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
|
|---|---|---|---|---|---|
9,548,051 | 9 | 16 | 9. A system comprising: a processor; and a computer-readable storage device having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: partitioning speech recognizer output into a plurality of independent clauses; and for an independent clause in the plurality of independent clauses: identifying an object; and recursively generating, via a processor, for each sub-independent clause within the independent clause, a semantic representation using the object. | 9. A system comprising: a processor; and a computer-readable storage device having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: partitioning speech recognizer output into a plurality of independent clauses; and for an independent clause in the plurality of independent clauses: identifying an object; and recursively generating, via a processor, for each sub-independent clause within the independent clause, a semantic representation using the object. 16. The system of claim 9 , wherein recursively generating the semantic representation further comprises filling in a data structure associated with a dialog act in the independent clause. | 0.617886 |
8,527,496 | 5 | 12 | 5. The method of claim 1 , wherein the presentation of the retrieved posts to the user comprises applying a ranking to the retrieved posts. | 5. The method of claim 1 , wherein the presentation of the retrieved posts to the user comprises applying a ranking to the retrieved posts. 12. The method of claim 5 , wherein the ranking comprises ranking the retrieved posts based at least in part on proximity of users. | 0.959717 |
7,580,830 | 32 | 36 | 32. A system comprising: an input/output (I/O) system; and a potential translations generator coupled with the I/O system, the potential translations generator incorporating a combined pronunciation-based and spelling-based transliteration model used to generate translation candidates for a named entity. | 32. A system comprising: an input/output (I/O) system; and a potential translations generator coupled with the I/O system, the potential translations generator incorporating a combined pronunciation-based and spelling-based transliteration model used to generate translation candidates for a named entity. 36. The system of claim 32 , wherein the potential translations generator generates the translation candidates based at least in part on context information corresponding to the named entity. | 0.919136 |
9,244,887 | 1 | 13 | 1. A computer-implemented method comprising: analyzing, using a time series engine, a distribution of unstructured time-stamped data to identify a plurality of potential time series data hierarchies for structuring the unstructured time-stamped data, wherein a potential time series data hierarchy is a framework for structuring the data using of multiple time series, and wherein the time series engine is at a server layer of a time series computing system; performing, using the time series engine, an analysis of the plurality of potential time series data hierarchies, wherein performing the analysis of the plurality of potential time series data hierarchies includes determining an optimal time series frequency and a data sufficiency metric for each of the plurality of potential time series data hierarchies; comparing data sufficiency metrics for the plurality of potential time series data hierarchies; selecting a hierarchy of the plurality of potential time series data hierarchies based on the comparison of the data sufficiency metrics; structuring the unstructured time-stamped data into structured time-stamped data according to the hierarchy and the optimal time series frequency, wherein structuring the transformed time-stamped data into the structured time-stamped data is performed using a single pass of the unstructured time-stamped data through the time series engine; computing a plurality of transformations of the structured time-stamped data using the single pass of the structured time-stamped data through the time series engine; transforming the structured time-stamped data into transformed time-stamped data according to the plurality of transformations; and providing, using an application programming interface, the transformed time-stamped data for visual presentation. | 1. A computer-implemented method comprising: analyzing, using a time series engine, a distribution of unstructured time-stamped data to identify a plurality of potential time series data hierarchies for structuring the unstructured time-stamped data, wherein a potential time series data hierarchy is a framework for structuring the data using of multiple time series, and wherein the time series engine is at a server layer of a time series computing system; performing, using the time series engine, an analysis of the plurality of potential time series data hierarchies, wherein performing the analysis of the plurality of potential time series data hierarchies includes determining an optimal time series frequency and a data sufficiency metric for each of the plurality of potential time series data hierarchies; comparing data sufficiency metrics for the plurality of potential time series data hierarchies; selecting a hierarchy of the plurality of potential time series data hierarchies based on the comparison of the data sufficiency metrics; structuring the unstructured time-stamped data into structured time-stamped data according to the hierarchy and the optimal time series frequency, wherein structuring the transformed time-stamped data into the structured time-stamped data is performed using a single pass of the unstructured time-stamped data through the time series engine; computing a plurality of transformations of the structured time-stamped data using the single pass of the structured time-stamped data through the time series engine; transforming the structured time-stamped data into transformed time-stamped data according to the plurality of transformations; and providing, using an application programming interface, the transformed time-stamped data for visual presentation. 13. The method of claim 1 , wherein analyzing the distribution of the unstructured time-stamped data includes performing a time frequency analysis on the unstructured data using the time series engine. | 0.87406 |
8,165,277 | 10 | 12 | 10. Logic for creating user-requested telephony features, the logic embodied in a non-transitory computer-readable medium and operable to: receive a plurality of instructions defining a graphical representation of an implementation of one or more telephony features for an endpoint, the graphical representation comprising a plurality of graphical elements, each graphical element representing at least a portion of a state process of the one or more telephony features; generate the graphical representation in accordance with the plurality of instructions; convert a first graphical element into a first text command; convert a second graphical element into a second text command, the first and second text commands specifying a plurality of actions of the state process; determine customized feature logic comprising the first and second text commands, the first and second text commands operable to provide the one or more telephony features for the endpoint; and communicate the customized feature logic to the endpoint for storage. | 10. Logic for creating user-requested telephony features, the logic embodied in a non-transitory computer-readable medium and operable to: receive a plurality of instructions defining a graphical representation of an implementation of one or more telephony features for an endpoint, the graphical representation comprising a plurality of graphical elements, each graphical element representing at least a portion of a state process of the one or more telephony features; generate the graphical representation in accordance with the plurality of instructions; convert a first graphical element into a first text command; convert a second graphical element into a second text command, the first and second text commands specifying a plurality of actions of the state process; determine customized feature logic comprising the first and second text commands, the first and second text commands operable to provide the one or more telephony features for the endpoint; and communicate the customized feature logic to the endpoint for storage. 12. The logic embodied in the non-transitory computer readable medium of claim 10 , wherein when generating the graphical representation of the implementation of the one or more telephony features the logic is further operable to: provide a modeling application operable to receive the plurality of instructions; and generate the graphical representation using the modeling application. | 0.5553 |
9,483,527 | 1 | 7 | 1. A method for decision reasoning, the method comprising using at least one hardware processor to: provide a database comprising decisions, questions and reasons; receive, from a user, a selection of a decision being part of said decisions; retrieve, from said database, relevant questions out of said questions, wherein said relevant questions are associated, within said database, with said decision received from the user; receive, from the user, answers to at least some of said relevant questions; process said answers so as to retrieve, from said database, one or more relevant reasons out of said reasons, wherein the one or more relevant reasons are one or more arguments justifying said decision; and display said one or more relevant reasons to the user. | 1. A method for decision reasoning, the method comprising using at least one hardware processor to: provide a database comprising decisions, questions and reasons; receive, from a user, a selection of a decision being part of said decisions; retrieve, from said database, relevant questions out of said questions, wherein said relevant questions are associated, within said database, with said decision received from the user; receive, from the user, answers to at least some of said relevant questions; process said answers so as to retrieve, from said database, one or more relevant reasons out of said reasons, wherein the one or more relevant reasons are one or more arguments justifying said decision; and display said one or more relevant reasons to the user. 7. The method according to claim 1 , further comprising using said at least one hardware processor to receive a suggestion of one or more new reasons from the user, and store said one or more new reasons in the database. | 0.804618 |
9,779,066 | 1 | 2 | 1. A method for converting Punycode text to Unicode text and displaying with augmented reality, said method comprising: providing a client device, a computer, a scanner, optical code recognition software, Punycode/ASCII and/or Unicode dictionary tables, and Punycode text; taking an image of said Punycode text and saving said image in said computer; scanning and saving said image of said Punycode text in said computer; subjecting said scanned image to said optical code recognition software to identify Punycode strings; converting and segregating said Punycode strings to Unicode strings; and displaying said Unicode strings in Unicode and/or ASCII code alpha numeric character sets; and wherein the optical character recognizer converts the optical image of characters into decoded data by recognizing the characters in the character string and generating a corresponding decoded data alpha numeric characters and symbols for each recognized character. | 1. A method for converting Punycode text to Unicode text and displaying with augmented reality, said method comprising: providing a client device, a computer, a scanner, optical code recognition software, Punycode/ASCII and/or Unicode dictionary tables, and Punycode text; taking an image of said Punycode text and saving said image in said computer; scanning and saving said image of said Punycode text in said computer; subjecting said scanned image to said optical code recognition software to identify Punycode strings; converting and segregating said Punycode strings to Unicode strings; and displaying said Unicode strings in Unicode and/or ASCII code alpha numeric character sets; and wherein the optical character recognizer converts the optical image of characters into decoded data by recognizing the characters in the character string and generating a corresponding decoded data alpha numeric characters and symbols for each recognized character. 2. The method converting Punycode text to Unicode text and displaying with augmented reality according to claim 1 , in which tokens and sub tokens are assigned to each Punycode string and segregated components. | 0.930325 |
9,253,304 | 1 | 6 | 1. A method for managing a voice communication, the method comprising: identifying, by a mobile voice communication device associated with a first user, an audio phrase produced by the first user during the voice communication between the first user using the mobile voice communication device and a second user using another voice communication device; generating, by the mobile voice communication device associated with the first user, an audio signature of the audio phrase produced by the first user, wherein the audio signature is one or more values generated by performing one or more calculations on an audio segment including the audio phrase; comparing, by the mobile voice communication device associated with the first user, the audio signature of the audio phrase produced by the first user to audio signatures corresponding to a set of undesirable audio phrases containing confidential information associated with the first user included within a policy prohibiting a transmission of the set of undesired audio phrases; determining, by the mobile voice communication device associated with the first user, that the audio signature of the audio phrase produced by the first user matches an audio signature of an undesirable audio phrase in the set of undesirable audio phrases, wherein the matches the audio signature of the undesirable audio phrase in the set of undesirable audio phrases means either a same or a similar audio signature to the audio signatures corresponding to the set of undesirable audio phrases; responsive to the mobile voice communication device associated with the first user determining that the audio signature of the audio phrase produced by the first user matches an audio signature of an undesirable audio phrase in the set of undesirable audio phrases, outputting, by the mobile voice communication device associated with the first user, a textual alert message to the first user via a display of the mobile voice communication device associated with the first user that includes a textual representation of the confidential information disclosed and that the confidential information is not to be divulged; inhibiting, by the mobile voice communication device associated with the first user, the transmission of the undesirable audio phase containing the confidential information from the mobile voice communication device associated with the first user to the other voice communication device used by the second user during the voice communication; and inhibiting, by the mobile voice communication device associated with the first user, further transmission of audio from the mobile voice communication device associated with the first user to the other voice communication device used by the second user for a period of time until a third user that is a trusted party of the first user joins the voice communication to determine whether the second user is an unauthorized party attempting to fraudulently receive the confidential information from the first user. | 1. A method for managing a voice communication, the method comprising: identifying, by a mobile voice communication device associated with a first user, an audio phrase produced by the first user during the voice communication between the first user using the mobile voice communication device and a second user using another voice communication device; generating, by the mobile voice communication device associated with the first user, an audio signature of the audio phrase produced by the first user, wherein the audio signature is one or more values generated by performing one or more calculations on an audio segment including the audio phrase; comparing, by the mobile voice communication device associated with the first user, the audio signature of the audio phrase produced by the first user to audio signatures corresponding to a set of undesirable audio phrases containing confidential information associated with the first user included within a policy prohibiting a transmission of the set of undesired audio phrases; determining, by the mobile voice communication device associated with the first user, that the audio signature of the audio phrase produced by the first user matches an audio signature of an undesirable audio phrase in the set of undesirable audio phrases, wherein the matches the audio signature of the undesirable audio phrase in the set of undesirable audio phrases means either a same or a similar audio signature to the audio signatures corresponding to the set of undesirable audio phrases; responsive to the mobile voice communication device associated with the first user determining that the audio signature of the audio phrase produced by the first user matches an audio signature of an undesirable audio phrase in the set of undesirable audio phrases, outputting, by the mobile voice communication device associated with the first user, a textual alert message to the first user via a display of the mobile voice communication device associated with the first user that includes a textual representation of the confidential information disclosed and that the confidential information is not to be divulged; inhibiting, by the mobile voice communication device associated with the first user, the transmission of the undesirable audio phase containing the confidential information from the mobile voice communication device associated with the first user to the other voice communication device used by the second user during the voice communication; and inhibiting, by the mobile voice communication device associated with the first user, further transmission of audio from the mobile voice communication device associated with the first user to the other voice communication device used by the second user for a period of time until a third user that is a trusted party of the first user joins the voice communication to determine whether the second user is an unauthorized party attempting to fraudulently receive the confidential information from the first user. 6. The method of claim 1 , wherein the audio phrase is a first audio phrase and further comprising: receiving, by the mobile voice communication device associated with the first user, a collection of text; generating, by the mobile voice communication device associated with the first user, audio data for the collection of text using a text-to-speech process; and storing, by the mobile voice communication device associated with the first user, the audio data in the policy, which prohibits the transmission of the set of undesired audio phrases as a second audio phrase. | 0.5416 |
9,036,083 | 17 | 18 | 17. The system of claim 14 , wherein the at least one module is further configured to determine additional information corresponding to the video content based on the identified text and the determined category. | 17. The system of claim 14 , wherein the at least one module is further configured to determine additional information corresponding to the video content based on the identified text and the determined category. 18. The system of claim 17 , wherein the at least one module is further configured to provide the additional information to a software application on a media content device. | 0.939553 |
8,515,891 | 9 | 10 | 9. In a computing environment, a method performed at least in part on at least one processor, comprising, constructing a symbolic finite automaton, including labeling a transition by a formula, and maintaining the symbolic finite automaton such that the transition has a satisfiable formula. | 9. In a computing environment, a method performed at least in part on at least one processor, comprising, constructing a symbolic finite automaton, including labeling a transition by a formula, and maintaining the symbolic finite automaton such that the transition has a satisfiable formula. 10. The method of claim 9 wherein maintaining the symbolic finite automaton comprises incrementally using an external constraint solver to maintain that the transition has a satisfiable formula. | 0.795359 |
8,631,420 | 15 | 16 | 15. The system of claim 14 , wherein the set of context items represents a set of the system parameters, the application parameters, or the combination of the system parameters and the application parameters of the environment in which the event was generated. | 15. The system of claim 14 , wherein the set of context items represents a set of the system parameters, the application parameters, or the combination of the system parameters and the application parameters of the environment in which the event was generated. 16. The system of claim 15 , further comprising: an event execution environment that extracts the context business information from the attached context to the event; an event producer that produces the context-aware event based on the extracted context business information; and an event framework that receives the context-aware event from the event producer and sends it to the event consumption environment. | 0.870265 |
7,991,709 | 13 | 14 | 13. A computing system for creating a document structure model of a computer parsable text document utilizing recognition of at least one ordered sequence of identifiers in the document, the system comprising: a document conversion graphical user interface; a conversion processor for converting at least one computer parsable text document of any format to an alternative structured language format to form a converted document; a text fragmenter for fragmenting the text of said converted document, wherein fragmenting comprises breaking said converted document into an ordered sequence of text fragments within a text format; an enumeration module for enumerating said text fragments to obtain a sequence of terms, wherein each said term comprises a matching fragment; a selection module for identifying at least one optimal sub-sequence of terms, wherein said optimal sub-sequence comprises at least one longest increasing sub-sequence from among said sequence of terms; and an association module for annotating the computer parsable text document with tags, wherein said tags comprise information derived from identification of said at least one optimal sub-sequence. | 13. A computing system for creating a document structure model of a computer parsable text document utilizing recognition of at least one ordered sequence of identifiers in the document, the system comprising: a document conversion graphical user interface; a conversion processor for converting at least one computer parsable text document of any format to an alternative structured language format to form a converted document; a text fragmenter for fragmenting the text of said converted document, wherein fragmenting comprises breaking said converted document into an ordered sequence of text fragments within a text format; an enumeration module for enumerating said text fragments to obtain a sequence of terms, wherein each said term comprises a matching fragment; a selection module for identifying at least one optimal sub-sequence of terms, wherein said optimal sub-sequence comprises at least one longest increasing sub-sequence from among said sequence of terms; and an association module for annotating the computer parsable text document with tags, wherein said tags comprise information derived from identification of said at least one optimal sub-sequence. 14. The system according to claim 13 , wherein said alternative structured language comprises a markup language. | 0.909823 |
9,264,824 | 16 | 20 | 16. A system comprising: a smart glasses graphical user interface configured to receive a user input to identify and select a speaker of interest from a plurality of speakers; a video recording module configured to record a plurality of lip movement patterns of the speaker of interest; a voice activity detection module configured to receive the plurality of lip movement patterns and generate voice activity detection data from the plurality of lip movement patterns; a voice audio data recording module; and a noise-reduced voice audio data generation module configured to receive the voice activity detection data and voice audio data, and configured to generate noise-reduced voice audio data corresponding to the speaker of interest. | 16. A system comprising: a smart glasses graphical user interface configured to receive a user input to identify and select a speaker of interest from a plurality of speakers; a video recording module configured to record a plurality of lip movement patterns of the speaker of interest; a voice activity detection module configured to receive the plurality of lip movement patterns and generate voice activity detection data from the plurality of lip movement patterns; a voice audio data recording module; and a noise-reduced voice audio data generation module configured to receive the voice activity detection data and voice audio data, and configured to generate noise-reduced voice audio data corresponding to the speaker of interest. 20. The system of claim 16 , further comprising: a speech recognition text generation module configured to receive the noise-reduced voice audio data and generate speech recognition text; and a smart glasses graphical user display configured to receive and display speech recognition text corresponding to the speaker of interest. | 0.501511 |
8,666,928 | 1 | 17 | 1. A knowledge representation system, comprising: a data store having a knowledge base stored therein comprising first knowledge represented in a structured, machine-readable format which encodes meaning and is distinct from natural language, the structured, machine-readable format primarily comprising assertions of named relationships between pairs of named entities; and at least one computing device operable to: add second knowledge in the structured, machine-readable format to the knowledge base, the second knowledge being generated with reference to input from a plurality of untrained, general internet users which is not in the structured, machine-readable format, at least some of the input from the users being in a particular natural language, wherein generating the second knowledge includes translating the input from the users to factual assertions compatible with the structured, machine-readable format using a plurality of translation templates, each of the translation templates including a respective predetermined pattern for matching against one or more natural language strings included in the input from the users, and wherein adding the second knowledge to the knowledge base includes determining whether the second knowledge is semantically contradicted by the first knowledge to promote consistency of the first and second knowledge across the knowledge base; generate third knowledge not represented in the knowledge base by inferring the third knowledge from one or more of the first knowledge or the second knowledge; and respond to queries using one or more of the first knowledge, the second knowledge, or the third knowledge. | 1. A knowledge representation system, comprising: a data store having a knowledge base stored therein comprising first knowledge represented in a structured, machine-readable format which encodes meaning and is distinct from natural language, the structured, machine-readable format primarily comprising assertions of named relationships between pairs of named entities; and at least one computing device operable to: add second knowledge in the structured, machine-readable format to the knowledge base, the second knowledge being generated with reference to input from a plurality of untrained, general internet users which is not in the structured, machine-readable format, at least some of the input from the users being in a particular natural language, wherein generating the second knowledge includes translating the input from the users to factual assertions compatible with the structured, machine-readable format using a plurality of translation templates, each of the translation templates including a respective predetermined pattern for matching against one or more natural language strings included in the input from the users, and wherein adding the second knowledge to the knowledge base includes determining whether the second knowledge is semantically contradicted by the first knowledge to promote consistency of the first and second knowledge across the knowledge base; generate third knowledge not represented in the knowledge base by inferring the third knowledge from one or more of the first knowledge or the second knowledge; and respond to queries using one or more of the first knowledge, the second knowledge, or the third knowledge. 17. The system of claim 1 wherein the first knowledge includes information relating to real world objects, and wherein the at least one computing device is further operable to present profiles identifying the real world objects, each profile corresponding to at least one of the real world objects and including human-perceivable facts relating to the at least one real world object. | 0.570628 |
8,702,486 | 14 | 20 | 14. A method for providing gameplay of word-based games puzzles comprising crossword puzzles or word search puzzles, the method being implemented in a computer that includes one or more processors programmed by one or more computer program instructions, the method comprising: receiving, by the one or more processors, a selection of a gameplay mode of operation from among a plurality of gameplay modes of operation; selecting, by the one or more processors, at least one of a word-based puzzle from among a plurality of word-based puzzles obtained from one or more sources of word-based puzzles; causing, by the one or more processors, the word-based puzzle to be communicated for gameplay; imposing, by the one or more processors, during gameplay of the word-based puzzle a time limit that relates to an attempt to at least partially solve the word-based puzzle; determining one or more types and quantities of virtual assets to be awarded to a user based on gameplay of the word-based puzzle, wherein the one or more types and quantities of virtual assets is determined based on whether the user solved a word related to one or more input spaces that is associated with a bonus award; allocating, by the one or more processors, the determined one or more types and quantities of virtual assets to the user based on gameplay of the word-based-game puzzle, wherein a virtual asset is exchangeable for one or more benefits related to gameplay depending on the type of virtual asset; and awarding the one or more types and quantities of virtual assets to the user. | 14. A method for providing gameplay of word-based games puzzles comprising crossword puzzles or word search puzzles, the method being implemented in a computer that includes one or more processors programmed by one or more computer program instructions, the method comprising: receiving, by the one or more processors, a selection of a gameplay mode of operation from among a plurality of gameplay modes of operation; selecting, by the one or more processors, at least one of a word-based puzzle from among a plurality of word-based puzzles obtained from one or more sources of word-based puzzles; causing, by the one or more processors, the word-based puzzle to be communicated for gameplay; imposing, by the one or more processors, during gameplay of the word-based puzzle a time limit that relates to an attempt to at least partially solve the word-based puzzle; determining one or more types and quantities of virtual assets to be awarded to a user based on gameplay of the word-based puzzle, wherein the one or more types and quantities of virtual assets is determined based on whether the user solved a word related to one or more input spaces that is associated with a bonus award; allocating, by the one or more processors, the determined one or more types and quantities of virtual assets to the user based on gameplay of the word-based-game puzzle, wherein a virtual asset is exchangeable for one or more benefits related to gameplay depending on the type of virtual asset; and awarding the one or more types and quantities of virtual assets to the user. 20. The method of claim 14 , wherein the method further comprising: determining a number of consecutive daily logons to the system by the user; determining a retention bonus that progressively increases a bonus based on the number of consecutive daily logons; and awarding the retention bonus to the user. | 0.501634 |
9,280,335 | 9 | 16 | 9. A non-transitory computer readable storage medium configured to create a composable software bundle as part of a virtual image asset, the non-transitory computer readable storage medium comprising instructions configured to perform a method comprising: retrieving a semantic representation of a set of software modules; retrieving a first set of metadata and a first set of artifacts comprising a set of executable instructions, each executable instructions in the set of executable instructions is to be performed on the set of software modules during at least one virtual image life-cycle phase in a set of virtual image life-cycle phases; storing the semantic representation and the first set of artifacts, in a composable software bundle associated with the first set of metadata; receiving a selection of a virtual image asset, wherein the virtual image asset comprises one or more virtual image disks, a second set of metadata, and a second set of artifacts comprising a second set of executable instructions associated with a second set of operations, wherein the composable software bundle is independent of a target environment, is separate and distinct from the virtual image asset, and is installed on the virtual image asset as part of creating a new virtual image asset based on the composable software bundle and the virtual image asset; and creating a new virtual image asset based on the composable software bundle and the virtual image asset, the new virtual image asset comprising a set of software modules installed by the composable software bundle on the virtual image asset, the new virtual image asset comprising metadata that is based on the composable software bundle and the virtual image asset, the new virtual image asset further comprising a third set of artifacts comprising a third set of executable instructions associated with a third set of operations that is based on the composable software bundle and the second set of artifacts from the virtual image asset, and wherein each executable instruction in the third set of executable instructions being executed at the virtual image life-cycle phase associated with an operation in the third set of operations that is associated with each executable instruction in the third set of executable instructions. | 9. A non-transitory computer readable storage medium configured to create a composable software bundle as part of a virtual image asset, the non-transitory computer readable storage medium comprising instructions configured to perform a method comprising: retrieving a semantic representation of a set of software modules; retrieving a first set of metadata and a first set of artifacts comprising a set of executable instructions, each executable instructions in the set of executable instructions is to be performed on the set of software modules during at least one virtual image life-cycle phase in a set of virtual image life-cycle phases; storing the semantic representation and the first set of artifacts, in a composable software bundle associated with the first set of metadata; receiving a selection of a virtual image asset, wherein the virtual image asset comprises one or more virtual image disks, a second set of metadata, and a second set of artifacts comprising a second set of executable instructions associated with a second set of operations, wherein the composable software bundle is independent of a target environment, is separate and distinct from the virtual image asset, and is installed on the virtual image asset as part of creating a new virtual image asset based on the composable software bundle and the virtual image asset; and creating a new virtual image asset based on the composable software bundle and the virtual image asset, the new virtual image asset comprising a set of software modules installed by the composable software bundle on the virtual image asset, the new virtual image asset comprising metadata that is based on the composable software bundle and the virtual image asset, the new virtual image asset further comprising a third set of artifacts comprising a third set of executable instructions associated with a third set of operations that is based on the composable software bundle and the second set of artifacts from the virtual image asset, and wherein each executable instruction in the third set of executable instructions being executed at the virtual image life-cycle phase associated with an operation in the third set of operations that is associated with each executable instruction in the third set of executable instructions. 16. The computer readable storage medium of claim 9 , wherein the set of executable instructions is a script that installs the set of software modules on the virtual image during at least one of the set of virtual image life-cycle phases associated with the script. | 0.839588 |
8,166,559 | 6 | 9 | 6. An article of manufacture, comprising: a non-transitory storage medium; a plurality of programming instructions stored in the storage medium to program an apparatus to enable the apparatus to save from a first security domain to a second security domain a filtered version of a web page document having a plurality of structured tear portions, including determining that the web page document contains one or more tear portions not to be accessible through the second security domain, and writing tear portions of the web page document excluding the one or more tear portions determined not to be accessible through the second security domain into the second security domain, the first and second security domains defined as administrative boundaries to respectively provide first and second pluralities of users differentiated access to documents, the first security domain being a higher security domain than the second security domain with the first plurality of users being less in number than the second plurality of users, each of the first and second security domains having a respective storage device to maintain data separation between the first and second security domains; and open through the first security domain the web page document, including: determining that the filtered version of the web page document has been saved to the second security domain; determining that one or more tear portions of the filtered version of the web page document has been modified, or one or more new tear portions has been added to the filtered version of the web page document through the second security domain; retrieving a copy of the one or more modified or new tear portions from the second security domain; merging the retrieved copy of the one or more modified or new tear portions into the web page document being open at the first security domain; facilitating a user in the first security domain in deciding whether to accept or reject a modification to a tear portion made through the second security domain or a new tear portion added through the second security domain. | 6. An article of manufacture, comprising: a non-transitory storage medium; a plurality of programming instructions stored in the storage medium to program an apparatus to enable the apparatus to save from a first security domain to a second security domain a filtered version of a web page document having a plurality of structured tear portions, including determining that the web page document contains one or more tear portions not to be accessible through the second security domain, and writing tear portions of the web page document excluding the one or more tear portions determined not to be accessible through the second security domain into the second security domain, the first and second security domains defined as administrative boundaries to respectively provide first and second pluralities of users differentiated access to documents, the first security domain being a higher security domain than the second security domain with the first plurality of users being less in number than the second plurality of users, each of the first and second security domains having a respective storage device to maintain data separation between the first and second security domains; and open through the first security domain the web page document, including: determining that the filtered version of the web page document has been saved to the second security domain; determining that one or more tear portions of the filtered version of the web page document has been modified, or one or more new tear portions has been added to the filtered version of the web page document through the second security domain; retrieving a copy of the one or more modified or new tear portions from the second security domain; merging the retrieved copy of the one or more modified or new tear portions into the web page document being open at the first security domain; facilitating a user in the first security domain in deciding whether to accept or reject a modification to a tear portion made through the second security domain or a new tear portion added through the second security domain. 9. The article of claim 6 , wherein said programming instructions are adapted to automatically accept or reject links added to other tear portions associated with the modification or new tear portion being accepted or rejected, when performing said open. | 0.777972 |
7,496,559 | 26 | 36 | 26. A computerized search system, comprising: at least one processor configured to generate for display: a single search interface configured for display on a display device, the single search interface comprising at least: an email search interface having at least a first email-specific attribute search field selected from the group comprising a date field, a from field, and a sender field; and a file search interface having at least a first file-specific attribute search field selected from the group comprising a file name field, a file type field, a date field, a file size field, and a path field; a Web history search interface having Web page-specific attribute search fields, including one or more of a date field, a title field, a size field, and a search term field; an email attachment search interface having email attachment-specific attribute search fields including one or more of a name field, a date field, a size field, and an extension field; a favorites search interface used to search Web pages designated by a user as favorite Web pages; at least one index comprising data regarding emails and files; one or more memories configured to store the at least one index; and an apparatus configured to access the at least one index in order to perform incremental searching of the emails and files as the user enters characters into at least one of the email-specific search fields and the file-specific search fields, wherein the processor executes the apparatus. | 26. A computerized search system, comprising: at least one processor configured to generate for display: a single search interface configured for display on a display device, the single search interface comprising at least: an email search interface having at least a first email-specific attribute search field selected from the group comprising a date field, a from field, and a sender field; and a file search interface having at least a first file-specific attribute search field selected from the group comprising a file name field, a file type field, a date field, a file size field, and a path field; a Web history search interface having Web page-specific attribute search fields, including one or more of a date field, a title field, a size field, and a search term field; an email attachment search interface having email attachment-specific attribute search fields including one or more of a name field, a date field, a size field, and an extension field; a favorites search interface used to search Web pages designated by a user as favorite Web pages; at least one index comprising data regarding emails and files; one or more memories configured to store the at least one index; and an apparatus configured to access the at least one index in order to perform incremental searching of the emails and files as the user enters characters into at least one of the email-specific search fields and the file-specific search fields, wherein the processor executes the apparatus. 36. The computerized search system as defined in claim 26 , wherein the file search interface further comprises a search field used to search across a plurality of the attribute fields. | 0.863166 |
9,275,113 | 8 | 14 | 8. 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: receiving a search query; obtaining a query language of the search query; obtaining search results responsive to the search query, wherein each search result identifies a respective content item of a plurality of content items, wherein each content item is associated with a plurality of language presentation counts for a plurality of languages, each language presentation count for each particular language representing how many times a plurality of users having a language preference matching the particular language were presented with an opportunity to select the content item, and wherein each content item is associated with a plurality of language selection counts for a plurality of languages, each language selection count for each particular language representing how many times a plurality of users having a language preference matching the particular language selected the content item when presented with an opportunity to select the content item; obtaining a respective language selection weight for the query language for each of the plurality of content items, wherein the language selection weight for the query language for a content item is based on the language presentation count for the query language associated with the content item and the language selection count for the query language associated with for the content item; computing a respective score for each of the plurality content items, wherein the score is based on the language selection weight for each of the plurality of content items; generating a ranking of a plurality of content items based at least in part on the respective scores; and providing search results corresponding to the ranking of the plurality of content items in response to the search query. | 8. 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: receiving a search query; obtaining a query language of the search query; obtaining search results responsive to the search query, wherein each search result identifies a respective content item of a plurality of content items, wherein each content item is associated with a plurality of language presentation counts for a plurality of languages, each language presentation count for each particular language representing how many times a plurality of users having a language preference matching the particular language were presented with an opportunity to select the content item, and wherein each content item is associated with a plurality of language selection counts for a plurality of languages, each language selection count for each particular language representing how many times a plurality of users having a language preference matching the particular language selected the content item when presented with an opportunity to select the content item; obtaining a respective language selection weight for the query language for each of the plurality of content items, wherein the language selection weight for the query language for a content item is based on the language presentation count for the query language associated with the content item and the language selection count for the query language associated with for the content item; computing a respective score for each of the plurality content items, wherein the score is based on the language selection weight for each of the plurality of content items; generating a ranking of a plurality of content items based at least in part on the respective scores; and providing search results corresponding to the ranking of the plurality of content items in response to the search query. 14. The system of claim 8 , wherein the language selection weight for each of the plurality of content items is computed according to:
language selection weight=bias1+( A ·bias2)+( B ·bias3) wherein: A is a percentage of total users clicking on the content item having a language preference matching the query language; B is a click through percentage of the content item for users having a language preference matching the query language; and bias1, bias2, and bias3 are biasing factors. | 0.762827 |
8,600,747 | 4 | 6 | 4. The system of claim 2 , wherein the previously encoded assumption dialog motivator is governed by predefined rules governing call flow. | 4. The system of claim 2 , wherein the previously encoded assumption dialog motivator is governed by predefined rules governing call flow. 6. The system of claim 4 , wherein a previously encoded assumption by the previously encoded assumption dialog motivator triggers transferring the user to a customer service representative when the user is not classified as wanting a concrete call type. | 0.909643 |
7,627,631 | 1 | 10 | 1. A system, comprising: one or more processors; a plug-in framework, wherein the plug-in framework includes a plug-in manager and a set of interfaces for plug-ins to implement; a process engine to execute and manage workflows, and wherein the process engine executes one or more business logic plug-ins which process business messages, wherein the one or more business logic plug-ins include a home interface that allows the plug-in manager to detect deployed business logic plug-ins by traversing a naming and directory tree, and wherein the plug-manager manages all of the plug-ins in the framework and the plug-in manager is the central hub through which all plug-in related client requests are routed; an integration studio, wherein an integration studio can be used at design time to define workflows and at run time to monitor running workflows; an integration framework, wherein the integration framework provides router logic plug-ins and filter logic plug-ins for at least one protocol used for the business messages; and an integration repository, wherein the integration repository is a database that can store workflow templates and workflow instances, wherein at least one of the workflow instances is a collaborative workflow that implements a role of a conversation definition configured in a collaborate repository, and the integration framework also provides a collaborative plug-in to allow a user to create the collaborative workflow. | 1. A system, comprising: one or more processors; a plug-in framework, wherein the plug-in framework includes a plug-in manager and a set of interfaces for plug-ins to implement; a process engine to execute and manage workflows, and wherein the process engine executes one or more business logic plug-ins which process business messages, wherein the one or more business logic plug-ins include a home interface that allows the plug-in manager to detect deployed business logic plug-ins by traversing a naming and directory tree, and wherein the plug-manager manages all of the plug-ins in the framework and the plug-in manager is the central hub through which all plug-in related client requests are routed; an integration studio, wherein an integration studio can be used at design time to define workflows and at run time to monitor running workflows; an integration framework, wherein the integration framework provides router logic plug-ins and filter logic plug-ins for at least one protocol used for the business messages; and an integration repository, wherein the integration repository is a database that can store workflow templates and workflow instances, wherein at least one of the workflow instances is a collaborative workflow that implements a role of a conversation definition configured in a collaborate repository, and the integration framework also provides a collaborative plug-in to allow a user to create the collaborative workflow. 10. The system of claim 1 , wherein the integration engine can specify a message XML Path Language (XPath) expression that defines intended recipients of a business message from a sender. | 0.669611 |
7,668,865 | 1 | 11 | 1. A computer implemented method of formatting a document comprising: a) providing a database comprising: (i) a plurality of document element classes; (ii) a set of document section formatting rules for each document element class; and (iii) a set of document elements for each document element class; and in a computer system comprising at least one processor operatively associated with the database: b) obtaining an electronic document; c) identifying at least one of the document elements within the electronic document; d) for one or more of the document elements identified within the electronic document: (i) identifying a document section within the electronic document that is associated with the respective identified document element; (ii) classifying the respective identified document element into one of the document element classes; (iii) determining the document section formatting rules associated with the classified document element class; (iv) determining whether said document section is formatted in accordance with the document section formatting rules of the classified document element class; and (v) where the document section is not formatted in accordance with the document section formatting rules of the classified document element class, selecting one or more of the document section formatting rules of the classified document element class and applying the selected one or more document section formatting rules to the document section to re-format the document section to a re-formatted document section that accords with the selected one or more document section formatting rules; and e) displaying a re-formatted version of the electronic document including one or more of the re-formatted document sections. | 1. A computer implemented method of formatting a document comprising: a) providing a database comprising: (i) a plurality of document element classes; (ii) a set of document section formatting rules for each document element class; and (iii) a set of document elements for each document element class; and in a computer system comprising at least one processor operatively associated with the database: b) obtaining an electronic document; c) identifying at least one of the document elements within the electronic document; d) for one or more of the document elements identified within the electronic document: (i) identifying a document section within the electronic document that is associated with the respective identified document element; (ii) classifying the respective identified document element into one of the document element classes; (iii) determining the document section formatting rules associated with the classified document element class; (iv) determining whether said document section is formatted in accordance with the document section formatting rules of the classified document element class; and (v) where the document section is not formatted in accordance with the document section formatting rules of the classified document element class, selecting one or more of the document section formatting rules of the classified document element class and applying the selected one or more document section formatting rules to the document section to re-format the document section to a re-formatted document section that accords with the selected one or more document section formatting rules; and e) displaying a re-formatted version of the electronic document including one or more of the re-formatted document sections. 11. A computer implemented method according to claim 1 wherein steps (d)(i) to (d)(v) are repeated for each document element identified within the electronic document. | 0.866826 |
9,826,056 | 6 | 7 | 6. A method comprising: sending for display to a target user of a social networking system a news ticker presenting a plurality of stories each describing an action performed by a user of the social networking system connected to the target user and identifying the user performing the action, each of the plurality of stories associated with an acting user, the news ticker including stories associated with a threshold number of acting users, the threshold number of story types comprising a plurality of story types, the news ticker comprising a graphical user interface; detecting, by an action interface module, one or more actions performed by acting users connected to the target user after the news ticker is sent to the target user, the action interface module configured to detect and store actions performed by acting users of the social networking system in real time; retrieving, by a news ticker computing system, candidate stories each describing a detected action performed by an acting user connected to the target user; selecting, by the news ticker computing system, a candidate story associated with an acting user for inclusion in an updated news ticker such that the updated news ticker includes at least the threshold number of acting users; without receiving an input from the target user, modifying, by the news ticker computing system, a presentation of stories within the news ticker to include the selected candidate story, to remove an existing story from the presentation of stories within the news ticker associated with the same story type as the selected candidate story, and such that the presentation of stories within the news ticker includes at least the threshold number of story types to generate the updated news ticker; and sending the updated news ticker including the selected candidate story for display to the target user. | 6. A method comprising: sending for display to a target user of a social networking system a news ticker presenting a plurality of stories each describing an action performed by a user of the social networking system connected to the target user and identifying the user performing the action, each of the plurality of stories associated with an acting user, the news ticker including stories associated with a threshold number of acting users, the threshold number of story types comprising a plurality of story types, the news ticker comprising a graphical user interface; detecting, by an action interface module, one or more actions performed by acting users connected to the target user after the news ticker is sent to the target user, the action interface module configured to detect and store actions performed by acting users of the social networking system in real time; retrieving, by a news ticker computing system, candidate stories each describing a detected action performed by an acting user connected to the target user; selecting, by the news ticker computing system, a candidate story associated with an acting user for inclusion in an updated news ticker such that the updated news ticker includes at least the threshold number of acting users; without receiving an input from the target user, modifying, by the news ticker computing system, a presentation of stories within the news ticker to include the selected candidate story, to remove an existing story from the presentation of stories within the news ticker associated with the same story type as the selected candidate story, and such that the presentation of stories within the news ticker includes at least the threshold number of story types to generate the updated news ticker; and sending the updated news ticker including the selected candidate story for display to the target user. 7. The method of claim 6 , wherein retrieving candidate stories comprises: retrieving candidate stories associated with actions associated with a time within a threshold time of a current time. | 0.805051 |
8,311,805 | 1 | 10 | 1. A method, performed in a character entry system, for interrelating character strings so that an incomplete input character string can be completed by selection of a presented character string, the method comprising: computing relationship scores for individual character strings in the system from documents stored in memory of the character entry system, the relationship scores consisting of a function consisting of co-occurrence scores between pairs of distinct character strings stored in a single matrix created from the character strings in the stored documents; in response to inputting of a string of individual characters that exceeds a specified threshold, identifying at least one selectable character string from among contextual associations that can complete the input character string in context based upon an overall ranking score computed as a function of a relationship score and at least one other score; and providing the identified at least one selectable character string to a user for selection. | 1. A method, performed in a character entry system, for interrelating character strings so that an incomplete input character string can be completed by selection of a presented character string, the method comprising: computing relationship scores for individual character strings in the system from documents stored in memory of the character entry system, the relationship scores consisting of a function consisting of co-occurrence scores between pairs of distinct character strings stored in a single matrix created from the character strings in the stored documents; in response to inputting of a string of individual characters that exceeds a specified threshold, identifying at least one selectable character string from among contextual associations that can complete the input character string in context based upon an overall ranking score computed as a function of a relationship score and at least one other score; and providing the identified at least one selectable character string to a user for selection. 10. The method of claim 1 , wherein, each relationship score is a function of membership of the individual character strings in a candidate completion's group. | 0.661702 |
10,007,882 | 2 | 7 | 2. The system of claim 1 , wherein said query document and said plurality of additional documents are each associated with a maximum number of most relevant concept vectors M such that the proximity of each document belonging to said plurality of additional documents to said query document is determined by the degree of overlapping of said maximum number of most relevant concept vectors M such that said output module enables displaying said at least a subset of said plurality of said additional documents based, at least in part, on said degree of overlapping. | 2. The system of claim 1 , wherein said query document and said plurality of additional documents are each associated with a maximum number of most relevant concept vectors M such that the proximity of each document belonging to said plurality of additional documents to said query document is determined by the degree of overlapping of said maximum number of most relevant concept vectors M such that said output module enables displaying said at least a subset of said plurality of said additional documents based, at least in part, on said degree of overlapping. 7. The system of claim 2 , wherein said technical terms in said concepts are weighted, such that weights values represent a measure of the information content said technical terms provide in relation to which concepts they are associated. | 0.965627 |
9,754,046 | 1 | 2 | 1. A method to generate a webpage using one or more terms in a hierarchical taxonomy of a content management system, the method comprising: accessing a term set having a hierarchical structure, wherein the term set comprises a first and second term; generating a first friendly uniform resource locator for the webpage using the first term, wherein the first term and the first friendly uniform resource locator are associated such that a change to the first term is automatically applied to the first friendly uniform resource locator, and wherein the first friendly uniform resource locator is mapped to a first physical uniform resource locator; generating a second friendly uniform resource locator for the webpage using the second term, wherein the second term and the second friendly uniform resource locator are associated such that a change to the second term is automatically applied to the second friendly uniform resource locator, and wherein the second friendly uniform resource locator is mapped to the first physical uniform resource locator; using the first physical uniform resource locator to generate a second physical uniform resource locator comprising a first set of term context parameters, the first set of term context parameters comprising a first set of term identifiers associated with the first term, wherein the first set of term identifiers are appended to the second physical uniform resource locator; and using the first physical uniform resource locator to generate a third physical uniform resource locator comprising a second set of term context parameters, the second set of term context parameters comprising a second set of term identifiers associated with the second term, wherein the second set of term identifiers are appended to the third physical uniform resource locator. | 1. A method to generate a webpage using one or more terms in a hierarchical taxonomy of a content management system, the method comprising: accessing a term set having a hierarchical structure, wherein the term set comprises a first and second term; generating a first friendly uniform resource locator for the webpage using the first term, wherein the first term and the first friendly uniform resource locator are associated such that a change to the first term is automatically applied to the first friendly uniform resource locator, and wherein the first friendly uniform resource locator is mapped to a first physical uniform resource locator; generating a second friendly uniform resource locator for the webpage using the second term, wherein the second term and the second friendly uniform resource locator are associated such that a change to the second term is automatically applied to the second friendly uniform resource locator, and wherein the second friendly uniform resource locator is mapped to the first physical uniform resource locator; using the first physical uniform resource locator to generate a second physical uniform resource locator comprising a first set of term context parameters, the first set of term context parameters comprising a first set of term identifiers associated with the first term, wherein the first set of term identifiers are appended to the second physical uniform resource locator; and using the first physical uniform resource locator to generate a third physical uniform resource locator comprising a second set of term context parameters, the second set of term context parameters comprising a second set of term identifiers associated with the second term, wherein the second set of term identifiers are appended to the third physical uniform resource locator. 2. The method of claim 1 , wherein the first friendly uniform resource locator is a concise representation of the first physical uniform resource locator. | 0.823394 |
8,688,656 | 4 | 5 | 4. A document management method for managing a plurality of documents registered in a storage device, the method comprising: acquiring user characteristic information including items for identifying a user, based on login information of the user when the user logs in; storing the user characteristic information of the user as attribute information of a document together with the document in the storage device when the user registers the document in the storage device, and storing weights representing a relevance between the document and each of the items of the user characteristic information of the user as attribute information of the document; acquiring a document from the plurality of documents stored in the storage device, wherein the document has at least one item of user characteristic information of a first user who logs in; and creating a display content to display information according to the user characteristic information of the first user together with an identification for identifying the document, wherein creating the display content includes classifying the identification based on the weight of each of the items stored, wherein, when the first user instructs to print the document by using the identification, the weight corresponding to the at least one item stored in the storage device is updated, and wherein, when the first user instructs to delete the document by using the identification, the weights corresponding to the items of the user characteristic information of the first user are changed, the identification for identifying the document instructed to be deleted disappears, the document remains in the storage device, and the identification is not displayed based on the changed weights the next time the first user logs in. | 4. A document management method for managing a plurality of documents registered in a storage device, the method comprising: acquiring user characteristic information including items for identifying a user, based on login information of the user when the user logs in; storing the user characteristic information of the user as attribute information of a document together with the document in the storage device when the user registers the document in the storage device, and storing weights representing a relevance between the document and each of the items of the user characteristic information of the user as attribute information of the document; acquiring a document from the plurality of documents stored in the storage device, wherein the document has at least one item of user characteristic information of a first user who logs in; and creating a display content to display information according to the user characteristic information of the first user together with an identification for identifying the document, wherein creating the display content includes classifying the identification based on the weight of each of the items stored, wherein, when the first user instructs to print the document by using the identification, the weight corresponding to the at least one item stored in the storage device is updated, and wherein, when the first user instructs to delete the document by using the identification, the weights corresponding to the items of the user characteristic information of the first user are changed, the identification for identifying the document instructed to be deleted disappears, the document remains in the storage device, and the identification is not displayed based on the changed weights the next time the first user logs in. 5. The method according to claim 4 , further comprising comparing the user characteristic information with the attribute information of the document and, if the attribute information of the document includes an item of the user characteristic information, changing the weight of that item. | 0.814981 |
7,870,143 | 11 | 20 | 11. A method for processing an XML document, comprising: parsing an XML document and generating a stream of discrete pieces of the XML document, wherein the XML document is represented using a hierarchical data structure, and each said discrete piece of the document is represented by one or more nodes in the hierarchical data structure; accepting a discrete piece of the XML document from the stream of discrete pieces from the streaming parser at one time; keeping in memory only said discrete piece of the XML document from the stream at said time; maintaining a plurality of contexts associated with the XML document in a context data structure, wherein each context of the plurality of contexts contains a node in the hierarchical data structure and a position of the node relative to a context node; mapping each context of the plurality of contexts to the stream of discrete pieces of the XML document and performing matching against each context of the plurality of contexts on said discrete piece of the XML document from the stream; passing the particular discrete piece of the XML document to a user object for handling when the particular discrete piece of the XML document is a matched discrete piece of the XML document. | 11. A method for processing an XML document, comprising: parsing an XML document and generating a stream of discrete pieces of the XML document, wherein the XML document is represented using a hierarchical data structure, and each said discrete piece of the document is represented by one or more nodes in the hierarchical data structure; accepting a discrete piece of the XML document from the stream of discrete pieces from the streaming parser at one time; keeping in memory only said discrete piece of the XML document from the stream at said time; maintaining a plurality of contexts associated with the XML document in a context data structure, wherein each context of the plurality of contexts contains a node in the hierarchical data structure and a position of the node relative to a context node; mapping each context of the plurality of contexts to the stream of discrete pieces of the XML document and performing matching against each context of the plurality of contexts on said discrete piece of the XML document from the stream; passing the particular discrete piece of the XML document to a user object for handling when the particular discrete piece of the XML document is a matched discrete piece of the XML document. 20. The method according to claim 11 , further comprising: returning the matching event to an XML stream for use by any other component. | 0.815718 |
8,024,193 | 43 | 44 | 43. The machine-implemented method of claim 40 wherein decomposing the matrix W comprises performing a singular value decomposition of W, represented by
W=USV T where M is the number of instances, M is the maximum number of segments corresponding to an instance, U is the M×R left singular matrix with row vectors u i (1≦i≦M), S is the R×R diagonal matrix of singular values s 1 ≧s 2 ≧ . . . ≧s R >0, V is the N×R right singular matrix with row vectors v j (1≦j≦N), R≦min (M, N), and T denotes matrix transposition. | 43. The machine-implemented method of claim 40 wherein decomposing the matrix W comprises performing a singular value decomposition of W, represented by
W=USV T where M is the number of instances, M is the maximum number of segments corresponding to an instance, U is the M×R left singular matrix with row vectors u i (1≦i≦M), S is the R×R diagonal matrix of singular values s 1 ≧s 2 ≧ . . . ≧s R >0, V is the N×R right singular matrix with row vectors v j (1≦j≦N), R≦min (M, N), and T denotes matrix transposition. 44. The machine-implemented method of claim 43 wherein a feature vector ū i is calculated as
ū i =u i S where u i is a row vector associated with an instance i, and S is the singular diagonal matrix. | 0.942042 |
9,754,022 | 1 | 5 | 1. A method comprising: receiving a user query in a first language; identifying a local language associated with a current location of a user device; and when the first language is distinct from the local language: querying a database based on the user query, to yield search results, wherein the search results comprise (1) a first result having a first word in the first language and a second word in the local language and (2) a second result predominantly in the first language; prioritizing the search results by first presenting the first result followed by the second result, to yield prioritized search results; and presenting the prioritized search results with an indication associated with the second result identifying that the second result is predominantly in the first language. | 1. A method comprising: receiving a user query in a first language; identifying a local language associated with a current location of a user device; and when the first language is distinct from the local language: querying a database based on the user query, to yield search results, wherein the search results comprise (1) a first result having a first word in the first language and a second word in the local language and (2) a second result predominantly in the first language; prioritizing the search results by first presenting the first result followed by the second result, to yield prioritized search results; and presenting the prioritized search results with an indication associated with the second result identifying that the second result is predominantly in the first language. 5. The method of claim 1 , further comprising identifying a primary language of a search result in the search results based on one of a metatag and a language analysis of the search result. | 0.839286 |
8,203,952 | 1 | 3 | 1. A computer-implemented method comprising the steps of: receiving, at a search engine operating on one or more computing devices from a traffic server that is not the search engine and is not operating on the one or more computing devices, network usage information that indicates a frequency with which users of a plurality of users requested, during a particular period of time, a particular document through the traffic server, which monitors frequencies with which documents in a plurality of documents are provided, through the traffic server, from a plurality of origin servers upon which the plurality of documents reside, to the plurality of users in response to a plurality of document-identifying requests from the plurality of users; the search engine positioning the particular document within a queue at a queue position that is selected based on said network usage information; the search engine performing a crawling or indexing operation based at least in part on the position of the particular document within the queue. | 1. A computer-implemented method comprising the steps of: receiving, at a search engine operating on one or more computing devices from a traffic server that is not the search engine and is not operating on the one or more computing devices, network usage information that indicates a frequency with which users of a plurality of users requested, during a particular period of time, a particular document through the traffic server, which monitors frequencies with which documents in a plurality of documents are provided, through the traffic server, from a plurality of origin servers upon which the plurality of documents reside, to the plurality of users in response to a plurality of document-identifying requests from the plurality of users; the search engine positioning the particular document within a queue at a queue position that is selected based on said network usage information; the search engine performing a crawling or indexing operation based at least in part on the position of the particular document within the queue. 3. The method of claim 1 , wherein said network usage information further indicates a frequency that said particular document is modified during the particular period of time. | 0.817708 |
8,195,756 | 12 | 13 | 12. The program instructing the processor as recited in claim 11 , further comprising instructions for communicating with the one or more users. | 12. The program instructing the processor as recited in claim 11 , further comprising instructions for communicating with the one or more users. 13. The program instructing the processor as recited in claim 12 , wherein the communicating comprises sending email to the one or more additional users to invite them to send messages. | 0.929551 |
9,646,606 | 1 | 20 | 1. A method of performing speech recognition that is performed by one or more computers of an automated speech recognizer, the method comprising: receiving, by the one or more computers, data that indicates multiple candidate transcriptions for an utterance, wherein the one or more computers are in communication with (i) a first search system that provides a search service of a first domain, and (ii) a second search system that provides a search service for a second domain, the second domain being different from the first domain; for each particular candidate transcription of the candidate transcriptions: receiving, by the one or more computers, data from the first search system that provides the search service for the first domain, the data from the first search system indicating first search results that the search service for the first domain identifies as relevant to the particular candidate transcription; determining, by the one or more computers, a first score based on the first search results that the search service for the first domain identifies as relevant to the particular candidate transcription; receiving, by the one or more computers, data from the second search system that provides the search service for the second domain, the data from the second search system indicating second search results that the search service for the second domain identifies as relevant to the particular candidate transcription; determining, by the one or more computers, a second score based on the second search results that the search service for the second domain identifies as relevant to the particular candidate transcription; providing, by the one or more computers, (i) the first score that is determined based on the first search results and (ii) the second score that is determined based on the second search results as input to a classifier, wherein the classifier has been trained, using scores that represent characteristics of different search results from different domains, to indicate a likelihood that a transcription is correct based on scores for multiple different domains; and receiving, by the one or more computers and from the trained classifier, a classifier output in response to at least the first score and the second score, the classifier output indicating a likelihood that the particular candidate transcription is correct; selecting, by the one or more computers, a transcription for the utterance, from among the multiple candidate transcriptions, based on the classifier outputs; and providing, by the one or more computers, the transcription as output of the automated speech recognizer. | 1. A method of performing speech recognition that is performed by one or more computers of an automated speech recognizer, the method comprising: receiving, by the one or more computers, data that indicates multiple candidate transcriptions for an utterance, wherein the one or more computers are in communication with (i) a first search system that provides a search service of a first domain, and (ii) a second search system that provides a search service for a second domain, the second domain being different from the first domain; for each particular candidate transcription of the candidate transcriptions: receiving, by the one or more computers, data from the first search system that provides the search service for the first domain, the data from the first search system indicating first search results that the search service for the first domain identifies as relevant to the particular candidate transcription; determining, by the one or more computers, a first score based on the first search results that the search service for the first domain identifies as relevant to the particular candidate transcription; receiving, by the one or more computers, data from the second search system that provides the search service for the second domain, the data from the second search system indicating second search results that the search service for the second domain identifies as relevant to the particular candidate transcription; determining, by the one or more computers, a second score based on the second search results that the search service for the second domain identifies as relevant to the particular candidate transcription; providing, by the one or more computers, (i) the first score that is determined based on the first search results and (ii) the second score that is determined based on the second search results as input to a classifier, wherein the classifier has been trained, using scores that represent characteristics of different search results from different domains, to indicate a likelihood that a transcription is correct based on scores for multiple different domains; and receiving, by the one or more computers and from the trained classifier, a classifier output in response to at least the first score and the second score, the classifier output indicating a likelihood that the particular candidate transcription is correct; selecting, by the one or more computers, a transcription for the utterance, from among the multiple candidate transcriptions, based on the classifier outputs; and providing, by the one or more computers, the transcription as output of the automated speech recognizer. 20. The method of claim 1 , further comprising, for each particular candidate transcription: determining, by the one or more computers, a first domain-specific query submission score that indicates a frequency that the particular candidate transcription was submitted as a query directed to the first domain; and determining, by the one or more computers, a second domain-specific query submission score that indicates a frequency that the particular candidate transcription was submitted as a query directed to the second domain; wherein providing, by the one or more computers, the scores as input to the classifier comprises providing, by the one or more computers, the first score, the second score, the first domain-specific query submission score, and the second domain-specific query submission score to the classifier, the classifier having been trained using examples of scores indicating characteristics of search results for multiple domains and using scores indicating domain-specific query submission scores for multiple domains; and wherein receiving, by the one or more computers, the classifier output comprises receiving, by the one or more computers, a classifier output determined based on the first score, the second score, the first domain-specific query submission score, and the second domain-specific query submission score. | 0.649141 |
7,703,028 | 47 | 48 | 47. An article of manufacture comprising a computer program usable medium storing instructions executable by a processor of a computer, said computer having a graphical display that includes at least two objects, said graphical display showing a relationship between said at least two objects, wherein said computer usable instructions when executed by the processor perform: splitting said graphical display into a left area forming a left rectangle, a center area forming a center rectangle, and a right area forming a right rectangle; displaying a star schema in said graphical display by displaying at least one dimension object including at least one dimension table that includes attribute data in said left area, a facts object including a facts table that includes measurement data in said center area, and at least one additional dimension object including at least one dimension table that includes attribute data in said right area, wherein said at least one object in each area is manipulated independently of said other objects in said each area and said at least one object in each other area; displaying in at least one area said at least two objects in said graphical display; accepting input that enlarges at least one of said at least two objects in one area; and in response to enlarging said at least one object in said one area: enlarging said display of said one area that includes said enlarged at least one object; moving and realigning vertically and horizontally at least one of said at least two objects that is not enlarged relative to said enlarged at least one object in said enlarged area thereby showing said relationship between said at least two objects; moving said display of said each other area to create more space on the graphical display for said enlarged area; realigning said objects in said each other area with the realigned other objects within said enlarged area, wherein positions of said objects in said each other area are adjusted in at least one of a horizontal direction and a vertical direction to accommodate movement and alignment of at least one of said at least two objects that is not enlarged; and displaying said relationship on said graphical display by including at least one connecting line that connects said at least one object in said enlarged area with said at least one object that is not included in said enlarged area. | 47. An article of manufacture comprising a computer program usable medium storing instructions executable by a processor of a computer, said computer having a graphical display that includes at least two objects, said graphical display showing a relationship between said at least two objects, wherein said computer usable instructions when executed by the processor perform: splitting said graphical display into a left area forming a left rectangle, a center area forming a center rectangle, and a right area forming a right rectangle; displaying a star schema in said graphical display by displaying at least one dimension object including at least one dimension table that includes attribute data in said left area, a facts object including a facts table that includes measurement data in said center area, and at least one additional dimension object including at least one dimension table that includes attribute data in said right area, wherein said at least one object in each area is manipulated independently of said other objects in said each area and said at least one object in each other area; displaying in at least one area said at least two objects in said graphical display; accepting input that enlarges at least one of said at least two objects in one area; and in response to enlarging said at least one object in said one area: enlarging said display of said one area that includes said enlarged at least one object; moving and realigning vertically and horizontally at least one of said at least two objects that is not enlarged relative to said enlarged at least one object in said enlarged area thereby showing said relationship between said at least two objects; moving said display of said each other area to create more space on the graphical display for said enlarged area; realigning said objects in said each other area with the realigned other objects within said enlarged area, wherein positions of said objects in said each other area are adjusted in at least one of a horizontal direction and a vertical direction to accommodate movement and alignment of at least one of said at least two objects that is not enlarged; and displaying said relationship on said graphical display by including at least one connecting line that connects said at least one object in said enlarged area with said at least one object that is not included in said enlarged area. 48. The article of manufacture of claim 47 , wherein said computer usable instructions when executed by the processor perform aligning said at least one moved object within said other area. | 0.773381 |
8,463,786 | 17 | 18 | 17. The process of claim 1 , wherein the process action of identifying clusters of keyword candidates in each of the groups of keyword candidates, comprises the action of: constructing a co-occurrence graph in the form of a weighted undirected graph comprising vertices and edges, wherein each vertex represents a different one of the candidate keywords and each edge connects a pair of vertices whose corresponding candidate keywords co-occur in at least one of the documents in the set of related documents, and wherein a weight is assigned to each edge which represents the number of documents in which the candidate keywords associated with the connected vertices co-occur; discarding each edge whose assigned weight does not exceed a prescribed minimum edge weight threshold; eliminating the candidate keyword associated with each vertex, if any, that is not connected to at least one other vertex by an edge, from consideration as a related keyword; designating each group of interconnected vertices as a sub-graph; for each sub-graph, computing the density of the sub-graph, determining if the sub-graph density exceeds a prescribed density threshold, and designating the sub-graph as a dense cluster of keyword candidates whenever its density exceeds the prescribed density threshold. | 17. The process of claim 1 , wherein the process action of identifying clusters of keyword candidates in each of the groups of keyword candidates, comprises the action of: constructing a co-occurrence graph in the form of a weighted undirected graph comprising vertices and edges, wherein each vertex represents a different one of the candidate keywords and each edge connects a pair of vertices whose corresponding candidate keywords co-occur in at least one of the documents in the set of related documents, and wherein a weight is assigned to each edge which represents the number of documents in which the candidate keywords associated with the connected vertices co-occur; discarding each edge whose assigned weight does not exceed a prescribed minimum edge weight threshold; eliminating the candidate keyword associated with each vertex, if any, that is not connected to at least one other vertex by an edge, from consideration as a related keyword; designating each group of interconnected vertices as a sub-graph; for each sub-graph, computing the density of the sub-graph, determining if the sub-graph density exceeds a prescribed density threshold, and designating the sub-graph as a dense cluster of keyword candidates whenever its density exceeds the prescribed density threshold. 18. The process of claim 17 , wherein the process action of computing the density of a sub-graph, comprises: for each vertex of the sub-graph, identifying the edges connected to the vertex under consideration, for each identified edge, computing the difference between the weight assigned to that edge and the prescribed minimum edge weight threshold, and summing the computed differences to establish a vertex sum for the vertex under consideration; and summing the vertex sums computed for the vertices of the sub-graph. | 0.771454 |
9,477,749 | 18 | 26 | 18. The method of claim 8 , further comprising: computing sentiment on unstructured text data; and analyzing an aggregation of extracted features to provide a measure of sentiment. | 18. The method of claim 8 , further comprising: computing sentiment on unstructured text data; and analyzing an aggregation of extracted features to provide a measure of sentiment. 26. The method of claim 18 , further comprising: presenting a non-trended report by displaying sentiment aggregated over a non-time data dimension; and wherein receiving an instruction to determine the one or more causal factors associated with the observation selected by the user further comprises: allowing the user to select a specific data dimension value as the observation for investigating causal factors that show at least one of a statistically significant tendency to associate more with positive sentiment rather than negative sentiment and a statistically significant tendency to associate more with negative sentiment rather than positive sentiment. | 0.869745 |
9,082,007 | 19 | 23 | 19. A computer-implemented method for image recreation, the method comprising: providing a computing system comprising a computer processing device and a non-transitory computer readable medium, where the computer readable medium comprises configured computer program instruction code, such that when said instruction code is operated by said computer processing device, said computer processing device performs the following operations: creating one or more generic control documents, wherein the generic control documents are blank templates of transaction documents, wherein transaction documents are checks; receiving an indication of a user transaction, wherein receiving an indication of the user transaction comprises receiving an image of the transaction documents associated with the user transaction; pulling metadata from the image of the transaction document, wherein metadata from the image of the transaction document includes text and numbers typed on the transaction document; determining if capturing images of image elements from the transaction document is necessary, wherein image elements are handwritten elements of the transaction document; capturing images of image elements from transaction document only when it is determined that capturing is necessary, receiving a request for an image of one or more of the transaction documents associated with the user transaction from the user; retrieving the metadata and the captured images from the transaction documents based on the request; determining an appropriate generic control document from the created one or more generic control documents, wherein the appropriate generic control document is based at least in part on the transaction document used by the user for the transaction; merging, via a computer processing device, the retrieved metadata and the captured image data from the one or more transaction documents with the determined appropriate generic control document to create a generated image of the one or more transaction documents requested; and presenting the generated image of the one or more transaction documents requested to the user. | 19. A computer-implemented method for image recreation, the method comprising: providing a computing system comprising a computer processing device and a non-transitory computer readable medium, where the computer readable medium comprises configured computer program instruction code, such that when said instruction code is operated by said computer processing device, said computer processing device performs the following operations: creating one or more generic control documents, wherein the generic control documents are blank templates of transaction documents, wherein transaction documents are checks; receiving an indication of a user transaction, wherein receiving an indication of the user transaction comprises receiving an image of the transaction documents associated with the user transaction; pulling metadata from the image of the transaction document, wherein metadata from the image of the transaction document includes text and numbers typed on the transaction document; determining if capturing images of image elements from the transaction document is necessary, wherein image elements are handwritten elements of the transaction document; capturing images of image elements from transaction document only when it is determined that capturing is necessary, receiving a request for an image of one or more of the transaction documents associated with the user transaction from the user; retrieving the metadata and the captured images from the transaction documents based on the request; determining an appropriate generic control document from the created one or more generic control documents, wherein the appropriate generic control document is based at least in part on the transaction document used by the user for the transaction; merging, via a computer processing device, the retrieved metadata and the captured image data from the one or more transaction documents with the determined appropriate generic control document to create a generated image of the one or more transaction documents requested; and presenting the generated image of the one or more transaction documents requested to the user. 23. The computer-implemented method of claim 19 , wherein merging the retrieved stored data from the one or more transaction documents with the determined appropriate generic control document further comprises adding the text data from the retrieved stored data to the appropriate generic control document. | 0.754808 |
6,038,343 | 10 | 18 | 10. An apparatus for recognizing characters, the apparatus comprising: a recognition dictionary in which are stored reference vectors derived from writing samples provided by non-specified writers, each of the reference vectors representing a category; preliminary character recognition means for comparing a feature vector of each input character in an input character pattern to the reference vectors in the recognition dictionary to preliminarily determine the candidate category to which the input character belongs; a character information store in which the feature vector and the candidate category of each input character are stored; recognized character selection means for selecting, from the input characters stored in the character information store, each of the input characters that has been recognized with high reliability as a selected input character; writer-specific reference vector generating means for receiving the feature vectors of the selected input characters from the character information store, and for generating therefrom a writer-specific reference vector for each category, the feature vector of each selected input character being used to generate the writer-specific reference vector for at least one category different from the candidate category to which the selected input character belongs; and final character recognition means, operating in response to the writer-specific reference vector for each category, for finally determining the category to which each input character belongs. | 10. An apparatus for recognizing characters, the apparatus comprising: a recognition dictionary in which are stored reference vectors derived from writing samples provided by non-specified writers, each of the reference vectors representing a category; preliminary character recognition means for comparing a feature vector of each input character in an input character pattern to the reference vectors in the recognition dictionary to preliminarily determine the candidate category to which the input character belongs; a character information store in which the feature vector and the candidate category of each input character are stored; recognized character selection means for selecting, from the input characters stored in the character information store, each of the input characters that has been recognized with high reliability as a selected input character; writer-specific reference vector generating means for receiving the feature vectors of the selected input characters from the character information store, and for generating therefrom a writer-specific reference vector for each category, the feature vector of each selected input character being used to generate the writer-specific reference vector for at least one category different from the candidate category to which the selected input character belongs; and final character recognition means, operating in response to the writer-specific reference vector for each category, for finally determining the category to which each input character belongs. 18. The apparatus of claim 10, in which: the writer-specific feature vector generating means includes: writer-specific feature vector generating means for generating a writer-specific feature vector for each category from the feature vectors of the selected input characters, the writer specific feature vector generating means generating plural writer-specific feature vectors for at least one category, and including means for averaging the plural writer-specific feature vectors to obtain a writer-specific feature vector for the at least one category, and means for deriving the writer-specific reference vector for each category from the writer-specific feature vector for the category. | 0.500723 |
8,606,775 | 14 | 18 | 14. A computer-implemented method for graphically representing one or more referents associated with a plurality of stories, the computer-implemented method comprising: as implemented by one or more computing devices configured with specific executable instructions, determining, for each of the plurality of stories, a score for the story based at least in part on a number of times that one or more referents of interest are referenced in at least a portion of content of the story; and generating for display a graphical representation of a subset of the plurality of stories, the graphical representation comprising a plurality of indicia, wherein each indicium of the plurality of indicia is associated with a different story of the subset of the plurality of stories, wherein the indicium for each story of the subset graphically indicates a strength of association between the story and the one or more referents of interest, and wherein the strength of association is determined based at least in part on the score for the story. | 14. A computer-implemented method for graphically representing one or more referents associated with a plurality of stories, the computer-implemented method comprising: as implemented by one or more computing devices configured with specific executable instructions, determining, for each of the plurality of stories, a score for the story based at least in part on a number of times that one or more referents of interest are referenced in at least a portion of content of the story; and generating for display a graphical representation of a subset of the plurality of stories, the graphical representation comprising a plurality of indicia, wherein each indicium of the plurality of indicia is associated with a different story of the subset of the plurality of stories, wherein the indicium for each story of the subset graphically indicates a strength of association between the story and the one or more referents of interest, and wherein the strength of association is determined based at least in part on the score for the story. 18. The computer-implemented method of claim 14 , wherein each referent of interest comprises at least one of an event, a character, an object, a subject, a time, a place and a person. | 0.941439 |
7,561,596 | 20 | 23 | 20. The computer system of claim 19 , wherein the multiplexer further formats the one or more multi-source data words that comprise additional data from one or more of the data buffers. | 20. The computer system of claim 19 , wherein the multiplexer further formats the one or more multi-source data words that comprise additional data from one or more of the data buffers. 23. The computer system of claim 20 , wherein an invalid value for the data stored in the data section of the multi-source data word indicates that the data section is empty. | 0.940977 |
7,529,753 | 28 | 37 | 28. A computer accessible storage hardware having stored thereon computer-executable instructions for providing application layer functionality between one or more database clients and one or more database servers, the computer executable instructions operable to: at a decoding layer above a network layer at a first network location between one or more database clients residing at one or more second network locations and one or more database servers residing at one or more third network locations: receive database messages communicated from the database clients and intended for the database servers and database messages communicated from the database servers and intended for the database clients; decode the database messages; extract query-language statements from the database messages; at a decoding layer above a network layer at a first network location between one or more database clients residing at one or more second network locations and one or more database servers residing at one or more third network locations: receiving database messages communicated from the database clients and intended for the database servers and database messages communicated from the database servers and intended for the database clients; decoding the database messages; and extracting query-language statements from the database messages; at an application layer above the decoding layer, a caching application operable for: receiving query-language statements extracted at the decoders comprising queries; receiving query-language statements extracted at the decoders comprising query results corresponding to the queries; and recording the queries and the query results corresponding to the queries in a cache residing at the first network location wherein the queries are associated with a corresponding query result; and a monitoring application operable to receive query-language statements extracted at the decoders and record observations on the database messages based at least in part on the query-language statements extracted at the decoders, wherein at least one observation is associated with a query result stored in the cache and communicate one or more observations associated with the queries to one or more computing systems at a fourth network location according to the needs of the one or more computer systems, wherein at least one of the computer systems maintains a web cache and is operable to modify the web cache based upon the communicated observations wherein observations on the database messages based at least in part on the query-language statement extracted at the decoders comprise the following: subject database instances of the query-language statements; network protocols and versions of the network protocols used to communicate the database messages; devices hosting the subject database instances of the query-language statements; hostnames, Internet Protocol (IP) addresses, Media Access Control (MAC) addresses, and network ports of the database servers; operating systems (OSs), versions of the OSs, and attributes of the OSs of devices hosting the subject database instances; devices hosting the clients; and a number of queries communicated from each of the clients to each of one or more database instances; and at an application layer above the decoding layer at the first network location, process the query-language statements extracted at the decoding layer. | 28. A computer accessible storage hardware having stored thereon computer-executable instructions for providing application layer functionality between one or more database clients and one or more database servers, the computer executable instructions operable to: at a decoding layer above a network layer at a first network location between one or more database clients residing at one or more second network locations and one or more database servers residing at one or more third network locations: receive database messages communicated from the database clients and intended for the database servers and database messages communicated from the database servers and intended for the database clients; decode the database messages; extract query-language statements from the database messages; at a decoding layer above a network layer at a first network location between one or more database clients residing at one or more second network locations and one or more database servers residing at one or more third network locations: receiving database messages communicated from the database clients and intended for the database servers and database messages communicated from the database servers and intended for the database clients; decoding the database messages; and extracting query-language statements from the database messages; at an application layer above the decoding layer, a caching application operable for: receiving query-language statements extracted at the decoders comprising queries; receiving query-language statements extracted at the decoders comprising query results corresponding to the queries; and recording the queries and the query results corresponding to the queries in a cache residing at the first network location wherein the queries are associated with a corresponding query result; and a monitoring application operable to receive query-language statements extracted at the decoders and record observations on the database messages based at least in part on the query-language statements extracted at the decoders, wherein at least one observation is associated with a query result stored in the cache and communicate one or more observations associated with the queries to one or more computing systems at a fourth network location according to the needs of the one or more computer systems, wherein at least one of the computer systems maintains a web cache and is operable to modify the web cache based upon the communicated observations wherein observations on the database messages based at least in part on the query-language statement extracted at the decoders comprise the following: subject database instances of the query-language statements; network protocols and versions of the network protocols used to communicate the database messages; devices hosting the subject database instances of the query-language statements; hostnames, Internet Protocol (IP) addresses, Media Access Control (MAC) addresses, and network ports of the database servers; operating systems (OSs), versions of the OSs, and attributes of the OSs of devices hosting the subject database instances; devices hosting the clients; and a number of queries communicated from each of the clients to each of one or more database instances; and at an application layer above the decoding layer at the first network location, process the query-language statements extracted at the decoding layer. 37. The computer accessible storage hardware of claim 28 , wherein the instructions are further operable, at a query-language layer above the decoding layer at the first network location, to receive query-language statements extracted at the decoding layer and, before the application receives the query-language statements, normalize the query-language statements for processing at the application. | 0.597782 |
7,711,735 | 9 | 10 | 9. The computer-readable medium of claim 1 having further computer executable instructions, comprising, suggesting domains from a set of users and domains visited by the set of users. | 9. The computer-readable medium of claim 1 having further computer executable instructions, comprising, suggesting domains from a set of users and domains visited by the set of users. 10. The computer-readable medium of claim 9 wherein suggesting the domains from a set of users comprises converting data in a users' URL visit log to a table of users-to-domains. | 0.962144 |
9,092,459 | 13 | 14 | 13. The system of claim 9 , wherein providing the image and the text query to the plurality of second users further comprises: including the image and the text query pair in a list of additional image and query pairs, the image and text query pair having a position in the list; and selecting the image and text query pair from the list for presentation to the plurality of second users, the selection based on the position of the image and text query pair in the list. | 13. The system of claim 9 , wherein providing the image and the text query to the plurality of second users further comprises: including the image and the text query pair in a list of additional image and query pairs, the image and text query pair having a position in the list; and selecting the image and text query pair from the list for presentation to the plurality of second users, the selection based on the position of the image and text query pair in the list. 14. The system of claim 13 , wherein the operations further comprise: modifying a position of the image and text query pair in the list based on indications of interest in the image and text query pair from one or more second users of the plurality of second users; and selecting the image and text query pair from the list for presentation to one or more third users, the selection based on the modified position of the image and text query pair in the list. | 0.780593 |
8,799,262 | 24 | 25 | 24. A method for configuring a web crawl, the method comprising the steps of: specifying a starter seed uniform resource locator (URL) and a user-specified web crawl configuration to a configurable web crawler which crawls a web to inspect text of page resources accessible on the web, each page resource identified by a unique URL, the user-specified web crawl configuration comprising user-specified crawling rules specifying crawling behavior, the crawling rules specifying crawling behavior for at least one each of a general crawl behavior, one or more page-specific crawl behavior to be applied during a crawl to one or more identified pages, and one or more element-specific crawl behavior to be applied during a crawl to one or more identified page elements, wherein the received crawling rules define the crawling behavior in terms of whether to record the resource text, whether to follow hyperlinks of the resource, whether to record text description in metadata associated with the page, whether to record keywords identified in the metadata associated with the page, whether to override a page title element, whether to exclude one or more identified resource pages, whether to exclude one or more identified domains; wherein the configurable web crawler is configured to maintain a queue of unprocessed URLs of resources, insert the specified starter seed URL into the queue of unprocessed URLs of resources, retrieve from the queue a next unprocessed URL, retrieve the user-specified web crawl configuration which specifies the crawling rules, and if allowed by the specified general crawl behavior and page-specific crawl behavior of the retrieved crawling rules, fetch the page resource addressed by the retrieved URL and process the fetched page resource on an element-by-element basis by parsing a next page element from the fetched page resource, and if an element-specific behavior is specified in the retrieved crawling rules for the parsed next page element then operating with regard to the element according to the specified element-specific behavior, and otherwise if a page-specific behavior is specified for the fetched page resource then operating with regard to the element according to the specified page-specific behavior, and otherwise if a global crawl behavior is specified then operating with regard to the element according to the specified global crawl behavior, and otherwise operating with regard to the element according to a default crawl behavior; and repeating the processing until either all elements have been parsed and processed in accordance with the retrieved crawling rules, and wherein the default crawl behavior comprises extracting URLs of outbound links and adding the extracted URLs to the queue, storing text to a resource repository for further analysis, the one or more processing units repeating the processing on available unprocessed URLs in the queue. | 24. A method for configuring a web crawl, the method comprising the steps of: specifying a starter seed uniform resource locator (URL) and a user-specified web crawl configuration to a configurable web crawler which crawls a web to inspect text of page resources accessible on the web, each page resource identified by a unique URL, the user-specified web crawl configuration comprising user-specified crawling rules specifying crawling behavior, the crawling rules specifying crawling behavior for at least one each of a general crawl behavior, one or more page-specific crawl behavior to be applied during a crawl to one or more identified pages, and one or more element-specific crawl behavior to be applied during a crawl to one or more identified page elements, wherein the received crawling rules define the crawling behavior in terms of whether to record the resource text, whether to follow hyperlinks of the resource, whether to record text description in metadata associated with the page, whether to record keywords identified in the metadata associated with the page, whether to override a page title element, whether to exclude one or more identified resource pages, whether to exclude one or more identified domains; wherein the configurable web crawler is configured to maintain a queue of unprocessed URLs of resources, insert the specified starter seed URL into the queue of unprocessed URLs of resources, retrieve from the queue a next unprocessed URL, retrieve the user-specified web crawl configuration which specifies the crawling rules, and if allowed by the specified general crawl behavior and page-specific crawl behavior of the retrieved crawling rules, fetch the page resource addressed by the retrieved URL and process the fetched page resource on an element-by-element basis by parsing a next page element from the fetched page resource, and if an element-specific behavior is specified in the retrieved crawling rules for the parsed next page element then operating with regard to the element according to the specified element-specific behavior, and otherwise if a page-specific behavior is specified for the fetched page resource then operating with regard to the element according to the specified page-specific behavior, and otherwise if a global crawl behavior is specified then operating with regard to the element according to the specified global crawl behavior, and otherwise operating with regard to the element according to a default crawl behavior; and repeating the processing until either all elements have been parsed and processed in accordance with the retrieved crawling rules, and wherein the default crawl behavior comprises extracting URLs of outbound links and adding the extracted URLs to the queue, storing text to a resource repository for further analysis, the one or more processing units repeating the processing on available unprocessed URLs in the queue. 25. The method of claim 24 , comprising specifying a crawl depth indicating to the web crawler a maximum number of URL links deep from the starter seed URL to crawl, and wherein the default crawl behavior comprises extracting URLs of outbound links and adding the extracted URLs to the queue so long as the specified crawl depth has not been reached. | 0.885845 |
8,060,517 | 21 | 23 | 21. A system comprising: a popularity database that stores measures of popularity of electronic documents available on the Internet; and one or more computer processors implementing a query breadth analyzer programmed to receive machine-readable information characterizing a first user selection of a first search result that was identified by a search engine as responsive to a first search query; receive machine-readable information characterizing a second user selection of a second search result that was identified by a search engine as responsive to a second search query; determine that breadth of the first search query is larger than breadth of the second search query; and record a characterization of the second user selection of the second search result as more strongly indicative of popularity than the first user selection of the first search result, the characterization being recorded in a machine-readable popularity database that stores measures of popularity. | 21. A system comprising: a popularity database that stores measures of popularity of electronic documents available on the Internet; and one or more computer processors implementing a query breadth analyzer programmed to receive machine-readable information characterizing a first user selection of a first search result that was identified by a search engine as responsive to a first search query; receive machine-readable information characterizing a second user selection of a second search result that was identified by a search engine as responsive to a second search query; determine that breadth of the first search query is larger than breadth of the second search query; and record a characterization of the second user selection of the second search result as more strongly indicative of popularity than the first user selection of the first search result, the characterization being recorded in a machine-readable popularity database that stores measures of popularity. 23. The system of claim 21 , further comprising a client device in communication with the query breadth analyzer. | 0.847297 |
8,214,421 | 2 | 3 | 2. The method of claim 1 , further comprising: providing verification rules corresponding to the specific markup language standard, the verification rules comprising a representation of the protocol verification graph; wherein said testing conformance comprises executing, with a processor of the sequence verifier, the verification rules to test conformance of each of the plurality of messages to the markup language standard. | 2. The method of claim 1 , further comprising: providing verification rules corresponding to the specific markup language standard, the verification rules comprising a representation of the protocol verification graph; wherein said testing conformance comprises executing, with a processor of the sequence verifier, the verification rules to test conformance of each of the plurality of messages to the markup language standard. 3. The method of claim 2 , wherein the protocol verification graph comprises a plurality of nodes each representing a message that must conform to a specific type. | 0.955731 |
10,026,419 | 1 | 2 | 1. A computer-implemented method, comprising: initiating, by a mobile computing device, an audio recording process using a microphone of the mobile computing device; identifying, by the mobile computing device, a first orientation of the mobile computing device at a beginning of the audio recording process; determining, during the audio recording process, that the mobile computing device has transitioned from the first orientation to a second orientation; in response to determining that the mobile computing device has transitioned from the first orientation to a second orientation, determining a speech energy threshold for comparing to speech received during the audio recording process and while the mobile computing device is in the second orientation; comparing an energy of the speech received during the audio recording process and while the mobile computing device is in the second orientation to the speech energy threshold; determining an end of speech condition based on (i) the energy of the speech received during the audio recording process and while the mobile computing device is in the second orientation and (ii) the speech energy threshold; and stopping, based on determining the end of speech condition, the audio recording process. | 1. A computer-implemented method, comprising: initiating, by a mobile computing device, an audio recording process using a microphone of the mobile computing device; identifying, by the mobile computing device, a first orientation of the mobile computing device at a beginning of the audio recording process; determining, during the audio recording process, that the mobile computing device has transitioned from the first orientation to a second orientation; in response to determining that the mobile computing device has transitioned from the first orientation to a second orientation, determining a speech energy threshold for comparing to speech received during the audio recording process and while the mobile computing device is in the second orientation; comparing an energy of the speech received during the audio recording process and while the mobile computing device is in the second orientation to the speech energy threshold; determining an end of speech condition based on (i) the energy of the speech received during the audio recording process and while the mobile computing device is in the second orientation and (ii) the speech energy threshold; and stopping, based on determining the end of speech condition, the audio recording process. 2. The method of claim 1 , wherein identifying the first orientation of the mobile computing device is performed in response to a proximity sensor of the mobile computing device detecting an object within a predetermined distance of the proximity sensor. | 0.856172 |
9,014,364 | 11 | 13 | 11. A non-transitory, computer-readable medium comprising computer-executable instructions that when executed cause at least one computer processor to: receive an indication of an establishment of a call between an agent and a remote party; receive speech audio associated with the call; ascertain a plurality of speech analytics engines to analyze the speech audio, wherein the plurality of speech analytics engines comprises a first speech analytics engine to process the speech audio to ascertain semantic aspects of the speech audio indicating a meaning of speech or uttered word made by at least one of the agent and the remote party and a second speech analytics engine to process the speech audio to ascertain non-semantic aspects of the speech audio being pertinent to at least one of the agent and the remote party or delivery of the speech by at least one of the agent and the remote party that does not directly indicate the meaning of the speech or the uttered word made by at least one of the agent and the remote party; and provide the speech audio to the plurality of speech analytics engines for the duration of the call; determine to transmit an event notification message to a first application specific module based on the second speech analytics engine ascertaining a non-semantic aspect of the speech audio, the first application specific module configured to perform functionality for a first particular application; determine not to transmit the event notification message to a second application specific module, the second application specific module configured to perform functionality for a second particular application that is different from the first particular application; and transmit the event notification message to the first application specific module. | 11. A non-transitory, computer-readable medium comprising computer-executable instructions that when executed cause at least one computer processor to: receive an indication of an establishment of a call between an agent and a remote party; receive speech audio associated with the call; ascertain a plurality of speech analytics engines to analyze the speech audio, wherein the plurality of speech analytics engines comprises a first speech analytics engine to process the speech audio to ascertain semantic aspects of the speech audio indicating a meaning of speech or uttered word made by at least one of the agent and the remote party and a second speech analytics engine to process the speech audio to ascertain non-semantic aspects of the speech audio being pertinent to at least one of the agent and the remote party or delivery of the speech by at least one of the agent and the remote party that does not directly indicate the meaning of the speech or the uttered word made by at least one of the agent and the remote party; and provide the speech audio to the plurality of speech analytics engines for the duration of the call; determine to transmit an event notification message to a first application specific module based on the second speech analytics engine ascertaining a non-semantic aspect of the speech audio, the first application specific module configured to perform functionality for a first particular application; determine not to transmit the event notification message to a second application specific module, the second application specific module configured to perform functionality for a second particular application that is different from the first particular application; and transmit the event notification message to the first application specific module. 13. The non-transitory, computer-readable medium storing instructions of claim 11 , wherein the instructions when executed further cause the at least one computer processor to: provide the speech audio to the first speech analytics engine and then to the second speech analytics engine after providing the speech audio to the first speech analytics engine. | 0.774112 |
9,916,303 | 9 | 10 | 9. A computer system for providing an answer to an input question containing at least one time-sensitive word or at least one time-sensitive phrase using natural language processing (NLP), the computer system comprising: one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising: creating and maintaining an online T-Word Dictionary, wherein creating and maintaining the online T-Word Dictionary comprises: determining a relationship between a plurality of T-Words and a plurality of corresponding values, wherein the plurality of corresponding values include a plurality of related lookup phrases and a plurality of concept terms; mapping the plurality of T-Words to the plurality of corresponding values based on the determined relationship; and storing the mapped plurality of T-Words to the plurality of corresponding values in the online T-Word Dictionary; receiving the input question, wherein the input question is entered by a user via a graphical user interface associated with a first computer; performing natural language processing (NLP) analysis on the input question to extract a required value phrase; forming at least one mathematical equation based on the extracted required value phrase, wherein forming the at least one mathematical equation comprises: identifying the at least one time-sensitive word or the at least one time-sensitive phrase contained in the received input question, wherein a value associated with the identified at least one time-sensitive word or the at least one time-sensitive phrase varies according to a particular point in time, and wherein the identifying comprises communicating online with a second computer to access the online T-Word Dictionary; and resolving the identified at least one time-sensitive word or the at least one time sensitive phrase contained in the received input question, wherein the resolving comprises communicating online with the second computer to access the online T-Word Dictionary and recursively mapping a plurality of variables associated with the identified at least one time-sensitive word or the at least one time-sensitive phrase to at least one formula contained in the T-Word Dictionary; determining the answer to the input question in natural language based on the solved at least one mathematical equation; and narrating the answer to the input question in natural language based on the solved at least one mathematical equation. | 9. A computer system for providing an answer to an input question containing at least one time-sensitive word or at least one time-sensitive phrase using natural language processing (NLP), the computer system comprising: one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising: creating and maintaining an online T-Word Dictionary, wherein creating and maintaining the online T-Word Dictionary comprises: determining a relationship between a plurality of T-Words and a plurality of corresponding values, wherein the plurality of corresponding values include a plurality of related lookup phrases and a plurality of concept terms; mapping the plurality of T-Words to the plurality of corresponding values based on the determined relationship; and storing the mapped plurality of T-Words to the plurality of corresponding values in the online T-Word Dictionary; receiving the input question, wherein the input question is entered by a user via a graphical user interface associated with a first computer; performing natural language processing (NLP) analysis on the input question to extract a required value phrase; forming at least one mathematical equation based on the extracted required value phrase, wherein forming the at least one mathematical equation comprises: identifying the at least one time-sensitive word or the at least one time-sensitive phrase contained in the received input question, wherein a value associated with the identified at least one time-sensitive word or the at least one time-sensitive phrase varies according to a particular point in time, and wherein the identifying comprises communicating online with a second computer to access the online T-Word Dictionary; and resolving the identified at least one time-sensitive word or the at least one time sensitive phrase contained in the received input question, wherein the resolving comprises communicating online with the second computer to access the online T-Word Dictionary and recursively mapping a plurality of variables associated with the identified at least one time-sensitive word or the at least one time-sensitive phrase to at least one formula contained in the T-Word Dictionary; determining the answer to the input question in natural language based on the solved at least one mathematical equation; and narrating the answer to the input question in natural language based on the solved at least one mathematical equation. 10. The computer system of claim 9 , further comprising: determining at least one relevant variable based on the extracted required value phrase; and determining at least one current value for the at least one determined relevant variable. | 0.64956 |
8,775,431 | 10 | 16 | 10. A computer-implemented method, comprising: receiving data from a plurality of remote data sources, the received data being associated with a plurality of search terms; analyzing the received data to identify a trending search term; comparing the trending search term with a database of topical terms, the database of topical terms including terms relevant to a predetermined topic associated with a particular publishing entity; determining that the trending search term is relevant to the predetermined topic; querying a content database using the trending search term to identify a caption to be associated with the trending search term, the content database including content published by the particular publishing entity; appending the caption to the trending search term; and storing the trending search term and the caption in a database, wherein the terms in the database of topical terms are derived from data in the content database. | 10. A computer-implemented method, comprising: receiving data from a plurality of remote data sources, the received data being associated with a plurality of search terms; analyzing the received data to identify a trending search term; comparing the trending search term with a database of topical terms, the database of topical terms including terms relevant to a predetermined topic associated with a particular publishing entity; determining that the trending search term is relevant to the predetermined topic; querying a content database using the trending search term to identify a caption to be associated with the trending search term, the content database including content published by the particular publishing entity; appending the caption to the trending search term; and storing the trending search term and the caption in a database, wherein the terms in the database of topical terms are derived from data in the content database. 16. The computer-implemented method of claim 10 , further comprising: transmitting a notification of the trending search term and the caption to a user device. | 0.81682 |
9,507,819 | 1 | 4 | 1. A method of responding to a search query to a user with a computing system comprising: a) identifying a target geographic region specified by the user with the computing system; b) automatically identifying local content sources with the computing system, which local content sources are situated within said target geographic region and are identified by the computing system to publish local content for such region; wherein at least some of said local content is derived from social network messages published at a social networking site by members of such site within said geographic region; c) processing a query from the user including a first search term with the computing system; d) determining that said query relates to events or topics associated with said target geographic region; e) in response to steps (c) and (d) automatically searching content of said social networking site to identify any local content related to said first search term with the computing system, including any responsive social network messages; f) presenting search results to said user with the computing system for said query including said local content in response to said query directed to said first search term; g) automatically polling and monitoring said social networking site to repeat steps (e) through (f) for said geographic region and locate additional local content relevant to said query. | 1. A method of responding to a search query to a user with a computing system comprising: a) identifying a target geographic region specified by the user with the computing system; b) automatically identifying local content sources with the computing system, which local content sources are situated within said target geographic region and are identified by the computing system to publish local content for such region; wherein at least some of said local content is derived from social network messages published at a social networking site by members of such site within said geographic region; c) processing a query from the user including a first search term with the computing system; d) determining that said query relates to events or topics associated with said target geographic region; e) in response to steps (c) and (d) automatically searching content of said social networking site to identify any local content related to said first search term with the computing system, including any responsive social network messages; f) presenting search results to said user with the computing system for said query including said local content in response to said query directed to said first search term; g) automatically polling and monitoring said social networking site to repeat steps (e) through (f) for said geographic region and locate additional local content relevant to said query. 4. The method of claim 1 , wherein said social network messages include discussions and communications between members of said social networking site. | 0.732143 |
10,033,770 | 1 | 3 | 1. A computer-implemented method for modifying a Session Initiation Protocol (SIP) message included in a series of SIP messages associated with a SIP message flow comprising: providing a scripting-type computer programming language with contexts that reference pre-defined portions of data of a SIP message and variables for storing data associated with a particular SIP message flow; providing an interface for configuring one or more rules of an ingress profile and one or more rules of an egress profile by the scripting language, wherein the one or more rules of the ingress profile are different than the one or more rules of the egress profile, wherein the one or more rules of the ingress profile and one or more rules of the egress profile are executed when processing one or more SIP messages in the SIP message flow, and wherein each of the one or more rules of the ingress profile and one or more rules of the egress profile includes at least one action, the action describing a modification to be made to a particular SIP message in the SIP message flow; receiving, by at least one or more processors, a particular SIP message included in the series of SIP messages; parsing the particular SIP message to determine one or more contexts corresponding to one or more particular portions of the particular SIP message, the parsing including associating a particular portion of the particular SIP message with a particular pre-defined context; determining whether criteria associated with each rule applies to at least the data referenced by one of the contexts; and in response to determining that data referenced by a particular context meets the criteria associated with a particular rule, saving data from the particular SIP message to a variable associated with a memory location based on the one or more actions associated with the particular rule; and modifying a subsequent SIP message based on the data from the particular SIP message in the memory location. | 1. A computer-implemented method for modifying a Session Initiation Protocol (SIP) message included in a series of SIP messages associated with a SIP message flow comprising: providing a scripting-type computer programming language with contexts that reference pre-defined portions of data of a SIP message and variables for storing data associated with a particular SIP message flow; providing an interface for configuring one or more rules of an ingress profile and one or more rules of an egress profile by the scripting language, wherein the one or more rules of the ingress profile are different than the one or more rules of the egress profile, wherein the one or more rules of the ingress profile and one or more rules of the egress profile are executed when processing one or more SIP messages in the SIP message flow, and wherein each of the one or more rules of the ingress profile and one or more rules of the egress profile includes at least one action, the action describing a modification to be made to a particular SIP message in the SIP message flow; receiving, by at least one or more processors, a particular SIP message included in the series of SIP messages; parsing the particular SIP message to determine one or more contexts corresponding to one or more particular portions of the particular SIP message, the parsing including associating a particular portion of the particular SIP message with a particular pre-defined context; determining whether criteria associated with each rule applies to at least the data referenced by one of the contexts; and in response to determining that data referenced by a particular context meets the criteria associated with a particular rule, saving data from the particular SIP message to a variable associated with a memory location based on the one or more actions associated with the particular rule; and modifying a subsequent SIP message based on the data from the particular SIP message in the memory location. 3. The computer-implemented method of claim 1 , wherein a particular rule includes at least one trigger, wherein one or more actions associated with the rule are processed when a particular variable meets a criterion that satisfies the trigger. | 0.707434 |
9,632,989 | 8 | 12 | 8. A system, comprising: a hardware processor; and a memory device, the memory device storing instructions, the instructions when executed causing the hardware processor to perform operations, the operations comprising: storing a hybrid markup language document; determining a partition boundary in the hybrid markup language document; generating a copy of the hybrid markup language document in response to the partition boundary; discarding content in the copy of the hybrid markup language document that precedes the partition boundary; and generating an output markup language document from remaining content occurring in the copy of the hybrid markup language document after the partition boundary. | 8. A system, comprising: a hardware processor; and a memory device, the memory device storing instructions, the instructions when executed causing the hardware processor to perform operations, the operations comprising: storing a hybrid markup language document; determining a partition boundary in the hybrid markup language document; generating a copy of the hybrid markup language document in response to the partition boundary; discarding content in the copy of the hybrid markup language document that precedes the partition boundary; and generating an output markup language document from remaining content occurring in the copy of the hybrid markup language document after the partition boundary. 12. The system of claim 8 , wherein the operations further comprise tagging the partition boundary. | 0.667785 |
7,912,706 | 1 | 9 | 1. A method for entering information in an electronic equipment for composition of a message, the method comprising: receiving one or more symbols from an input device to create a message to be transmitted to and read by a recipient, wherein the symbols correspond to one or more alphanumeric characters; requesting local dictionary information related to the received one or more symbols from a local predictive text dictionary application resident in the electronic equipment; requesting remote dictionary information related to the received one or more symbols from a predictive text dictionary application stored on an associated remote server, wherein the request for remote dictionary information is transmitted automatically upon expiration of a predetermined period of time in response to the received one or more symbols from the input device; receiving the requested local dictionary information and the remote dictionary information, wherein the received local dictionary information and the remote dictionary information includes predictive text that begins with the symbols received from the input device; and outputting the predictive text in a user-sensible format, wherein the predictive text from the local dictionary information is output in priority before the predictive text received from the remote dictionary information. | 1. A method for entering information in an electronic equipment for composition of a message, the method comprising: receiving one or more symbols from an input device to create a message to be transmitted to and read by a recipient, wherein the symbols correspond to one or more alphanumeric characters; requesting local dictionary information related to the received one or more symbols from a local predictive text dictionary application resident in the electronic equipment; requesting remote dictionary information related to the received one or more symbols from a predictive text dictionary application stored on an associated remote server, wherein the request for remote dictionary information is transmitted automatically upon expiration of a predetermined period of time in response to the received one or more symbols from the input device; receiving the requested local dictionary information and the remote dictionary information, wherein the received local dictionary information and the remote dictionary information includes predictive text that begins with the symbols received from the input device; and outputting the predictive text in a user-sensible format, wherein the predictive text from the local dictionary information is output in priority before the predictive text received from the remote dictionary information. 9. The method according to claim 1 , wherein the remote dictionary information includes one or more words that have a spelling that corresponds to the received symbols. | 0.748503 |
8,719,002 | 11 | 15 | 11. A computer usable program product comprising a computer usable storage device including computer usable code for revising a translation of a content using a shared translation database, the computer usable code comprising: computer usable code for presenting the translation of the content to a user; computer usable code for receiving a revision to a first portion of the translation from the user; computer usable code for identifying a second portion of the translation and a third portion of the translation using the shared translation database, the second portion and the third portion being candidates for revising using the revision; and computer usable code for suggesting the second portion for revising using the revision while omitting suggesting the third portion for revising using revision because only a second user with pre-approved access is allowed to revise the third portion. | 11. A computer usable program product comprising a computer usable storage device including computer usable code for revising a translation of a content using a shared translation database, the computer usable code comprising: computer usable code for presenting the translation of the content to a user; computer usable code for receiving a revision to a first portion of the translation from the user; computer usable code for identifying a second portion of the translation and a third portion of the translation using the shared translation database, the second portion and the third portion being candidates for revising using the revision; and computer usable code for suggesting the second portion for revising using the revision while omitting suggesting the third portion for revising using revision because only a second user with pre-approved access is allowed to revise the third portion. 15. The computer usable program product of claim 11 , further comprising: computer usable code for controlling the user's access to the shared translation database such that the user is able to (i) suggest the revision, (ii) interact with the shared translation database to identify the second portion, and (iii) select the second portion for revising, but is unable to modify the shared translation database. | 0.874386 |
7,680,334 | 29 | 30 | 29. The method according to claim 15 , wherein the best interpretation is associated with a category defining what kind of symbol is represented by the best interpretation. | 29. The method according to claim 15 , wherein the best interpretation is associated with a category defining what kind of symbol is represented by the best interpretation. 30. The method according to claim 29 , wherein the step of presenting comprises masking the presentation of the best interpretation according to which category the best interpretation is associated with. | 0.935841 |
7,814,125 | 4 | 5 | 4. The computer program product of claim 3 wherein in response to receiving the page token, the application layer applies business logic and passes the page token back to the user interface builder. | 4. The computer program product of claim 3 wherein in response to receiving the page token, the application layer applies business logic and passes the page token back to the user interface builder. 5. The computer program product of claim 4 wherein in response to receiving the page token, the user interface builder formats the data in the page token into a page for viewing and passes the page back to the user interface controller. | 0.94718 |
8,595,222 | 1 | 4 | 1. A computer-implemented method of using Resource Description Framework (RDF) reification to associate Semantic Web statements with start properties and stop properties related to lifetimes of the Semantic Web statements using a reification processor, comprising: accessing an RDF statement from a Semantic Web resource wherein the RDF statement includes a subject, a predicate, and an object; determining a lifetime of the subject of the RDF statement, wherein determining the lifetime of the subject is based on at least one of a start property of the subject and a stop property of the subject; determining a lifetime of the predicate of the RDF statement, wherein determining the lifetime of the predicate is based on at least one of a start property of the predicate and a stop property the predicate; determining a lifetime of the object of the RDF statement, wherein determining the lifetime of the object is based on at least one of a start property of the object and a stop property of the object; automatically determining a lifetime of the RDF statement based on an overlap of the lifetime of the subject, the lifetime of the predicate, and the lifetime of the object; generating a reified RDF statement, using the reification processor, wherein the reified RDF statement includes the subject, the predicate, the object and the lifetime of the RDF statement; and storing the reified RDF statement in the Semantic Web resource. | 1. A computer-implemented method of using Resource Description Framework (RDF) reification to associate Semantic Web statements with start properties and stop properties related to lifetimes of the Semantic Web statements using a reification processor, comprising: accessing an RDF statement from a Semantic Web resource wherein the RDF statement includes a subject, a predicate, and an object; determining a lifetime of the subject of the RDF statement, wherein determining the lifetime of the subject is based on at least one of a start property of the subject and a stop property of the subject; determining a lifetime of the predicate of the RDF statement, wherein determining the lifetime of the predicate is based on at least one of a start property of the predicate and a stop property the predicate; determining a lifetime of the object of the RDF statement, wherein determining the lifetime of the object is based on at least one of a start property of the object and a stop property of the object; automatically determining a lifetime of the RDF statement based on an overlap of the lifetime of the subject, the lifetime of the predicate, and the lifetime of the object; generating a reified RDF statement, using the reification processor, wherein the reified RDF statement includes the subject, the predicate, the object and the lifetime of the RDF statement; and storing the reified RDF statement in the Semantic Web resource. 4. The method of claim 1 , wherein automatically determining the lifetime of the RDF statement comprises selecting the lifetime of the subject of the RDF statement as the lifetime of the RDF statement. | 0.803711 |
9,596,228 | 19 | 23 | 19. A system, comprising: a service provider device associated with a service provider, the service provider device being configured for: receiving a document account number associated with a user of a document banking system hosted on a server in communication with the service provider device, wherein the document account number is received upon the user swiping a document card at the service provider device; and sending content to the document banking system corresponding to a service along with details of the service provider via secure Application Program Interfaces (APIs); a content handler hosted on the server, the content handler being configured for: authenticating, on a one-time basis, the service provider for sending the content to the user via the document banking system, wherein the authenticating is based on receiving the document account number from the service provider device; receiving the content from the service provider corresponding to a service used by the user, the content being received via secure Application Program Interfaces (APIs), the content being received along with details of the service provider, the user having a document bank account with the document banking system; identifying a template corresponding to the service for which the content is received, wherein the template is stored in a storage module associated with the document bank account; overlaying the received content over the identified template to generate or to update an electronic document with the content received from the service provider; adding the generated or updated electronic document to the storage module associated with the document bank account of the user; and a user interface hosted on the server, the user interface being configured for: displaying the generated or updated electronic document. | 19. A system, comprising: a service provider device associated with a service provider, the service provider device being configured for: receiving a document account number associated with a user of a document banking system hosted on a server in communication with the service provider device, wherein the document account number is received upon the user swiping a document card at the service provider device; and sending content to the document banking system corresponding to a service along with details of the service provider via secure Application Program Interfaces (APIs); a content handler hosted on the server, the content handler being configured for: authenticating, on a one-time basis, the service provider for sending the content to the user via the document banking system, wherein the authenticating is based on receiving the document account number from the service provider device; receiving the content from the service provider corresponding to a service used by the user, the content being received via secure Application Program Interfaces (APIs), the content being received along with details of the service provider, the user having a document bank account with the document banking system; identifying a template corresponding to the service for which the content is received, wherein the template is stored in a storage module associated with the document bank account; overlaying the received content over the identified template to generate or to update an electronic document with the content received from the service provider; adding the generated or updated electronic document to the storage module associated with the document bank account of the user; and a user interface hosted on the server, the user interface being configured for: displaying the generated or updated electronic document. 23. The system of claim 19 , wherein the document banking system includes a transaction engine for transacting the generated or updated electronic document. | 0.704545 |
7,496,516 | 4 | 5 | 4. The method of claim 1 , further comprising: instantiating a session object in response to the recognized command, wherein the session object creates a channel. | 4. The method of claim 1 , further comprising: instantiating a session object in response to the recognized command, wherein the session object creates a channel. 5. The method of claim 4 , further comprising: allocating a client for the session object. | 0.958372 |
5,493,185 | 1 | 7 | 1. An animation method comprising the steps of: (a) providing a figure to be animated, said figure having at least one drive unit for driving a part or segment of the figure; (b) providing a control system and manually causing the control system to emit control signals for controlling said at least one drive unit; (c) digitizing the control signals; (d) feeding the digitized control signals to a processor and processing them individually or in sets; (e) storing the processed control signals in a memory; (f) transmitting the stored control signals to said at least one drive unit after converting said signals to analog form in order to animate the figure; (g) modifying said control signals by superimposing sub-control signals on them during animation of the figure, wherein life-like and spontaneous movements of the figure can be obtained under direct control of an animator even as the stored control signals control basic animation functions to relieve the animator of the need to control said basic animation functions. | 1. An animation method comprising the steps of: (a) providing a figure to be animated, said figure having at least one drive unit for driving a part or segment of the figure; (b) providing a control system and manually causing the control system to emit control signals for controlling said at least one drive unit; (c) digitizing the control signals; (d) feeding the digitized control signals to a processor and processing them individually or in sets; (e) storing the processed control signals in a memory; (f) transmitting the stored control signals to said at least one drive unit after converting said signals to analog form in order to animate the figure; (g) modifying said control signals by superimposing sub-control signals on them during animation of the figure, wherein life-like and spontaneous movements of the figure can be obtained under direct control of an animator even as the stored control signals control basic animation functions to relieve the animator of the need to control said basic animation functions. 7. A method as claimed in claim 1, wherein step (d) comprises the step of implementing a selection system by which the modified control signals may be applied to an individual drive unit or to set of drive units. | 0.717333 |
9,348,900 | 11 | 12 | 11. A computer program product comprising a non-transitory computer readable medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to: receive an input question; route the input question to a plurality of Question and Answer (QA) system pipelines; receive results of processing the input question from each QA system pipeline in the plurality of QA system pipelines, wherein the results comprise one or more candidate answers to the input question and associated confidence scores; adjust, for each QA system pipeline, the confidence scores of the one or more candidate answers associated with the QA system pipeline based on one or more weighting factors; and generate the answer to the input question based on the adjusted confidence scores of the one or more candidate answers for each QA system pipeline. | 11. A computer program product comprising a non-transitory computer readable medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to: receive an input question; route the input question to a plurality of Question and Answer (QA) system pipelines; receive results of processing the input question from each QA system pipeline in the plurality of QA system pipelines, wherein the results comprise one or more candidate answers to the input question and associated confidence scores; adjust, for each QA system pipeline, the confidence scores of the one or more candidate answers associated with the QA system pipeline based on one or more weighting factors; and generate the answer to the input question based on the adjusted confidence scores of the one or more candidate answers for each QA system pipeline. 12. The computer program product of claim 11 , wherein the computer readable program further causes the computing device to adjust the confidence scores of the one or more candidate answers associated with the QA system pipeline at least by: determining a weighting factor for the confidence scores based on determined relevance of the QA system pipeline to the input question. | 0.772892 |
9,177,289 | 1 | 7 | 1. A computer-implemented method for extending a knowledge base, the method being executed using one or more processors and comprising: receiving an enterprise service signature (ESS) associated with an enterprise service (ES), the ESS being stored in a computer-readable repository, the ES comprising a callable service that provides business functionality, the ESS identifying the ES and comprising a concatenation of terms and a notation; segmenting, by the one or more processors, the ESS based on the notation to provide a segmented ESS comprising an array of terms; comparing, by the one or more processors, terms of the array of terms to metadata of a taxonomic scheme, the metadata comprising one or more neighboring entities of a respective term in the array of terms; identifying, by the one or more processors and based on the comparing, one or more known terms and one or more unknown terms from the segmented ESS, the one or more known terms matching the taxonomic scheme and the one or more unknown terms not being associated with the taxonomic scheme; determining, by the one or more processors, that at least one unknown term of the one or more unknown terms comprises at least one of a specialization and a new entity based on combining a cohesion value and a correlation value, the cohesion value being based on a number of times the at least one unknown term is used with one of the one or more known terms and the correlation value being based on a number of times the at least one unknown term is used with other known terms; and extending, by the one or more processors, the knowledge base in view of the at least one of the specialization and the new entity. | 1. A computer-implemented method for extending a knowledge base, the method being executed using one or more processors and comprising: receiving an enterprise service signature (ESS) associated with an enterprise service (ES), the ESS being stored in a computer-readable repository, the ES comprising a callable service that provides business functionality, the ESS identifying the ES and comprising a concatenation of terms and a notation; segmenting, by the one or more processors, the ESS based on the notation to provide a segmented ESS comprising an array of terms; comparing, by the one or more processors, terms of the array of terms to metadata of a taxonomic scheme, the metadata comprising one or more neighboring entities of a respective term in the array of terms; identifying, by the one or more processors and based on the comparing, one or more known terms and one or more unknown terms from the segmented ESS, the one or more known terms matching the taxonomic scheme and the one or more unknown terms not being associated with the taxonomic scheme; determining, by the one or more processors, that at least one unknown term of the one or more unknown terms comprises at least one of a specialization and a new entity based on combining a cohesion value and a correlation value, the cohesion value being based on a number of times the at least one unknown term is used with one of the one or more known terms and the correlation value being based on a number of times the at least one unknown term is used with other known terms; and extending, by the one or more processors, the knowledge base in view of the at least one of the specialization and the new entity. 7. The method of claim 1 , wherein extending the knowledge base comprises appending one or more nodes to a metadata graph associated with the ES. | 0.779635 |
9,116,918 | 11 | 12 | 11. The system of claim 8 , wherein the processor is further configured to: retrieve metadata corresponding to the search domain; extract the plurality of entity names based on the retrieved metadata; determine, for each of the plurality of entity names, the entity type and the entity score associated with the entity name; and generate an entity table that includes, for each of the plurality of entity names, the entity name and the associated entity type and entity score. | 11. The system of claim 8 , wherein the processor is further configured to: retrieve metadata corresponding to the search domain; extract the plurality of entity names based on the retrieved metadata; determine, for each of the plurality of entity names, the entity type and the entity score associated with the entity name; and generate an entity table that includes, for each of the plurality of entity names, the entity name and the associated entity type and entity score. 12. The system of claim 11 , wherein the processor is further configured to supplement the plurality of entity names in the generated entity table with curated entity information, wherein the curated entity information includes ignored terms in the search query. | 0.927704 |
4,829,576 | 23 | 25 | 23. A text locating system for locating a sequence of one or more words in a body of text comprising: means for representing a body of human readable text as a sequence of individual machine readable characters corresponding to individual human readable characters in that text; speech recognition means for responding to the sound of a spoken word by producing a word symbol, identifying a human speakable word which said speech recognition means considers likely to correspond to said sound; search string means for representing a search string comprised of one or more machine readable characters and for responding to the word symbol produced by said speech recognition means by adding to said speech string a sequence of one or more of said machine readable characters corresponding to the spelling of the human speakable word identified by said word symbol; and string searching means for performing a character-by-character search of least a portion of said body of text for a sub-sequence of one or more of said machine readable characters matching the machine readable characters represented by said search string. | 23. A text locating system for locating a sequence of one or more words in a body of text comprising: means for representing a body of human readable text as a sequence of individual machine readable characters corresponding to individual human readable characters in that text; speech recognition means for responding to the sound of a spoken word by producing a word symbol, identifying a human speakable word which said speech recognition means considers likely to correspond to said sound; search string means for representing a search string comprised of one or more machine readable characters and for responding to the word symbol produced by said speech recognition means by adding to said speech string a sequence of one or more of said machine readable characters corresponding to the spelling of the human speakable word identified by said word symbol; and string searching means for performing a character-by-character search of least a portion of said body of text for a sub-sequence of one or more of said machine readable characters matching the machine readable characters represented by said search string. 25. A text locating system as described in claim 23 further including: cursor storing means for storing the location of a cursor, that is, a movable location in said body of text at which certain text processing functions can be performed; and cursor setting means, responsive to said string matching means, for setting the location stored in said cursor storing means to one which points to said matching sub-sequence of one or more words. | 0.860229 |
9,753,737 | 6 | 10 | 6. A non-transitory, computer-readable medium storing computer-executable code for developing applications that provide data security when executed by one or more processors associated with one or more computer systems, the non-transitory, computer-readable medium comprising: code configured to define a view object of an application development framework that presents data stored in datasources according to a predetermined view in applications built on the datasources using the application development framework, and store the view object in memory; code configured to receive information mapping each of a plurality of attributes of the view object to data stored in at least one datasource of the datasources; code to configure attribute security with respect to at least two attributes of the view object at least in part by: receiving expressions that restrict output in the applications of the data mapped to the at least two attributes of the plurality of attributes of the view object in the predetermined view, wherein a first expression of the expressions corresponds to a first role and a first privilege of an identified user, and a second expression of the expressions corresponds to a second role and a second privilege of the identified user; and defining a first security property and a second security property of the at least two attributes, and storing values for the first security property and the second security property in a table of properties defined for the view object; code configured to generate an application with the application development framework based at least in part on the view object; code configured to, responsive to a request corresponding to the view object, and based at least in part on the first security property and the second security property and the values stored in the table of the properties defined for the view object, restricting access, allowed to the identified user according to the first role, to first data mapped to the at least two attributes of the view object, and restrict output, via the application, of second data mapped to the at least two attributes of the view object in the predetermined view according to the second role so that data corresponding to the at least two attributes is excluded from a record and/or a row that is output; wherein each attribute of the plurality of attributes corresponds to one or both of a respective field of the record and a respective column of the row. | 6. A non-transitory, computer-readable medium storing computer-executable code for developing applications that provide data security when executed by one or more processors associated with one or more computer systems, the non-transitory, computer-readable medium comprising: code configured to define a view object of an application development framework that presents data stored in datasources according to a predetermined view in applications built on the datasources using the application development framework, and store the view object in memory; code configured to receive information mapping each of a plurality of attributes of the view object to data stored in at least one datasource of the datasources; code to configure attribute security with respect to at least two attributes of the view object at least in part by: receiving expressions that restrict output in the applications of the data mapped to the at least two attributes of the plurality of attributes of the view object in the predetermined view, wherein a first expression of the expressions corresponds to a first role and a first privilege of an identified user, and a second expression of the expressions corresponds to a second role and a second privilege of the identified user; and defining a first security property and a second security property of the at least two attributes, and storing values for the first security property and the second security property in a table of properties defined for the view object; code configured to generate an application with the application development framework based at least in part on the view object; code configured to, responsive to a request corresponding to the view object, and based at least in part on the first security property and the second security property and the values stored in the table of the properties defined for the view object, restricting access, allowed to the identified user according to the first role, to first data mapped to the at least two attributes of the view object, and restrict output, via the application, of second data mapped to the at least two attributes of the view object in the predetermined view according to the second role so that data corresponding to the at least two attributes is excluded from a record and/or a row that is output; wherein each attribute of the plurality of attributes corresponds to one or both of a respective field of the record and a respective column of the row. 10. The non-transitory, computer-readable storage medium of claim 6 , further comprising: code configured to generate the view object as a component of the application wherein an eXtensible Markup Language (XML) file definition is generated for the view object. | 0.501908 |
8,868,509 | 1 | 7 | 1. A method for backing up data computed using an application in a cloud computing environment, said method comprising: modifying the application to register a servlet; publishing the application that was modified to the cloud computing environment; during execution of the application, using the servlet for: detecting annotated entities created in code of the application by parsing user codes; finding out properties and property types of the annotated entities; generating a plurality of structured query language (SQL) statements to query out data to be backed up in accordance with the annotated entities; and publishing the backed up data, wherein at least one of modifying the application, publishing the application, and using the servlet is to be performed using at least one computer. | 1. A method for backing up data computed using an application in a cloud computing environment, said method comprising: modifying the application to register a servlet; publishing the application that was modified to the cloud computing environment; during execution of the application, using the servlet for: detecting annotated entities created in code of the application by parsing user codes; finding out properties and property types of the annotated entities; generating a plurality of structured query language (SQL) statements to query out data to be backed up in accordance with the annotated entities; and publishing the backed up data, wherein at least one of modifying the application, publishing the application, and using the servlet is to be performed using at least one computer. 7. The method according to claim 1 , further comprising adding a library to the application. | 0.797357 |
7,801,942 | 1 | 2 | 1. A network search platform, comprising: a spider structured to surf a network, to collect textual information of at least one webpage of at least one website of the network, and to store the textual information in a database; a robot browser structured to take at least one snap-shot image of the at least one webpage; resolution means for parsing the textual information and queuing a request to the robot browser to take the at least one snap-shot image responsive to the textual information of the at least one webpage; user selectable options configurable to provide first search results responsive to keywords entered by at least one user of the network, the first search results to show at least some of the textual information of the at least one webpage; and user services configurable to collect demographic information of the at least one user of the network, wherein the user selectable options are further configurable to provide the first search results responsive to the demographic information. | 1. A network search platform, comprising: a spider structured to surf a network, to collect textual information of at least one webpage of at least one website of the network, and to store the textual information in a database; a robot browser structured to take at least one snap-shot image of the at least one webpage; resolution means for parsing the textual information and queuing a request to the robot browser to take the at least one snap-shot image responsive to the textual information of the at least one webpage; user selectable options configurable to provide first search results responsive to keywords entered by at least one user of the network, the first search results to show at least some of the textual information of the at least one webpage; and user services configurable to collect demographic information of the at least one user of the network, wherein the user selectable options are further configurable to provide the first search results responsive to the demographic information. 2. A network search platform according to claim 1 , wherein the user selectable options are further configurable to provide second search results to show only the at least one snap-shot image of the at least one webpage. | 0.897004 |
9,275,364 | 9 | 11 | 9. A non-transitory, machine-readable medium that stores instructions, which, when performed by a machine, cause the machine to perform operations comprising: access a business process platform that includes a business process definition and a provider semantic configuration, the business process definition modeling a business process as a workflow comprising a plurality of dependent tasks, wherein the business process definition identifies a user interface definition, a business object definition, and business object data; generate a group semantic configuration that extends the provider semantic configuration; and apply the group semantic configuration to one or more of the user interface definition, the business object definition, and the business object data; customize one of the plurality of dependent tasks of the workflow defined in the business process definition based on the group semantic configuration, the customization altering a meaning of at least one element of the customized dependent task, wherein the meaning of the customized dependent task comprises task functionality and behavior. | 9. A non-transitory, machine-readable medium that stores instructions, which, when performed by a machine, cause the machine to perform operations comprising: access a business process platform that includes a business process definition and a provider semantic configuration, the business process definition modeling a business process as a workflow comprising a plurality of dependent tasks, wherein the business process definition identifies a user interface definition, a business object definition, and business object data; generate a group semantic configuration that extends the provider semantic configuration; and apply the group semantic configuration to one or more of the user interface definition, the business object definition, and the business object data; customize one of the plurality of dependent tasks of the workflow defined in the business process definition based on the group semantic configuration, the customization altering a meaning of at least one element of the customized dependent task, wherein the meaning of the customized dependent task comprises task functionality and behavior. 11. The non-transitory, machine-readable medium of claim 9 , wherein the group semantic configuration further extends a customer semantic configuration that personalizes the business process definition for an organization. | 0.860553 |
9,668,024 | 1 | 5 | 1. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device having a processor, memory, and a first display, cause the device to: receive speech input from a user; determine a user intent of the speech input based on content displayed on the first display; determine media content based on the user intent; and play the media content on a second device associated with a second display. | 1. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device having a processor, memory, and a first display, cause the device to: receive speech input from a user; determine a user intent of the speech input based on content displayed on the first display; determine media content based on the user intent; and play the media content on a second device associated with a second display. 5. The computer-readable storage medium of claim 1 , wherein the instructions further cause the device to: identify the user based on the speech input; and determine the user intent of the speech input based on data associated with the identified user. | 0.798077 |
9,348,807 | 12 | 13 | 12. The computer program product of claim 8 , wherein the conditional expression component includes a representation of the conditional expression in a hierarchical tree format. | 12. The computer program product of claim 8 , wherein the conditional expression component includes a representation of the conditional expression in a hierarchical tree format. 13. The computer program product of claim 12 , wherein the hierarchical tree format includes conditional expressions that must both be satisfied being depicted as connected by solid lines. | 0.947072 |
7,512,583 | 13 | 15 | 13. A decision support system, comprising: a plurality of disparate data sources, each of the data sources configured to provide data comprising time and event information; and an electronic device configured to receive data from each of the data sources and to authenticate the received data, the electronic device further configured to analyze the time and event information so as to provide at least one recommended action and outcome information for the recommended action. | 13. A decision support system, comprising: a plurality of disparate data sources, each of the data sources configured to provide data comprising time and event information; and an electronic device configured to receive data from each of the data sources and to authenticate the received data, the electronic device further configured to analyze the time and event information so as to provide at least one recommended action and outcome information for the recommended action. 15. The system of claim 13 , wherein the disparate data sources comprise at least one of an internet source, a real-time sensor, a computer database, a relational database, and a flat-file database. | 0.637363 |
8,266,583 | 2 | 3 | 2. The computer-implemented method of claim 1 , further comprising selecting the first function to define whether at least two packet units are members of a same equivalence class. | 2. The computer-implemented method of claim 1 , further comprising selecting the first function to define whether at least two packet units are members of a same equivalence class. 3. The computer-implemented method of claim 2 , further comprising defining the first function to depend upon at least one field of the packet units. | 0.937709 |
6,029,043 | 17 | 34 | 17. A computer-aided group-learning method for more than one user to work on a subject, the method comprising the steps of: setting a duration of time for users to communicate among themselves to allow them to work on materials on the subject; starting a dialogue session for users to communicate in an area related to the subject; stopping the dialogue session approximately at or before the end of the duration of time; and monitoring at least one user's input during the dialogue session so as to have the monitored input available for analysis; wherein based on the analysis, the method further comprises the step of guiding at least one user back to the subject in the dialogue session when one or more users have been distracted from the subject for a duration of time; such that the dialogue session provides an interactive environment to help the users learn. | 17. A computer-aided group-learning method for more than one user to work on a subject, the method comprising the steps of: setting a duration of time for users to communicate among themselves to allow them to work on materials on the subject; starting a dialogue session for users to communicate in an area related to the subject; stopping the dialogue session approximately at or before the end of the duration of time; and monitoring at least one user's input during the dialogue session so as to have the monitored input available for analysis; wherein based on the analysis, the method further comprises the step of guiding at least one user back to the subject in the dialogue session when one or more users have been distracted from the subject for a duration of time; such that the dialogue session provides an interactive environment to help the users learn. 34. A computer-aided group-learning method as recited in claim 17 further comprising: the step of restricting users who can work on the subject; and wherein the one or more users working on the subject are existing users. | 0.66311 |
5,526,407 | 29 | 37 | 29. A speech information apparatus for recording, categorizing, organizing, managing and retrieving speech information, said apparatus comprising, a. speech stream means for obtaining a speech stream, b. first storage means for storing the speech stream in at least a temporary storage, c. extracting means for extracting multiple, selected features from the speech stream, and wherein the multiple features include the speaker's identity or location, duration of speech phrases, and pauses in speaking, d. constructing means for constructing a visual representation of the selected features of the speech stream, e. visual representation means for providing the visual representation to a user, f. categorizing means for categorizing portions of the speech stream, with or without the aid of the representation, by at least one of the following categorizing techniques: user command and, automatic recognition of speech qualities, including tempo, fundamental pitch, and phonemes, and g. second storage means for storing, in at least a temporary storage, data structure which represents the categorized portions of the speech stream. | 29. A speech information apparatus for recording, categorizing, organizing, managing and retrieving speech information, said apparatus comprising, a. speech stream means for obtaining a speech stream, b. first storage means for storing the speech stream in at least a temporary storage, c. extracting means for extracting multiple, selected features from the speech stream, and wherein the multiple features include the speaker's identity or location, duration of speech phrases, and pauses in speaking, d. constructing means for constructing a visual representation of the selected features of the speech stream, e. visual representation means for providing the visual representation to a user, f. categorizing means for categorizing portions of the speech stream, with or without the aid of the representation, by at least one of the following categorizing techniques: user command and, automatic recognition of speech qualities, including tempo, fundamental pitch, and phonemes, and g. second storage means for storing, in at least a temporary storage, data structure which represents the categorized portions of the speech stream. 37. The invention defined in claim 29 wherein the visual representation in the visual means shows patterns of the speech that occurr over a period of time during the obtaining of the speech stream. | 0.778652 |
8,345,966 | 4 | 7 | 4. The method of claim 3 , wherein the labeling further comprises: determining if each pixel in the image represents an edge; estimating distribution of edge density in a neighborhood of the each pixel in the image; and using the distribution to determine a descriptive type of each pixel and labeling each pixel accordingly. | 4. The method of claim 3 , wherein the labeling further comprises: determining if each pixel in the image represents an edge; estimating distribution of edge density in a neighborhood of the each pixel in the image; and using the distribution to determine a descriptive type of each pixel and labeling each pixel accordingly. 7. The method of claim 4 , wherein the determining whether each pixel is a perceptually significant pixel or a perceptually insignificant pixel comprises deeming the each pixel to be perceptually insignificant if the each pixel is at least one of: noise, contour, region boundary, texture boundary, and transition region. | 0.788259 |
9,471,642 | 13 | 18 | 13. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions for: providing a usage tracking engine in an in-memory database and in communication with usage data of a data object of the in-memory database; causing the usage tracking engine to track access to the data object by a database user; causing the usage tracking engine to receive a ranking of the data object from a heuristic learning module in the in-memory database that considers, a geographic location of the database user, a time stamp of access to the data object by the database user, and prior manual placement of the data object in a shelf by the database user; causing the usage tracking engine to check a personalization setting reflecting a number of data objects to be located on the shelf in an application layer accessible to the database user, the number based upon a storage capacity available to the database user; and causing the usage tracking engine to displace the data object from the shelf based upon the ranking and the personalization setting. | 13. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions for: providing a usage tracking engine in an in-memory database and in communication with usage data of a data object of the in-memory database; causing the usage tracking engine to track access to the data object by a database user; causing the usage tracking engine to receive a ranking of the data object from a heuristic learning module in the in-memory database that considers, a geographic location of the database user, a time stamp of access to the data object by the database user, and prior manual placement of the data object in a shelf by the database user; causing the usage tracking engine to check a personalization setting reflecting a number of data objects to be located on the shelf in an application layer accessible to the database user, the number based upon a storage capacity available to the database user; and causing the usage tracking engine to displace the data object from the shelf based upon the ranking and the personalization setting. 18. The non-transitory computer readable storage medium of claim 13 wherein the heuristic learning module further considers whether the database user changed the data object, wherein a change in the data object increases the ranking. | 0.537698 |
9,216,041 | 10 | 19 | 10. A medical implant assembly comprising: a) first and second bone anchors cooperating with a longitudinal connecting member having a tensioned cord and a spacer, the spacer located between the first and second bone anchors and having a first through bore, the tensioned cord extending through the spacer, each of the first and second bone anchors having a first pair of opposed upstanding arms and a compression insert, each compression insert having a second pair of upstanding arms forming an insert channel therebetween, each second pair of upstanding arms of the compression inserts having a top surface; b) a sleeve for attachment to one of the bone anchors, the sleeve having: i) a second through bore sized and shaped for slidably receiving the tensioned cord, ii) an aperture formed in the sleeve substantially transverse to the second through bore, the aperture sized and shaped for receiving a lower extension of a cord gripping closure top, iii) first and second body portions, the first body portion sized and shaped for being closely received within a respective channel of the second pair of upstanding arms of a respective compression insert and the second body portion being sized and shaped to be received between the first pair of opposed upstanding arms of a respective bone anchor and also engage the top surfaces of the second pair of upstanding arms of the respective compression insert. | 10. A medical implant assembly comprising: a) first and second bone anchors cooperating with a longitudinal connecting member having a tensioned cord and a spacer, the spacer located between the first and second bone anchors and having a first through bore, the tensioned cord extending through the spacer, each of the first and second bone anchors having a first pair of opposed upstanding arms and a compression insert, each compression insert having a second pair of upstanding arms forming an insert channel therebetween, each second pair of upstanding arms of the compression inserts having a top surface; b) a sleeve for attachment to one of the bone anchors, the sleeve having: i) a second through bore sized and shaped for slidably receiving the tensioned cord, ii) an aperture formed in the sleeve substantially transverse to the second through bore, the aperture sized and shaped for receiving a lower extension of a cord gripping closure top, iii) first and second body portions, the first body portion sized and shaped for being closely received within a respective channel of the second pair of upstanding arms of a respective compression insert and the second body portion being sized and shaped to be received between the first pair of opposed upstanding arms of a respective bone anchor and also engage the top surfaces of the second pair of upstanding arms of the respective compression insert. 19. The medical implant assembly of claim 10 , wherein the tensioned cord extends through the spacer through an off axis through bore, the off axis through bore being spaced from a central point on a side of the spacer. | 0.744755 |
9,972,317 | 9 | 15 | 9. A computing system comprising: a processor; and memory storing instructions executable by the processor, wherein the instructions, based at least on execution, configure the computing system to: receive first information corresponding to a first set of commands associated with a first application module; receive second information corresponding to a second set of commands associated with a second application module; store the first and second information in a data store; identify a voice command received from a user and recognized based at least in part on using a speech recognizer; based at least in part on a determination, using the stored first information, that the voice command includes at least one word corresponding to a first object or a first action included in at least a first command included in the first set of commands, obtain a first indication of the correspondence between the voice command and the first command; based at least in part on a determination, using the stored second information, that the voice command includes at least one word corresponding to a second object or a second action included in at least a second command included in the second set of commands, obtain a second indication of the correspondence between the voice command and the second command; based at least in part on the first indication and the second indication, prepare a list of third information corresponding, respectively, to the first command associated with the first application module and the second command associated with the second application module; visually render items in the list of third information on a display; for each item in the visually rendered list, visually identify on the display which of the first or second application modules corresponds to the item; receive an indication of a user selection of one of the items in the list of third information, wherein the selected item corresponds to a selected one of the first or second command; and based on the indication of the user selection, automatically execute the selected command. | 9. A computing system comprising: a processor; and memory storing instructions executable by the processor, wherein the instructions, based at least on execution, configure the computing system to: receive first information corresponding to a first set of commands associated with a first application module; receive second information corresponding to a second set of commands associated with a second application module; store the first and second information in a data store; identify a voice command received from a user and recognized based at least in part on using a speech recognizer; based at least in part on a determination, using the stored first information, that the voice command includes at least one word corresponding to a first object or a first action included in at least a first command included in the first set of commands, obtain a first indication of the correspondence between the voice command and the first command; based at least in part on a determination, using the stored second information, that the voice command includes at least one word corresponding to a second object or a second action included in at least a second command included in the second set of commands, obtain a second indication of the correspondence between the voice command and the second command; based at least in part on the first indication and the second indication, prepare a list of third information corresponding, respectively, to the first command associated with the first application module and the second command associated with the second application module; visually render items in the list of third information on a display; for each item in the visually rendered list, visually identify on the display which of the first or second application modules corresponds to the item; receive an indication of a user selection of one of the items in the list of third information, wherein the selected item corresponds to a selected one of the first or second command; and based on the indication of the user selection, automatically execute the selected command. 15. The computing system of claim 9 , wherein the instructions configure the computing system to: identify an action that corresponds to the item selected from the list; identify one of the first or second application module that corresponds to the identified action; and provide an indication of the identified action to the identified application module. | 0.501401 |
8,751,520 | 6 | 13 | 6. A method comprising receiving an initial query; selecting one or more additional queries relating to the initial query; determining a respective utility measure for each of the one or more additional queries, wherein the utility measure represents a likelihood that a respective additional query would be a final query submitted in a query session, wherein the utility measure is determined from a query graph that represents one or more query refinements from the initial query to one of the additional queries, wherein each particular query refinement in the graph has a respective associated weight that represents a likelihood of the particular query refinement being submitted in the query session; selecting an additional query from the one or more additional queries having a highest utility measure; and providing the selected additional query to a client device to be displayed along with search results associated with the initial query. | 6. A method comprising receiving an initial query; selecting one or more additional queries relating to the initial query; determining a respective utility measure for each of the one or more additional queries, wherein the utility measure represents a likelihood that a respective additional query would be a final query submitted in a query session, wherein the utility measure is determined from a query graph that represents one or more query refinements from the initial query to one of the additional queries, wherein each particular query refinement in the graph has a respective associated weight that represents a likelihood of the particular query refinement being submitted in the query session; selecting an additional query from the one or more additional queries having a highest utility measure; and providing the selected additional query to a client device to be displayed along with search results associated with the initial query. 13. The method of claim 6 , wherein the additional queries are contextually relevant to the initial query. | 0.873508 |
6,161,130 | 60 | 61 | 60. The apparatus in claim 59 wherein the handcrafted features comprise features correspondingly related to formatting, authoring, delivery or communication attributes that characterize an e-mail message as belonging to the first class. | 60. The apparatus in claim 59 wherein the handcrafted features comprise features correspondingly related to formatting, authoring, delivery or communication attributes that characterize an e-mail message as belonging to the first class. 61. The apparatus in claim 60 wherein the formatting attributes comprises whether a predefined word in the text of the incoming message is capitalized, or whether the text of the incoming message contains a series of predefined punctuation marks. | 0.918812 |
8,548,797 | 1 | 2 | 1. A computer-implemented method comprising: determining a particular language based at least in part on both content of text submitted by a user and a source IP address that is associated with the user; and based on having determined the particular language for the user, presenting, to the user, one or more content items that are associated with the particular language; wherein the content of the text does not expressly state the particular language. | 1. A computer-implemented method comprising: determining a particular language based at least in part on both content of text submitted by a user and a source IP address that is associated with the user; and based on having determined the particular language for the user, presenting, to the user, one or more content items that are associated with the particular language; wherein the content of the text does not expressly state the particular language. 2. The method of claim 1 , wherein determining the particular language comprises: determining a particular market based on a top-level domain of a particular URL; determining whether the text is encoded in ASCII; determining whether only one language is mapped to the particular market in a stored set of market-to-language mappings; and in response to determining that (a) the text is encoded in ASCII and (b) only one language is mapped to the particular market in the stored set of market-to-language mappings, determining that the particular language is the one language that is mapped to the particular market in the stored set of market-to-language mappings. | 0.846296 |
9,433,310 | 3 | 5 | 3. The sleeve system for beverage containers set forth in claim 1 , further characterized in that extending from said first edge is a hook-fastening rear section that extends a first predetermined distance to a third edge. | 3. The sleeve system for beverage containers set forth in claim 1 , further characterized in that extending from said first edge is a hook-fastening rear section that extends a first predetermined distance to a third edge. 5. The sleeve system for beverage containers set forth in claim 3 , further characterized in that extending from said second edge is a loop-fastening section that extends a second predetermined distance to fourth edge. | 0.818937 |
9,454,764 | 28 | 29 | 28. A non-transitory computer-readable medium whose contents, when executed by a computing system, cause the computing system to perform operations comprising: retrieving an image being displayed; performing optical character recognition on the retrieved image to obtain a sequence of text; identifying an advertising message associated with at least a portion of the obtained sequence of text by at least: identifying a keyword associated with the retrieved image; determining whether the sequence of text is located in the retrieved image within a threshold number of words of the keyword associated with the image; in response to determining that the sequence of text is located in the retrieved image within the threshold number of words of the keyword associated with the retrieved image, selecting a particular advertising message as the advertising message based on (i) the sequence of text and (ii) the keyword associated with the retrieved image; and in response to determining that the sequence of text is not located in the retrieved image within the threshold number of words of the keyword associated with the retrieved image, selecting a particular advertising message as the advertising message based on the sequence of text; and providing the advertising message for display. | 28. A non-transitory computer-readable medium whose contents, when executed by a computing system, cause the computing system to perform operations comprising: retrieving an image being displayed; performing optical character recognition on the retrieved image to obtain a sequence of text; identifying an advertising message associated with at least a portion of the obtained sequence of text by at least: identifying a keyword associated with the retrieved image; determining whether the sequence of text is located in the retrieved image within a threshold number of words of the keyword associated with the image; in response to determining that the sequence of text is located in the retrieved image within the threshold number of words of the keyword associated with the retrieved image, selecting a particular advertising message as the advertising message based on (i) the sequence of text and (ii) the keyword associated with the retrieved image; and in response to determining that the sequence of text is not located in the retrieved image within the threshold number of words of the keyword associated with the retrieved image, selecting a particular advertising message as the advertising message based on the sequence of text; and providing the advertising message for display. 29. The non-transitory computer-readable medium of claim 28 , wherein the advertising message is displayed on a first display device. | 0.898628 |
7,734,823 | 1 | 11 | 1. A computer-implemented method performed on a server in a network, comprising: storing in the server a structured document associated with an application that is executable on the server, the structured document defining a request URL mapping to the application and at least one rule for composing an instance of the application on the server using a set of one or more components, each of the components being defined in the structured document by a URI-addressable path and being one of: a presentation component, a code component and a data component; responsive to receipt at the server of a client request from a client, evaluating the client request; if the client request includes the request URL mapping to the application, retrieving the structured document associated with the application; using the structured document to compose an instance of the application on the server that includes the one or more components as defined in the structured document; generating a response to the client request using the instance of the application that has been composed on the server upon receipt of the client request; delivering the response to the client; after a given time period following delivery of the response, invalidating at least one component in the instance of the application so that the instance of the application is no longer available to respond to new client requests received at the server; and automatically invalidating any other component that was derived from the at least one component when the instance of the application was composed. | 1. A computer-implemented method performed on a server in a network, comprising: storing in the server a structured document associated with an application that is executable on the server, the structured document defining a request URL mapping to the application and at least one rule for composing an instance of the application on the server using a set of one or more components, each of the components being defined in the structured document by a URI-addressable path and being one of: a presentation component, a code component and a data component; responsive to receipt at the server of a client request from a client, evaluating the client request; if the client request includes the request URL mapping to the application, retrieving the structured document associated with the application; using the structured document to compose an instance of the application on the server that includes the one or more components as defined in the structured document; generating a response to the client request using the instance of the application that has been composed on the server upon receipt of the client request; delivering the response to the client; after a given time period following delivery of the response, invalidating at least one component in the instance of the application so that the instance of the application is no longer available to respond to new client requests received at the server; and automatically invalidating any other component that was derived from the at least one component when the instance of the application was composed. 11. The method as described in claim 1 wherein the presentation components are markup language fragments. | 0.7375 |
8,174,559 | 4 | 6 | 4. A method as in claim 1 , further comprising generating text associated with the video and audio data, and storing the text along with another time stamp that synchronizes the text with the video and audio data. | 4. A method as in claim 1 , further comprising generating text associated with the video and audio data, and storing the text along with another time stamp that synchronizes the text with the video and audio data. 6. A method as in claim 4 , wherein said generating text further comprises generating text in a plurality of different languages, the text generated in each of the plurality of different languages representing substantially similar content including at least first text in a first language having the first timestamp, and second text in a second language representing substantially similar information as the first text and the second text being associated with the first time stamp. | 0.712157 |
8,732,214 | 5 | 6 | 5. The computer-readable medium as recited in claim 1 , wherein receiving the string to be searched comprises successively receiving each character of the string. | 5. The computer-readable medium as recited in claim 1 , wherein receiving the string to be searched comprises successively receiving each character of the string. 6. The computer-readable medium as recited in claim 5 further comprising repeating said creating, querying, receiving query results and transmitting steps each time a character is received. | 0.929688 |
9,293,129 | 1 | 3 | 1. A method for determining pronunciation issues, comprising: receiving text comprising sentences for a Text-To-Speech (TTS) component and a recording of the text that is used as a reference for the text; receiving synthesized speech generated by the TTS component using the text as input to the TTS component; evaluating results received by an evaluation performed at a text level by determining a similarity of the synthesized speech to the recording, wherein the evaluation at the text level comprises performing a similarity measurement of a phone sequence of a sentence in the text and a corresponding phone sequence of a sentence in the recording; evaluating results obtained from a Speech Recognition (SR) component related to different inputs to the SR component comprising the synthesized speech and the recording; and generating a list that includes a ranking of pronunciation issue candidates based on the evaluations. | 1. A method for determining pronunciation issues, comprising: receiving text comprising sentences for a Text-To-Speech (TTS) component and a recording of the text that is used as a reference for the text; receiving synthesized speech generated by the TTS component using the text as input to the TTS component; evaluating results received by an evaluation performed at a text level by determining a similarity of the synthesized speech to the recording, wherein the evaluation at the text level comprises performing a similarity measurement of a phone sequence of a sentence in the text and a corresponding phone sequence of a sentence in the recording; evaluating results obtained from a Speech Recognition (SR) component related to different inputs to the SR component comprising the synthesized speech and the recording; and generating a list that includes a ranking of pronunciation issue candidates based on the evaluations. 3. The method of claim 1 , wherein the evaluation at the text level further comprises performing evaluations for a word sequence and a phone sequence of each sentence within the text. | 0.790618 |
6,122,661 | 48 | 50 | 48. A storage medium according to claim 47, further comprising: a translator within the host extension converting the one or more data fields into one or more hypertext links within the markup language document. | 48. A storage medium according to claim 47, further comprising: a translator within the host extension converting the one or more data fields into one or more hypertext links within the markup language document. 50. A storage medium according to claim 48, wherein at least one data field comprises an hidden input field, the translator within the host extension converting the password input field into a text input field within the markup language document. | 0.936335 |
9,986,419 | 31 | 39 | 31. A method comprising: at an electronic device: receiving input representing user instruction to provide a reminder in the future, the user instruction identifying an entity; and after receiving the input: detecting, by a microphone of the electronic device, an audio input; identifying, in the detected audio input, a voice corresponding to the entity; and in response to identifying the voice, providing the reminder. | 31. A method comprising: at an electronic device: receiving input representing user instruction to provide a reminder in the future, the user instruction identifying an entity; and after receiving the input: detecting, by a microphone of the electronic device, an audio input; identifying, in the detected audio input, a voice corresponding to the entity; and in response to identifying the voice, providing the reminder. 39. The method of claim 31 , further comprising: identifying, based on the input, profile information corresponding to the entity, wherein the voice corresponding to the entity is identified based on the identified profile information. | 0.807692 |
9,402,057 | 1 | 4 | 1. An avatar-calling service processing a call from a calling IP client to a called IP client wherein calling IP clients' avatar is integrated into said calling service, said service is accessible through said IP clients' communication device wherein said calling IP client with avatar has video calling and real-time rendering capabilities and said called IP client's end-user communication device has real-time rendering and video/graphics display capabilities, said calling IP client has an application which integrates avatar with lip and motion-syncs into avatar calling service, said avatar-calling service comprising: an avatar call control server communicating with an avatar inserter using an HTTP/XML interface retrieving said calling IP client's avatar information from an avatar repository, said avatar repository storing avatars of users; said avatar inserter retrieving said calling IP client's avatar information from said avatar repository and transferring said retrieved avatar information to said avatar call control server; said avatar call control server sending said avatar information with calling information, wherein the avatar is an animated 2D or 3D digital representations of said IP client's user and said animated 2D and/or 3D avatars are synchronized to the user's lip, face and body movements in real time. | 1. An avatar-calling service processing a call from a calling IP client to a called IP client wherein calling IP clients' avatar is integrated into said calling service, said service is accessible through said IP clients' communication device wherein said calling IP client with avatar has video calling and real-time rendering capabilities and said called IP client's end-user communication device has real-time rendering and video/graphics display capabilities, said calling IP client has an application which integrates avatar with lip and motion-syncs into avatar calling service, said avatar-calling service comprising: an avatar call control server communicating with an avatar inserter using an HTTP/XML interface retrieving said calling IP client's avatar information from an avatar repository, said avatar repository storing avatars of users; said avatar inserter retrieving said calling IP client's avatar information from said avatar repository and transferring said retrieved avatar information to said avatar call control server; said avatar call control server sending said avatar information with calling information, wherein the avatar is an animated 2D or 3D digital representations of said IP client's user and said animated 2D and/or 3D avatars are synchronized to the user's lip, face and body movements in real time. 4. The method of claim 1 , wherein said Avatar-Calling service is one of the following: 3G call, 4G call, video call, VoIP call or video conferencing. | 0.871355 |
9,703,775 | 2 | 3 | 2. The method of claim 1 , further comprising: accessing a social graph of an online social network, the social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between the two nodes, the nodes comprising: a first node corresponding to the first user; and a plurality of second nodes that each correspond to a second user or a concept; and calculating the credibility-score of the first user based on social-graph information associated with the first node. | 2. The method of claim 1 , further comprising: accessing a social graph of an online social network, the social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between the two nodes, the nodes comprising: a first node corresponding to the first user; and a plurality of second nodes that each correspond to a second user or a concept; and calculating the credibility-score of the first user based on social-graph information associated with the first node. 3. The method of claim 2 , wherein the credibility-score of the first user is further based on social-graph information associated with a second node of the plurality of second nodes. | 0.926031 |
9,916,364 | 21 | 22 | 21. The medium of claim 1 , the instructions further defining the step of determining, by the processor, that the user is at a border of two DMAs. | 21. The medium of claim 1 , the instructions further defining the step of determining, by the processor, that the user is at a border of two DMAs. 22. The medium of claim 21 , the instructions further defining the step of identifying, by the processor, two user groups from one DMA each as having similar attributes as the requesting user and relevant news items from local news sources associated with both the DMAs is retrieved for presentation to the user. | 0.88638 |
8,555,248 | 24 | 25 | 24. The computer-implemented system according to claim 23 , wherein each release status code and its associated one or more predefined transitions are specified in a contract between a developer of the application platform and a developer of the business application. | 24. The computer-implemented system according to claim 23 , wherein each release status code and its associated one or more predefined transitions are specified in a contract between a developer of the application platform and a developer of the business application. 25. The computer-implemented system according to claim 24 , wherein the contract specifies types of changes allowed to business object entities associated with the RELEASED release status code, and wherein the business application is to detect changes to business object entities associated with the RELEASED release status code which are not among the specified types of changes. | 0.931234 |
10,062,300 | 1 | 21 | 1. A modular learning device comprising of: a base board having a frame with plurality of sides, a complementary joining construction on sides of the base board, a front plane, a rear plane, a network of tracks having a spinal track, several dormant tracks, several solution tracks, several parking tracks, the dormant tracks and the parking tracks and the solution tracks are connected to the spinal track, a recess, wherein some parking tracks are also solution tracks; a plurality of sliding blocks having a tread, a stopper and a shaft, the shaft having a first end and a second end; and a plurality of wisdom cards having an identifier section, a margin having up to same number of sides as the base board, a plurality of zones in the margin, a middle area and corresponding solutions in the zones randomly, a solution code for problems or situations, each wisdom card containing different problems or situations on a plurality of subjects, an indicator for each problem or situation, wherein the indicator is a hint or a prompt to arrive at correct provided solution; different base boards unifiable by the complementary joining construction on the sides of the base board, the plurality of wisdom cards mounted, either one at a time, or in combination, one in each recess of the base board, the plurality of sliding blocks mounted on the base board with the head on the front plane of the base board and the stopper on the rear plane of the base board, the plurality of sliding blocks can move freely in the network of tracks and cannot get dislodged unless the stopper is separated or manoeuvred using a minimum force. | 1. A modular learning device comprising of: a base board having a frame with plurality of sides, a complementary joining construction on sides of the base board, a front plane, a rear plane, a network of tracks having a spinal track, several dormant tracks, several solution tracks, several parking tracks, the dormant tracks and the parking tracks and the solution tracks are connected to the spinal track, a recess, wherein some parking tracks are also solution tracks; a plurality of sliding blocks having a tread, a stopper and a shaft, the shaft having a first end and a second end; and a plurality of wisdom cards having an identifier section, a margin having up to same number of sides as the base board, a plurality of zones in the margin, a middle area and corresponding solutions in the zones randomly, a solution code for problems or situations, each wisdom card containing different problems or situations on a plurality of subjects, an indicator for each problem or situation, wherein the indicator is a hint or a prompt to arrive at correct provided solution; different base boards unifiable by the complementary joining construction on the sides of the base board, the plurality of wisdom cards mounted, either one at a time, or in combination, one in each recess of the base board, the plurality of sliding blocks mounted on the base board with the head on the front plane of the base board and the stopper on the rear plane of the base board, the plurality of sliding blocks can move freely in the network of tracks and cannot get dislodged unless the stopper is separated or manoeuvred using a minimum force. 21. The modular learning device as claimed in claim 1 , wherein the sliding block has a magnet. | 0.860704 |
6,047,286 | 1 | 5 | 1. A method for indexing information, comprising the steps of: processing a query having a phrase corresponding to concatenation of adjacent portions of the information; generating an index entry for the phrase; processing the query to identify one or more locations at which the phrase occurs within the information; and measuring an amount of time required to process the query to identify the one or more locations; wherein the index entry for the phrase is generated if the measured time exceeds a threshold. | 1. A method for indexing information, comprising the steps of: processing a query having a phrase corresponding to concatenation of adjacent portions of the information; generating an index entry for the phrase; processing the query to identify one or more locations at which the phrase occurs within the information; and measuring an amount of time required to process the query to identify the one or more locations; wherein the index entry for the phrase is generated if the measured time exceeds a threshold. 5. A method according to claim 1, wherein the index entry includes a first entry representing the phrase and one or more second entries each representing a respective location of the phrase within the information. | 0.892641 |
8,721,339 | 10 | 11 | 10. The method of claim 9 wherein; the first query term is a first one of a plurality of query terms; the first matrix of relationships is a first one of a plurality of matrices of relationships; and the method further comprises: computing an originality estimate α for each word in the student writing found in one or more of the plurality of matrices; and computing a point of originality for the student writing using each of the computed originality estimates. | 10. The method of claim 9 wherein; the first query term is a first one of a plurality of query terms; the first matrix of relationships is a first one of a plurality of matrices of relationships; and the method further comprises: computing an originality estimate α for each word in the student writing found in one or more of the plurality of matrices; and computing a point of originality for the student writing using each of the computed originality estimates. 11. The method of claim 10 wherein computing a point of originality for the student writing using each of the computed originality estimates comprises summing each of the originality estimates and wherein the point of originality for the student writing corresponds to the summed originality estimates. | 0.914205 |
9,524,440 | 7 | 19 | 7. A method for providing handwriting recognition for a superimposed input stroke, said method comprising: creating a segmentation graph based on a plurality of input strokes, at least two of the strokes being at least partially superimposed on one another, wherein the segmentation graph consists of nodes and paths corresponding to character hypotheses formed by segmenting the input strokes to take into account the at least partially superimposed strokes; assigning a recognition score to each node of the segmentation graph based on language recognition information; generating linguistic meaning of the input strokes by optimizing the recognition scores of the node paths of the segmentation graph based on a language model; and providing an output based on the simultaneous analysis of the segmentation graph, the recognition score, and the language model. | 7. A method for providing handwriting recognition for a superimposed input stroke, said method comprising: creating a segmentation graph based on a plurality of input strokes, at least two of the strokes being at least partially superimposed on one another, wherein the segmentation graph consists of nodes and paths corresponding to character hypotheses formed by segmenting the input strokes to take into account the at least partially superimposed strokes; assigning a recognition score to each node of the segmentation graph based on language recognition information; generating linguistic meaning of the input strokes by optimizing the recognition scores of the node paths of the segmentation graph based on a language model; and providing an output based on the simultaneous analysis of the segmentation graph, the recognition score, and the language model. 19. A method according to claim 7 , wherein the language model includes linguistic information specific to one or more languages. | 0.831152 |
9,984,249 | 9 | 13 | 9. The computing device of claim 1 , wherein the protection service is further configured to automatically control sharing of the selected digital payload with the recipient computing device based on determining that a sending context is inconsistent with the prospective recipient. | 9. The computing device of claim 1 , wherein the protection service is further configured to automatically control sharing of the selected digital payload with the recipient computing device based on determining that a sending context is inconsistent with the prospective recipient. 13. The computing system of claim 9 , wherein the sending context indicates that the selected digital payload is being shared using a work-designated identity or a personal-designated identity. | 0.93117 |
9,760,549 | 4 | 5 | 4. The method of claim 1 , further comprising: selectively creating a shadowed document; and associating with each partition a shadowed document count. | 4. The method of claim 1 , further comprising: selectively creating a shadowed document; and associating with each partition a shadowed document count. 5. The method of claim 4 , wherein the creation of a shadowed document includes the copying of the current partition table list at one level below the current commit level. | 0.973668 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.