patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
7,630,959 | 1 | 12 | 1. A method for processing a query on a database using a server operatively connected to the database, the method comprising: presenting from the server, to a user, a plurality of query elements, each query element having a plurality of allowed query element values, the plurality of allowed query element values for each query element being presented to the user for selection of a query element value from the plurality of allowed query element values, the query element values not selected by the user being non-selected query element values; receiving at the server, from the user, a selected query element value for at least one of the plurality of query elements; retrieving information objects stored in the database, the database storing a first relevance value which defines a relevance of at least one information object with respect to the selected query element value and a second relevance value which defines a relevance of the at least one information object with respect to the non-selected query element value, the first relevance value and the second relevance value being assigned by a human editor other than the user, the first relevance value and the second relevance value being assigned before the plurality of query elements is presented to the user, the information objects being retrieved based on the first relevance value and the second relevance value, the database further including an index, the index associating at least one information object stored in the database with at least the selected query element value; wherein retrieving the information objects based on the first relevance value and the second relevance value is performed by the server in response to receiving the selected query element value for at least one of the plurality of query elements, and returning query results to the user, the query results corresponding to the information objects. | 1. A method for processing a query on a database using a server operatively connected to the database, the method comprising: presenting from the server, to a user, a plurality of query elements, each query element having a plurality of allowed query element values, the plurality of allowed query element values for each query element being presented to the user for selection of a query element value from the plurality of allowed query element values, the query element values not selected by the user being non-selected query element values; receiving at the server, from the user, a selected query element value for at least one of the plurality of query elements; retrieving information objects stored in the database, the database storing a first relevance value which defines a relevance of at least one information object with respect to the selected query element value and a second relevance value which defines a relevance of the at least one information object with respect to the non-selected query element value, the first relevance value and the second relevance value being assigned by a human editor other than the user, the first relevance value and the second relevance value being assigned before the plurality of query elements is presented to the user, the information objects being retrieved based on the first relevance value and the second relevance value, the database further including an index, the index associating at least one information object stored in the database with at least the selected query element value; wherein retrieving the information objects based on the first relevance value and the second relevance value is performed by the server in response to receiving the selected query element value for at least one of the plurality of query elements, and returning query results to the user, the query results corresponding to the information objects. 12. The method of claim 1 , further comprising calculating the index using the relevance value associated with a selected query element value. | 0.607735 |
8,935,681 | 1 | 2 | 1. A method of protecting an original plain text file which comprises the steps of: a) encrypting the original plain text file and making the original plain text file available to a user as a protected file; b) issuing to said user a user program and a user license, operable on a computer, to enable said user to decrypt the protected file and view the original plain text file as an image of the original plain text file whilst protecting the image of the original plain text file from being copied to any file, other than a further protected file, wherein the image of the original plain text file cannot be found by other programs on the computer; and c) arranging that the user program comprises an editor program that allows the user to (i) edit the image of the original plain text file to create an edited image and (ii) to save changes made to the image of the original plain text file in an encrypted form, separate from the original plain text file, wherein the editor program enables the use to create the edited image of the original plain text file from the protected file and a difference file using the editor program and user license, wherein, before allowing the user to view or edit the image of the original plain text file, the user program checks its own validity by checking a digital signature to ensure the user program has not been modified, and wherein parts of the original plain text file are marked as non-editable, and the editor program prevents such parts being edited so that they will always be present in any image created from the original plain text file and any difference file or files. | 1. A method of protecting an original plain text file which comprises the steps of: a) encrypting the original plain text file and making the original plain text file available to a user as a protected file; b) issuing to said user a user program and a user license, operable on a computer, to enable said user to decrypt the protected file and view the original plain text file as an image of the original plain text file whilst protecting the image of the original plain text file from being copied to any file, other than a further protected file, wherein the image of the original plain text file cannot be found by other programs on the computer; and c) arranging that the user program comprises an editor program that allows the user to (i) edit the image of the original plain text file to create an edited image and (ii) to save changes made to the image of the original plain text file in an encrypted form, separate from the original plain text file, wherein the editor program enables the use to create the edited image of the original plain text file from the protected file and a difference file using the editor program and user license, wherein, before allowing the user to view or edit the image of the original plain text file, the user program checks its own validity by checking a digital signature to ensure the user program has not been modified, and wherein parts of the original plain text file are marked as non-editable, and the editor program prevents such parts being edited so that they will always be present in any image created from the original plain text file and any difference file or files. 2. The method as claimed in claim 1 in which changes to the image of the original plain text file are saved by a difference engine which re-opens the protected file using said user license and compares the image of the original plain text file with the edited image to produce the difference file which is saved. | 0.5 |
9,946,794 | 1 | 13 | 1. A method comprising: receiving, at a computing device, a search query originating from a general purpose search system or a user device in communication with the general purpose search system; in response to receiving the search query, determining, at the computing device, a first module score, wherein the first module score is based on at least one input received by the user device in response to a previous search query; in response to determining that the first module score is greater than a first minimum threshold score and less than a first maximum threshold score, determining, at the computing device, a second module score, wherein: the second module score is based on a match between (i) the search query and (ii) each application of a first set of applications associated with a special purpose search system; and each application of the first set of applications has a popularity score greater than or equal to a threshold popularity score; in response to determining that the second module score is less than a second threshold score, determining, at the computing device, a third module score, wherein: the third module score is based on a match between (i) the search query and (ii) previously executed search queries; and the previously executed search queries are associated with an application search; in response to one of (i) the first module score being greater than or equal to the first maximum threshold score, (ii) the second module score being greater than or equal to the second threshold score, and (iii) the third module score being greater than or equal to a third maximum threshold score, determining, at the computing device, that a special purpose search intent of the search query exists; in response to determining that the special purpose search intent of the search query exists, sending a positive recommendation from the computing device to at least one of the general purpose search system, the special purpose search system, or the user device, wherein the positive recommendation includes an instruction to obtain application search results from the special purpose search system; in response to the general purpose search system receiving the positive recommendation, generating, using the special purpose search system, application search results based on the search query; in response to the special purpose search system generating application search results, obtaining, using the general purpose search system, the application search results from the special purpose search system; generating, using the general purpose search system, general purpose search results based on the search query; and transmitting, using the general purpose search system, a set of the application search results and a set of the general purpose search results to the user device. | 1. A method comprising: receiving, at a computing device, a search query originating from a general purpose search system or a user device in communication with the general purpose search system; in response to receiving the search query, determining, at the computing device, a first module score, wherein the first module score is based on at least one input received by the user device in response to a previous search query; in response to determining that the first module score is greater than a first minimum threshold score and less than a first maximum threshold score, determining, at the computing device, a second module score, wherein: the second module score is based on a match between (i) the search query and (ii) each application of a first set of applications associated with a special purpose search system; and each application of the first set of applications has a popularity score greater than or equal to a threshold popularity score; in response to determining that the second module score is less than a second threshold score, determining, at the computing device, a third module score, wherein: the third module score is based on a match between (i) the search query and (ii) previously executed search queries; and the previously executed search queries are associated with an application search; in response to one of (i) the first module score being greater than or equal to the first maximum threshold score, (ii) the second module score being greater than or equal to the second threshold score, and (iii) the third module score being greater than or equal to a third maximum threshold score, determining, at the computing device, that a special purpose search intent of the search query exists; in response to determining that the special purpose search intent of the search query exists, sending a positive recommendation from the computing device to at least one of the general purpose search system, the special purpose search system, or the user device, wherein the positive recommendation includes an instruction to obtain application search results from the special purpose search system; in response to the general purpose search system receiving the positive recommendation, generating, using the special purpose search system, application search results based on the search query; in response to the special purpose search system generating application search results, obtaining, using the general purpose search system, the application search results from the special purpose search system; generating, using the general purpose search system, general purpose search results based on the search query; and transmitting, using the general purpose search system, a set of the application search results and a set of the general purpose search results to the user device. 13. The method of claim 1 , further comprising: in response to determining that the third module score is greater than a third minimum threshold score and less than the third maximum threshold score, determining, at the computing device, a fourth module score by: matching the search query with a grammar within a search domain of the special purpose search system, wherein each grammar has an associated grammar score; and outputting the fourth module score based on the associated grammar score; and in response to the fourth module score being greater than a fourth maximum threshold, determining, at the computing device, that the special purpose search intent of the search query exists. | 0.5 |
9,325,508 | 19 | 20 | 19. The method of claim 17 , wherein a name of the signing party is placed in a Name entry of the signature field. | 19. The method of claim 17 , wherein a name of the signing party is placed in a Name entry of the signature field. 20. The method of claim 19 , wherein the name of the signing party is included in an appearance of the digital signature when the digitally signed electronic document is rendered into a visual or aural form. | 0.5 |
10,019,824 | 1 | 3 | 1. A method performed by a computing system for rendering a model image of a 3D model, the method comprising: accessing an original image along with metadata based on a view of a camera that collected the image, the metadata for determining a row number and a column number of the original image that correspond to a geospatial coordinate; identifying an origin pixel of the original image, the origin pixel having an origin row number and an origin column number and an image height and an image width in pixels; using the metadata to identify an origin geospatial coordinate associated with the origin pixel; for each easting, northing, and height direction, generating a row transform factor and a column transform factor to transform geospatial coordinates of the 3D model to a clip range based on a pixel that corresponds to a geospatial coordinate that is a certain geospatial distance in that direction from the origin geospatial coordinate; generating a perspective transform matrix based on the row transform factors and the column transform factors; and applying the perspective transform matrix to the 3D model to generate the model image. | 1. A method performed by a computing system for rendering a model image of a 3D model, the method comprising: accessing an original image along with metadata based on a view of a camera that collected the image, the metadata for determining a row number and a column number of the original image that correspond to a geospatial coordinate; identifying an origin pixel of the original image, the origin pixel having an origin row number and an origin column number and an image height and an image width in pixels; using the metadata to identify an origin geospatial coordinate associated with the origin pixel; for each easting, northing, and height direction, generating a row transform factor and a column transform factor to transform geospatial coordinates of the 3D model to a clip range based on a pixel that corresponds to a geospatial coordinate that is a certain geospatial distance in that direction from the origin geospatial coordinate; generating a perspective transform matrix based on the row transform factors and the column transform factors; and applying the perspective transform matrix to the 3D model to generate the model image. 3. The method of claim 1 wherein the original image is a satellite image and the metadata includes rational polynomial coefficients. | 0.901345 |
8,350,964 | 6 | 7 | 6. The captioned image reproducing device according to claim 1 , wherein: the caption text contains a received caption contained in broadcasting data transmitted from an external device and the dummy caption; the captioned image reproducing device further comprises a caption list display unit that displays the caption list and a switching unit that switches a mode between a first mode that the caption list includes therein only the received caption and a second mode that the caption list includes therein the received caption and the dummy caption; the control unit adds an identifier indicating that a caption text is the received caption or the dummy caption to a caption text stored in the memory unit; and when the switching unit switches the mode, the caption list creating unit determines the identifier added to the caption text, and creates a caption list based on a determination result. | 6. The captioned image reproducing device according to claim 1 , wherein: the caption text contains a received caption contained in broadcasting data transmitted from an external device and the dummy caption; the captioned image reproducing device further comprises a caption list display unit that displays the caption list and a switching unit that switches a mode between a first mode that the caption list includes therein only the received caption and a second mode that the caption list includes therein the received caption and the dummy caption; the control unit adds an identifier indicating that a caption text is the received caption or the dummy caption to a caption text stored in the memory unit; and when the switching unit switches the mode, the caption list creating unit determines the identifier added to the caption text, and creates a caption list based on a determination result. 7. The captioned image reproducing device according to claim 6 , wherein when the switching unit switches the mode to the first mode, the caption list creating unit determines a caption text to which an identifier that the caption text is the received caption is added, and creates a caption list that includes therein a predetermined number of caption texts in accordance with the reproduction order. | 0.760454 |
5,392,414 | 3 | 5 | 3. The method as set forth in claim 2, wherein, said predictive annotations correcting step comprises: h.1) correcting said currently recorded predictive annotation if said current retrieval does not result in said selection hit and said prediction hit; h.2) correcting a previously selected predictive annotation in a previously retrieved predictive annotation vector in said predictive annotation storage structure from which said previously recorded predictive annotation was made during said prior access if said current retrieval does not result in said selection hit and said prediction hit, and h.3) correcting a chosen predictive annotation in said currently retrieved predictive annotation vector in said predictive annotation storage structure if said current retrieval does not result in said selection hit, said chosen predictive annotation being a predictive annotation in said currently retrieved predictive annotation vector corresponding to a data block in said currently retrieved data vector chosen to be replaced by a replacement data block. | 3. The method as set forth in claim 2, wherein, said predictive annotations correcting step comprises: h.1) correcting said currently recorded predictive annotation if said current retrieval does not result in said selection hit and said prediction hit; h.2) correcting a previously selected predictive annotation in a previously retrieved predictive annotation vector in said predictive annotation storage structure from which said previously recorded predictive annotation was made during said prior access if said current retrieval does not result in said selection hit and said prediction hit, and h.3) correcting a chosen predictive annotation in said currently retrieved predictive annotation vector in said predictive annotation storage structure if said current retrieval does not result in said selection hit, said chosen predictive annotation being a predictive annotation in said currently retrieved predictive annotation vector corresponding to a data block in said currently retrieved data vector chosen to be replaced by a replacement data block. 5. The method as set forth in claim 3, wherein, if said current retrieval does not result in said selection hit, said previously selected predictive annotation in said previously retrieved predictive annotation vector in said predictive annotation storage structure is corrected in said previously recorded predictive annotation correcting step to predict a vector position corresponding to said chosen data block's vector position in said currently retrieved data vector. | 0.656977 |
8,200,676 | 10 | 13 | 10. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus at least to perform the following steps: using a geoparser engine to identify one or more potential geographic references within a document, and to generate respective geotags associated with the identified geographic references; determining to display on a visual display device a visual representation of the geotags along with the associated geographic references; providing a user interface that facilitates one or more of a change of at least one of the displayed geotags, and a specification of one or more additional geographic references within the document and of additional respective geotags associated with the additional geographic references; and determining to send the one or more of the change(s) to the displayed geotags, and the specification of additional geographic references and additional respective geotags to the geoparser engine for one or more of display on the visual display device within the visual representation and future use by the geoparser engine; wherein each of the geotags includes a relevance, parameter for assessing a pertinence of the geotag with respect to the document, or a confidence parameter for assessing a relevance of the geotag with respect to the associated geographic reference, or a combination thereof. | 10. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus at least to perform the following steps: using a geoparser engine to identify one or more potential geographic references within a document, and to generate respective geotags associated with the identified geographic references; determining to display on a visual display device a visual representation of the geotags along with the associated geographic references; providing a user interface that facilitates one or more of a change of at least one of the displayed geotags, and a specification of one or more additional geographic references within the document and of additional respective geotags associated with the additional geographic references; and determining to send the one or more of the change(s) to the displayed geotags, and the specification of additional geographic references and additional respective geotags to the geoparser engine for one or more of display on the visual display device within the visual representation and future use by the geoparser engine; wherein each of the geotags includes a relevance, parameter for assessing a pertinence of the geotag with respect to the document, or a confidence parameter for assessing a relevance of the geotag with respect to the associated geographic reference, or a combination thereof. 13. The non-transitory computer-readable storage medium of claim 10 , wherein an enabled change includes changing the confidence parameter of a selectable one of the displayed geotags. | 0.7125 |
10,123,028 | 11 | 14 | 11. A syntax parsing method comprising: utilizing a plurality of syntax parsing circuits, each having at least entropy decoding capability, to generate a plurality of entropy decoding results of a plurality of image regions within a same frame, respectively; and assigning bitstream start points of the image regions to the syntax parsing circuits and triggering the syntax parsing circuits to start entropy decoding, respectively; wherein the syntax parsing circuits comprise a first syntax parsing circuit and a second syntax parsing circuit and utilizing the syntax parsing circuits comprises: utilizing the first syntax parsing circuit to perform entropy decoding upon a first image region included in the image regions during a first processing time period; and utilizing the second syntax parsing circuit to perform entropy decoding upon a second image region included in the image regions during a second processing time period, wherein the second processing time period is overlapped with the first processing time period. | 11. A syntax parsing method comprising: utilizing a plurality of syntax parsing circuits, each having at least entropy decoding capability, to generate a plurality of entropy decoding results of a plurality of image regions within a same frame, respectively; and assigning bitstream start points of the image regions to the syntax parsing circuits and triggering the syntax parsing circuits to start entropy decoding, respectively; wherein the syntax parsing circuits comprise a first syntax parsing circuit and a second syntax parsing circuit and utilizing the syntax parsing circuits comprises: utilizing the first syntax parsing circuit to perform entropy decoding upon a first image region included in the image regions during a first processing time period; and utilizing the second syntax parsing circuit to perform entropy decoding upon a second image region included in the image regions during a second processing time period, wherein the second processing time period is overlapped with the first processing time period. 14. The syntax parsing method of claim 11 , further comprising: utilizing a plurality of storage devices dedicated to the syntax parsing circuits, respectively; and storing the entropy decoding results of the image regions into the storage devices, respectively; wherein utilizing the syntax parsing circuits comprises: utilizing each of the syntax parsing circuits to perform entropy decoding upon image regions of a same column in the same frame. | 0.728814 |
9,330,088 | 5 | 6 | 5. A computer program product, for monitoring a synchronous computer-mediated communication in which a text transcript is generated by at least two chat participants including a first chat participant and a second chat participant, the product comprising software stored on a non-transitory software storage device, the software comprising: first program instructions programmed to perform a simple check on the text transcript for existence of a potential frustration precondition, the simple check includes checking a set of at least one table for a list of text-based signals to identify in the text transcript a text-based signal on the list of text-based signals; second program instructions programmed to, on condition that a potential frustration precondition is found, perform a first text analytics analysis on the text transcript to determine whether potential frustration is evidenced by the text transcript; and third program instructions programmed to, responsive to potential frustration being evidenced by the text transcript, take a responsive action based at least in part upon a potential cause of the potential frustration determined by performing a second text analytics analysis on the text transcript; wherein: the responsive action is designed to alleviate an occurrence of potential frustration for the second chat participant; the set of at least one table includes a user-specific table that is customizable by the first chat participant to include participant-specific text-based signals corresponding to the second chat participant; and the user-specific table being customizable to indicate a participant-specific potential frustration precondition corresponding to the second chat participant during a chat session between the first chat participant and the second chat participant. | 5. A computer program product, for monitoring a synchronous computer-mediated communication in which a text transcript is generated by at least two chat participants including a first chat participant and a second chat participant, the product comprising software stored on a non-transitory software storage device, the software comprising: first program instructions programmed to perform a simple check on the text transcript for existence of a potential frustration precondition, the simple check includes checking a set of at least one table for a list of text-based signals to identify in the text transcript a text-based signal on the list of text-based signals; second program instructions programmed to, on condition that a potential frustration precondition is found, perform a first text analytics analysis on the text transcript to determine whether potential frustration is evidenced by the text transcript; and third program instructions programmed to, responsive to potential frustration being evidenced by the text transcript, take a responsive action based at least in part upon a potential cause of the potential frustration determined by performing a second text analytics analysis on the text transcript; wherein: the responsive action is designed to alleviate an occurrence of potential frustration for the second chat participant; the set of at least one table includes a user-specific table that is customizable by the first chat participant to include participant-specific text-based signals corresponding to the second chat participant; and the user-specific table being customizable to indicate a participant-specific potential frustration precondition corresponding to the second chat participant during a chat session between the first chat participant and the second chat participant. 6. The product of claim 5 wherein the responsive action includes automatically, and under software control, making a suggestion to at least one of the at least two chat participants with respect to how the communication may be conducted. | 0.537109 |
9,495,345 | 1 | 5 | 1. A method for improving natural language processing conducted by a natural language model, the method comprising: accessing, at a first node in a logical hierarchy configured to guide classification of a plurality of documents by the natural language model, at least one rule associated with the first node, said at least one rule defining a first factor for determining whether a document among the plurality of documents is to be classified into the first node; identifying a percolation criterion associated with a second node in the logical hierarchy that is a parent node to the first node, said percolation criterion indicating that the at least one rule associated with the first node is to be associated also with the second node; based on the identified percolation criterion, associating the at least one rule with the second node such that the at least one rule defines a second factor for determining whether the document is to also be classified into the second node; accessing the document for natural language processing; and classifying the document according to the logical hierarchy by determining whether the document is to be classified into at least one of the second node and the first node based on the at least one rule associated with both the first node and the second node. | 1. A method for improving natural language processing conducted by a natural language model, the method comprising: accessing, at a first node in a logical hierarchy configured to guide classification of a plurality of documents by the natural language model, at least one rule associated with the first node, said at least one rule defining a first factor for determining whether a document among the plurality of documents is to be classified into the first node; identifying a percolation criterion associated with a second node in the logical hierarchy that is a parent node to the first node, said percolation criterion indicating that the at least one rule associated with the first node is to be associated also with the second node; based on the identified percolation criterion, associating the at least one rule with the second node such that the at least one rule defines a second factor for determining whether the document is to also be classified into the second node; accessing the document for natural language processing; and classifying the document according to the logical hierarchy by determining whether the document is to be classified into at least one of the second node and the first node based on the at least one rule associated with both the first node and the second node. 5. The method of claim 1 , wherein the percolation criterion includes a metadata tag that is enabled. | 0.923369 |
7,665,063 | 38 | 39 | 38. The method of claim 37 , further comprising saving said modified variables to a persistent storage. | 38. The method of claim 37 , further comprising saving said modified variables to a persistent storage. 39. The method of claim 38 , where said persistent storage is a relational database. | 0.557895 |
8,583,608 | 8 | 11 | 8. A computer program product for managing query execution, comprising: a non-transitory computer-readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code to receive a query for processing from a requesting entity; computer readable program code to calculate an estimated execution time for executing the received query, wherein the estimated execution time approximates an amount of time the received query will take to execute; computer readable program code to determine a maximum allowable runtime for the received query; computer readable program code to adjust an amount of memory compression used in executing the received query, based at least in part on the estimated execution time and the maximum allowable runtime for the received query; and computer readable program code to issue the query for execution using the adjusted amount of memory compression. | 8. A computer program product for managing query execution, comprising: a non-transitory computer-readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code to receive a query for processing from a requesting entity; computer readable program code to calculate an estimated execution time for executing the received query, wherein the estimated execution time approximates an amount of time the received query will take to execute; computer readable program code to determine a maximum allowable runtime for the received query; computer readable program code to adjust an amount of memory compression used in executing the received query, based at least in part on the estimated execution time and the maximum allowable runtime for the received query; and computer readable program code to issue the query for execution using the adjusted amount of memory compression. 11. The computer program product of claim 8 , wherein the maximum allowable runtime for the received query is determined based on an execution time adjustment threshold which specifies a maximum amount of time for extending the execution of the received query. | 0.565217 |
7,809,704 | 12 | 13 | 12. The data clustering component of claim 10 wherein the probabilistic analysis component restricts the observed data into subsets and wherein the spectral analysis component spectrally analyzes the observed data based on the subsets. | 12. The data clustering component of claim 10 wherein the probabilistic analysis component restricts the observed data into subsets and wherein the spectral analysis component spectrally analyzes the observed data based on the subsets. 13. The data clustering component of claim 12 wherein the spectral analysis component spectrally analyzes the observed data to identify a cluster that represents a portion of the observed data in a given subset of the observed data, and indicates how well the cluster represents each item of the observed data in the given subset. | 0.5 |
7,533,120 | 15 | 16 | 15. The apparatus of claim 14 further comprising: means for maintaining a database containing one or more configuration setting for a computer. | 15. The apparatus of claim 14 further comprising: means for maintaining a database containing one or more configuration setting for a computer. 16. The apparatus of claim 15 further comprising: means for mapping configuration settings having incompatible data formats into a new compatible data format for storage in said database. | 0.5 |
9,201,937 | 1 | 6 | 1. A method comprising: creating, by one or more processors, one or more schema terms based upon matching one or more general user data requirements to one or more industry terms; identifying, by one or more of the processors, one or more application-specific data requirements that fail to correspond to at least one of the one or more schema terms; creating, by one or more of the processors, one or more application-specific schema terms based upon matching the one or more identified application-specific data requirements to at least one of the one or more industry terms; generating, by one or more of the processors, an associative map that includes data organized according to the one or more application-specific schema terms; creating, by one or more of the processors, a query based upon at least one of the one or more application-specific schema terms; and executing the query on the associative map, wherein the execution of the query retrieves the data from the associative map and loads the data in one or more storage areas accessible to a user. | 1. A method comprising: creating, by one or more processors, one or more schema terms based upon matching one or more general user data requirements to one or more industry terms; identifying, by one or more of the processors, one or more application-specific data requirements that fail to correspond to at least one of the one or more schema terms; creating, by one or more of the processors, one or more application-specific schema terms based upon matching the one or more identified application-specific data requirements to at least one of the one or more industry terms; generating, by one or more of the processors, an associative map that includes data organized according to the one or more application-specific schema terms; creating, by one or more of the processors, a query based upon at least one of the one or more application-specific schema terms; and executing the query on the associative map, wherein the execution of the query retrieves the data from the associative map and loads the data in one or more storage areas accessible to a user. 6. The method of claim 1 further comprising: creating an application-specific mapping script that includes the one or more application-specific schema terms; executing the application-specific mapping script, wherein the execution of the application-specific mapping script retrieves application-specific data corresponding to the one or more application-specific schema terms from one or more operational data storage areas and adds the application-specific data to the associative map; providing the one or more application-specific schema terms to a user; receiving one or more application-specific schema term selections from the user that selects one or more of the application-specific schema terms; including the selected application-specific schema terms in an application-specific query; and executing the application-specific query on the associative map, resulting in identification of the application-specific data and the loading of the identified application-specific data in at least one of the one or more storage areas. | 0.5 |
8,266,587 | 9 | 10 | 9. The computer implemented method of claim 1 , wherein: the number of the input vectors, and a maximum data capacity of respective vectors, are selected to comply with requirements of a specified data processing device, and data found in the output stream is selectively grouped, to further comply with said requirements. | 9. The computer implemented method of claim 1 , wherein: the number of the input vectors, and a maximum data capacity of respective vectors, are selected to comply with requirements of a specified data processing device, and data found in the output stream is selectively grouped, to further comply with said requirements. 10. The computer implemented method of claim 9 , wherein: there are two of the input vectors, each limited to a data capacity comprising a specified byte size. | 0.5 |
9,740,792 | 15 | 17 | 15. A computer system for generating a user interface for a topology of virtual computing resources and application components executing thereon, the computer system comprising: a display device; and a processor programmed to carry out the steps of: generating a plurality of topology components arranged in a grid layout and including a source topology component and a destination topology component, wherein the grid layout includes a plurality of ways comprising gaps between the plurality of topology components; determining a first path segment from the source topology component to the ways, comprising: determining the first path segment travels to an intersection between two of the ways in a direction of the destination topology component; determining a second path segment from the ways to the destination topology component; generating a graphic element based on the determined first and second path segments, wherein the graphic element is a topology connection comprising a plurality of scalar vector graphics connecting the source topology component to the destination topology component; and rendering, on the display device, a graphical user interface comprising the graphic element connecting the source topology component to the destination topology component. | 15. A computer system for generating a user interface for a topology of virtual computing resources and application components executing thereon, the computer system comprising: a display device; and a processor programmed to carry out the steps of: generating a plurality of topology components arranged in a grid layout and including a source topology component and a destination topology component, wherein the grid layout includes a plurality of ways comprising gaps between the plurality of topology components; determining a first path segment from the source topology component to the ways, comprising: determining the first path segment travels to an intersection between two of the ways in a direction of the destination topology component; determining a second path segment from the ways to the destination topology component; generating a graphic element based on the determined first and second path segments, wherein the graphic element is a topology connection comprising a plurality of scalar vector graphics connecting the source topology component to the destination topology component; and rendering, on the display device, a graphical user interface comprising the graphic element connecting the source topology component to the destination topology component. 17. The computer system of claim 15 , wherein the processor is further programmed to carry out the steps of: dividing the ways into a plurality of lanes; and assigning the second path segment to one of the plurality of lanes based on a direction of the second path segment. | 0.782989 |
9,928,060 | 1 | 5 | 1. A method for tracking changes in a Javascript object notation structure, the method comprising: adjusting, by one or more computer processors, a Javascript object notation structure to comprise a tag on at least one object and a tag on at least one array; receiving, by one or more computer processors, data indicating a first set of at least one change to the Javascript object notation structure; adjusting, by one or more computer processors, the tags in the Javascript object notation structure to include the first set of the at least one change in the Javascript object notation structure; receiving, by one or more computer processor, data indicating the first set of the at least one change to the Javascript object notation structure is complete; and displaying, by one or more computer processors, the first set of the at least one change to the Javascript object notation structure based upon the adjusted tags. | 1. A method for tracking changes in a Javascript object notation structure, the method comprising: adjusting, by one or more computer processors, a Javascript object notation structure to comprise a tag on at least one object and a tag on at least one array; receiving, by one or more computer processors, data indicating a first set of at least one change to the Javascript object notation structure; adjusting, by one or more computer processors, the tags in the Javascript object notation structure to include the first set of the at least one change in the Javascript object notation structure; receiving, by one or more computer processor, data indicating the first set of the at least one change to the Javascript object notation structure is complete; and displaying, by one or more computer processors, the first set of the at least one change to the Javascript object notation structure based upon the adjusted tags. 5. The method of claim 1 , further comprising: receiving, by one or more computer processors, a second set of at least one change to the Javascript object notation structure, wherein the second set and the first set include a change to a common component in the code; and adjusting, by one or more computer processors, the tags to replace the first set of the at least one change to the Javascript object notation structure with the received second set of at least one change to the Javascript object notation structure that overlap with the first set of the at least one change to the Javascript object notation structure. | 0.5 |
10,122,732 | 12 | 13 | 12. The method of claim 10 , further comprises: providing at least one categorized group of user identity attributes; and determining a privacy preference for each category. | 12. The method of claim 10 , further comprises: providing at least one categorized group of user identity attributes; and determining a privacy preference for each category. 13. The method of claim 12 , further comprises: receiving from the environment the security policy having requirements specifying required attributes; identifying at least one category referencing the required attributes; and the evaluating further includes using the privacy preference of at least one identified category in the evaluation operation. | 0.5 |
7,724,164 | 1 | 2 | 1. An apparatus usable in a text image coding and decoding system, comprising: a decomposer to decompose image data to extract a stripe image having one or more symbols; a matching unit to match the symbols with reference symbols of a symbol dictionary; a dynamic symbol caching unit to generate one or more new symbols when the one or more new symbols of the symbols are not included in the symbol dictionary, and to remove the least used one or more of the reference symbols, so that the symbol dictionary is updated as an updated symbol dictionary with the one or more new symbols and without the least used one or more reference symbols. | 1. An apparatus usable in a text image coding and decoding system, comprising: a decomposer to decompose image data to extract a stripe image having one or more symbols; a matching unit to match the symbols with reference symbols of a symbol dictionary; a dynamic symbol caching unit to generate one or more new symbols when the one or more new symbols of the symbols are not included in the symbol dictionary, and to remove the least used one or more of the reference symbols, so that the symbol dictionary is updated as an updated symbol dictionary with the one or more new symbols and without the least used one or more reference symbols. 2. The apparatus of claim 1 , further comprising: a memory to store the symbols of the symbol dictionary, wherein the dynamic symbol caching unit removes the least used one or more of the reference symbols according to a memory size of the memory and a volume of the updated symbol dictionary. | 0.807995 |
7,657,458 | 1 | 32 | 1. An apparatus, comprising: a database that contains reviews and reviews information, locator code information, subject information, and user information; and a computer system configured to instantiate a review engine server that provides a first information to a user and receives a second information from said user and stores at least some of the second information in the database, wherein said first information includes at least a review form, and said second information includes at least a locator code, and further wherein said locator code references a unique transaction. | 1. An apparatus, comprising: a database that contains reviews and reviews information, locator code information, subject information, and user information; and a computer system configured to instantiate a review engine server that provides a first information to a user and receives a second information from said user and stores at least some of the second information in the database, wherein said first information includes at least a review form, and said second information includes at least a locator code, and further wherein said locator code references a unique transaction. 32. An apparatus as recited in claim 1 wherein said review engine server further associates at least some of said reviews with said locator code. | 0.759934 |
8,073,845 | 1 | 16 | 1. An information retrieval apparatus, comprising: an input unit for inputting characters; a database for storing a name, an attribute word associated with the name, and a degree of relevance indicating a degree of relevance between the name and the attribute word; a name retrieval unit for retrieving a name including the input characters from the database to output the retrieved name as a candidate name; an attribute word generating unit for extracting an attribute word associated with the candidate name output from the name retrieval unit from the database; and an output unit for displaying the attribute word extracted by the attribute word generating unit and the candidate name from the name retrieval unit, wherein: the attribute word generating unit is configured to: obtain a degree of relevance of the candidate name associated with the attribute word from the database with respect to a combination of the extracted attribute words; calculate a degree of independency indicating a degree of difference between the extracted attribute words; calculate a degree of coverage indicating an extent to which the combination of the extracted attribute words covers the candidate names; and calculate a degree of equality indicating uniformity of a number of corresponding candidate names for each attribute word; the attribute word generating unit comprises a first score calculating unit for calculating a score of the combination of the attribute words based on at least one of the calculated degree of independency, the calculated degree of coverage and the calculated degree of equality; and the attribute word generating unit outputs the combinations of the attribute words to the output unit in a descending order of the score. | 1. An information retrieval apparatus, comprising: an input unit for inputting characters; a database for storing a name, an attribute word associated with the name, and a degree of relevance indicating a degree of relevance between the name and the attribute word; a name retrieval unit for retrieving a name including the input characters from the database to output the retrieved name as a candidate name; an attribute word generating unit for extracting an attribute word associated with the candidate name output from the name retrieval unit from the database; and an output unit for displaying the attribute word extracted by the attribute word generating unit and the candidate name from the name retrieval unit, wherein: the attribute word generating unit is configured to: obtain a degree of relevance of the candidate name associated with the attribute word from the database with respect to a combination of the extracted attribute words; calculate a degree of independency indicating a degree of difference between the extracted attribute words; calculate a degree of coverage indicating an extent to which the combination of the extracted attribute words covers the candidate names; and calculate a degree of equality indicating uniformity of a number of corresponding candidate names for each attribute word; the attribute word generating unit comprises a first score calculating unit for calculating a score of the combination of the attribute words based on at least one of the calculated degree of independency, the calculated degree of coverage and the calculated degree of equality; and the attribute word generating unit outputs the combinations of the attribute words to the output unit in a descending order of the score. 16. The information retrieval apparatus according to claim 1 , wherein the degree of equality is an indicator indicating uniformity of the number of candidate names corresponding to the extracted attribute word. | 0.94235 |
7,672,833 | 1 | 10 | 1. A method for entity disambiguation for execution by one or more data processors, the method comprising: carrying out a within-document co-reference resolution for a plurality of documents, the within-document co-reference resolution comprising: initializing, by at least one of the data processors, a list of entities as an empty list; processing, by at least one of the data processors, names in order of longest to shortest within each entity type class; and comparing, by at least one of the data processors, each name to all entities with which it may be compatible, based on a token hash or database, the comparing being carried out via entity type-specific distance measures; aggregating, by at least one of the data processors, attributes about each entity mentioned in each document; and using, by at least one of the data processors, said entity attributes as features in determining which documents concern a same entity. | 1. A method for entity disambiguation for execution by one or more data processors, the method comprising: carrying out a within-document co-reference resolution for a plurality of documents, the within-document co-reference resolution comprising: initializing, by at least one of the data processors, a list of entities as an empty list; processing, by at least one of the data processors, names in order of longest to shortest within each entity type class; and comparing, by at least one of the data processors, each name to all entities with which it may be compatible, based on a token hash or database, the comparing being carried out via entity type-specific distance measures; aggregating, by at least one of the data processors, attributes about each entity mentioned in each document; and using, by at least one of the data processors, said entity attributes as features in determining which documents concern a same entity. 10. The method of claim 1 , further comprising: carrying out, by at least one of the data processors, entity type-specific parsing to extract entity attributes, generate standardized names, and populate data structures that are used to perform said method of within-document entity disambiguation. | 0.744845 |
8,650,182 | 12 | 14 | 12. A non-transitory computer-readable storage medium storing one or more sequences of instructions, which when executed, cause one or more processors to perform steps comprising: receiving a search request comprising one or more keywords; retrieving, from an index, a set of location indicators, wherein each location indicator of the set of location indicators is stored in association with at least one keyword of the one or more keywords; wherein a location indicator of the set of location indicators includes: a document identifier identifying a particular XML document in a collection of XML documents containing a particular keyword of the one or more keywords; an order key specifying the hierarchical position of a node within the particular XML document that contains the particular keyword; and a path representation representing a path of the node within the particular XML document that contains the particular keyword; and displaying one or more nodes of the particular XML document that contains the particular keyword, wherein the one or more nodes includes the node located at the hierarchical position specified by the order key. | 12. A non-transitory computer-readable storage medium storing one or more sequences of instructions, which when executed, cause one or more processors to perform steps comprising: receiving a search request comprising one or more keywords; retrieving, from an index, a set of location indicators, wherein each location indicator of the set of location indicators is stored in association with at least one keyword of the one or more keywords; wherein a location indicator of the set of location indicators includes: a document identifier identifying a particular XML document in a collection of XML documents containing a particular keyword of the one or more keywords; an order key specifying the hierarchical position of a node within the particular XML document that contains the particular keyword; and a path representation representing a path of the node within the particular XML document that contains the particular keyword; and displaying one or more nodes of the particular XML document that contains the particular keyword, wherein the one or more nodes includes the node located at the hierarchical position specified by the order key. 14. The non-transitory computer-readable storage medium of claim 12 , wherein: the index is stored as a balanced search tree; the particular keyword is a key into the index; and all location indicators of the set of location indicators included in an index entry are stored together as a single element in the balanced search tree. | 0.70708 |
9,489,629 | 1 | 4 | 1. A method, comprising: receiving, by a question answering system, a case from a user; assigning a first level of user sophistication, of a plurality of levels of user sophistication, to the user; determining a level of evidence sophistication, of a plurality of levels of evidence sophistication, associated with each of a plurality of items of supporting evidence in a corpus of information used to process the case; selecting, by operation of a computer processor, a subset of the plurality of items of supporting evidence based on the determined levels of user sophistication and evidence sophistication; and returning the selected subset to the user as part of a response to the case. | 1. A method, comprising: receiving, by a question answering system, a case from a user; assigning a first level of user sophistication, of a plurality of levels of user sophistication, to the user; determining a level of evidence sophistication, of a plurality of levels of evidence sophistication, associated with each of a plurality of items of supporting evidence in a corpus of information used to process the case; selecting, by operation of a computer processor, a subset of the plurality of items of supporting evidence based on the determined levels of user sophistication and evidence sophistication; and returning the selected subset to the user as part of a response to the case. 4. The method of claim 1 , wherein the subset includes items of supporting evidence having a determined level of evidence sophistication matching the first level of user sophistication of the user. | 0.740789 |
8,533,078 | 1 | 7 | 1. A redaction system comprising: a system for receiving an electronic version of a first document; a system for generating an electronic version of a second document which is a redacted version of the first document, wherein the system for generating comprises a computer having a redaction engine coupled to a source of redaction rules, wherein the source of redaction rules comprises at least one rule for automatically excluding information in the first document from the second document; and a system for transmitting the second document from the redaction system. | 1. A redaction system comprising: a system for receiving an electronic version of a first document; a system for generating an electronic version of a second document which is a redacted version of the first document, wherein the system for generating comprises a computer having a redaction engine coupled to a source of redaction rules, wherein the source of redaction rules comprises at least one rule for automatically excluding information in the first document from the second document; and a system for transmitting the second document from the redaction system. 7. A redaction system as in claim 1 wherein the source of redaction rules comprise at least one rule for automatically including a second piece of information in the second document from the first document. | 0.5 |
8,939,837 | 1 | 5 | 1. A system comprising: a memory to store computer instructions; and a processor coupled with the memory, wherein the processor, responsive to executing the computer instructions performs operations comprising: receiving a signal generated in response to a user input at a first accessory operably coupled with a first computing device, wherein the first computing device is programmed to present a video game; identifying matching words between the signal and a plurality of words stored in a multi-lingual library; and providing an audio signal to a second accessory for presentation to an intended recipient, wherein the audio signal is generated based on the received signal using the identified matching words, and wherein the audio signal is associated with the video game. | 1. A system comprising: a memory to store computer instructions; and a processor coupled with the memory, wherein the processor, responsive to executing the computer instructions performs operations comprising: receiving a signal generated in response to a user input at a first accessory operably coupled with a first computing device, wherein the first computing device is programmed to present a video game; identifying matching words between the signal and a plurality of words stored in a multi-lingual library; and providing an audio signal to a second accessory for presentation to an intended recipient, wherein the audio signal is generated based on the received signal using the identified matching words, and wherein the audio signal is associated with the video game. 5. The system of claim 1 , wherein the operations further comprise: obtaining an identity of the intended recipient of the user input; and determining a language for the intended recipient based on the identity. | 0.717914 |
8,527,276 | 11 | 18 | 11. A system comprising: one or more processors; memory; and machine-readable instructions stored in the memory, that upon execution by the one or more processors cause the system to carry out operations comprising: training a neural network implemented by the system to map one or more training-time sequences of phonetic-context descriptors received by the neural network into training-time predicted feature vectors that correspond to acoustic properties of predefined speech waveforms, wherein the one or more training-time sequences of phonetic-context descriptors correspond to phonetic transcriptions of training-time text strings, and the training-time text strings correspond to written transcriptions of speech carried in the predefined speech waveforms, receiving, by a text analysis module implemented by the system, a run-time text string, processing the received run-time text string with the text analysis module to generate a run-time sequence of phonetic-context descriptors that corresponds to a phonetic transcription of the run-time text string, wherein each phonetic-context descriptor of the run-time sequence includes a respective label identifying a phonetic speech unit of a plurality of phonetic speech units, data indicating phonetic context of the identified phonetic speech unit, and data indicating time duration of the identified phonetic speech unit, processing the run-time sequence of the phonetic-context descriptors with the trained neural network in a corresponding sequence of neural network time steps to generate one or more run-time predicted feature vectors, and processing the one or more run-time predicted feature vectors with a signal generation module to produce and output a run-time speech waveform corresponding to a spoken rendering of the received run-time text string, wherein processing the received run-time text string with the text analysis module to generate the run-time sequence of phonetic-context descriptors comprises: generating a run-time transcription sequence of phonetic speech units that corresponds to the phonetic transcription of the run-time text string; and determining a respective number of consecutive phonetic-context descriptors to generate for each of the phonetic speech units of the run-time transcription sequence. | 11. A system comprising: one or more processors; memory; and machine-readable instructions stored in the memory, that upon execution by the one or more processors cause the system to carry out operations comprising: training a neural network implemented by the system to map one or more training-time sequences of phonetic-context descriptors received by the neural network into training-time predicted feature vectors that correspond to acoustic properties of predefined speech waveforms, wherein the one or more training-time sequences of phonetic-context descriptors correspond to phonetic transcriptions of training-time text strings, and the training-time text strings correspond to written transcriptions of speech carried in the predefined speech waveforms, receiving, by a text analysis module implemented by the system, a run-time text string, processing the received run-time text string with the text analysis module to generate a run-time sequence of phonetic-context descriptors that corresponds to a phonetic transcription of the run-time text string, wherein each phonetic-context descriptor of the run-time sequence includes a respective label identifying a phonetic speech unit of a plurality of phonetic speech units, data indicating phonetic context of the identified phonetic speech unit, and data indicating time duration of the identified phonetic speech unit, processing the run-time sequence of the phonetic-context descriptors with the trained neural network in a corresponding sequence of neural network time steps to generate one or more run-time predicted feature vectors, and processing the one or more run-time predicted feature vectors with a signal generation module to produce and output a run-time speech waveform corresponding to a spoken rendering of the received run-time text string, wherein processing the received run-time text string with the text analysis module to generate the run-time sequence of phonetic-context descriptors comprises: generating a run-time transcription sequence of phonetic speech units that corresponds to the phonetic transcription of the run-time text string; and determining a respective number of consecutive phonetic-context descriptors to generate for each of the phonetic speech units of the run-time transcription sequence. 18. The system of claim 11 , wherein each of the one or more run-time predicted feature vectors includes a set of acoustic metrics, and wherein the set of acoustic metrics is at least one of Mel Cepstral coefficients, Line Spectral Pairs, Linear Predictive coefficients, Mel-Generalized Cepstral Coefficients, fundamental frequency, aperiodic measures, log power spectrum, or phase, and wherein each of the one or more run-time predicted feature vectors further includes a set of first-order time derivatives of the set of acoustic metrics, and a set of second-order time derivatives of the set of acoustic metrics, the second-order time derivatives being time derivatives of the first-order time derivatives. | 0.754161 |
9,069,795 | 1 | 7 | 1. A method for building a catalog using visual objects, comprising: clustering a plurality of records, each record comprises at least one object image associated with at least one textual field, to yield a plurality of clusters such that the object images in each cluster exhibit between them a visual similarity above a specified value; and labeling each cluster of the plurality of clusters with a label by applying a dictionary function to the textual fields of each cluster of the plurality of clusters; obtaining a representative image of each cluster of the plurality of clusters; selecting a category dictionary for each cluster of the plurality of clusters based on the textual fields of each cluster of the plurality of clusters; editing the label of each cluster of the plurality of clusters by omitting or adding words based on a respective selected category dictionary; and displaying a catalog wherein the label of each cluster of the plurality of clusters is presented in association with the representative image thereof, the catalog is displayed as part of a user interface at a user terminal; wherein the label reflects a common semantic factor of the textual fields of each cluster, wherein the common semantic factor has a value above a specified threshold, wherein the visual similarity provides a measure of resemblances between two visual objects based on local descriptors in the visual objects, wherein at least one of the clustering and the associating is executed by at least one processor. | 1. A method for building a catalog using visual objects, comprising: clustering a plurality of records, each record comprises at least one object image associated with at least one textual field, to yield a plurality of clusters such that the object images in each cluster exhibit between them a visual similarity above a specified value; and labeling each cluster of the plurality of clusters with a label by applying a dictionary function to the textual fields of each cluster of the plurality of clusters; obtaining a representative image of each cluster of the plurality of clusters; selecting a category dictionary for each cluster of the plurality of clusters based on the textual fields of each cluster of the plurality of clusters; editing the label of each cluster of the plurality of clusters by omitting or adding words based on a respective selected category dictionary; and displaying a catalog wherein the label of each cluster of the plurality of clusters is presented in association with the representative image thereof, the catalog is displayed as part of a user interface at a user terminal; wherein the label reflects a common semantic factor of the textual fields of each cluster, wherein the common semantic factor has a value above a specified threshold, wherein the visual similarity provides a measure of resemblances between two visual objects based on local descriptors in the visual objects, wherein at least one of the clustering and the associating is executed by at least one processor. 7. The method according to claim 1 , further comprising filtering out copyrighted records, wherein a copyrighted object image of a copyrighted record exhibits a visual similarity above a specified level with an object image ranked above a specified level of relevance retrieved by an image search engine applied to at least one textual field associated with the object image. | 0.5 |
9,077,933 | 1 | 6 | 1. A method comprising: tabulating for each program in a program guide an occurrence count corresponding to each term of a plurality of terms, the occurrence count indicating a number of times the respective term is associated with a corresponding program; computing, by utilizing instructions from memory that are executed by a processor of a computer, for each program in the program guide, a relevance ranking score by multiplying an average of occurrence counts associated with a corresponding program by how many times the corresponding program is listed in the program guide; selecting a list of programs from the program guide based on a respective relevance ranking score of each program; and outputting the list of programs. | 1. A method comprising: tabulating for each program in a program guide an occurrence count corresponding to each term of a plurality of terms, the occurrence count indicating a number of times the respective term is associated with a corresponding program; computing, by utilizing instructions from memory that are executed by a processor of a computer, for each program in the program guide, a relevance ranking score by multiplying an average of occurrence counts associated with a corresponding program by how many times the corresponding program is listed in the program guide; selecting a list of programs from the program guide based on a respective relevance ranking score of each program; and outputting the list of programs. 6. The method as defined in claim 1 , further comprising weighting the relevance ranking score based on a user profile. | 0.729545 |
6,016,494 | 1 | 4 | 1. A method of accessing electronic information, comprising the steps of: loading an original document onto a data processing system; selecting, at the data processing system, a link embedded in the original document, the link being associated with a linked document; and creating a new document by merging the linked document with the original document, in response to said selecting step. | 1. A method of accessing electronic information, comprising the steps of: loading an original document onto a data processing system; selecting, at the data processing system, a link embedded in the original document, the link being associated with a linked document; and creating a new document by merging the linked document with the original document, in response to said selecting step. 4. The method of claim 1 further comprising the step of displaying the new document at the data processing system. | 0.875 |
9,984,392 | 10 | 11 | 10. A computer program product stored on a computer-readable medium that includes instructions that, when loaded into memory, cause a processor to perform a method, the method comprising: accessing profiles for a plurality of users of the social networking system, each profile identifying a connection to each of a plurality of other users of the social networking system, the plurality of users comprising a viewing user; receiving a message from a third party system that is in a different domain than the social networking system, the message identifying the third party system and describing an action performed on a web page of the third party system by the viewing user; generating, by a computer of the social networking system, a confirmation message for display in a user interface to the viewing user on the third party system, the confirmation message providing an example of a story that could be provided to a plurality of connections of the viewing user, the story describing the action performed on the third party system by the viewing user; sending, by the computer of the social networking system to the third party system, the generated confirmation message for display in the user interface within a nested iframe on the web page of the third party system, the nested iframe being within a domain of the social networking system and allowing communication from the social networking system to the user on the web page of the third party system without sharing personal information that the social networking system has for the viewing user; receiving an indication of whether the viewing user opts in or opts out of allowing the story describing the action performed on the third party system by the viewing user to be provided to the plurality of connections based on the user having selected an opt in or opt out feature in the nested iframe on the user interface; based on the viewing user opting in to allowing the story to be provided to the plurality of connections, generating a plurality of news feeds each including the story describing the action in addition to a plurality of other stories describing other actions taken by other users of the social networking system; and providing for display to each of the plurality of connections a user interface including the generated news feed for the connection, wherein different connections receive different sets of other stories in the news feed. | 10. A computer program product stored on a computer-readable medium that includes instructions that, when loaded into memory, cause a processor to perform a method, the method comprising: accessing profiles for a plurality of users of the social networking system, each profile identifying a connection to each of a plurality of other users of the social networking system, the plurality of users comprising a viewing user; receiving a message from a third party system that is in a different domain than the social networking system, the message identifying the third party system and describing an action performed on a web page of the third party system by the viewing user; generating, by a computer of the social networking system, a confirmation message for display in a user interface to the viewing user on the third party system, the confirmation message providing an example of a story that could be provided to a plurality of connections of the viewing user, the story describing the action performed on the third party system by the viewing user; sending, by the computer of the social networking system to the third party system, the generated confirmation message for display in the user interface within a nested iframe on the web page of the third party system, the nested iframe being within a domain of the social networking system and allowing communication from the social networking system to the user on the web page of the third party system without sharing personal information that the social networking system has for the viewing user; receiving an indication of whether the viewing user opts in or opts out of allowing the story describing the action performed on the third party system by the viewing user to be provided to the plurality of connections based on the user having selected an opt in or opt out feature in the nested iframe on the user interface; based on the viewing user opting in to allowing the story to be provided to the plurality of connections, generating a plurality of news feeds each including the story describing the action in addition to a plurality of other stories describing other actions taken by other users of the social networking system; and providing for display to each of the plurality of connections a user interface including the generated news feed for the connection, wherein different connections receive different sets of other stories in the news feed. 11. The computer program product of claim 10 , wherein the story comprises a social advertisement for display to the connections of the viewing user based on the action taken by the viewing user on the third party system. | 0.705333 |
9,363,634 | 11 | 14 | 11. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving a user context of a user, wherein the user context specifies a location of a user device being used by the user; obtaining user activity data organized into sessions, each session being data representing a plurality of user activities performed by a distinct user during a respective time period, the sessions including sessions for multiple users; obtaining matching sessions for the received user context, each matching session being a distinct session that includes data representing activities performed by respective users having a user context matching the received user context during a time period represented by the matching session; obtaining general sessions, each general session including data representing activities performed by respective users during a time period represented by the general session; determining, from the obtained matching sessions and the obtained general sessions, one or more context-relevant activities that occur in the matching sessions more frequently than the one or more context-relevant activities occur in the general sessions, the one or more context-relevant activities being activities performed by users matching the received user context more frequently than by users in general; and providing information related to the one or more context-relevant activities in response to receiving the user context. | 11. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving a user context of a user, wherein the user context specifies a location of a user device being used by the user; obtaining user activity data organized into sessions, each session being data representing a plurality of user activities performed by a distinct user during a respective time period, the sessions including sessions for multiple users; obtaining matching sessions for the received user context, each matching session being a distinct session that includes data representing activities performed by respective users having a user context matching the received user context during a time period represented by the matching session; obtaining general sessions, each general session including data representing activities performed by respective users during a time period represented by the general session; determining, from the obtained matching sessions and the obtained general sessions, one or more context-relevant activities that occur in the matching sessions more frequently than the one or more context-relevant activities occur in the general sessions, the one or more context-relevant activities being activities performed by users matching the received user context more frequently than by users in general; and providing information related to the one or more context-relevant activities in response to receiving the user context. 14. The system of claim 11 , wherein the context-relevant activities comprise users making a purchase at a particular business, and wherein providing information related to the one or more context-relevant activities comprises providing information about the particular business. | 0.700644 |
9,747,369 | 9 | 12 | 9. The method of claim 8 , wherein the call information further includes a voiceprint of the telephone conversation, and wherein the one or more processors is configured to index the call information based on at least one stress feature identified in the voiceprint. | 9. The method of claim 8 , wherein the call information further includes a voiceprint of the telephone conversation, and wherein the one or more processors is configured to index the call information based on at least one stress feature identified in the voiceprint. 12. The method of claim 9 , further comprising determining the at least one stress feature for only telephone conversations having a frequency of identified keywords above a predetermined threshold. | 0.608696 |
9,336,017 | 11 | 16 | 11. A non-transitory computer-readable medium storing instructions, which when executed by a processing device, cause the processing device to perform method comprising: receiving, within a datacenter management user interface, an action request to perform an action; determining, in response to receiving the action request, a first suggested object compatible with the action request, wherein the first suggested object is a datacenter or a component within the datacenter, wherein the component may be physical or virtual, and wherein the first suggested object is not displayed as a directly selectable option within the datacenter management user interface when the action request is received; and providing, in response to determining the first suggested object compatible with the action request, a first command suggestion within the datacenter management user interface, wherein the first command suggestion comprises the first suggested object. | 11. A non-transitory computer-readable medium storing instructions, which when executed by a processing device, cause the processing device to perform method comprising: receiving, within a datacenter management user interface, an action request to perform an action; determining, in response to receiving the action request, a first suggested object compatible with the action request, wherein the first suggested object is a datacenter or a component within the datacenter, wherein the component may be physical or virtual, and wherein the first suggested object is not displayed as a directly selectable option within the datacenter management user interface when the action request is received; and providing, in response to determining the first suggested object compatible with the action request, a first command suggestion within the datacenter management user interface, wherein the first command suggestion comprises the first suggested object. 16. The medium of claim 11 , the method further comprising: providing a second suggested object within the datacenter management user interface, wherein the second suggested object is compatible with one or more of the first suggested object, and the action request. | 0.650919 |
9,378,423 | 7 | 10 | 7. A method, comprising: identifying a set of entities in video content; for a portion of the video content, identifying first confidence values that are representative of features of the portion and that are a result of a video recognition process, one confidence value of the first confidence values defining a probability that a face of an entity from the set of entities is present; for the portion, identifying second confidence values that are representative of features of the portion and that are a result of an audio recognition process, one confidence value of the second confidence values defining a probability that a category of phone is being uttered by the entity; and based on the first confidence values and the second confidence values, determining, by a computing device, at least one identifier that defines whether the entity is present in the portion. | 7. A method, comprising: identifying a set of entities in video content; for a portion of the video content, identifying first confidence values that are representative of features of the portion and that are a result of a video recognition process, one confidence value of the first confidence values defining a probability that a face of an entity from the set of entities is present; for the portion, identifying second confidence values that are representative of features of the portion and that are a result of an audio recognition process, one confidence value of the second confidence values defining a probability that a category of phone is being uttered by the entity; and based on the first confidence values and the second confidence values, determining, by a computing device, at least one identifier that defines whether the entity is present in the portion. 10. The method of claim 7 , wherein the video recognition process comprises a face recognition process, and wherein the audio recognition process comprises a voice recognition process. | 0.859542 |
8,229,864 | 1 | 7 | 1. A computer-implemented method, the method comprising: obtaining a plurality of scripts each having been received from a different client wherein each script contains a reference to one or more interactive fields of a graphical user interface presented on the client, and wherein the script also contains a reference to a distinct predictive model; executing each script by a script engine wherein executing the script causes data of the interactive fields referenced by the script to be provided as input to the respective predictive model referenced by the script, and wherein at least two of the scripts are executed in parallel on different sets of one or more computing devices of a plurality of computing devices; processing each provided input data by the respective predictive model wherein the processing includes providing output of the respective predictive model to the script engine from which the input data was provided, and wherein each respective predictive model executes on a different set of one or more computing devices of the plurality of computing devices; and wherein executing each script includes providing the output of each respective predictive model to the respective client for presenting in the graphical user interface of the respective client. | 1. A computer-implemented method, the method comprising: obtaining a plurality of scripts each having been received from a different client wherein each script contains a reference to one or more interactive fields of a graphical user interface presented on the client, and wherein the script also contains a reference to a distinct predictive model; executing each script by a script engine wherein executing the script causes data of the interactive fields referenced by the script to be provided as input to the respective predictive model referenced by the script, and wherein at least two of the scripts are executed in parallel on different sets of one or more computing devices of a plurality of computing devices; processing each provided input data by the respective predictive model wherein the processing includes providing output of the respective predictive model to the script engine from which the input data was provided, and wherein each respective predictive model executes on a different set of one or more computing devices of the plurality of computing devices; and wherein executing each script includes providing the output of each respective predictive model to the respective client for presenting in the graphical user interface of the respective client. 7. The method of claim 1 wherein the graphical user interface presented on the client is for a spreadsheet application, a word processor application, or an email application. | 0.5 |
8,452,793 | 20 | 32 | 20. A computer readable storage medium comprising one or more sequences of instructions, which when executed by one or more processors cause: presenting, at a local client machine, a first webpage that includes a first plurality of search results based on a user-provided search criteria, wherein a copy of the first webpage is locally cached; receiving a first user selection of a search result of the first plurality of search results included on the first webpage, wherein selection of the search result causes a document corresponding to the first user selection to be displayed; modifying, at the local client machine, the locally cached copy of the first webpage to include metadata associated with the first user selection of the search result; in response to receiving a request to re-display the first-webpage: inspecting the locally cached copy of the first webpage for any metadata, added to the locally cached copy subsequent to presenting the first webpage, associated with user interaction on the first web page; detecting that the locally cached copy of the first webpage has been modified to include the metadata associated with the first user selection of the search result; in response to the detecting step, obtaining content based on the metadata; responding to the request to re-display the first webpage by displaying a modified search results webpage, wherein the modified search results webpage has been changed relative to the first web page based, at least in part, on the content that was obtained based on the metadata. | 20. A computer readable storage medium comprising one or more sequences of instructions, which when executed by one or more processors cause: presenting, at a local client machine, a first webpage that includes a first plurality of search results based on a user-provided search criteria, wherein a copy of the first webpage is locally cached; receiving a first user selection of a search result of the first plurality of search results included on the first webpage, wherein selection of the search result causes a document corresponding to the first user selection to be displayed; modifying, at the local client machine, the locally cached copy of the first webpage to include metadata associated with the first user selection of the search result; in response to receiving a request to re-display the first-webpage: inspecting the locally cached copy of the first webpage for any metadata, added to the locally cached copy subsequent to presenting the first webpage, associated with user interaction on the first web page; detecting that the locally cached copy of the first webpage has been modified to include the metadata associated with the first user selection of the search result; in response to the detecting step, obtaining content based on the metadata; responding to the request to re-display the first webpage by displaying a modified search results webpage, wherein the modified search results webpage has been changed relative to the first web page based, at least in part, on the content that was obtained based on the metadata. 32. The computer readable storage medium of claim 20 , wherein the metadata is included in a field, of the locally cached copy of the first web page, configured for storage of information related to user interaction on the first web page. | 0.888263 |
9,710,543 | 1 | 14 | 1. A computer-implemented method of indexing a plurality of responses for later providing to users in response to queries, said method comprising: storing said plurality of responses; for each of said responses, storing a plurality of representative queries in association with that response, each of said representative queries representing a possible query for searching for information addressed by that response; processing each of said representative queries to determine, for each representative query, corresponding substitute expressions for particular substitutable terms in that representative query from a plurality of substitute expressions, wherein a substitute expression is chosen for a particular one of said substitutable terms by calculating at least one first substitutability metric for that one of said substitutable terms and that substitute expression based on a measure of times that substitutable term was not substituted by that substitute expression in already processed ones of said representative queries and a measure of times that substitutable term was substituted by that substitute expression in already processed ones of said representative queries, at least one of said substitutions of that substitutable term by a substitute expression in one of said already processed ones of said representative queries having been received as input from an operator; selectively modifying said representative queries by substituting substitutable terms of said representative queries by corresponding substitute expressions having a suitable first substitutability metric; for each of said plurality of responses: forming a Boolean expression from those representative queries, as selectively modified, of said plurality of representative queries associated with that response, said Boolean expression satisfied by each of those representative queries; and storing said Boolean expression in association with that response for later applying to each of said queries, and that response to be provided to said user in response of those of said queries satisfying said Boolean expression. | 1. A computer-implemented method of indexing a plurality of responses for later providing to users in response to queries, said method comprising: storing said plurality of responses; for each of said responses, storing a plurality of representative queries in association with that response, each of said representative queries representing a possible query for searching for information addressed by that response; processing each of said representative queries to determine, for each representative query, corresponding substitute expressions for particular substitutable terms in that representative query from a plurality of substitute expressions, wherein a substitute expression is chosen for a particular one of said substitutable terms by calculating at least one first substitutability metric for that one of said substitutable terms and that substitute expression based on a measure of times that substitutable term was not substituted by that substitute expression in already processed ones of said representative queries and a measure of times that substitutable term was substituted by that substitute expression in already processed ones of said representative queries, at least one of said substitutions of that substitutable term by a substitute expression in one of said already processed ones of said representative queries having been received as input from an operator; selectively modifying said representative queries by substituting substitutable terms of said representative queries by corresponding substitute expressions having a suitable first substitutability metric; for each of said plurality of responses: forming a Boolean expression from those representative queries, as selectively modified, of said plurality of representative queries associated with that response, said Boolean expression satisfied by each of those representative queries; and storing said Boolean expression in association with that response for later applying to each of said queries, and that response to be provided to said user in response of those of said queries satisfying said Boolean expression. 14. The method of claim 1 , wherein said selectively modifying comprises presenting each of said corresponding substitute expressions to an operator for confirmation, and modifying each representative query in response to receiving confirmation. | 0.664384 |
8,731,905 | 9 | 10 | 9. A method of reading a document to a user, the method being performed by a computer processor, the method comprising the steps of: (a) parsing, by the computer processor, the document into a sequence of phrasal segments using the method of claim 8 and identifying one segment as a current segment; (b) instructing, by the computer processor, a text-to-speech engine to read the current segment aloud to the user; (c) pausing, by the computer processor, for a pre-determined duration after the current segment has been read, the duration being the inter-segment pause duration; (d) setting, by the computer processor, the current segment to be the next segment in the sequence; and (e) repeating steps (b), (c), and (d) until all segments have been read or until the user instructs the processor to stop. | 9. A method of reading a document to a user, the method being performed by a computer processor, the method comprising the steps of: (a) parsing, by the computer processor, the document into a sequence of phrasal segments using the method of claim 8 and identifying one segment as a current segment; (b) instructing, by the computer processor, a text-to-speech engine to read the current segment aloud to the user; (c) pausing, by the computer processor, for a pre-determined duration after the current segment has been read, the duration being the inter-segment pause duration; (d) setting, by the computer processor, the current segment to be the next segment in the sequence; and (e) repeating steps (b), (c), and (d) until all segments have been read or until the user instructs the processor to stop. 10. The method of claim 9 , wherein the inter-segment pause duration is discernibly longer than the average pause duration between words. | 0.540268 |
8,185,376 | 1 | 2 | 1. A method for determining a language of origin of a word comprising analyzing non-uniform letter sequence portions of the word, wherein analyzing comprises: using one or more processors of a computing system, segmenting the word into strings of letter chunks based on different criteria, the letter chunks being of non-uniform length of one or more letters; using one or more processors of a computing system, ascertaining a probability of the word belonging to a selected language by using a plurality of N-gram models based directly on the letter chunks segmented with the different criteria for each of a plurality of different languages, and providing results from using the plurality of N-gram models based directly on letter chunks extracted with the different criteria to a combined classifier that merges the results from the plurality of N-gram models to provide a hypothesis of the language of origin, wherein the combined classifier comprises a plurality of Gaussian mixture models wherein scores from multiple letter chunks models are treated as an eigenvector of a word and a Gaussian mixture model is provided for each of the plurality of different languages, and wherein the results from the plurality of N-gram models are scored by each of the Gaussian mixture models; and outputting the hypothesis of the language of origin of the word provided by the combined classifier. | 1. A method for determining a language of origin of a word comprising analyzing non-uniform letter sequence portions of the word, wherein analyzing comprises: using one or more processors of a computing system, segmenting the word into strings of letter chunks based on different criteria, the letter chunks being of non-uniform length of one or more letters; using one or more processors of a computing system, ascertaining a probability of the word belonging to a selected language by using a plurality of N-gram models based directly on the letter chunks segmented with the different criteria for each of a plurality of different languages, and providing results from using the plurality of N-gram models based directly on letter chunks extracted with the different criteria to a combined classifier that merges the results from the plurality of N-gram models to provide a hypothesis of the language of origin, wherein the combined classifier comprises a plurality of Gaussian mixture models wherein scores from multiple letter chunks models are treated as an eigenvector of a word and a Gaussian mixture model is provided for each of the plurality of different languages, and wherein the results from the plurality of N-gram models are scored by each of the Gaussian mixture models; and outputting the hypothesis of the language of origin of the word provided by the combined classifier. 2. The method of claim 1 wherein the step of ascertaining includes using an N-gram model based on syllable-based letter chunk. | 0.844828 |
7,570,382 | 13 | 15 | 13. A computer-implemented method for detecting errors in electronic document transfers comprising the steps of: receiving setup data representative of a user-selected automated electronic document transfer scheme; testing the setup data against error data representative of selected error conditions associated with document, wherein the setup data includes forwarding data representative of instructions to automatically forward electronic documents to at least one selected destination; generating graph data representative of interrelationships between selected destinations as specified in the forwarding data; and upon a positive determination of an error condition, generating an error signal in accordance with a positive determination of an error condition. | 13. A computer-implemented method for detecting errors in electronic document transfers comprising the steps of: receiving setup data representative of a user-selected automated electronic document transfer scheme; testing the setup data against error data representative of selected error conditions associated with document, wherein the setup data includes forwarding data representative of instructions to automatically forward electronic documents to at least one selected destination; generating graph data representative of interrelationships between selected destinations as specified in the forwarding data; and upon a positive determination of an error condition, generating an error signal in accordance with a positive determination of an error condition. 15. The method for detecting errors in electronic document transfers of claim 13 wherein the error data includes loop data representative of bidirectional forwarding of electronic documents between at least two destinations. | 0.629139 |
9,298,871 | 18 | 19 | 18. The system of claim 17 , the programmable code including the instructions which, when executed by the processor, further cause the processor to check interactions with a layout application for the first parameterized cell layout and the second parameterized cell layout. | 18. The system of claim 17 , the programmable code including the instructions which, when executed by the processor, further cause the processor to check interactions with a layout application for the first parameterized cell layout and the second parameterized cell layout. 19. The system of claim 18 , the programmable code including the instructions which, when executed by the processor, further cause the processor to check the interactions with respect to data above a geometric layer. | 0.5 |
7,688,967 | 8 | 9 | 8. A telephone which includes: a determination component to determine, in response to receiving an electronic message in the form of an electronic mail message, at least one telephone number from the electronic message associated with the telephone, by parsing a body of the electronic message, and to determine at least one other telephone number from a header of the electronic message by comparing an electronic mail address in an address field of the electronic message with a directory to determine a telephone number associated with the address; and an assignment component operable to assign the at least one telephone number determined from the body of the electronic message and the at least one other telephone number determined from the header of the electronic message dynamically to respective buttons on a telephone, to provide respective speed dial buttons on the telephone. | 8. A telephone which includes: a determination component to determine, in response to receiving an electronic message in the form of an electronic mail message, at least one telephone number from the electronic message associated with the telephone, by parsing a body of the electronic message, and to determine at least one other telephone number from a header of the electronic message by comparing an electronic mail address in an address field of the electronic message with a directory to determine a telephone number associated with the address; and an assignment component operable to assign the at least one telephone number determined from the body of the electronic message and the at least one other telephone number determined from the header of the electronic message dynamically to respective buttons on a telephone, to provide respective speed dial buttons on the telephone. 9. A telephone as claimed in claim 8 , in which the determination component is operable to parse text in a body of the electronic mail message to determine the at least one telephone number, if present, which has been included in text in the body of the electronic message. | 0.5 |
8,521,505 | 10 | 14 | 10. A computer program product for string pattern conceptualization, particularly for a pattern of words, comprising: a computer readable storage device having computer readable program code embodied therewith, where the computer readable program code when executed on a computer causes the computer to: set a reference string set comprising a plurality of strings; find, inside the reference string set comprising the plurality of strings, at least two specific tuples of substring triples that each comprise a prefix substring, a middle substring, and a suffix substring; and consider each tuple as a candidate for representing a related concept; where: each concatenation of the substring triples is an explicit member of the reference string set; each middle substring of the substring triples is unequal to another middle substring within the substring triples found inside the reference string set; each prefix substring of the substring triples is equal to all other prefix substrings within the substring triples found inside the reference string set; each suffix substring of the substring triples is equal to all other suffix substrings within the substring triples found inside the reference string set; and either the prefix substring of the substring triples or the suffix substring of the substring triples is not empty. | 10. A computer program product for string pattern conceptualization, particularly for a pattern of words, comprising: a computer readable storage device having computer readable program code embodied therewith, where the computer readable program code when executed on a computer causes the computer to: set a reference string set comprising a plurality of strings; find, inside the reference string set comprising the plurality of strings, at least two specific tuples of substring triples that each comprise a prefix substring, a middle substring, and a suffix substring; and consider each tuple as a candidate for representing a related concept; where: each concatenation of the substring triples is an explicit member of the reference string set; each middle substring of the substring triples is unequal to another middle substring within the substring triples found inside the reference string set; each prefix substring of the substring triples is equal to all other prefix substrings within the substring triples found inside the reference string set; each suffix substring of the substring triples is equal to all other suffix substrings within the substring triples found inside the reference string set; and either the prefix substring of the substring triples or the suffix substring of the substring triples is not empty. 14. The computer program product of claim 10 , where the computer readable program code when executed on the computer further causes the computer to compare at least two occurrence counts if at least one of two or more of the middle substrings and two or more concatenations of the prefix substrings and the middle substrings are explicit members of the reference string set. | 0.5 |
7,908,125 | 1 | 8 | 1. A computer-readable storage medium having computer-readable program instructions embedded therein for directing operation of a computer system, wherein the computer-readable program instructions, when executed by a processor on the computer system, enable the computing system implement a data processing system, that comprises: a model service system receiving, as an input, an object model description, indicative of a first object model that represents business data, and generating a dimensional model based on the input; an entity generator generating a second object model based on the dimensional model, the second object model representing business data represented by the dimensional model; a navigation service identifying a data navigation path from relationships between individual sets of data that comprise the business data, and outputting the data navigation path for navigation by a user from a first data set to a related second data set wherein the navigation service comprises: a plurality of navigation providers each associated with a specific type of navigation; a navigation service layer transmitting a navigation service request to one or more of the navigation providers that are registered with the navigation service layer; and a metadata service providing the plurality of navigation providers with access to a metadata store, each navigation provider responding to a received data navigation request by interacting with the metadata service to identify at least one data navigation path and returning the at least one identified data navigation path to the navigation service layer for output to the user; and a computer processor being a functional component of the data processing system and activated by the model service system, the entity generator and the navigation service to facilitate receiving the object model, generating the second object model and identifying the navigation path. | 1. A computer-readable storage medium having computer-readable program instructions embedded therein for directing operation of a computer system, wherein the computer-readable program instructions, when executed by a processor on the computer system, enable the computing system implement a data processing system, that comprises: a model service system receiving, as an input, an object model description, indicative of a first object model that represents business data, and generating a dimensional model based on the input; an entity generator generating a second object model based on the dimensional model, the second object model representing business data represented by the dimensional model; a navigation service identifying a data navigation path from relationships between individual sets of data that comprise the business data, and outputting the data navigation path for navigation by a user from a first data set to a related second data set wherein the navigation service comprises: a plurality of navigation providers each associated with a specific type of navigation; a navigation service layer transmitting a navigation service request to one or more of the navigation providers that are registered with the navigation service layer; and a metadata service providing the plurality of navigation providers with access to a metadata store, each navigation provider responding to a received data navigation request by interacting with the metadata service to identify at least one data navigation path and returning the at least one identified data navigation path to the navigation service layer for output to the user; and a computer processor being a functional component of the data processing system and activated by the model service system, the entity generator and the navigation service to facilitate receiving the object model, generating the second object model and identifying the navigation path. 8. The computer-readable storage medium of claim 1 wherein at least one of the plurality of navigation providers is associated with navigation from aggregated data to related transaction data. | 0.830389 |
9,842,100 | 14 | 15 | 14. The computer implemented method of claim 13 , wherein parsing the text maps case frame records to event frames, the parsing ignores the Do type and the TRANSFORMATION type. | 14. The computer implemented method of claim 13 , wherein parsing the text maps case frame records to event frames, the parsing ignores the Do type and the TRANSFORMATION type. 15. The computer implemented method of claim 14 , wherein the function classification data table includes the DO function type, the TRANSFORMATION type, the TRANSFER type, and the TRANSACTION type, each function type having a different event frame type. | 0.5 |
9,460,155 | 13 | 14 | 13. A computerized system comprising: a processor configured to execute instruction; a memory containing instructions when executed on the processor, causes the processor to perform operations that: receive a user utterance with a context manager; communicate, with the context manager, a user text an context identifier to an extraction engine, wherein the user text is obtained from the user utterance; create, with the context manager, a context object associated with the user utterance; extract topics and attributes from the user text with the extraction engine, wherein the extraction engine assigns a probability to each extracted attribute based on a number of occurrences of the attribute, wherein the extraction engine calculates a confidence value to the attribute, wherein the confidence value is defined as f ( I ( v i ) ) = 1 log 2 ( I ( v i ) + I ) ∑ v ∈ I ( v i ) α ( v ) C ( v ) ; communicate the topics and attributes to the context manager; update, with the context manager, the context object context manager with topics and attributes; communicate the context object to a semantic engine; update the context object, with the semantic engine, based on at least one of an inference rule or a semantic model; communicate the context object to a discourse manager; use discourse states, and dialogs to determine a system utterance for the user, wherein a system utterance comprises an automatically generated response generated with at least one processor; generate a query plan; send the updated context object and user intent to execution engine; query a database for additional information relevant to the system utterance; convert the additional information from to additional sentence in a user-readable natural language state; add additional sentences to the system utterance; and communicate the system utterance to at least one of a user device or a user application. | 13. A computerized system comprising: a processor configured to execute instruction; a memory containing instructions when executed on the processor, causes the processor to perform operations that: receive a user utterance with a context manager; communicate, with the context manager, a user text an context identifier to an extraction engine, wherein the user text is obtained from the user utterance; create, with the context manager, a context object associated with the user utterance; extract topics and attributes from the user text with the extraction engine, wherein the extraction engine assigns a probability to each extracted attribute based on a number of occurrences of the attribute, wherein the extraction engine calculates a confidence value to the attribute, wherein the confidence value is defined as f ( I ( v i ) ) = 1 log 2 ( I ( v i ) + I ) ∑ v ∈ I ( v i ) α ( v ) C ( v ) ; communicate the topics and attributes to the context manager; update, with the context manager, the context object context manager with topics and attributes; communicate the context object to a semantic engine; update the context object, with the semantic engine, based on at least one of an inference rule or a semantic model; communicate the context object to a discourse manager; use discourse states, and dialogs to determine a system utterance for the user, wherein a system utterance comprises an automatically generated response generated with at least one processor; generate a query plan; send the updated context object and user intent to execution engine; query a database for additional information relevant to the system utterance; convert the additional information from to additional sentence in a user-readable natural language state; add additional sentences to the system utterance; and communicate the system utterance to at least one of a user device or a user application. 14. A computerized system of claim 13 , wherein C(v) comprises a confidence in the information-extraction rule that extracted the attribute-value pair from the user utterance, wherein a(v) comprises an indicator function for whether a particular value occurred within a negated context, and wherein I(vi) comprises a collection of occurrences of a value extracted from the user utterance. | 0.5 |
9,483,240 | 5 | 6 | 5. The method of claim 4 , wherein the additional source code is further generated for evaluating, based on the flag, each of the one or more dependencies between each of the plurality of data biding expressions. | 5. The method of claim 4 , wherein the additional source code is further generated for evaluating, based on the flag, each of the one or more dependencies between each of the plurality of data biding expressions. 6. The method of claim 5 , wherein the additional source code is further generated for updating the at least one data binding from the plurality of data binding expressions in response to evaluating each of the one or more dependencies between each of the plurality of data biding expressions based on the flag. | 0.706604 |
9,311,077 | 15 | 19 | 15. A computer system for identifying code changes, the computer system comprising: one or more computer processors; one or more computer-readable storage medium, wherein the one or more computer-readable storage medium are not transitory signals; program instructions stored on the computer readable storage medium for execution by at least one of the one or more processors, the program instructions comprising: program instructions to retrieve a first changeset that is associated with a program based, at least in part, on a search parameter that includes a range of time and a first area of interest that indicates a first portion of a source code of the program; program instructions to identify a first set of changes included in the first changeset based on a time stamp of a change, wherein a time of the time stamp is included within the range of time, and wherein first set of changes includes a change to a region of the source code that is included in the first area of interest, the computer determining whether the change included in the first set of changes is a textual change or a syntactical change to the region of the source code, based on textual matching, and syntactical matching, wherein syntactical matching includes a comparison of a first valid syntax of the first set of changes to a second valid syntax of the region of the source code of the program that corresponds to the first set of changes, and wherein the comparison reveals that a syntax of the source code of the program was changed by the first set of changes from second valid syntax to the first valid syntax; program instructions to generate a second area of interest that includes a second portion of the source code of the program by updating the first area of interest based, at least in part, on i) the change being a textual change or a syntactical change and ii) an inverse of an operation included in the change, such that the second area of interest includes a third portion of source code that is not indicated by the first area of interest; program instructions to search for a second set of changes based, at least in part, on the second area of interest; program instructions to identify a possible source of an error based, at least in part, on a result of an analysis of a syntax of the second set of changes; and program instructions to generate a result that includes, at least in part, the second set of changes and an indication of the possible source of the error. | 15. A computer system for identifying code changes, the computer system comprising: one or more computer processors; one or more computer-readable storage medium, wherein the one or more computer-readable storage medium are not transitory signals; program instructions stored on the computer readable storage medium for execution by at least one of the one or more processors, the program instructions comprising: program instructions to retrieve a first changeset that is associated with a program based, at least in part, on a search parameter that includes a range of time and a first area of interest that indicates a first portion of a source code of the program; program instructions to identify a first set of changes included in the first changeset based on a time stamp of a change, wherein a time of the time stamp is included within the range of time, and wherein first set of changes includes a change to a region of the source code that is included in the first area of interest, the computer determining whether the change included in the first set of changes is a textual change or a syntactical change to the region of the source code, based on textual matching, and syntactical matching, wherein syntactical matching includes a comparison of a first valid syntax of the first set of changes to a second valid syntax of the region of the source code of the program that corresponds to the first set of changes, and wherein the comparison reveals that a syntax of the source code of the program was changed by the first set of changes from second valid syntax to the first valid syntax; program instructions to generate a second area of interest that includes a second portion of the source code of the program by updating the first area of interest based, at least in part, on i) the change being a textual change or a syntactical change and ii) an inverse of an operation included in the change, such that the second area of interest includes a third portion of source code that is not indicated by the first area of interest; program instructions to search for a second set of changes based, at least in part, on the second area of interest; program instructions to identify a possible source of an error based, at least in part, on a result of an analysis of a syntax of the second set of changes; and program instructions to generate a result that includes, at least in part, the second set of changes and an indication of the possible source of the error. 19. The computer system of claim 15 , further comprising: program instructions to retrieve the second set of changes, wherein the changes included in the second set of changes are selected based one or more of a time stamp of a change, textual matching, and syntactical matching; and program instructions to generate a result that includes, at least in part, the first set of changes and the second set of changes. | 0.681048 |
8,615,708 | 10 | 12 | 10. One or more non-transitory computer-readable storage media storing instructions that, when executed by one or more computing devices, causes the one or more computing devices to perform a method comprising: parsing a meta-language style sheet comprising at least one meta-language style sheet variable declaration and at least one meta-language style sheet rule definition referencing the at least one meta-language style sheet variable; generating, based on the parsing, an intermediate representation of the meta-language style sheet variable declaration and an intermediate representation of the meta-language style sheet rule definition; generating executable code based at least on both the intermediate representation of the meta-language style sheet variable declaration and the intermediate representation of the meta-language style sheet rule definition; executing the executable code to produce a web browser style sheet; and updating display of a web page using the web browser style sheet. | 10. One or more non-transitory computer-readable storage media storing instructions that, when executed by one or more computing devices, causes the one or more computing devices to perform a method comprising: parsing a meta-language style sheet comprising at least one meta-language style sheet variable declaration and at least one meta-language style sheet rule definition referencing the at least one meta-language style sheet variable; generating, based on the parsing, an intermediate representation of the meta-language style sheet variable declaration and an intermediate representation of the meta-language style sheet rule definition; generating executable code based at least on both the intermediate representation of the meta-language style sheet variable declaration and the intermediate representation of the meta-language style sheet rule definition; executing the executable code to produce a web browser style sheet; and updating display of a web page using the web browser style sheet. 12. The one or more non-transitory storage media of claim 10 , wherein the meta-language style sheet rule comprises at least one selector and at least one style sheet rule declaration, the style sheet rule declaration comprising a style sheet property and a reference to the meta-language style sheet variable. | 0.675052 |
4,185,830 | 1 | 3 | 1. A puzzle to be solved to form a predetermined intelligible collocation of language symbols, said puzzle comprising: a puzzle base, said puzzle base having at least one row of language symbols at fixed locations in each row, said symbols being adapted to be read seriatim from one end to the other of each said row, said base further having a plurality of template outlines of various planar shapes and sizes, said template outlines located in fixed positions among the language symbols on said puzzle base and a plurality of movable elements, various ones of said movable elements corresponding in shape and size to various ones of said tamplate outlines and adapted to be superimposed in registry thereon, at least one of said movable elements further having at least one language symbol display area presenting a language symbol therein, each said language symbol area of all said movable elements being indentical in size and shape whereby, when all of said movable elements are arranged in predetermined locations upon said puzzle base and properly superimposed in registry on said template outlines of the same shape and size, the language symbols in said language symbol display areas on said movable elements cooperate with the language symbols on said puzzle base to form said predetermined intelligible collocation of language symbols when read seriatim from one end to the other of each said row. | 1. A puzzle to be solved to form a predetermined intelligible collocation of language symbols, said puzzle comprising: a puzzle base, said puzzle base having at least one row of language symbols at fixed locations in each row, said symbols being adapted to be read seriatim from one end to the other of each said row, said base further having a plurality of template outlines of various planar shapes and sizes, said template outlines located in fixed positions among the language symbols on said puzzle base and a plurality of movable elements, various ones of said movable elements corresponding in shape and size to various ones of said tamplate outlines and adapted to be superimposed in registry thereon, at least one of said movable elements further having at least one language symbol display area presenting a language symbol therein, each said language symbol area of all said movable elements being indentical in size and shape whereby, when all of said movable elements are arranged in predetermined locations upon said puzzle base and properly superimposed in registry on said template outlines of the same shape and size, the language symbols in said language symbol display areas on said movable elements cooperate with the language symbols on said puzzle base to form said predetermined intelligible collocation of language symbols when read seriatim from one end to the other of each said row. 3. The puzzle in accordance with claim 1 in which at least one of said template outlines extends into at least two adjacent rows. | 0.768817 |
8,549,485 | 7 | 12 | 7. A non-transitory computer readable storage medium that provides instructions, which when executed on a processing system cause the processing system to perform operations comprising: defining a first class, the first class being a concise expression class that comprises one or more objects; including the concise expression class in a second class that comprises one or more objects of the second class; executing an expression in a software application to evaluate an object of the second class to determine whether data associated with the object of the second class exists; returning results of the execution of the expression when data associated with the object of the second class exists within the software application; and returning an instance of an object of the concise expression class when data associated with the object of the second class does not exist within the software application, wherein when the concise expression class comprises an attribute of the object of the second class, an attribute of the returned instance of the object of the concise expression class corresponds to the attribute of the object of the second class. | 7. A non-transitory computer readable storage medium that provides instructions, which when executed on a processing system cause the processing system to perform operations comprising: defining a first class, the first class being a concise expression class that comprises one or more objects; including the concise expression class in a second class that comprises one or more objects of the second class; executing an expression in a software application to evaluate an object of the second class to determine whether data associated with the object of the second class exists; returning results of the execution of the expression when data associated with the object of the second class exists within the software application; and returning an instance of an object of the concise expression class when data associated with the object of the second class does not exist within the software application, wherein when the concise expression class comprises an attribute of the object of the second class, an attribute of the returned instance of the object of the concise expression class corresponds to the attribute of the object of the second class. 12. The non-transitory computer readable storage medium of claim 7 , wherein execution of the expression to evaluate the object of the second class comprises accessing data in an object outside of the second class. | 0.612319 |
8,819,024 | 9 | 12 | 9. A non-transitory computer-readable storage medium having executable computer program instructions embodied therein for determining category classifiers applicable to digital media items of a digital media repository, actions of the computer program instructions comprising: accessing a category-instance repository comprising relationships between categories and instances of categories, the category-instance repository derived from a corpus of documents comprising textual portions, the derivation comprising computing strengths for relationships between categories and instances based at least in part on frequencies of co-occurrence of the categories and instances over the corpus of documents; accessing a set of media item concept classifiers derived from the media items and associated with concepts derived from textual metadata of the digital media items in the digital media repository; computing consistency scores for a plurality of the categories based at least in part on scores obtained from media item concept classifiers associated with concepts corresponding to the instances of the plurality of categories; selectively removing the categories of the category-instance repository based at least in part whether the computed consistency scores indicate a threshold level of inconsistency; and determining, for each category of a plurality of the categories not removed, a category classifier based at least in part on the media item concept classifiers of concepts associated with the category, the determined category classifier when applied to a media item producing a score indicating whether the media item represents the category for which the category classifier was determined. | 9. A non-transitory computer-readable storage medium having executable computer program instructions embodied therein for determining category classifiers applicable to digital media items of a digital media repository, actions of the computer program instructions comprising: accessing a category-instance repository comprising relationships between categories and instances of categories, the category-instance repository derived from a corpus of documents comprising textual portions, the derivation comprising computing strengths for relationships between categories and instances based at least in part on frequencies of co-occurrence of the categories and instances over the corpus of documents; accessing a set of media item concept classifiers derived from the media items and associated with concepts derived from textual metadata of the digital media items in the digital media repository; computing consistency scores for a plurality of the categories based at least in part on scores obtained from media item concept classifiers associated with concepts corresponding to the instances of the plurality of categories; selectively removing the categories of the category-instance repository based at least in part whether the computed consistency scores indicate a threshold level of inconsistency; and determining, for each category of a plurality of the categories not removed, a category classifier based at least in part on the media item concept classifiers of concepts associated with the category, the determined category classifier when applied to a media item producing a score indicating whether the media item represents the category for which the category classifier was determined. 12. The non-transitory computer-readable storage medium of claim 9 , wherein the accessing the category-instance repository comprises: storing a set of textual patterns indicating a category-instance relationship between a portion of text corresponding to a category and a portion of text corresponding to an instance; applying the textual patterns over the corpus of documents, thereby identifying a set of category-instance relationships; and retaining, as the categories and instances of the category-instance repository, the categories and instances having relationships with computed strengths of at least some predetermined threshold value. | 0.737612 |
7,772,478 | 2 | 3 | 2. The method for understanding music of claim 1 , further comprising selecting a test music sample using the semantic basis sub-classifier machines to compute sub-description vectors for the test music sample forming a test sample description vector for the test music sample by combining the sub-description vectors. | 2. The method for understanding music of claim 1 , further comprising selecting a test music sample using the semantic basis sub-classifier machines to compute sub-description vectors for the test music sample forming a test sample description vector for the test music sample by combining the sub-description vectors. 3. The method for understanding music of claim 2 , further comprising comparing the test sample description vector with a description provided by a user recommending or not recommending the test music sample to the user depending on the results of the comparison. | 0.57717 |
8,626,797 | 10 | 12 | 10. The information processing apparatus according to claim 9 , wherein the one or more processors are further configured to execute the instructions to: configure a user answer acquisition section configured to execute the instructions to acquire an answer from the user if the text extracted by the text extraction block is phrased as a question prompting the user for an answer, wherein the answer from the user may be directly entered through at least one of a keyboard or touch panel, or entered through the selection of an object on the display screen. | 10. The information processing apparatus according to claim 9 , wherein the one or more processors are further configured to execute the instructions to: configure a user answer acquisition section configured to execute the instructions to acquire an answer from the user if the text extracted by the text extraction block is phrased as a question prompting the user for an answer, wherein the answer from the user may be directly entered through at least one of a keyboard or touch panel, or entered through the selection of an object on the display screen. 12. The information processing apparatus according to claim 10 , wherein the one or more processors are further configured to execute the instructions to: configure a questioning tendency section to set a tendency in questioning, wherein the tendency may include the preferential presentation of questions similar to a particular question, wherein the tendency may include the preferential presentation of questions of a certain difficulty level, and wherein the tendency may include repeating questions answered incorrectly. | 0.5 |
8,171,049 | 15 | 17 | 15. The method of claim 1 , wherein the relevance scores for unlabeled objects in the collection are computed with an equation which includes: a first term which takes into account relevance feedback and pseudo-relevance feedback of positively labeled text portions of other objects; a second term which takes into account relevance feedback and pseudo-relevance feedback of negatively labeled text portions of other objects; a third term which takes into account relevance feedback and pseudo-relevance feedback of positively labeled image portions of other objects; and a fourth term which takes into account relevance feedback and pseudo-relevance feedback of negatively labeled image portions of other objects. | 15. The method of claim 1 , wherein the relevance scores for unlabeled objects in the collection are computed with an equation which includes: a first term which takes into account relevance feedback and pseudo-relevance feedback of positively labeled text portions of other objects; a second term which takes into account relevance feedback and pseudo-relevance feedback of negatively labeled text portions of other objects; a third term which takes into account relevance feedback and pseudo-relevance feedback of positively labeled image portions of other objects; and a fourth term which takes into account relevance feedback and pseudo-relevance feedback of negatively labeled image portions of other objects. 17. The method of claim 15 , wherein the equation further includes at least one of: a weight applied to the first and second terms according to at least one modality selected by the user; and a weight applied to the third and fourth terms according to at least one modality selected by the user. | 0.5 |
7,698,315 | 12 | 13 | 12. A method for an advertising campaign management system, the method comprising: in association with stored account information, storing data defining a plurality of advertisements associated with an advertiser, the plurality of advertisements being linked together as at least one category, according to a grouping indication received from the advertiser; producing a user interface for a computer display device showing the account information along with the associated advertisements for a category when the account information is accessed by the advertiser, wherein the user interface includes a quick-fill button to simultaneously set a category for a plurality of displayed advertisements; enabling the advertiser to simultaneously create a plurality of new advertisements through a sub-page of the user interface and to categorize the plurality of new advertisements into at least one category with the quick-fill button, which operates commonly on the plurality of new advertisements when selected; enabling the advertiser to view a plurality of advertisements across one or more categories; and enabling the advertiser to perform filtered searches of the plurality of advertisements based on at least one attribute of the advertisement data. | 12. A method for an advertising campaign management system, the method comprising: in association with stored account information, storing data defining a plurality of advertisements associated with an advertiser, the plurality of advertisements being linked together as at least one category, according to a grouping indication received from the advertiser; producing a user interface for a computer display device showing the account information along with the associated advertisements for a category when the account information is accessed by the advertiser, wherein the user interface includes a quick-fill button to simultaneously set a category for a plurality of displayed advertisements; enabling the advertiser to simultaneously create a plurality of new advertisements through a sub-page of the user interface and to categorize the plurality of new advertisements into at least one category with the quick-fill button, which operates commonly on the plurality of new advertisements when selected; enabling the advertiser to view a plurality of advertisements across one or more categories; and enabling the advertiser to perform filtered searches of the plurality of advertisements based on at least one attribute of the advertisement data. 13. The method of claim 12 further comprising: enabling the advertiser to simultaneously commonly modify one or more advertisements that are the results of a filtered search. | 0.747826 |
8,566,088 | 15 | 18 | 15. A method of speech recognition comprising the steps of: accessing a plurality of weak classifiers, wherein each weak classifier comprises a decision function for determining the presence of an event within a training corpus of known-class digitized speech utterances, and an ensemble detector comprising a plurality of the weak classifiers, that together are better at determining the presence of a speech signal event than any of the constituent weak classifiers; receiving a speech signal; digitizing the received speech signal; detecting locations of relevant speech signal events in the received and digitized speech signal, wherein each of the relevant speech signal events comprise spectral information and temporal information; capturing spectral features of and temporal relationships between all of the speech signal events; segmenting the received and digitized speech signal based on the detected locations of the speech signal events; analyzing the segmented, received and digitized speech signal, wherein the analysis is synchronized with the speech signal events, detecting patterns in the digitized speech signal with the captured spectral information, the temporal relationships, and the analyzed speech signal; recognizing speech data that corresponds with the analyzed digitized speech signal, wherein the step of recognizing the speech data comprises the steps of providing a list of perceptual alternatives for the recognized speech data that corresponds to the detected patterns in the digitized speech signal, and disambiguating between the perceptual alternatives for the recognized speech data based on the analysis of one or more of the speech signal events to improve the recognized speech data; and outputting the improved speech data. | 15. A method of speech recognition comprising the steps of: accessing a plurality of weak classifiers, wherein each weak classifier comprises a decision function for determining the presence of an event within a training corpus of known-class digitized speech utterances, and an ensemble detector comprising a plurality of the weak classifiers, that together are better at determining the presence of a speech signal event than any of the constituent weak classifiers; receiving a speech signal; digitizing the received speech signal; detecting locations of relevant speech signal events in the received and digitized speech signal, wherein each of the relevant speech signal events comprise spectral information and temporal information; capturing spectral features of and temporal relationships between all of the speech signal events; segmenting the received and digitized speech signal based on the detected locations of the speech signal events; analyzing the segmented, received and digitized speech signal, wherein the analysis is synchronized with the speech signal events, detecting patterns in the digitized speech signal with the captured spectral information, the temporal relationships, and the analyzed speech signal; recognizing speech data that corresponds with the analyzed digitized speech signal, wherein the step of recognizing the speech data comprises the steps of providing a list of perceptual alternatives for the recognized speech data that corresponds to the detected patterns in the digitized speech signal, and disambiguating between the perceptual alternatives for the recognized speech data based on the analysis of one or more of the speech signal events to improve the recognized speech data; and outputting the improved speech data. 18. The method of claim 15 , wherein the step of accessing a sample of the plurality of speech signals having matching event patterns further comprises the step of automatically identifying regions in the plurality of speech signals that contain the event patterns, which comprises the steps of: accessing a training set; converting the speech signal into time-trajectory space regions containing all of the speech signal events from positive training examples; and repeatedly performing the steps of computing the counts of negative examples for all of the time-traiectory space regions, selecting a region of the time-trajectory space regions with the fewest events from negative training examples, and eliminating negative examples with no speech signal events in the selected region from further consideration; until a cascade is created that operates perfectly on said training set. | 0.688115 |
5,404,395 | 33 | 35 | 33. In a switching system having an internal numbering plan, for use in a telecommunications network having a network numbering plan, the improvement comprising: data storage means for storing first contents defining a syntax and a grammar of the network numbering plan that includes a first symbol sequence which first symbol sequence includes an extension number of the switching system, the first contents defining the first symbol sequence as a feature access code for a feature of the switching system; means responsive to receipt of the first symbol sequence, for parsing the received first symbol sequence by using the first contents of the data storage means to determine a meaning of the first symbol sequence within the network numbering plan; and means responsive to the determined meaning of the received first symbol sequence for invoking said feature in the switching system. | 33. In a switching system having an internal numbering plan, for use in a telecommunications network having a network numbering plan, the improvement comprising: data storage means for storing first contents defining a syntax and a grammar of the network numbering plan that includes a first symbol sequence which first symbol sequence includes an extension number of the switching system, the first contents defining the first symbol sequence as a feature access code for a feature of the switching system; means responsive to receipt of the first symbol sequence, for parsing the received first symbol sequence by using the first contents of the data storage means to determine a meaning of the first symbol sequence within the network numbering plan; and means responsive to the determined meaning of the received first symbol sequence for invoking said feature in the switching system. 35. The improvement of claim 33 wherein: the first contents define the first symbol sequence same as the second contents define the second symbol sequence; and the invoking means are responsive to the determined meaning of the received second symbol sequence by invoking the feature that corresponds to the second symbol sequence by using the determined meaning and the second contents of the data storage means, and are responsive to the determined meaning of the received first symbol sequence by invoking same said feature by using the determined meaning and the first contents of the data storage means. | 0.691251 |
8,019,656 | 30 | 31 | 30. The product summary generator of claim 22 , further comprising a notifying module adapted to notify a user that an update has taken place of the self-updating naturally-reading narrative product summary. | 30. The product summary generator of claim 22 , further comprising a notifying module adapted to notify a user that an update has taken place of the self-updating naturally-reading narrative product summary. 31. The product summary generator of claim 30 , wherein the user is notified by email or RSS feed that an update has taken place of the self-updating naturally-reading narrative product summary. | 0.5 |
8,185,867 | 1 | 14 | 1. A method in a computer system for providing an interface between at least one logical view of data and a plurality of data sources, comprising: receiving an indication of an operation to be performed on the at least one logical view, the at least one logical view including at least one combination of data constructed from and corresponding to two or more of the plurality of data sources, the two or more of the plurality of data sources including at least one data source that is not a relational database, each of the plurality of data sources storing data; automatically determining the corresponding plurality of data sources that were used to construct the at least one logical view; and transparently and automatically causing the stored data in the corresponding plurality of data sources to be adjusted in accordance with the indicated operation, thereby automatically performing the indicated operation on underlying data that corresponds to the logical view. | 1. A method in a computer system for providing an interface between at least one logical view of data and a plurality of data sources, comprising: receiving an indication of an operation to be performed on the at least one logical view, the at least one logical view including at least one combination of data constructed from and corresponding to two or more of the plurality of data sources, the two or more of the plurality of data sources including at least one data source that is not a relational database, each of the plurality of data sources storing data; automatically determining the corresponding plurality of data sources that were used to construct the at least one logical view; and transparently and automatically causing the stored data in the corresponding plurality of data sources to be adjusted in accordance with the indicated operation, thereby automatically performing the indicated operation on underlying data that corresponds to the logical view. 14. The method of claim 1 , further comprising: receiving an indication of an expression that includes at least one of a mathematical expression or a function; and evaluating the expression to generate a virtual attribute in the at least one logical view. | 0.789951 |
8,200,606 | 11 | 13 | 11. The computer program product of claim 10 including the further program instruction using historical statistics data to identify the past behavior of said components and combining the enriched alert and identified past behavior of said components to generate at least one alert resolution action. | 11. The computer program product of claim 10 including the further program instruction using historical statistics data to identify the past behavior of said components and combining the enriched alert and identified past behavior of said components to generate at least one alert resolution action. 13. The computer program product of claim 11 wherein the instruction for associating the received alert request to a generic conceptual data model comprises the step of identifying in the alert request at least one attribute to link the alert request to at least one generic conceptual data model. | 0.5 |
10,068,033 | 5 | 7 | 5. The method according to claim 1 , wherein determining the partition number and the layer number of the candidate vertex indicated by the query condition comprises: determining, based on the partition number and the layer number of the query vertex and according to a distance between the candidate vertex indicated by the query condition and the query vertex, the partition number and the layer number of the candidate vertex. | 5. The method according to claim 1 , wherein determining the partition number and the layer number of the candidate vertex indicated by the query condition comprises: determining, based on the partition number and the layer number of the query vertex and according to a distance between the candidate vertex indicated by the query condition and the query vertex, the partition number and the layer number of the candidate vertex. 7. The method according to claim 5 , wherein vertex-cut partitioning is performed on the multiple vertices in the graph data whole set; a partition border comprises a vertex; and a shortest distance between the vertex on the partition border and the partition border of a partition in which the vertex is located is zero; and wherein the query condition indicates a maximum distance between the candidate vertex and the query vertex; when the maximum distance is not greater than the layer number of the query vertex, determining the partition number and the layer number of the candidate vertex comprises: determining that the partition number of the candidate vertex is the partition number of the query vertex; determining a minimum value between a maximum layer number in a partition in which the query vertex is located and a value obtained by adding the layer number of the query vertex and the maximum distance; and determining a layer number within a closed interval from a value obtained by subtracting the maximum distance from the layer number of the query vertex to the minimum value as the layer number of the candidate vertex; when the maximum distance is greater than the layer number of the query vertex, the determining a partition number and a layer number of the candidate vertex specifically comprises: determining that the partition number of the candidate vertex is the partition number of the query vertex and a partition number of a neighboring partition of a partition in which the query vertex is located; for the partition in which the query vertex is located, determining a minimum value between a maximum layer number in the partition in which the query vertex is located and a value obtained by adding the layer number of the query vertex and the maximum distance, and determining a layer number within a closed interval from zero to the minimum value as the layer number that is of the candidate vertex and that belongs to a same group as the partition number of the query vertex; and for each neighboring partition of the partition in which the query vertex is located, determining a minimum value between a maximum layer number of the neighboring partition and a value obtained by subtracting the layer number of the query vertex from the maximum distance, and determining a layer number within a closed interval from zero to the minimum value as the layer number that is of the candidate vertex and that belongs to a same group as a partition number of the neighboring partition. | 0.507448 |
8,478,903 | 43 | 46 | 43. A server operative in a computer network for delivering resources to multiple client machines, the server comprising: cache storage; a table listing a plurality of origin servers having content that is authorized for delivery to client machines via the server, wherein the server is associated with a first alias name corresponding to a first origin server of the plurality of origin servers, and wherein the server is associated with a second alias name corresponding to a second origin server of the plurality of origin servers, said second origin server being distinct from the first origin server and said second alias name being distinct from the first alias name, and wherein the server is operable to replicate at least some of the resources located on the first origin server, and at least some of the resources located on the second origin server, and wherein, in response to a request for a resource, the server uses at least the table to analyze an alias name associated with the request to determine an origin server associated with the particular resource. | 43. A server operative in a computer network for delivering resources to multiple client machines, the server comprising: cache storage; a table listing a plurality of origin servers having content that is authorized for delivery to client machines via the server, wherein the server is associated with a first alias name corresponding to a first origin server of the plurality of origin servers, and wherein the server is associated with a second alias name corresponding to a second origin server of the plurality of origin servers, said second origin server being distinct from the first origin server and said second alias name being distinct from the first alias name, and wherein the server is operable to replicate at least some of the resources located on the first origin server, and at least some of the resources located on the second origin server, and wherein, in response to a request for a resource, the server uses at least the table to analyze an alias name associated with the request to determine an origin server associated with the particular resource. 46. A server as recited in claim 43 , wherein in response to a request for a resource, the server is further configured and adapted to reject the request for the resource if the alias name received with the request is not included the table. | 0.5 |
9,342,508 | 2 | 3 | 2. A system as described in claim 1 , wherein the instructions are further executable to cause the service to maintain one or more templates that each correspond to locales for which the text is to be localized, said templates include a template for the locale from which the request for the content is received, said templates being formed based on the canonicalization pattern and the content. | 2. A system as described in claim 1 , wherein the instructions are further executable to cause the service to maintain one or more templates that each correspond to locales for which the text is to be localized, said templates include a template for the locale from which the request for the content is received, said templates being formed based on the canonicalization pattern and the content. 3. A system as described in claim 2 , wherein said templates include text translated based on the canonicalization pattern. | 0.5 |
7,475,015 | 5 | 7 | 5. The method as recited in claim 1 , further comprising the step of determining a confidence measurement. | 5. The method as recited in claim 1 , further comprising the step of determining a confidence measurement. 7. The method as recited in claim 5 , wherein the step of determining a confidence measurement includes employing scores obtained from the semantic structured language model along with other speech recognition based features. | 0.519231 |
7,996,440 | 31 | 32 | 31. A non-transitory computer-readable medium having stored thereon executable instructions that, when executed, cause the computer to: identify a first set of attributes and a first set of values of a product via a supervised classification algorithm as applied to at least one natural language document; identify a second set of attributes and a second set of values of the product via a semi-supervised classification algorithm as applied to the at least one natural language document based at least in part upon the first set of attributes and the first set of values; provide the first set of attributes and the second set of attributes as at least one attribute; provide the first set of values and the second set of values as at least one value; for at least two attributes of the at least one attribute, calculate correlation values between each of the at least two attributes; for at least two values of the at least one value, calculate correlation values between each of the at least two values; merge attributes of the at least two attributes having correlation values above a correlation threshold; merge values of the at least two values having correlation values above the correlation threshold; and store the at least one attribute and the at least one value. | 31. A non-transitory computer-readable medium having stored thereon executable instructions that, when executed, cause the computer to: identify a first set of attributes and a first set of values of a product via a supervised classification algorithm as applied to at least one natural language document; identify a second set of attributes and a second set of values of the product via a semi-supervised classification algorithm as applied to the at least one natural language document based at least in part upon the first set of attributes and the first set of values; provide the first set of attributes and the second set of attributes as at least one attribute; provide the first set of values and the second set of values as at least one value; for at least two attributes of the at least one attribute, calculate correlation values between each of the at least two attributes; for at least two values of the at least one value, calculate correlation values between each of the at least two values; merge attributes of the at least two attributes having correlation values above a correlation threshold; merge values of the at least two values having correlation values above the correlation threshold; and store the at least one attribute and the at least one value. 32. The computer-readable medium of claim 31 , further comprising executable instructions that, when executed, cause the computer to: provide seed attributes and corresponding seed values identified by an unsupervised classification algorithm as applied to the at least one natural language document, wherein the executable instructions that, when executed, cause the computer to identify the first set of attributes and the first set of values further cause the computer to identify the first set of attributes and the first set of values via the supervised classification algorithm based on the seed attributes and the corresponding seed values. | 0.5 |
8,402,428 | 16 | 18 | 16. A non-transitory computer readable media for storing programming instructions for automatically generating source code files in a file storage unit, the computer readable media comprising: programming instructions for monitoring the file storage unit to detect changes in the file storage unit and in response send file event notifications; programming instructions for building a metadata model relating to the source code files in the file storage unit, wherein the metadata model comprises a plurality of metadata items, a key that identifies the metadata item, and one or more dependencies of the metadata items in relation to other of the metadata items; and programming instructions for automatically generating one or more of the source code files using the metadata model in response to at least one of the file event notifications and the metadata notifications, including automatically generating at least one of the source code files containing an inter-type declaration that adds an additional member into another of the source code files. | 16. A non-transitory computer readable media for storing programming instructions for automatically generating source code files in a file storage unit, the computer readable media comprising: programming instructions for monitoring the file storage unit to detect changes in the file storage unit and in response send file event notifications; programming instructions for building a metadata model relating to the source code files in the file storage unit, wherein the metadata model comprises a plurality of metadata items, a key that identifies the metadata item, and one or more dependencies of the metadata items in relation to other of the metadata items; and programming instructions for automatically generating one or more of the source code files using the metadata model in response to at least one of the file event notifications and the metadata notifications, including automatically generating at least one of the source code files containing an inter-type declaration that adds an additional member into another of the source code files. 18. The computer readable media as recited in claim 16 , wherein the metadata unit including programming instructions for sending metadata notifications according to changes to the dependencies of the metadata items. | 0.5 |
9,501,506 | 11 | 12 | 11. The system of claim 10 , wherein the term assigned to the second leaf node is a first term and wherein the instructions further include instructions that, when executed, cause the first leaf node to: receive an updated term-sharded posting list portion for a second term from a third leaf node, the second term being assigned to the first leaf node; receive an updated term-sharded posting list portion for the second term from a fourth leaf node; merge the updated term-sharded posting list portion from the third leaf node with the updated term-sharded posting list portion from the fourth leaf node to generate a new term-sharded posting list for the second term; and and use the new term-sharded posting list for the second term in responding to queries. | 11. The system of claim 10 , wherein the term assigned to the second leaf node is a first term and wherein the instructions further include instructions that, when executed, cause the first leaf node to: receive an updated term-sharded posting list portion for a second term from a third leaf node, the second term being assigned to the first leaf node; receive an updated term-sharded posting list portion for the second term from a fourth leaf node; merge the updated term-sharded posting list portion from the third leaf node with the updated term-sharded posting list portion from the fourth leaf node to generate a new term-sharded posting list for the second term; and and use the new term-sharded posting list for the second term in responding to queries. 12. The system of claim 11 , wherein as part of using the new term-sharded posting list for the second term, the instructions further include instructions that, when executed, cause the first leaf node to: apply change information for the portion from the fourth node and the portion from the third leaf node to the new term-sharded posting list so that the first leaf node responds to at least some queries with a current version of the term-sharded posting list. | 0.586453 |
9,268,769 | 14 | 15 | 14. One or more non-transitory computer-readable media comprising computer program code that, when executed by a computer system, enables the computer system to perform the following method for identifying message content to send to users based on the users' language characteristics, the method comprising: obtaining user-generated content for a plurality of users, wherein each content item is associated with a user ID that uniquely identifies the user that generated the content item; extracting language characteristics from the user-generated content; assigning one or more language characteristic scores to each of the users; clustering the users into groups using the language characteristic scores; testing the responsiveness of each group to different message content by sending a plurality of test messages with different message content to at least a subset of users within each group and measuring the response rates to the test messages; associating different message content with different language characteristic scores by identifying a message content to which each of the groups is most responsive and associating the message content with the group; obtaining user-generated content for a new user; extracting language characteristics from the new user's user-generated content; assigning one or more language characteristic scores to the new user; and sending a message to the new user with the message content previously associated with users having similar language characteristic score(s). | 14. One or more non-transitory computer-readable media comprising computer program code that, when executed by a computer system, enables the computer system to perform the following method for identifying message content to send to users based on the users' language characteristics, the method comprising: obtaining user-generated content for a plurality of users, wherein each content item is associated with a user ID that uniquely identifies the user that generated the content item; extracting language characteristics from the user-generated content; assigning one or more language characteristic scores to each of the users; clustering the users into groups using the language characteristic scores; testing the responsiveness of each group to different message content by sending a plurality of test messages with different message content to at least a subset of users within each group and measuring the response rates to the test messages; associating different message content with different language characteristic scores by identifying a message content to which each of the groups is most responsive and associating the message content with the group; obtaining user-generated content for a new user; extracting language characteristics from the new user's user-generated content; assigning one or more language characteristic scores to the new user; and sending a message to the new user with the message content previously associated with users having similar language characteristic score(s). 15. The one or more non-transitory computer-readable media of claim 14 , wherein testing the responsiveness of each group to different message content comprises testing the responsiveness of each group to offers of different products to identify a best product for each group. | 0.5 |
9,519,629 | 2 | 3 | 2. The method of claim 1 , wherein the at least one common rule includes at least one global value to be used throughout the one or more pages. | 2. The method of claim 1 , wherein the at least one common rule includes at least one global value to be used throughout the one or more pages. 3. The method of claim 2 , wherein the at least one global value includes a global reference to at least one of an image, a font, or a color. | 0.5 |
9,727,652 | 1 | 7 | 1. A computer-implemented method comprising: associating a user search query (q) with a search task (T), wherein the search task comprises a sequence of multiple distinct user search queries that share a common context; identifying multiple information documents that correspond to the search task, wherein the multiple information documents comprise one or more information documents that correspond to each of the multiple distinct user search queries of the search task; and generating a recommended chronologically-ordered sequence of the multiple information documents to present to the user in response to the user search query, wherein the recommended chronologically-ordered sequence is based on (i) the sequence of the multiple distinct user search queries of the search task and (ii) dependency information associated with the multiple information documents, wherein said dependency information comprises (a) determined measure of importance that a user accesses the contents of a first of the multiple information documents before proceeding to the contents of a second of the multiple information documents, and (b) a determined measure of relevance of each of the multiple information documents to each of one or more other documents from the multiple information documents, wherein the determined measure of relevance comprises a computed probability of the second information document (D 2 ) being dependent on the first information document (D 1 ), and wherein said probability (P) is computed via P(D 2 |D 1 , q)=P(T|q)*P(D 2 |q, T)*P(D 2 |D 1 ). | 1. A computer-implemented method comprising: associating a user search query (q) with a search task (T), wherein the search task comprises a sequence of multiple distinct user search queries that share a common context; identifying multiple information documents that correspond to the search task, wherein the multiple information documents comprise one or more information documents that correspond to each of the multiple distinct user search queries of the search task; and generating a recommended chronologically-ordered sequence of the multiple information documents to present to the user in response to the user search query, wherein the recommended chronologically-ordered sequence is based on (i) the sequence of the multiple distinct user search queries of the search task and (ii) dependency information associated with the multiple information documents, wherein said dependency information comprises (a) determined measure of importance that a user accesses the contents of a first of the multiple information documents before proceeding to the contents of a second of the multiple information documents, and (b) a determined measure of relevance of each of the multiple information documents to each of one or more other documents from the multiple information documents, wherein the determined measure of relevance comprises a computed probability of the second information document (D 2 ) being dependent on the first information document (D 1 ), and wherein said probability (P) is computed via P(D 2 |D 1 , q)=P(T|q)*P(D 2 |q, T)*P(D 2 |D 1 ). 7. The method of claim 1 , wherein said generating comprises determining a measure of relevance of the user search query to the search task. | 0.675926 |
8,612,469 | 2 | 11 | 2. A computer-implemented method comprising: transmitting from a server system code and content associated with a Web page to a first client; invoking via the code a pop-up toolbox after a first user selects a portion of the content using a pointing device at the first client, wherein the pop-up toolbox allows the user to input a first suggestion to be associated with the selected portion of content; receiving from the first client the first suggestion associated with the selected portion of content and first information, wherein the first information comprises a content identifier, a start position of the selected portion within the content, and an end position of the selected portion within the content; and storing the first information in a suggestions database, wherein the suggestions database is separate from a database that stores the content associated with the Web page; permitting a second user at a second client to select at least a portion of the content selected by the first user; and permitting the second user at the second client to input a second suggestion for the at least a portion of the content selected by the first user. | 2. A computer-implemented method comprising: transmitting from a server system code and content associated with a Web page to a first client; invoking via the code a pop-up toolbox after a first user selects a portion of the content using a pointing device at the first client, wherein the pop-up toolbox allows the user to input a first suggestion to be associated with the selected portion of content; receiving from the first client the first suggestion associated with the selected portion of content and first information, wherein the first information comprises a content identifier, a start position of the selected portion within the content, and an end position of the selected portion within the content; and storing the first information in a suggestions database, wherein the suggestions database is separate from a database that stores the content associated with the Web page; permitting a second user at a second client to select at least a portion of the content selected by the first user; and permitting the second user at the second client to input a second suggestion for the at least a portion of the content selected by the first user. 11. The computer-implemented method of claim 2 further comprising: permitting designating the first suggestion as an accepted suggestion; and permitting designating the second suggestion as a discarded suggestion. | 0.570565 |
9,274,698 | 1 | 5 | 1. A method comprising: displaying text on a touch screen in an original configuration; detecting a touch associated with a first area of the touch screen; displaying an enlarged view of the first area comprising at least two characters of the text; detecting selection of a first character from the at least two characters; resuming the original configuration after detecting the selection of the first character, wherein the first character is shown as designated text when the original configuration is resumed. | 1. A method comprising: displaying text on a touch screen in an original configuration; detecting a touch associated with a first area of the touch screen; displaying an enlarged view of the first area comprising at least two characters of the text; detecting selection of a first character from the at least two characters; resuming the original configuration after detecting the selection of the first character, wherein the first character is shown as designated text when the original configuration is resumed. 5. The method of claim 1 , further comprising performing text editing on the designated text. | 0.917407 |
9,495,405 | 15 | 19 | 15. A computer program product comprising a computer readable storage medium having computer readable program code embodied thereon, the computer readable program code executable by a processor to perform a method comprising: receiving a query; establishing a target confidence level for the query, the target confidence level representing a requested level of accuracy for a result of the query; assigning a plurality of confidence levels to a plurality of analytics engines, the plurality of confidence levels comprising a respective confidence level for each analytics engine in the plurality of analytics engines; selecting a preliminary set of analytics engines from among the plurality of analytics engines; querying each analytics engine in the preliminary set of analytics engines based on the query; receiving a plurality of responses to the query, the plurality of responses comprising a response to the query from each analytics engine in the preliminary set of analytics engines; grouping the plurality of responses to the query into two or more groups of responses to the query, wherein each group is associated with a set of analytics engines that provided the set of responses in the group; calculating two or more group confidence levels for the two or more groups, wherein a group confidence level is calculated for each group based on the respective confidence level of each analytics engine in the set of analytics engines associated with the group; selecting a first group of the two or more groups of responses to the query, wherein the selecting is at least partially based on the target confidence level and the group confidence level of the first group; and summarizing into a final result the first group of responses to the query, the final result being an answer to the query. | 15. A computer program product comprising a computer readable storage medium having computer readable program code embodied thereon, the computer readable program code executable by a processor to perform a method comprising: receiving a query; establishing a target confidence level for the query, the target confidence level representing a requested level of accuracy for a result of the query; assigning a plurality of confidence levels to a plurality of analytics engines, the plurality of confidence levels comprising a respective confidence level for each analytics engine in the plurality of analytics engines; selecting a preliminary set of analytics engines from among the plurality of analytics engines; querying each analytics engine in the preliminary set of analytics engines based on the query; receiving a plurality of responses to the query, the plurality of responses comprising a response to the query from each analytics engine in the preliminary set of analytics engines; grouping the plurality of responses to the query into two or more groups of responses to the query, wherein each group is associated with a set of analytics engines that provided the set of responses in the group; calculating two or more group confidence levels for the two or more groups, wherein a group confidence level is calculated for each group based on the respective confidence level of each analytics engine in the set of analytics engines associated with the group; selecting a first group of the two or more groups of responses to the query, wherein the selecting is at least partially based on the target confidence level and the group confidence level of the first group; and summarizing into a final result the first group of responses to the query, the final result being an answer to the query. 19. The computer program product of claim 15 , wherein the assigning the plurality of confidence levels to the plurality of analytics engines comprises assigning a first confidence level to a first analytics engine for potential queries in a first category and assigning a second confidence level to the first analytics engine for potential queries in a second category. | 0.521964 |
9,081,978 | 15 | 17 | 15. A system, comprising: a token mapping datastore storing token mapping data that associates a plurality of strings with corresponding tokens, wherein the token mapping datastore is included in a first computing environment associated with a first trust level; a whitelist token mapping datastore storing whitelist token mapping data that associates a subset of the plurality of strings with the corresponding tokens, wherein the whitelist token mapping datastore is included in a second computing environment associated with a second trust level; a first computing device in communication with the token mapping datastore, the first computing device configured to execute computer-readable instructions that cause the first computing device to: generate tokenized information that includes one or more tokens that correspond to one or more strings of the plurality of strings; and send the tokenized information to be stored in the second computing environment; and a second computing device in communication with the first computing device and the whitelist token mapping datastore, the second computing device configured to execute computer-readable instructions that cause the second computing device to: receive a search request to search for a file that includes one or more search terms; for the one or more search terms that are included in the whitelist token mapping data, retrieve the corresponding token from the whitelist token mapping datastore; for the one or more search terms that are not included in the whitelist token mapping data, send a request that the first computing device retrieve the corresponding token from the token mapping datastore; search for a tokenized version of the file that includes the one or more tokens corresponding to the one or more search terms; identify, in the tokenized version of the file, one or more tokens that are included in the whitelist token mapping data; replace the identified one or more tokens with the corresponding string from the whitelist token mapping data, to generate an at least partly detokenized version of the file; and provide the at least partly detokenized version of the file in response to the search request. | 15. A system, comprising: a token mapping datastore storing token mapping data that associates a plurality of strings with corresponding tokens, wherein the token mapping datastore is included in a first computing environment associated with a first trust level; a whitelist token mapping datastore storing whitelist token mapping data that associates a subset of the plurality of strings with the corresponding tokens, wherein the whitelist token mapping datastore is included in a second computing environment associated with a second trust level; a first computing device in communication with the token mapping datastore, the first computing device configured to execute computer-readable instructions that cause the first computing device to: generate tokenized information that includes one or more tokens that correspond to one or more strings of the plurality of strings; and send the tokenized information to be stored in the second computing environment; and a second computing device in communication with the first computing device and the whitelist token mapping datastore, the second computing device configured to execute computer-readable instructions that cause the second computing device to: receive a search request to search for a file that includes one or more search terms; for the one or more search terms that are included in the whitelist token mapping data, retrieve the corresponding token from the whitelist token mapping datastore; for the one or more search terms that are not included in the whitelist token mapping data, send a request that the first computing device retrieve the corresponding token from the token mapping datastore; search for a tokenized version of the file that includes the one or more tokens corresponding to the one or more search terms; identify, in the tokenized version of the file, one or more tokens that are included in the whitelist token mapping data; replace the identified one or more tokens with the corresponding string from the whitelist token mapping data, to generate an at least partly detokenized version of the file; and provide the at least partly detokenized version of the file in response to the search request. 17. The system of claim 15 , wherein: the search request further comprises a search range in dates, times, or both dates and times; the tokenized file includes timestamp data describing when the tokenized file was created; and the searching for the tokenized version of the file includes searching for the tokenized version of the file having a timestamp within the search range. | 0.708909 |
7,594,166 | 28 | 29 | 28. A computer system including at least one processor for rendering page images on a display, comprising: an external component encapsulating code for modifying a behavior of one or more elements, the external component operable to be instantiated multiple times and operable to modify elements in a plurality of different HTML documents while being external to the HTML documents and wherein information associating the one or more elements with the external component is maintained in a cascading style sheet, wherein code for determining a behavior of the one or more elements is included in one or more extensible markup language (XML) namespaces that are defined externally to the HTML documents and that are associated with the external component; and at least one processing unit comprising a renderer connected to the display for rendering the page images, the renderer being configured to: modify one or more of the page images by accessing one or more of the XML namespaces associated with the external component to initiate drawing of information on the one or more of the page images based at least in part on code included in the one or more XML namespaces; make a plurality of calls to the one or more XML namespaces to initiate the drawing of the information on the one or more of the page images; and draw the information on the one or more of the page image responsive to one or more of the plurality of calls to the one or more XML namespaces; the renderer being further configured to: instantiate the external component to reveal one or more of the XML namespaces associated with the external component the one or more of the XML namespaces being external to the HTML document and specifying one or more behaviors to be applied to the one or more elements; and access the one or more XML namespaces to retrieve a new behavior to be applied to the representation of the one or more elements rendered on the page image, the new behavior being configured to enhance a default behavior for the one or more elements. | 28. A computer system including at least one processor for rendering page images on a display, comprising: an external component encapsulating code for modifying a behavior of one or more elements, the external component operable to be instantiated multiple times and operable to modify elements in a plurality of different HTML documents while being external to the HTML documents and wherein information associating the one or more elements with the external component is maintained in a cascading style sheet, wherein code for determining a behavior of the one or more elements is included in one or more extensible markup language (XML) namespaces that are defined externally to the HTML documents and that are associated with the external component; and at least one processing unit comprising a renderer connected to the display for rendering the page images, the renderer being configured to: modify one or more of the page images by accessing one or more of the XML namespaces associated with the external component to initiate drawing of information on the one or more of the page images based at least in part on code included in the one or more XML namespaces; make a plurality of calls to the one or more XML namespaces to initiate the drawing of the information on the one or more of the page images; and draw the information on the one or more of the page image responsive to one or more of the plurality of calls to the one or more XML namespaces; the renderer being further configured to: instantiate the external component to reveal one or more of the XML namespaces associated with the external component the one or more of the XML namespaces being external to the HTML document and specifying one or more behaviors to be applied to the one or more elements; and access the one or more XML namespaces to retrieve a new behavior to be applied to the representation of the one or more elements rendered on the page image, the new behavior being configured to enhance a default behavior for the one or more elements. 29. The system of claim 28 further comprising a mechanism for receiving an event. | 0.873041 |
8,024,193 | 1 | 3 | 1. A machine-implemented method comprising: pruning redundancy of instances in a plurality of speech segments, wherein the redundancy criterion is based on a similarity measure between feature vectors derived from a machine perception transformation of time-domain samples corresponding to the instances in the plurality of speech segments, wherein the instances subjected to redundancy pruning are clustered together with feature vectors discernably separated from each other in the machine perception transformation and wherein the machine perception transformation is correlated with human perception by using the time-domain samples retaining both amplitude and phase information of the speech segments, which were provided in sound data for a speech synthesis system. | 1. A machine-implemented method comprising: pruning redundancy of instances in a plurality of speech segments, wherein the redundancy criterion is based on a similarity measure between feature vectors derived from a machine perception transformation of time-domain samples corresponding to the instances in the plurality of speech segments, wherein the instances subjected to redundancy pruning are clustered together with feature vectors discernably separated from each other in the machine perception transformation and wherein the machine perception transformation is correlated with human perception by using the time-domain samples retaining both amplitude and phase information of the speech segments, which were provided in sound data for a speech synthesis system. 3. The machine-implemented method of claim 1 wherein the feature vectors incorporate phase information of the instances. | 0.948849 |
8,180,801 | 1 | 14 | 1. A computer system including instructions recorded on a non-transitory computer-readable medium, the system comprising: a query handler configured to receive a query from a stream application to be applied against a stream of data including multiple tuples representing events; a stream window manager configured to express the query in a specification which defines a window including a subset of the tuples, the specification defining content of the window as a range of the tuples having a range attribute over which the content is specified, defining when to update the window using a synchronization attribute specifying a movement of the window over time with respect to the content, and defining an evaluation of the content of the window using an evaluation attribute specifying when to perform the evaluation; a query translator configured to translate the query into any one of a plurality of stream processing languages of a data stream management system (DSMS), and configured to translate the query into a stream processing language of the plurality of stream processing languages including mapping the range attribute, the synchronization attribute, and the evaluation attribute to the stream processing language of the data stream management system (DSMS), to thereby obtain a translated query; and a DSMS mediator configured to provide the translated query to the DSMS for processing therewith. | 1. A computer system including instructions recorded on a non-transitory computer-readable medium, the system comprising: a query handler configured to receive a query from a stream application to be applied against a stream of data including multiple tuples representing events; a stream window manager configured to express the query in a specification which defines a window including a subset of the tuples, the specification defining content of the window as a range of the tuples having a range attribute over which the content is specified, defining when to update the window using a synchronization attribute specifying a movement of the window over time with respect to the content, and defining an evaluation of the content of the window using an evaluation attribute specifying when to perform the evaluation; a query translator configured to translate the query into any one of a plurality of stream processing languages of a data stream management system (DSMS), and configured to translate the query into a stream processing language of the plurality of stream processing languages including mapping the range attribute, the synchronization attribute, and the evaluation attribute to the stream processing language of the data stream management system (DSMS), to thereby obtain a translated query; and a DSMS mediator configured to provide the translated query to the DSMS for processing therewith. 14. The system of claim 1 wherein the stream of data includes one or more streams of data expressed as either relational or XML data streams, or combinations thereof, and wherein the query translator is configured to translate any of relational or XML data streams, or combinations thereof, into the stream processing language. | 0.60122 |
9,858,437 | 1 | 5 | 1. A method of operating an application search system, the method comprising: storing, in an application record data store, a plurality of application records corresponding respectively to a plurality of applications; storing, in a privacy record data store, for each application of at least some of the plurality of applications, a global privacy indicator specific to the application and applicable to all users; in response to receiving a first search query from a user device: identifying a plurality of search results responsive to the first search query from the application record data store, the plurality of search results corresponding to respective ones of the plurality of application records; for each search result of the plurality of search results, selectively determining a privacy indicator based on the privacy record data store; determining a search sensitivity value based on the privacy indicators; declaring the first search query as private based on the search sensitivity value; transmitting the plurality of search results to the user device; and in response to the first search query being declared as private, transmitting a search privacy indicator to the user device. | 1. A method of operating an application search system, the method comprising: storing, in an application record data store, a plurality of application records corresponding respectively to a plurality of applications; storing, in a privacy record data store, for each application of at least some of the plurality of applications, a global privacy indicator specific to the application and applicable to all users; in response to receiving a first search query from a user device: identifying a plurality of search results responsive to the first search query from the application record data store, the plurality of search results corresponding to respective ones of the plurality of application records; for each search result of the plurality of search results, selectively determining a privacy indicator based on the privacy record data store; determining a search sensitivity value based on the privacy indicators; declaring the first search query as private based on the search sensitivity value; transmitting the plurality of search results to the user device; and in response to the first search query being declared as private, transmitting a search privacy indicator to the user device. 5. The method of claim 1 further comprising selectively transmitting targeted advertising along with the plurality of search results, wherein the transmitting the targeted advertising is avoided in response to the first search query being declared as private. | 0.766667 |
8,122,026 | 1 | 3 | 1. A method for identifying documents referring to an entity, the entity being associated with a first set of features, the method comprising: identifying a first set of documents based on a first model and the first set of features, wherein the first model includes a first set of rules specifying at least one combination of features from the first set of features that are sufficient for identifying a document referring to the entity, each document of the first set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the first model; determining a second model based on the features of the first set of documents, wherein the second model includes a second set of rules specifying at least one combination of features from the first set of documents that are sufficient for identifying a document referring to the entity; identifying a second set of documents based on the second model and the first set of features, each document of the second set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the second model; identifying a second set of features based on the second set of documents; determining if the second set of features are associated with the entity; and responsive to determining that the second set of features are associated with the entity, identifying a third set of documents based on a third model and the second set of features, the third set of documents each comprising a sufficient number of features in common with the second set of features to identify a document referring to the entity according to the third model. | 1. A method for identifying documents referring to an entity, the entity being associated with a first set of features, the method comprising: identifying a first set of documents based on a first model and the first set of features, wherein the first model includes a first set of rules specifying at least one combination of features from the first set of features that are sufficient for identifying a document referring to the entity, each document of the first set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the first model; determining a second model based on the features of the first set of documents, wherein the second model includes a second set of rules specifying at least one combination of features from the first set of documents that are sufficient for identifying a document referring to the entity; identifying a second set of documents based on the second model and the first set of features, each document of the second set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the second model; identifying a second set of features based on the second set of documents; determining if the second set of features are associated with the entity; and responsive to determining that the second set of features are associated with the entity, identifying a third set of documents based on a third model and the second set of features, the third set of documents each comprising a sufficient number of features in common with the second set of features to identify a document referring to the entity according to the third model. 3. The method of claim 1 , wherein the first model is different than the second model. | 0.833977 |
7,721,200 | 1 | 5 | 1. A method of generating a customized document about a product, the method comprising: a) providing a user with a document manager input interface on a computer, the input interface including a definition manager module, an electronic library manager module, an automatic text generator module, a document editor module, an effectivity interface module, and a document builder module; b) on the computer, defining a document definition based on a plurality of predefined data elements arranged in a tree-like data structure using the definition manager module, the predefined data elements being retrieved from a parts library contained in the document builder module, wherein the document definition comprises at least one of (i) organization of sections of the customized document, (ii) maintenance codes specific to the product, and (iii) page formatting information; c) on the computer, creating the customized document from the document definition using the definition manager module; d) on the computer, storing the customized document in a relational database; e) on the computer, editing one or more of the predefined data elements using the document editor module by using content-specific selection menus to generate revised data elements that are stored in the relational database; f) on the computer, deconstructing syntax of textual data elements that are syntactically joined with linguistic rules, specifying a category in which to place a business rule, generating one or more tasks associated with the business rule, and applying the business rule to the textual data elements of the customized document using the automatic text generator module; g) on the computer, modifying given data that is standard in particular data structures, and customizing the given data for particular applications using the electronic library manager module; h) on the computer, establishing effectivity associations, using the effectivity interface module, for a given component of the product, and thereby defining a manner in which a change to the given component is propagated throughout the customized document; i) in response to the user making the change to the given component via the effectivity interface module, propagating the change throughout the customized document according to the effectivity associations established by the user; j) synthesizing text from the revised data elements according to (i) the document definition defined by the document definition module, (ii) edits made by the user via the document editor module, (iii) the business rule applied by the user via the automatic text generator module, (iv) the customized data provided by the electronic library manager module, and (v) the effectivity associations established via the effectivity interface module; and k) generating and publishing the customized document. | 1. A method of generating a customized document about a product, the method comprising: a) providing a user with a document manager input interface on a computer, the input interface including a definition manager module, an electronic library manager module, an automatic text generator module, a document editor module, an effectivity interface module, and a document builder module; b) on the computer, defining a document definition based on a plurality of predefined data elements arranged in a tree-like data structure using the definition manager module, the predefined data elements being retrieved from a parts library contained in the document builder module, wherein the document definition comprises at least one of (i) organization of sections of the customized document, (ii) maintenance codes specific to the product, and (iii) page formatting information; c) on the computer, creating the customized document from the document definition using the definition manager module; d) on the computer, storing the customized document in a relational database; e) on the computer, editing one or more of the predefined data elements using the document editor module by using content-specific selection menus to generate revised data elements that are stored in the relational database; f) on the computer, deconstructing syntax of textual data elements that are syntactically joined with linguistic rules, specifying a category in which to place a business rule, generating one or more tasks associated with the business rule, and applying the business rule to the textual data elements of the customized document using the automatic text generator module; g) on the computer, modifying given data that is standard in particular data structures, and customizing the given data for particular applications using the electronic library manager module; h) on the computer, establishing effectivity associations, using the effectivity interface module, for a given component of the product, and thereby defining a manner in which a change to the given component is propagated throughout the customized document; i) in response to the user making the change to the given component via the effectivity interface module, propagating the change throughout the customized document according to the effectivity associations established by the user; j) synthesizing text from the revised data elements according to (i) the document definition defined by the document definition module, (ii) edits made by the user via the document editor module, (iii) the business rule applied by the user via the automatic text generator module, (iv) the customized data provided by the electronic library manager module, and (v) the effectivity associations established via the effectivity interface module; and k) generating and publishing the customized document. 5. The method of claim 1 , further comprising: cross-referencing one of the predefined data elements or revised data elements to one or more other documents. | 0.804726 |
9,690,982 | 10 | 17 | 10. A system for using self-referential movement data compressed by principal joint variable analysis to identify a movement of a human object or a non human object relating to betting or game activity, the system comprising: a classifier configured to receive a stream of reference frames from a detector unit, the stream of reference frames comprising a set of self-referential movement data points provided in three dimensions, each self-referential movement data point identifying locations or positions of one or more parts of a body of the human object or the non human object with respect to a reference point on the body of the human object or the non human object with respect to a particular dimension of the three dimensions; the classifier configured to determine that a subset of the set of self-referential movement data points is sufficient to recognize a reference movement relating to betting or game activity; the classifier configured to generate a feature matrix, each row of the feature matrix (i) representative of a particular location or position of the one or more parts of the body, and (ii) having at least three cells, each cell storing a self-referential movement data point of the set of self-referential movement data points corresponding to the particular location or position of the one or more parts of the body in one of the three dimensions; the classifier configured to transform the feature matrix into a compressed feature matrix using a principal joint variable analysis function at a pre-defined variance threshold, collapsing the feature matrix by reducing the three-dimensional data set into a two-dimensional data set or a single-dimensional data set, the compressed feature matrix maintaining only the rows of the feature matrix having a corresponding variance greater than the pre-defined variance threshold; a data storage configured to store the compressed feature matrix representative of the reference movement; and a recognizer configured to receive a new stream of frames including new self-referential movement data points, each new self-referential movement data point identifying a location of a part of a body of a new human object or the new non human object with respect to the reference point on the body of the new human object or the new non human object and recognizing that the movement of the new human object or the new non human object corresponds to the reference movement when the new self-referential movement data points corresponding to the compressed feature matrix only vary from the data set of the compressed feature matrix within a pre-defined recognition threshold. | 10. A system for using self-referential movement data compressed by principal joint variable analysis to identify a movement of a human object or a non human object relating to betting or game activity, the system comprising: a classifier configured to receive a stream of reference frames from a detector unit, the stream of reference frames comprising a set of self-referential movement data points provided in three dimensions, each self-referential movement data point identifying locations or positions of one or more parts of a body of the human object or the non human object with respect to a reference point on the body of the human object or the non human object with respect to a particular dimension of the three dimensions; the classifier configured to determine that a subset of the set of self-referential movement data points is sufficient to recognize a reference movement relating to betting or game activity; the classifier configured to generate a feature matrix, each row of the feature matrix (i) representative of a particular location or position of the one or more parts of the body, and (ii) having at least three cells, each cell storing a self-referential movement data point of the set of self-referential movement data points corresponding to the particular location or position of the one or more parts of the body in one of the three dimensions; the classifier configured to transform the feature matrix into a compressed feature matrix using a principal joint variable analysis function at a pre-defined variance threshold, collapsing the feature matrix by reducing the three-dimensional data set into a two-dimensional data set or a single-dimensional data set, the compressed feature matrix maintaining only the rows of the feature matrix having a corresponding variance greater than the pre-defined variance threshold; a data storage configured to store the compressed feature matrix representative of the reference movement; and a recognizer configured to receive a new stream of frames including new self-referential movement data points, each new self-referential movement data point identifying a location of a part of a body of a new human object or the new non human object with respect to the reference point on the body of the new human object or the new non human object and recognizing that the movement of the new human object or the new non human object corresponds to the reference movement when the new self-referential movement data points corresponding to the compressed feature matrix only vary from the data set of the compressed feature matrix within a pre-defined recognition threshold. 17. The system of claim 10 , wherein the recognizer is further configured to perform a slow and fast motion vector compression function to extract one or more additional mid-frames between first frame and the second frame by plotting the one or more additional mid-frames using a 4 th order polynomial function applied to the feature matrix, the one or more additional mid-frames being extracted to provide a sufficient number of frames to detect or recognize the reference movement and added to the feature matrix prior to generation of the compressed feature matrix. | 0.5 |
8,983,847 | 1 | 2 | 1. A voice recognition apparatus comprising: a program information storage unit configured to store metadata of a broadcast program in association with a user's viewing state; a dictionary storage unit configured to store a recognition dictionary including a recognition word which is a voice recognition target and a priority of the recognition word; a recommendation state storage unit configured to store a recommendation state representing one of a first state and a second state, the first state representing a state in which a feature word having a high first score is recommended among feature words, each feature word representing a feature of the broadcast program, the first score representing a degree of the user's preference for a feature word, the second state representing a state in which a feature word including specific information is recommended among the feature words, the specific information specifying a broadcast program having a high second score, the second score representing a degree of the user's preference for the broadcast program; a calculating unit configured to calculate the first score, the second score, and the feature words on the basis of the metadata and the viewing state; an updating unit configured to update the priority of a recognition word including a feature word among the feature words according to the first score when the recommendation state indicates the first state and to update the priority of a recognition word including the specific information according to the second score when the recommendation state indicates the second state; a receiving unit configured to receive a voice; a recognizing unit configured to recognize the voice using the recognition dictionary; and an operation control unit configured to control an operation on the broadcast program based on a recognition result by the recognizing unit. | 1. A voice recognition apparatus comprising: a program information storage unit configured to store metadata of a broadcast program in association with a user's viewing state; a dictionary storage unit configured to store a recognition dictionary including a recognition word which is a voice recognition target and a priority of the recognition word; a recommendation state storage unit configured to store a recommendation state representing one of a first state and a second state, the first state representing a state in which a feature word having a high first score is recommended among feature words, each feature word representing a feature of the broadcast program, the first score representing a degree of the user's preference for a feature word, the second state representing a state in which a feature word including specific information is recommended among the feature words, the specific information specifying a broadcast program having a high second score, the second score representing a degree of the user's preference for the broadcast program; a calculating unit configured to calculate the first score, the second score, and the feature words on the basis of the metadata and the viewing state; an updating unit configured to update the priority of a recognition word including a feature word among the feature words according to the first score when the recommendation state indicates the first state and to update the priority of a recognition word including the specific information according to the second score when the recommendation state indicates the second state; a receiving unit configured to receive a voice; a recognizing unit configured to recognize the voice using the recognition dictionary; and an operation control unit configured to control an operation on the broadcast program based on a recognition result by the recognizing unit. 2. The apparatus according to claim 1 , further comprising a display control unit configured to preferentially select a feature word that has a high first score as an input candidate representing a candidate of an input indicating the operation, and causes the selected input candidate to be displayed on a display unit. | 0.746835 |
8,923,838 | 1 | 13 | 1. A method for activating a cellular phone account utilizing automated speech recognition, comprising: receiving a plurality of user supplied information over a network utilizing automated speech recognition; storing the information in a memory database; and determining if the stored information is sufficient for cellular phone activation, wherein if sufficient, automatically activating the cellular phone account based on the information received utilizing the automated speech recognition, and wherein, if not sufficient, continuing to store the information in the memory database without activating the cellular phone and allowing the user to resume an interrupted activation session without repeating the previously stored information. | 1. A method for activating a cellular phone account utilizing automated speech recognition, comprising: receiving a plurality of user supplied information over a network utilizing automated speech recognition; storing the information in a memory database; and determining if the stored information is sufficient for cellular phone activation, wherein if sufficient, automatically activating the cellular phone account based on the information received utilizing the automated speech recognition, and wherein, if not sufficient, continuing to store the information in the memory database without activating the cellular phone and allowing the user to resume an interrupted activation session without repeating the previously stored information. 13. The method as recited in claim 1 , wherein the cellular phone account may include a pre-paid account. | 0.826159 |
9,336,197 | 1 | 8 | 1. A computer-implemented method of recognizing a first language used in information content, comprising: at a computer having one or more processors and memory for storing programs to be executed by the one or more processors: integrating a first vocabulary list and a second vocabulary list that are built based on a first language and a second language, respectively, into a comprehensive vocabulary list, wherein the integrating includes analyzing the first vocabulary list in view of the second vocabulary list to at least identify a first vocabulary sub-list, in the comprehensive vocabulary list, that is used in the first language, but not in the second language; identifying, within the information content, a plurality of expressions that are included in the comprehensive vocabulary list; identifying, within the plurality of expressions, a subset of expressions that are included in the first vocabulary sub-list; determining that a total frequency of occurrence of the subset of expressions within the information content meets predetermined occurrence criteria; and in accordance with the determination, determining that the information content is composed in the first language. | 1. A computer-implemented method of recognizing a first language used in information content, comprising: at a computer having one or more processors and memory for storing programs to be executed by the one or more processors: integrating a first vocabulary list and a second vocabulary list that are built based on a first language and a second language, respectively, into a comprehensive vocabulary list, wherein the integrating includes analyzing the first vocabulary list in view of the second vocabulary list to at least identify a first vocabulary sub-list, in the comprehensive vocabulary list, that is used in the first language, but not in the second language; identifying, within the information content, a plurality of expressions that are included in the comprehensive vocabulary list; identifying, within the plurality of expressions, a subset of expressions that are included in the first vocabulary sub-list; determining that a total frequency of occurrence of the subset of expressions within the information content meets predetermined occurrence criteria; and in accordance with the determination, determining that the information content is composed in the first language. 8. The method of claim 1 , wherein the frequency of occurrence for the subset of expressions is determined to meet the predetermined occurrence criteria, when a ratio between the number of words in the subset of expressions and the number of words in another subset of expressions, included in the information content, that are defined as valid vocabulary exceeds a second threshold ratio. | 0.796122 |
8,041,729 | 18 | 27 | 18. A volatile or non-volatile computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more computing devices, cause the one or more computing devices to perform: associating a category to a set of nodes of a graph by: determining a first node that represents a first term that is in the category; locating a second node associated with the first node based at least in part on a first degree of cross-reference between the first node and the second node, the second node representing a second term, wherein the first degree of cross-reference is based at least in part on a frequency by which the first term appears in a set of documents with the second term; locating a third node associated with the second node based at least in part on a second degree of cross-reference between the second node and the third node, the third node representing a third term, wherein the second degree of cross-reference is based at least in part on a frequency by which the second term appears in a set of documents with the third term; based at least in part on both (a) the first degree of cross-reference between the first node and the second node, and (b) the second degree of cross-reference between the second node and the third node, determining whether or not the third term is in the category; in response to determining that the third term is in the category, storing information that indicates the third term is in the category. | 18. A volatile or non-volatile computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more computing devices, cause the one or more computing devices to perform: associating a category to a set of nodes of a graph by: determining a first node that represents a first term that is in the category; locating a second node associated with the first node based at least in part on a first degree of cross-reference between the first node and the second node, the second node representing a second term, wherein the first degree of cross-reference is based at least in part on a frequency by which the first term appears in a set of documents with the second term; locating a third node associated with the second node based at least in part on a second degree of cross-reference between the second node and the third node, the third node representing a third term, wherein the second degree of cross-reference is based at least in part on a frequency by which the second term appears in a set of documents with the third term; based at least in part on both (a) the first degree of cross-reference between the first node and the second node, and (b) the second degree of cross-reference between the second node and the third node, determining whether or not the third term is in the category; in response to determining that the third term is in the category, storing information that indicates the third term is in the category. 27. The volatile or non-volatile computer-readable storage medium of claim 18 , wherein the category is associated with a set of related nodes, wherein the one or more sequences of instructions, when executed by the one or more processors, further cause the one or more processors to perform: determining a set of related terms, each term of the set of related terms associated with a node of the set of related nodes; determining that a query is associated with at least one term of the set of related terms; in response to determining that the query is related to the at least one term of the set of related terms, storing a second information that indicates the query is associated with at least one other term of the set of related terms. | 0.554622 |
9,922,026 | 1 | 6 | 1. A system for processing a report, comprising a reference description detector for processing a natural language textual report to detect a description of a reference to at least part of a data object, wherein the description is expressed in natural language as a part of the natural language textual report; an associating unit for generating an association between the description of the reference and said at least part of the data object; and a description interpreter for interpreting the detected description of the reference, to obtain a normalized representation of the reference, wherein the description interpreter comprises a view parameter extraction unit for extracting a view parameter indicative of a view of the data object from the description of the reference. | 1. A system for processing a report, comprising a reference description detector for processing a natural language textual report to detect a description of a reference to at least part of a data object, wherein the description is expressed in natural language as a part of the natural language textual report; an associating unit for generating an association between the description of the reference and said at least part of the data object; and a description interpreter for interpreting the detected description of the reference, to obtain a normalized representation of the reference, wherein the description interpreter comprises a view parameter extraction unit for extracting a view parameter indicative of a view of the data object from the description of the reference. 6. The system according to claim 1 , wherein the data object comprises an image dataset, and wherein the description interpreter comprises an object description extraction unit for extracting a description of an object that is graphically represented by the image dataset. | 0.576324 |
7,509,330 | 1 | 15 | 1. A computer readable storage medium having stored thereon a system for application-layer monitoring of communication between one or more database clients and one or more database servers, the system comprising: one or more decoders residing at a decoding layer above a network layer, the decoders residing on a database device at a first network location between one or more database clients residing at one or more second network locations distinct from the first network location and one or more database servers residing at one or more third network locations distinct from both the first network location and the one or more second network locations, the decoders on the database device being operable to: receive database messages communicated over the network from any of the database clients residing at the one or more second network locations and intended for any of the database servers at the one or more third network locations and database messages communicated from the database servers and intended for the database clients; decode the database messages, wherein decoding the database messages comprises decoding a protocol generated as an output of a database connectivity driver in response to an input by a database application residing at an application layer, wherein decoding the database messages comprises decoding database messages of database implementations different from each other and, wherein the database connectivity driver is utilized by the one or more database clients to communicate with the database server; and extract query-language statements from the database messages, wherein the query-language statements are created by the database application at one or more of the database clients and provided as input to the database connectivity driver and the database connectivity driver generate the database message as an output based on the query-language statement; and a monitoring application residing at an application layer above the decoding layer, the monitoring application residing on the database device at the first network location, the monitoring application being 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. | 1. A computer readable storage medium having stored thereon a system for application-layer monitoring of communication between one or more database clients and one or more database servers, the system comprising: one or more decoders residing at a decoding layer above a network layer, the decoders residing on a database device at a first network location between one or more database clients residing at one or more second network locations distinct from the first network location and one or more database servers residing at one or more third network locations distinct from both the first network location and the one or more second network locations, the decoders on the database device being operable to: receive database messages communicated over the network from any of the database clients residing at the one or more second network locations and intended for any of the database servers at the one or more third network locations and database messages communicated from the database servers and intended for the database clients; decode the database messages, wherein decoding the database messages comprises decoding a protocol generated as an output of a database connectivity driver in response to an input by a database application residing at an application layer, wherein decoding the database messages comprises decoding database messages of database implementations different from each other and, wherein the database connectivity driver is utilized by the one or more database clients to communicate with the database server; and extract query-language statements from the database messages, wherein the query-language statements are created by the database application at one or more of the database clients and provided as input to the database connectivity driver and the database connectivity driver generate the database message as an output based on the query-language statement; and a monitoring application residing at an application layer above the decoding layer, the monitoring application residing on the database device at the first network location, the monitoring application being 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. 15. The system of claim 1 , further comprising a database message interface residing at the network layer and at the first network location, the database message interface being operable to: receive frames of database messages from the clients and the database servers and write the frames to memory at the first network location for processing at the decoders; and communicate frames of database messages from memory at the first network location to the clients and the database servers without assembling the frames. | 0.826408 |
9,679,546 | 3 | 4 | 3. The method of claim 2 , further comprising transforming the audio data into the plurality of electrical driving signals by obtaining audio data in a prescribed format; organizing the audio data into 4 tracks representing vocals, drums, guitars, and bass; mapping each of the four tracks to one of the plurality of different regions of the vest; and using each of the respective tracks of data to drive the motors in the corresponding region. | 3. The method of claim 2 , further comprising transforming the audio data into the plurality of electrical driving signals by obtaining audio data in a prescribed format; organizing the audio data into 4 tracks representing vocals, drums, guitars, and bass; mapping each of the four tracks to one of the plurality of different regions of the vest; and using each of the respective tracks of data to drive the motors in the corresponding region. 4. The method of claim 3 , wherein the prescribed format is a MIDI (Musical Instrument Digital Interface) format. | 0.5 |
5,557,722 | 1 | 11 | 1. A data processing system for randomly accessing and formatting a portion of an electronically published document having fixed text content and fixed structure defined by descriptive markup defining a plurality of hierarchical elements, wherein each element except a root element has an ancestor element and a type name and at least one element has text content, the data processing system comprising: means for storing a format specification for each type name utilized for elements in the electronically published document, wherein the format specification for a type name defines appearance of the text content of the elements in the electronically published document having the type name, and wherein the means for storing is separate from the electronically published document; means for receiving an indication of a starting point within the electronically published document; means for selecting a starting point element within the electronically published document according to the received indication of the starting point; means for selecting elements of the electronically published document beginning with the selected starting point element; means for identifying any ancestor elements of the selected elements; and means for formatting the text content of each selected element according to a combination of the format specifications for the type names of ancestor elements identified for the selected element and for the type name of the selected element. | 1. A data processing system for randomly accessing and formatting a portion of an electronically published document having fixed text content and fixed structure defined by descriptive markup defining a plurality of hierarchical elements, wherein each element except a root element has an ancestor element and a type name and at least one element has text content, the data processing system comprising: means for storing a format specification for each type name utilized for elements in the electronically published document, wherein the format specification for a type name defines appearance of the text content of the elements in the electronically published document having the type name, and wherein the means for storing is separate from the electronically published document; means for receiving an indication of a starting point within the electronically published document; means for selecting a starting point element within the electronically published document according to the received indication of the starting point; means for selecting elements of the electronically published document beginning with the selected starting point element; means for identifying any ancestor elements of the selected elements; and means for formatting the text content of each selected element according to a combination of the format specifications for the type names of ancestor elements identified for the selected element and for the type name of the selected element. 11. The data processing system of claim 1 wherein an element may have a security attribute and wherein the means for formatting the text content of each selected element omits the selected element if the selected element has a security attribute. | 0.791525 |
8,732,479 | 10 | 13 | 10. At least one non-transitory computer readable storage medium encoded with processor-executable instructions that, when executed by at least one processor of a client system, perform a method for backing up a user file, the instructions comprising instructions for: A) generating, via the at least one processor of the client system, a plurality of file segments each corresponding to a portion of the user file; B) encrypting, via the at least one processor, each of the plurality of file segments; C) determining, via the at least one processor, destination mapping information for each of the plurality of encrypted file segments, the destination mapping information comprising a location address in storage of a second system, different from the client system, where the corresponding encrypted file segment will be stored; D) updating, via the at least one processor, a backup status file associated with the user file with the plurality of destination mapping information for each of the corresponding plurality of encrypted file segments; E) transmitting the plurality of encrypted file segments to the second system for backup, while keeping metadata of the user file at the client device in the backup status file; and F) subsequently retrieving the plurality of encrypted file segments from the second system for restoration, the encrypted file segments requested via the mapping information and storage identifying information in the backup status file, the metadata used to structurally reconstruct the client file system. | 10. At least one non-transitory computer readable storage medium encoded with processor-executable instructions that, when executed by at least one processor of a client system, perform a method for backing up a user file, the instructions comprising instructions for: A) generating, via the at least one processor of the client system, a plurality of file segments each corresponding to a portion of the user file; B) encrypting, via the at least one processor, each of the plurality of file segments; C) determining, via the at least one processor, destination mapping information for each of the plurality of encrypted file segments, the destination mapping information comprising a location address in storage of a second system, different from the client system, where the corresponding encrypted file segment will be stored; D) updating, via the at least one processor, a backup status file associated with the user file with the plurality of destination mapping information for each of the corresponding plurality of encrypted file segments; E) transmitting the plurality of encrypted file segments to the second system for backup, while keeping metadata of the user file at the client device in the backup status file; and F) subsequently retrieving the plurality of encrypted file segments from the second system for restoration, the encrypted file segments requested via the mapping information and storage identifying information in the backup status file, the metadata used to structurally reconstruct the client file system. 13. The computer readable storage medium of claim 10 , further comprising instructions for updating the backup status file with size information of each of the plurality of file segments. | 0.809572 |
9,298,826 | 6 | 10 | 6. A system for matching users among social networking environments, the system comprising: a bus; a computer-readable storage device coupled to the bus; a processor coupled to the bus; program instructions, stored on the computer-readable storage device for execution by the processor, to receive one or more goals from a querying user and store the one or more goals in an electronic storage medium; program instructions, stored on the computer-readable storage device for execution by the processor, to provide one or more selection criteria to the querying user, the selection criteria relating to attributes of a desired set of candidate users to collaborate with the querying user to collaborate with the querying user; program instructions, stored on the computer-readable storage device for execution by the processor, to receive a response to at least one of the one or more selection criteria and store the response in the electronic storage medium; program instructions, stored on the computer-readable storage device, for execution by the processor, to receive, from the querying user, a desired degree of social network separation between the querying user and the desired set of candidate users to collaborate with the querying user in achieving the one or more goals; program instructions, stored on the computer-readable storage device for execution by the processor, to weight one or more selection criteria relative to one another; program instructions, stored on the computer-readable storage device for execution by the processor, to prioritize the one or more selection criteria based on a corresponding weight derived from the weighting; program instructions, stored on the computer-readable storage device for execution by the processor, to search a set of social networks based on the set of goals, the prioritized selection criteria, and the desired degree of social network separation, for a set of candidate users to collaborate with the querying user in achieving the one or more goals; program instructions, stored on the computer-readable storage device for execution by the processor, to rank the set of candidate users based on a likelihood of each candidate user in the set of candidate users matching the set of goals and the response; and program instructions, stored on the computer-readable storage device for execution by the processor, to send a collaboration invitation to at least one candidate user in the set of candidate users matching the set of goals and the response; wherein the social networking environment comprises a set of nodes each corresponding to one user of a set of users, and each of the set of nodes being connected to other nodes of the set of nodes by at least one network to form the social networking environment; and wherein the desired degree of social network separation comprises a numerical indicator of a maximum number of connected nodes between a node corresponding to the querying user and a set of nodes corresponding to the set of candidate users. | 6. A system for matching users among social networking environments, the system comprising: a bus; a computer-readable storage device coupled to the bus; a processor coupled to the bus; program instructions, stored on the computer-readable storage device for execution by the processor, to receive one or more goals from a querying user and store the one or more goals in an electronic storage medium; program instructions, stored on the computer-readable storage device for execution by the processor, to provide one or more selection criteria to the querying user, the selection criteria relating to attributes of a desired set of candidate users to collaborate with the querying user to collaborate with the querying user; program instructions, stored on the computer-readable storage device for execution by the processor, to receive a response to at least one of the one or more selection criteria and store the response in the electronic storage medium; program instructions, stored on the computer-readable storage device, for execution by the processor, to receive, from the querying user, a desired degree of social network separation between the querying user and the desired set of candidate users to collaborate with the querying user in achieving the one or more goals; program instructions, stored on the computer-readable storage device for execution by the processor, to weight one or more selection criteria relative to one another; program instructions, stored on the computer-readable storage device for execution by the processor, to prioritize the one or more selection criteria based on a corresponding weight derived from the weighting; program instructions, stored on the computer-readable storage device for execution by the processor, to search a set of social networks based on the set of goals, the prioritized selection criteria, and the desired degree of social network separation, for a set of candidate users to collaborate with the querying user in achieving the one or more goals; program instructions, stored on the computer-readable storage device for execution by the processor, to rank the set of candidate users based on a likelihood of each candidate user in the set of candidate users matching the set of goals and the response; and program instructions, stored on the computer-readable storage device for execution by the processor, to send a collaboration invitation to at least one candidate user in the set of candidate users matching the set of goals and the response; wherein the social networking environment comprises a set of nodes each corresponding to one user of a set of users, and each of the set of nodes being connected to other nodes of the set of nodes by at least one network to form the social networking environment; and wherein the desired degree of social network separation comprises a numerical indicator of a maximum number of connected nodes between a node corresponding to the querying user and a set of nodes corresponding to the set of candidate users. 10. The system of claim 6 , further comprising program instructions, stored on the computer-readable storage device for execution by the processor, to connect the querying user and the least one candidate user in response to the sending of the set of collaboration invites. | 0.5 |
7,519,609 | 10 | 13 | 10. A method for exchanging XML data, comprising acts of: providing, by a data aggregator, a predetermined XML provider file structure to each of a plurality of content providers having proprietary content schemas, wherein the predetermined XML provider file structure has an XML schema that defines a structure of content provider files used to access content from the content providers according to the predetermined XML provider file structure; referencing content provider files of the content providers, wherein the content provider files of the content providers represent content of the content providers according to the predetermined XML provider file structure; and retrieving, from memory, content provider files of the content providers and importing content contained therein into the relational database system. | 10. A method for exchanging XML data, comprising acts of: providing, by a data aggregator, a predetermined XML provider file structure to each of a plurality of content providers having proprietary content schemas, wherein the predetermined XML provider file structure has an XML schema that defines a structure of content provider files used to access content from the content providers according to the predetermined XML provider file structure; referencing content provider files of the content providers, wherein the content provider files of the content providers represent content of the content providers according to the predetermined XML provider file structure; and retrieving, from memory, content provider files of the content providers and importing content contained therein into the relational database system. 13. The method as recited in claim 10 , wherein said instance file includes information from the proprietary content schema of a content provider that is queryable by users of said relational database system. | 0.537778 |
7,730,072 | 2 | 16 | 2. The computer readable storage medium as recited in claim 1 wherein said steps of identifying and detecting the second informational item includes identifying and detecting of a plurality of informational items. | 2. The computer readable storage medium as recited in claim 1 wherein said steps of identifying and detecting the second informational item includes identifying and detecting of a plurality of informational items. 16. The computer readable storage medium as recited in claim 2 , further comprising the step of merging the outputs of said algorithms. | 0.78013 |
9,965,502 | 15 | 16 | 15. A computer-readable storage medium storing a plurality of instructions for controlling a processor in an apparatus which manages a plurality of objects, each object including content data and metadata, the plurality of instructions comprising: generating an index for the objects, the index including a plurality of content properties including a first content property and a second content property, the first content property having a first name of the first content property and first expression information for extracting values from fields in the metadata of one or more of the objects, and the second content property having the first name and second expression information for extracting values from the fields in the metadata of one or more of the objects so that at least a portion of the index is deduplicated such that values for multiple relevant expressions are able to be returned for a single search request; and searching, upon receipt of a search request including the first name and a first value, the index for one or more objects that have at least one of: the first value in at least one of the fields identified based on the first expression information in the metadata, or the first value in at least one of the fields identified based on the second expression information in the metadata; and based on finding at least one match, returning an indication of at least one of the objects determined to include the first value in at least one of the fields identified in the metadata based on the first expression information or in at least one of the fields identified in the metadata based on the second expression information. | 15. A computer-readable storage medium storing a plurality of instructions for controlling a processor in an apparatus which manages a plurality of objects, each object including content data and metadata, the plurality of instructions comprising: generating an index for the objects, the index including a plurality of content properties including a first content property and a second content property, the first content property having a first name of the first content property and first expression information for extracting values from fields in the metadata of one or more of the objects, and the second content property having the first name and second expression information for extracting values from the fields in the metadata of one or more of the objects so that at least a portion of the index is deduplicated such that values for multiple relevant expressions are able to be returned for a single search request; and searching, upon receipt of a search request including the first name and a first value, the index for one or more objects that have at least one of: the first value in at least one of the fields identified based on the first expression information in the metadata, or the first value in at least one of the fields identified based on the second expression information in the metadata; and based on finding at least one match, returning an indication of at least one of the objects determined to include the first value in at least one of the fields identified in the metadata based on the first expression information or in at least one of the fields identified in the metadata based on the second expression information. 16. A computer-readable storage medium according to claim 15 , wherein the plurality of instructions further comprising: managing a content class having a plurality of content properties which includes the first content property and the second content property. | 0.589623 |
9,130,975 | 1 | 7 | 1. A method comprising: receiving at a macro recorder a request to start recording one or more communication exchanges between a web browser and a server; sending a communication from the web browser in a first format to the server, wherein the first format is at least one of a content format and a protocol, the first format is one of HTML and XHTML, and the first format comprises human-readable Application Programming Interface (API) documentation about a user interaction with the server; recording by the macro recorder at least part of the communication; receiving at the web browser a response to the communication sent from the server, the response being sent from the server and received at the web browser and the response comprising the first format and a second format, wherein the second format is at least one of a content format and a protocol and is different than the first format, and the second format is not parsable by the web browser, and the first format in combination with the second format describes the machine-readable API about the user interaction with the server; sending a request to send a response with a specific type of second format and determining from the specific type of second format in the response a computer language to normalize a representation of the response; parsing in a micro browser the response in the second format to produce the normalized representation of the response; and generating in the macro recorder, a macro, wherein the macro is created based on the at least part of the communication and the normalized representation of the response. | 1. A method comprising: receiving at a macro recorder a request to start recording one or more communication exchanges between a web browser and a server; sending a communication from the web browser in a first format to the server, wherein the first format is at least one of a content format and a protocol, the first format is one of HTML and XHTML, and the first format comprises human-readable Application Programming Interface (API) documentation about a user interaction with the server; recording by the macro recorder at least part of the communication; receiving at the web browser a response to the communication sent from the server, the response being sent from the server and received at the web browser and the response comprising the first format and a second format, wherein the second format is at least one of a content format and a protocol and is different than the first format, and the second format is not parsable by the web browser, and the first format in combination with the second format describes the machine-readable API about the user interaction with the server; sending a request to send a response with a specific type of second format and determining from the specific type of second format in the response a computer language to normalize a representation of the response; parsing in a micro browser the response in the second format to produce the normalized representation of the response; and generating in the macro recorder, a macro, wherein the macro is created based on the at least part of the communication and the normalized representation of the response. 7. The method of claim 1 , wherein the second format is a micro format, wherein the micro format is a format that is embedded within the first format, and wherein the parsing step normalizes the representation of the response by converting the micro format to one of JavaScript Object Notation, Resource Description Framework, Java, and C++. | 0.519718 |
8,375,067 | 24 | 25 | 24. The system according to claim 22 wherein the filtration module queries the job seeker for one or more reasons for elimination upon selection by the job seeker of a matching job to be eliminated. | 24. The system according to claim 22 wherein the filtration module queries the job seeker for one or more reasons for elimination upon selection by the job seeker of a matching job to be eliminated. 25. The system according to claim 24 wherein the one or more reasons are selected from a predetermined set of reasons displayed to the job seeker for selection. | 0.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.