sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
1. A system comprising: one or more processors; a distributed database configured with items of data, the distributed database storing information of a social networking system describing a plurality of existing users; a scripting language configured to extract data from the social networking system, the data extraction applying access control comprising privacy settings of each user of the social networking system, the privacy settings restricting the information about the user that is accessible to other users of the social networking system; and a structured query language interface for extracting information of the social networking system, the structured query language interface in communication with the scripting language, the structured query language interface configured to access database systems and further configured to receive a query over a network, to send the query to the scripting language, and to receive extracted data from the scripting language comprising the requested information subject to the privacy settings of users of the social networking system in response to the query, wherein the distributed database allows an addition by the social networking system of a new field or category of data to the plurality of existing users, the new field or category of data representing an attribute describing each user of the plurality of existing users and storing data directly received from one or more users of the social networking system rather than data derived from one or more existing fields of data; and wherein the structured query language is further configured to receive a request from an application or website maintained by a third party separate from the social networking system, the request identifying the new field or category of data, generate a response to the request comprising the new field or category of data, determine a format for the response to accommodate a database of the third party, convert the response into the determined format, and provide the response in the determined format to the third party. | 1. A system comprising: one or more processors; a distributed database configured with items of data, the distributed database storing information of a social networking system describing a plurality of existing users; a scripting language configured to extract data from the social networking system, the data extraction applying access control comprising privacy settings of each user of the social networking system, the privacy settings restricting the information about the user that is accessible to other users of the social networking system; and a structured query language interface for extracting information of the social networking system, the structured query language interface in communication with the scripting language, the structured query language interface configured to access database systems and further configured to receive a query over a network, to send the query to the scripting language, and to receive extracted data from the scripting language comprising the requested information subject to the privacy settings of users of the social networking system in response to the query, wherein the distributed database allows an addition by the social networking system of a new field or category of data to the plurality of existing users, the new field or category of data representing an attribute describing each user of the plurality of existing users and storing data directly received from one or more users of the social networking system rather than data derived from one or more existing fields of data; and wherein the structured query language is further configured to receive a request from an application or website maintained by a third party separate from the social networking system, the request identifying the new field or category of data, generate a response to the request comprising the new field or category of data, determine a format for the response to accommodate a database of the third party, convert the response into the determined format, and provide the response in the determined format to the third party. 7. The system of claim 1 , wherein the distributed database comprises a plurality of databases. | 0.531059 |
14. A method, comprising: at an electronic device having a touch-sensitive surface: displaying one or more views of a plurality of views, wherein: a first view of the one or more displayed views includes a plurality of gesture recognizers; the plurality of gesture recognizers in the first view includes one or more proxy gesture recognizers and one or more non-proxy gesture recognizers; each gesture recognizer indicates one of a plurality of predefined states; and a first proxy gesture recognizer in the first view has a state that corresponds to a state of a respective non-proxy gesture recognizer that is not in the first view; wherein the state of the first proxy gesture recognizer and the corresponding state of the respective non-proxy gesture recognizer are both selected from a same set of predefined states; detecting a sequence of one or more sub-events; delivering a respective sub-event to the respective non-proxy gesture recognizer that is not in the first view and at least a subset of the one or more non-proxy gesture recognizers in the first view; and processing the respective sub-event with at least one of the one or more non-proxy gesture recognizers in the first view in accordance with states of the first proxy gesture recognizer and at least the subset of the one or more non-proxy gesture recognizers in the first view. | 14. A method, comprising: at an electronic device having a touch-sensitive surface: displaying one or more views of a plurality of views, wherein: a first view of the one or more displayed views includes a plurality of gesture recognizers; the plurality of gesture recognizers in the first view includes one or more proxy gesture recognizers and one or more non-proxy gesture recognizers; each gesture recognizer indicates one of a plurality of predefined states; and a first proxy gesture recognizer in the first view has a state that corresponds to a state of a respective non-proxy gesture recognizer that is not in the first view; wherein the state of the first proxy gesture recognizer and the corresponding state of the respective non-proxy gesture recognizer are both selected from a same set of predefined states; detecting a sequence of one or more sub-events; delivering a respective sub-event to the respective non-proxy gesture recognizer that is not in the first view and at least a subset of the one or more non-proxy gesture recognizers in the first view; and processing the respective sub-event with at least one of the one or more non-proxy gesture recognizers in the first view in accordance with states of the first proxy gesture recognizer and at least the subset of the one or more non-proxy gesture recognizers in the first view. 23. The method of claim 14 , wherein: the one or more non-proxy gesture recognizers in the first view are associated with a software application; and the respective non-proxy gesture recognizer that is not in the first view is associated with system software that is distinct from the software application. | 0.575895 |
18. The method of processing a taxpayer source document of claim 17 further comprising correcting the extracted tax data from the electronic image of the taxpayer source document that are flagged. | 18. The method of processing a taxpayer source document of claim 17 further comprising correcting the extracted tax data from the electronic image of the taxpayer source document that are flagged. 19. The method of processing a taxpayer source document of claim 18 further comprising: verifying and correcting the extracted tax data from the electronic image of the taxpayer source document that are flagged; assigning unassociated images of the taxpayer source documents to parent taxpayer source documents; determining which electronic images of the taxpayer source documents are superseded; determining which electronic images of the taxpayer source documents are duplicates; determining which electronic images of the taxpayer source documents are new taxpayer source documents; and supplementing the proforma data with tax data extracted from the electronic image of the taxpayer source documents. | 0.799154 |
6. The method of claim 5 , wherein the plurality of message summaries comprise second information derived from a second message of a plurality of second messages associated with a second online forum that is different from the first online forum. | 6. The method of claim 5 , wherein the plurality of message summaries comprise second information derived from a second message of a plurality of second messages associated with a second online forum that is different from the first online forum. 7. The method of claim 6 , and further comprising preloading and initially hiding second additional information associated with the second message. | 0.939338 |
1. A method of fitting graphical objects within a plurality of separate graphical frames in a document, each frame being associated with at least one value associated with a fitting attribute for fitting one or more of the graphical objects in the frame, comprising: associating the separate frames within a group; using an algorithm to automatically determine an optimized at least one value, wherein using the algorithm comprises: determining a plurality of intermediate optimized values, wherein each intermediate optimized value is associated with a particular frame within the group; and selecting the optimized at least one value from said plurality of intermediate values; and applying the optimized at least one value to each frame in the group to fit one or more of the graphical objects in each of the frames without modifying the size of the frames in the group. | 1. A method of fitting graphical objects within a plurality of separate graphical frames in a document, each frame being associated with at least one value associated with a fitting attribute for fitting one or more of the graphical objects in the frame, comprising: associating the separate frames within a group; using an algorithm to automatically determine an optimized at least one value, wherein using the algorithm comprises: determining a plurality of intermediate optimized values, wherein each intermediate optimized value is associated with a particular frame within the group; and selecting the optimized at least one value from said plurality of intermediate values; and applying the optimized at least one value to each frame in the group to fit one or more of the graphical objects in each of the frames without modifying the size of the frames in the group. 2. The method of claim 1 , wherein said applying comprises: applying the optimized at least one value to a first frame in the group, and in response automatically applying the optimized at least one value to the other frames in the group. | 0.644376 |
1. A computer-implemented method for crawling through web-based forms, the method comprising: identifying, by a computer system, web-based forms to be searched, wherein the identified web-based forms comprise input fields, which are used to generate a corresponding database query to a content database; creating entries in a local form database for the identified web-based forms, wherein the created entries are used to generate subsequent searches in the content database; storing metadata about the identified web-based forms in the local form database, wherein the stored metadata are used to predict and map information associated with the identified web-based forms; receiving a user query, from a user; predicting a search class based on a probability that the predicted search class generates a structured query which corresponds to the received user query; selecting, by the computer system, at least one web-based form from the local form database based on the generated structured query, the predicted search class, and the stored metadata; presenting the user with at least one query-through link to the at least one selected web-base form; selecting a query-through link from the at least one presented query-through link; automatically submitting, by the computer system, a corresponding query to the content database through the selected web-based form corresponding to the selected query-through link. | 1. A computer-implemented method for crawling through web-based forms, the method comprising: identifying, by a computer system, web-based forms to be searched, wherein the identified web-based forms comprise input fields, which are used to generate a corresponding database query to a content database; creating entries in a local form database for the identified web-based forms, wherein the created entries are used to generate subsequent searches in the content database; storing metadata about the identified web-based forms in the local form database, wherein the stored metadata are used to predict and map information associated with the identified web-based forms; receiving a user query, from a user; predicting a search class based on a probability that the predicted search class generates a structured query which corresponds to the received user query; selecting, by the computer system, at least one web-based form from the local form database based on the generated structured query, the predicted search class, and the stored metadata; presenting the user with at least one query-through link to the at least one selected web-base form; selecting a query-through link from the at least one presented query-through link; automatically submitting, by the computer system, a corresponding query to the content database through the selected web-based form corresponding to the selected query-through link. 8. The method of claim 1 , wherein a given form generates values for output fields by: forming a database query from constants received through input fields of the given form; sending the database query to a database system; receiving a response from the database system; and outputting data returned in the response through output fields of the given form. | 0.574728 |
15. A computer program product stored in a computer readable device, comprising computer instructions that, when executed by an information handling system, causes the information handling system to copy records between tables in a relational database by performing actions comprising: receiving a Structured Query Language (SQL) table COPY statement, wherein the COPY statement is devoid of an INSERT clause and identifies a source table and a target table; retrieving a plurality of column names from a metadata corresponding to the source table; and generating an SQL statement, based upon the COPY statement, that includes an INSERT INTO clause pertaining to the target table and a SELECT clause pertaining to the source table, wherein the INSERT INTO clause includes a set of target column names corresponding to the plurality of column names, and wherein the SELECT clause includes a set of corresponding source column names. | 15. A computer program product stored in a computer readable device, comprising computer instructions that, when executed by an information handling system, causes the information handling system to copy records between tables in a relational database by performing actions comprising: receiving a Structured Query Language (SQL) table COPY statement, wherein the COPY statement is devoid of an INSERT clause and identifies a source table and a target table; retrieving a plurality of column names from a metadata corresponding to the source table; and generating an SQL statement, based upon the COPY statement, that includes an INSERT INTO clause pertaining to the target table and a SELECT clause pertaining to the source table, wherein the INSERT INTO clause includes a set of target column names corresponding to the plurality of column names, and wherein the SELECT clause includes a set of corresponding source column names. 19. The computer program product of claim 15 , wherein the COPY statement further identifies a ON ERROR clause, and wherein the actions further comprise: identifying one or more mismatches between the source table and the target table; and adjusting the generated SQL statement based on the ON ERROR clause and the identified mismatches. | 0.856802 |
5. A method of providing natural language support for users running queries against a database, comprising: providing a data abstraction model comprising a plurality of logical fields abstractly describing physical data residing in the database; providing translation information for the data abstraction model describing translations of each of the plurality of logical fields from a first natural language expression to two or more second natural language expressions; and displaying one of the second natural language expressions to a user, wherein which of the two or more second natural language expressions is displayed depends upon which natural language expression files are loaded to define a language resource component associated with the data abstraction model. | 5. A method of providing natural language support for users running queries against a database, comprising: providing a data abstraction model comprising a plurality of logical fields abstractly describing physical data residing in the database; providing translation information for the data abstraction model describing translations of each of the plurality of logical fields from a first natural language expression to two or more second natural language expressions; and displaying one of the second natural language expressions to a user, wherein which of the two or more second natural language expressions is displayed depends upon which natural language expression files are loaded to define a language resource component associated with the data abstraction model. 15. The method of claim 5 , further comprising: retrieving an abstract query expressed in the first natural language expression; translating the abstract query on the basis of the translation information to express the abstract query in the second natural language expression; and displaying the abstract query expressed in the second natural language expression. | 0.589064 |
13. A computing device comprising: a memory configured to store computer-executable instructions; and a processor in communication with the memory configured to execute the computer-executable instructions to at least: receive, at the computing device, a query submitted by a user, the query submitted with a keyword; determine the keyword for the item based at least in part on a parsing of the query; access an interaction history for a plurality of users in a data store, the interaction history correlating a past search query with a completed action by the plurality of users based at least in part on a plurality of previous interactions by the plurality of users, the plurality of previous interactions including interactions by the plurality of users with search results of the past search query that were provided by the electronic marketplace responsive to the keyword; determine a category of a plurality of different categories, the category being associated with the completed action identified in the interaction history; determine that a number of interactions associated with the category that correspond with the completed action identified in the interaction history is more than a threshold amount; correlate the category with a preferred layout stored in the data store; adjust a generic item search network page of the electronic marketplace to comprise attributes of the preferred layout; and enable to display to the user search results responsive to the query using the preferred layout and absent a redirection to a specific item search network page. | 13. A computing device comprising: a memory configured to store computer-executable instructions; and a processor in communication with the memory configured to execute the computer-executable instructions to at least: receive, at the computing device, a query submitted by a user, the query submitted with a keyword; determine the keyword for the item based at least in part on a parsing of the query; access an interaction history for a plurality of users in a data store, the interaction history correlating a past search query with a completed action by the plurality of users based at least in part on a plurality of previous interactions by the plurality of users, the plurality of previous interactions including interactions by the plurality of users with search results of the past search query that were provided by the electronic marketplace responsive to the keyword; determine a category of a plurality of different categories, the category being associated with the completed action identified in the interaction history; determine that a number of interactions associated with the category that correspond with the completed action identified in the interaction history is more than a threshold amount; correlate the category with a preferred layout stored in the data store; adjust a generic item search network page of the electronic marketplace to comprise attributes of the preferred layout; and enable to display to the user search results responsive to the query using the preferred layout and absent a redirection to a specific item search network page. 16. The computing device of claim 13 , wherein the preferred layout identifies an image aspect ratio, dimension, or resolution for one or more items to enable to display to the user as search results. | 0.63088 |
4. The method of claim 1 , wherein the comprehensiveness metric comprises a difficulty metric, wherein determining the value for the comprehensiveness metric comprises: mapping the sets of concepts to topics in the syllabus; for each given question in the question paper, building a tree of topics comprising a root node representing a central topic, at least one child node representing a topic having concepts that help in understanding concepts of the central topic, and at least one leaf node representing a topic having fundamental concepts; and determining a value of a difficulty metric for the given question to be equal to a depth of the tree. | 4. The method of claim 1 , wherein the comprehensiveness metric comprises a difficulty metric, wherein determining the value for the comprehensiveness metric comprises: mapping the sets of concepts to topics in the syllabus; for each given question in the question paper, building a tree of topics comprising a root node representing a central topic, at least one child node representing a topic having concepts that help in understanding concepts of the central topic, and at least one leaf node representing a topic having fundamental concepts; and determining a value of a difficulty metric for the given question to be equal to a depth of the tree. 5. The method of claim 4 , wherein determining the value for the comprehensiveness metric further comprises: building a forest of the trees corresponding to the questions of the question paper; and determining value of the difficulty metric for the question paper to be equal to a depth of the forest. | 0.881383 |
4. The system of claim 1 , wherein applying the first level of complexity of the machine learning model to the input value by applying at least one biased first level of complexity to the input value to generate at least one class label comprises: applying a negatively biased first level of complexity to the input value to generate a first class label; and applying a positively biased first level of complexity to the input value to generate a second class label. | 4. The system of claim 1 , wherein applying the first level of complexity of the machine learning model to the input value by applying at least one biased first level of complexity to the input value to generate at least one class label comprises: applying a negatively biased first level of complexity to the input value to generate a first class label; and applying a positively biased first level of complexity to the input value to generate a second class label. 6. The system of claim 4 , the operations further comprising: adjusting the negatively biased first level of complexity and/or the positively biased first level of complexity to modify a likelihood that the first level of complexity is able to classify the input value with a predetermined confidence level. | 0.804566 |
8. An apparatus, comprising: a processor configured to: identify at least one action as a predetermined command of a first computer operating language stored in the memory; identify at least one event in a next generation language data file corresponding to the predetermined command, wherein the next generation language is a different computer operating language than the first computer operating language; map the predetermined command of the first computer operating language to a corresponding protocol command of the next generation computer operating language via the at least one event identified; create a translation data file comprising at least one state that identifies the predetermined command and the at least one event corresponding to the at least one action; parse information comprising at least one character string from the at least one action; store the parsed information in the translation data file; and execute the corresponding protocol command when the at least one event matches the predetermined command. | 8. An apparatus, comprising: a processor configured to: identify at least one action as a predetermined command of a first computer operating language stored in the memory; identify at least one event in a next generation language data file corresponding to the predetermined command, wherein the next generation language is a different computer operating language than the first computer operating language; map the predetermined command of the first computer operating language to a corresponding protocol command of the next generation computer operating language via the at least one event identified; create a translation data file comprising at least one state that identifies the predetermined command and the at least one event corresponding to the at least one action; parse information comprising at least one character string from the at least one action; store the parsed information in the translation data file; and execute the corresponding protocol command when the at least one event matches the predetermined command. 13. The apparatus of claim 8 , wherein a format attribute of the at least one event is compared to the predetermined command to identify whether there is a match. | 0.653735 |
1. A computer-implemented method comprising: under control of a computing device executing specific computer-executable instructions, capturing, via an imaging device, an image including a subject; identifying, using pixel information of pixels included in the image, a portion of the image including the subject; identifying a facial feature of the subject included in the portion of the image; detecting a mood of the subject at a time that the image was captured based at least in part on the facial feature; identifying, using pixel information of pixels included in the portion of the image, a first configuration of an item shown in the portion of the image including the subject; identifying a second configuration of the item using the mood and the first configuration, wherein the first configuration identifies a first color for the item and the second configuration identifies a second color for the item; and causing an image of the item in the second configuration to be presented on a display. | 1. A computer-implemented method comprising: under control of a computing device executing specific computer-executable instructions, capturing, via an imaging device, an image including a subject; identifying, using pixel information of pixels included in the image, a portion of the image including the subject; identifying a facial feature of the subject included in the portion of the image; detecting a mood of the subject at a time that the image was captured based at least in part on the facial feature; identifying, using pixel information of pixels included in the portion of the image, a first configuration of an item shown in the portion of the image including the subject; identifying a second configuration of the item using the mood and the first configuration, wherein the first configuration identifies a first color for the item and the second configuration identifies a second color for the item; and causing an image of the item in the second configuration to be presented on a display. 2. The computer-implemented method of claim 1 , further comprising: generating additional mood data for the subject using at least a portion of an additional image including the subject, the additional mood data indicating an additional detected mood of the subject at a time that the additional image was captured; identifying, using pixel information of pixels included in the portion of the additional image, the first configuration of the item shown in the portion of the additional image including the subject; identifying a time difference between the time that the image was captured and the time that the additional image was captured; and generating a weighted detected mood using the mood, the additional mood data, and the time difference, wherein identifying the second configuration of the item further uses the weighted detected mood. | 0.5 |
6. A system comprising: a computing system comprising one or more hardware computing devices, said computing system configured to at least: access contextual information associated with a browse session for a user, wherein the contextual information includes one or more attributes indicative of a user browsing context for the browse session; determine the user browsing context with respect to items available from an electronic catalog based at least in part on the contextual information; generate a candidate list of candidate digital content recommendation items for the user such that the candidate list includes (i) one or more items from a watch list associated with the user and (ii) one or more additional items not in the watch list, the watch list indicative of one or more items added to the watch list and when the one or more items were added to the watch list; determine, based at least in part on an amount of time elapsed between (i) when a given item is added to the watch list and (ii) when the given item is watched, a time interval by which to filter the candidate list; remove one or more candidate items that do not satisfy the determined time interval from the candidate list; and output one or more digital content item recommendations from the candidate list that does not include the one or more removed candidate items. | 6. A system comprising: a computing system comprising one or more hardware computing devices, said computing system configured to at least: access contextual information associated with a browse session for a user, wherein the contextual information includes one or more attributes indicative of a user browsing context for the browse session; determine the user browsing context with respect to items available from an electronic catalog based at least in part on the contextual information; generate a candidate list of candidate digital content recommendation items for the user such that the candidate list includes (i) one or more items from a watch list associated with the user and (ii) one or more additional items not in the watch list, the watch list indicative of one or more items added to the watch list and when the one or more items were added to the watch list; determine, based at least in part on an amount of time elapsed between (i) when a given item is added to the watch list and (ii) when the given item is watched, a time interval by which to filter the candidate list; remove one or more candidate items that do not satisfy the determined time interval from the candidate list; and output one or more digital content item recommendations from the candidate list that does not include the one or more removed candidate items. 11. The system of claim 6 , wherein the computing system is further configured to: apply a respective weighting factor to each candidate item in the candidate list, based on the determined user browsing context, the determined time interval, and a time period associated with the candidate item; and reorder the candidate items in the candidate list based on the respective weighting factors. | 0.56956 |
1. A computer-implemented method for searching for documents, comprising: enabling a user to select a source document; receiving information for the source document, the information including at least one topic and a weight for each topic, where the topic relates to content of the source document, and the weight represents how strongly the topic is associated with the source document; accessing an index, stored in a memory, containing a plurality of topics and references to documents, each entry in the index storing a topic of the plurality of topics with a list of each of the documents containing the topic; selecting a set of documents by comparing the at least one topic of the source document to the entries of the index to obtain each list in the index that is stored with one or more entries in the index matching the at least one topic of the source document, each document of the set of documents having a respective document signature formed of at least one topic relating to content of the document and a weight for each topic; generating similarity scores based on the weight of a topic in the source document and a weight of the same topic in each document within the set of documents having that topic as indicated by the document signature; selecting a subset of documents from the set of documents based on the similarity scores; and outputting an identity of the subset of documents for display to the user. | 1. A computer-implemented method for searching for documents, comprising: enabling a user to select a source document; receiving information for the source document, the information including at least one topic and a weight for each topic, where the topic relates to content of the source document, and the weight represents how strongly the topic is associated with the source document; accessing an index, stored in a memory, containing a plurality of topics and references to documents, each entry in the index storing a topic of the plurality of topics with a list of each of the documents containing the topic; selecting a set of documents by comparing the at least one topic of the source document to the entries of the index to obtain each list in the index that is stored with one or more entries in the index matching the at least one topic of the source document, each document of the set of documents having a respective document signature formed of at least one topic relating to content of the document and a weight for each topic; generating similarity scores based on the weight of a topic in the source document and a weight of the same topic in each document within the set of documents having that topic as indicated by the document signature; selecting a subset of documents from the set of documents based on the similarity scores; and outputting an identity of the subset of documents for display to the user. 6. The method of claim 1 , wherein the subset comprises a cluster of documents associated with one or more best similarity scores. | 0.540532 |
1. A method of optimising Rate Distortion Optimisation candidate assessment in hardware apparatus, comprising: determining which Rate Distortion Optimisation candidates out of a plurality of candidates are separately processable, wherein the candidates are partitions of a picture; determining a processing delay of critical portions of candidate assessment hardware, wherein the critical portions of candidate processing hardware include a Rate Distortion Optimization Best Candidate Decision Block; a Motion Vector Predictor Calculation Block; and a Sum and Langrangian Multiplication Block; determining a rule set governing how the separately processable candidates may be ordered for processing, wherein the rule set for ordering the separately processable candidates depends on the input video resolution; determining an optimised processing order for processing the separately processable candidate assessments, dependent on the processing delay of critical portions of the candidate assessment hardware and the determined rule set; spending enough clock cycles processing other candidates in between partitions of the same size, such that the best candidate for a given partition can be set in time to calculate a motion vector difference (MVD) bit cost (RMV) for the next partition; and processing the candidates according to the determined processing order. | 1. A method of optimising Rate Distortion Optimisation candidate assessment in hardware apparatus, comprising: determining which Rate Distortion Optimisation candidates out of a plurality of candidates are separately processable, wherein the candidates are partitions of a picture; determining a processing delay of critical portions of candidate assessment hardware, wherein the critical portions of candidate processing hardware include a Rate Distortion Optimization Best Candidate Decision Block; a Motion Vector Predictor Calculation Block; and a Sum and Langrangian Multiplication Block; determining a rule set governing how the separately processable candidates may be ordered for processing, wherein the rule set for ordering the separately processable candidates depends on the input video resolution; determining an optimised processing order for processing the separately processable candidate assessments, dependent on the processing delay of critical portions of the candidate assessment hardware and the determined rule set; spending enough clock cycles processing other candidates in between partitions of the same size, such that the best candidate for a given partition can be set in time to calculate a motion vector difference (MVD) bit cost (RMV) for the next partition; and processing the candidates according to the determined processing order. 9. The method of claim 1 , wherein the apparatus is pipelined. | 0.689575 |
6. The virtual world processing apparatus of claim 3 , wherein the sensor generates the first metadata by encoding the information relating to sensor capability into a binary format, and transmits the binary-encoded first metadata to the adaptation RV unit. | 6. The virtual world processing apparatus of claim 3 , wherein the sensor generates the first metadata by encoding the information relating to sensor capability into a binary format, and transmits the binary-encoded first metadata to the adaptation RV unit. 7. The virtual world processing apparatus of claim 6 , wherein the binary-encoded first metadata comprises binary encoding syntax, a number of bits of attributes of the binary encoding syntax, and a mnemonic of the attributes. | 0.868786 |
3. The method of claim 2 , wherein the index file includes the header, the method further comprising adding a time stamp to the header. | 3. The method of claim 2 , wherein the index file includes the header, the method further comprising adding a time stamp to the header. 4. The method of claim 3 , further comprising: determining if the static XML document has been modified, comprising comparing the time stamp in the header to a time reference in the XML document. | 0.887601 |
8. The method of claim 1 , wherein performing one or more sub-microsearches comprises searching an index for parameter patterns and/or alternatives. | 8. The method of claim 1 , wherein performing one or more sub-microsearches comprises searching an index for parameter patterns and/or alternatives. 10. The method of claim 8 , wherein searching an index comprises searching for index entries that index combinations of parameter patterns and/or alternatives. | 0.960887 |
12. A method for identifying information about a particular entity comprising: providing a request to one or more data sources using one or more search terms to acquire electronic documents having unstructured text, that are selected based on the one or more search terms from a plurality of terms related to the particular entity; tokenizing the acquired documents to form a data matrix; calculating a plurality of eigenvectors, using the data matrix and the transpose of the data matrix; acquiring a variance for determining the amount of intra-clustering between the documents; and clustering the acquired documents using some of the eigenvectors and the variance. | 12. A method for identifying information about a particular entity comprising: providing a request to one or more data sources using one or more search terms to acquire electronic documents having unstructured text, that are selected based on the one or more search terms from a plurality of terms related to the particular entity; tokenizing the acquired documents to form a data matrix; calculating a plurality of eigenvectors, using the data matrix and the transpose of the data matrix; acquiring a variance for determining the amount of intra-clustering between the documents; and clustering the acquired documents using some of the eigenvectors and the variance. 17. The method of claim 12 , wherein calculating a plurality of eigenvectors, using the data matrix and the transpose of the data matrix comprises: constructing a guess eigenvector to a distributed matrix, wherein the distributed matrix is related to the data matrix and the transpose of the data matrix; partitioning the guess eigenvector into one or more sub-vectors; distributing the one or more sub-vectors to one or more server slaves that contain at least one tokenized electronic document; acquiring from the one or more server slaves, a second vector that corresponds to the multiplication of the sub-vector that was distributed to the server slave with the tokenized electronic document contained on that server slave; assembling the acquired vectors into a single reconstituted vector; determining whether the reconstituted vector is an eigenvector of the distributed matrix; and providing the reconstituted vector if it is an eigenvector of the distributed matrix. | 0.557227 |
2. One or more computing devices as recited in claim 1 , the acts further comprising identifying a characteristic, other than the voice signature of the second voice command, associated with the second voice command, and wherein determining to cause performance of the second operation or refrain from causing performance of the second operation is based at least in part on comparing the characteristic to a characteristic associated with the first voice command. | 2. One or more computing devices as recited in claim 1 , the acts further comprising identifying a characteristic, other than the voice signature of the second voice command, associated with the second voice command, and wherein determining to cause performance of the second operation or refrain from causing performance of the second operation is based at least in part on comparing the characteristic to a characteristic associated with the first voice command. 3. One or more computing devices as recited in claim 2 , wherein the characteristic comprises one or more of: a grammar of the second voice command or a time of day at which the second voice command is uttered. | 0.870425 |
14. The method of claim 10 , further comprising: extracting a plurality of features from the video sample. | 14. The method of claim 10 , further comprising: extracting a plurality of features from the video sample. 16. The method of claim 14 , further comprising: generating a plurality of classification scores based on the plurality of features determined employing a plurality of models; and associating the video sample with the video category label based on the plurality of features and the plurality of classification scores. | 0.829399 |
1. An attribute-assigning image-processing system comprising: a distributed computing system that includes multiple computer systems, each having one or more processors, one or more memories, one or more mass-storage devices, and one or more network interconnections; an input-image memory for receiving an input image provided by one or more of the multiple computer systems; a set of first-level feature detectors, provided by one or more of the multiple computer systems, that detect face-containing subimages within the input image and, for each face-containing subimage, generate a set of normalized regions; a set of second-level feature detectors that generate a set of feature vectors from each normalized region; a set of attribute classifiers that each outputs an attribute value and an associated probability that reflects a likelihood that the attribute value returned in response to input of one or more feature vectors reflects the attribute value that would be assigned to the image of the facial feature contained in the normalized region from which the set of second-level feature detectors produced the input feature vectors; and a controller that submits the input image to the first-level feature detectors in order to generate sets of normalized regions for each face-containing subimage in the input image; submits each set of normalized regions to generate a set of feature vectors; and submits subsets of feature vectors to each attribute classifier in an ordered list of attribute classifiers to assign attributes to each face-containing subimage. | 1. An attribute-assigning image-processing system comprising: a distributed computing system that includes multiple computer systems, each having one or more processors, one or more memories, one or more mass-storage devices, and one or more network interconnections; an input-image memory for receiving an input image provided by one or more of the multiple computer systems; a set of first-level feature detectors, provided by one or more of the multiple computer systems, that detect face-containing subimages within the input image and, for each face-containing subimage, generate a set of normalized regions; a set of second-level feature detectors that generate a set of feature vectors from each normalized region; a set of attribute classifiers that each outputs an attribute value and an associated probability that reflects a likelihood that the attribute value returned in response to input of one or more feature vectors reflects the attribute value that would be assigned to the image of the facial feature contained in the normalized region from which the set of second-level feature detectors produced the input feature vectors; and a controller that submits the input image to the first-level feature detectors in order to generate sets of normalized regions for each face-containing subimage in the input image; submits each set of normalized regions to generate a set of feature vectors; and submits subsets of feature vectors to each attribute classifier in an ordered list of attribute classifiers to assign attributes to each face-containing subimage. 16. The attribute-assigning image-processing system of claim 1 wherein attribute classifiers are applied in order of decreasing reliability. | 0.610064 |
18. A system according to claim 14 wherein said nodes are established by selecting a predetermined number of the highest letter a posteriori probabilities that correspond to said signals. | 18. A system according to claim 14 wherein said nodes are established by selecting a predetermined number of the highest letter a posteriori probabilities that correspond to said signals. 20. A system according to claim 18 wherein access to said trie structure at each node of said trellis or graph structure is enhanced by mounting a vector of pointers for accessing said trie structure at a desired location. | 0.902364 |
1. A method of creating and editing of a dashboard using a computer system, comprising: transforming data extracted from a data repository to generate read-only pre-packaged data sets for querying; storing the read-only pre-packaged data sets in a general-purpose distributed memory caching system associated with the computer system; receiving, in a dashboard editing mode, a selection of a second panel to add to the dashboard, wherein: the second panel provides a visual representation of data, from the data repository, in a graph; the dashboard includes (i) faceted first panels including filtering controls and (ii) selection controls; the faceted first panels provide a visual representation of data, from the data repository, in a chart, such that each faceted first panel, of the faceted first panels, (i) presents one or more segments of a category from data in the data repository and (ii) associates at least one of the one or more segments with a filtering control that can be linked to a facet property; and an activated facet property of a faceted first panel, of the faceted first panels, causes one or more other faceted first panels to share and be responsive to signals from both (i) the filtering control included in the faceted first panel and (ii) the selection controls; activating a facet property of the second panel to link a selection of data visually displayed in the second panel to the signals from both (i) the filtering control included in the faceted first panel and (ii) the selection controls; identifying a user selection of the filtering control included in the faceted first panel; executing a query on the read-only pre-packaged data sets stored in the general-purpose distributed memory caching system based at least in part on the user selection; and populating the second panel using results of the executed query without requiring a user to exit the dashboard editing mode, wherein the selection controls, the filtering control included in the faceted first panel and a filtering control displayed by the one or more other faceted first panels are simultaneously presented for interaction by user selection, and wherein the filtering control included in the faceted first panel applies a filter to adjust (i) the filtering control of the one or more other faceted first panels to provide interactive visual representations of the one or more segments displayed by at least one chart of the one or more other faceted first panels, and (ii) a visual representation of the graph displayed by the second panel. | 1. A method of creating and editing of a dashboard using a computer system, comprising: transforming data extracted from a data repository to generate read-only pre-packaged data sets for querying; storing the read-only pre-packaged data sets in a general-purpose distributed memory caching system associated with the computer system; receiving, in a dashboard editing mode, a selection of a second panel to add to the dashboard, wherein: the second panel provides a visual representation of data, from the data repository, in a graph; the dashboard includes (i) faceted first panels including filtering controls and (ii) selection controls; the faceted first panels provide a visual representation of data, from the data repository, in a chart, such that each faceted first panel, of the faceted first panels, (i) presents one or more segments of a category from data in the data repository and (ii) associates at least one of the one or more segments with a filtering control that can be linked to a facet property; and an activated facet property of a faceted first panel, of the faceted first panels, causes one or more other faceted first panels to share and be responsive to signals from both (i) the filtering control included in the faceted first panel and (ii) the selection controls; activating a facet property of the second panel to link a selection of data visually displayed in the second panel to the signals from both (i) the filtering control included in the faceted first panel and (ii) the selection controls; identifying a user selection of the filtering control included in the faceted first panel; executing a query on the read-only pre-packaged data sets stored in the general-purpose distributed memory caching system based at least in part on the user selection; and populating the second panel using results of the executed query without requiring a user to exit the dashboard editing mode, wherein the selection controls, the filtering control included in the faceted first panel and a filtering control displayed by the one or more other faceted first panels are simultaneously presented for interaction by user selection, and wherein the filtering control included in the faceted first panel applies a filter to adjust (i) the filtering control of the one or more other faceted first panels to provide interactive visual representations of the one or more segments displayed by at least one chart of the one or more other faceted first panels, and (ii) a visual representation of the graph displayed by the second panel. 10. The method of claim 1 , wherein populating the second panel using results of the executed query further comprises: determining an animation sequence based at least in part on the results of the executed query; and transforming the visual representation of data of the second panel from a first visualization option to a second visualization option using the determined animation sequence. | 0.592005 |
1. A computer-implemented method for generating a search term comprising: in a computer system: a. defining a profile based on a selection made by a user; b. getting a text object, wherein the text object contains a plurality of text items, at least one of the plurality of text items comprising a text item pointed to by a Universal Resource Locator (URL); c. selecting at least one, but not all of the text items based on the profile; d. parsing only the selected text items to generate the search term; and e. creating a search based on the search term and a selection of a search engine made by the user. | 1. A computer-implemented method for generating a search term comprising: in a computer system: a. defining a profile based on a selection made by a user; b. getting a text object, wherein the text object contains a plurality of text items, at least one of the plurality of text items comprising a text item pointed to by a Universal Resource Locator (URL); c. selecting at least one, but not all of the text items based on the profile; d. parsing only the selected text items to generate the search term; and e. creating a search based on the search term and a selection of a search engine made by the user. 9. The method of claim 1 , further comprising the steps of sending the search term to the search engine and generating search results in the search engine based on the search term. | 0.686082 |
14. The system of claim 13 , where the logic further causes the processor to: find multiple GUI object interaction paths that identify API calls that perform actions on the sequential GUI objects; validate useable GUI object interaction paths from the multiple GUI object interaction paths that control the actions performed on the sequential GUI objects; and determine a number of GUI object interactions in each of the useable GUI object interaction paths. | 14. The system of claim 13 , where the logic further causes the processor to: find multiple GUI object interaction paths that identify API calls that perform actions on the sequential GUI objects; validate useable GUI object interaction paths from the multiple GUI object interaction paths that control the actions performed on the sequential GUI objects; and determine a number of GUI object interactions in each of the useable GUI object interaction paths. 16. The system of claim 14 , where the logic further causes the processor to: select from the useable GUI object interaction paths, a first path selected having the greatest number of GUI object interactions of the useable GUI object interaction paths. | 0.916988 |
1. A system comprising: one or more processors; and a modeling component executed by the one or more processors to: receive accented speech data for a word; generate, for the word, a parse table that includes a plurality of levels, each level corresponding to a different respective subword type and including one or more subwords of the respective subword type; determine, based at least on the accented speech data, a set of probabilities at each level of the parse table, each probability of the set of probabilities for a particular level being associated with a respective subword of the one or more subwords of the particular level; and combine the sets of probabilities to generate a model for accented speech recognition, wherein the model provides a probability of occurrence for each of one or more phone sequences corresponding to a mispronunciation of the word. | 1. A system comprising: one or more processors; and a modeling component executed by the one or more processors to: receive accented speech data for a word; generate, for the word, a parse table that includes a plurality of levels, each level corresponding to a different respective subword type and including one or more subwords of the respective subword type; determine, based at least on the accented speech data, a set of probabilities at each level of the parse table, each probability of the set of probabilities for a particular level being associated with a respective subword of the one or more subwords of the particular level; and combine the sets of probabilities to generate a model for accented speech recognition, wherein the model provides a probability of occurrence for each of one or more phone sequences corresponding to a mispronunciation of the word. 9. The system of claim 1 , wherein combining the sets employs a weighted linear combination. | 0.632964 |
1. A method for hierarchical database compression, comprising: applying, by a database management unit, a first level of a first type of compression to a first partition of a column of a database and storing data generated from applying the first level of the first type of compression to the first partition in a memory buffer external to the database; and applying, by the database management unit, a second level of the first type of compression to a subset of the data, wherein the first level of the first type of compression comprises a first first-level dictionary and the second level of the first type of compression comprises a first second-level dictionary, and wherein a code size of the first first-level dictionary is larger than a code size of the first second-level dictionary, wherein applying the second level of the first type of compression further comprises: adding a first data entry to a set of data corresponding to a page of the database; determining an amount of space saved by applying the second level of the first type of compression to the set of data; determining a size of the first second-level dictionary corresponding to the first type of compression; based on determining that the amount of space is larger than the size of the first second-level dictionary, adding a second data entry to the set of data corresponding to the page; determining, based on the adding of the second data entry to the set of data, that there is a change to at least one of size of the first second-level dictionary and the code size of the first second-level dictionary; calculating a size of the page based on the determined change; determining that the page is full based on the calculated size of the page; removing the second data entry from the set of data corresponding to the page; applying the second level of the first type of compression without the determined change to the set of data corresponding to the page; performing predicate evaluation on the subset of the first partition by converting a predicate value into a compressed predicate value using the first first-level dictionary and the first second-level dictionary, and comparing the predicate value directly to compressed data in the subset of the first partition, wherein the compressed data is compressed using the first level and the second level of the first type of compression; performing join/groupby processing on the subset of the first partition by converting of second-level codes to first-level codes using the first second-level dictionary, and performing the join/groupby processing on the first-level codes; and performing expression evaluation on the subset of the first partition by converting second-level codes to uncompressed data using the first first-level dictionary and the first second-level dictionary. | 1. A method for hierarchical database compression, comprising: applying, by a database management unit, a first level of a first type of compression to a first partition of a column of a database and storing data generated from applying the first level of the first type of compression to the first partition in a memory buffer external to the database; and applying, by the database management unit, a second level of the first type of compression to a subset of the data, wherein the first level of the first type of compression comprises a first first-level dictionary and the second level of the first type of compression comprises a first second-level dictionary, and wherein a code size of the first first-level dictionary is larger than a code size of the first second-level dictionary, wherein applying the second level of the first type of compression further comprises: adding a first data entry to a set of data corresponding to a page of the database; determining an amount of space saved by applying the second level of the first type of compression to the set of data; determining a size of the first second-level dictionary corresponding to the first type of compression; based on determining that the amount of space is larger than the size of the first second-level dictionary, adding a second data entry to the set of data corresponding to the page; determining, based on the adding of the second data entry to the set of data, that there is a change to at least one of size of the first second-level dictionary and the code size of the first second-level dictionary; calculating a size of the page based on the determined change; determining that the page is full based on the calculated size of the page; removing the second data entry from the set of data corresponding to the page; applying the second level of the first type of compression without the determined change to the set of data corresponding to the page; performing predicate evaluation on the subset of the first partition by converting a predicate value into a compressed predicate value using the first first-level dictionary and the first second-level dictionary, and comparing the predicate value directly to compressed data in the subset of the first partition, wherein the compressed data is compressed using the first level and the second level of the first type of compression; performing join/groupby processing on the subset of the first partition by converting of second-level codes to first-level codes using the first second-level dictionary, and performing the join/groupby processing on the first-level codes; and performing expression evaluation on the subset of the first partition by converting second-level codes to uncompressed data using the first first-level dictionary and the first second-level dictionary. 3. The method of claim 1 , wherein the first type of compression comprises dictionary coding, wherein the first second-level dictionary comprises bidirectional mappings between first-level codes and second-level codes, and wherein: compressing data in the subset of the first partition comprises converting the data into first-level codes using the first first-level dictionary, and converting the first-level codes into second-level codes using the first second-level dictionary; and wherein decoding data in the subset of the first partition comprises converting second-level codes into first level-codes using the first second-level dictionary, and converting first-level codes into the data using the first first-level dictionary. | 0.580479 |
10. A computer system for automatic interpretation of system data utilized to create a policy document, said system comprising: a processor; and program code on a computer readable medium and which is executed by the processor to complete the automatic interpretation of system data utilized to create the policy document, said program code comprising: program code for tracking events occurring on a system represented by system data said events including known events represented within the policy document and unknown events; program code for filtering through each unknown event; program code for storing said unknown events in a database of unknown events, wherein only unknown events, separate from known events, are stored in the database of unknown events; program code for analyzing said unknown events within said database; program code for identifying trends within said database of unknown events based on a historical treatment of said unknown events; program code for selectively determining which unknown events among all of the unknown events should be considered for inclusion in said policy document; and program code for updating the policy document with event examples associated with the unknown events selected for inclusion. | 10. A computer system for automatic interpretation of system data utilized to create a policy document, said system comprising: a processor; and program code on a computer readable medium and which is executed by the processor to complete the automatic interpretation of system data utilized to create the policy document, said program code comprising: program code for tracking events occurring on a system represented by system data said events including known events represented within the policy document and unknown events; program code for filtering through each unknown event; program code for storing said unknown events in a database of unknown events, wherein only unknown events, separate from known events, are stored in the database of unknown events; program code for analyzing said unknown events within said database; program code for identifying trends within said database of unknown events based on a historical treatment of said unknown events; program code for selectively determining which unknown events among all of the unknown events should be considered for inclusion in said policy document; and program code for updating the policy document with event examples associated with the unknown events selected for inclusion. 11. The system of claim 10 , further comprising: program code for outputting suggested elements from said database for inclusion in said policy documents, wherein said suggested elements are selected and outputted by a software-implemented process. | 0.5 |
7. A computing device for translating user keywords into semantic queries, comprising at least one processor operatively coupled to a memory storing instructions which when executed by the at least one processor cause the at least one processor to: receive keywords; search the conceptual model to identify one or more concepts relevant to the keywords; transform at least a portion of the conceptual model into a connected graph; automatically generate, without user input, at least one path through the connected graph using at least one path expansion rule, the at least one path connecting the one or more concepts; identify and rank facets that support incremental user navigation from nodes of convergence in the at least one path, wherein the facets are generated at least in part by indexing a number of distinct values for attributes of the one or more concepts; generate at least one structured semantic query from the at least one path with the identified and ranked facets; and execute the at least one structure semantic query on a semantic repository. | 7. A computing device for translating user keywords into semantic queries, comprising at least one processor operatively coupled to a memory storing instructions which when executed by the at least one processor cause the at least one processor to: receive keywords; search the conceptual model to identify one or more concepts relevant to the keywords; transform at least a portion of the conceptual model into a connected graph; automatically generate, without user input, at least one path through the connected graph using at least one path expansion rule, the at least one path connecting the one or more concepts; identify and rank facets that support incremental user navigation from nodes of convergence in the at least one path, wherein the facets are generated at least in part by indexing a number of distinct values for attributes of the one or more concepts; generate at least one structured semantic query from the at least one path with the identified and ranked facets; and execute the at least one structure semantic query on a semantic repository. 12. The computing device according to claim 7 , wherein the at least one path expansion rule is a self-loop, a path-loop, or a subsumed-loopor requires applying cardinalities to relations between concepts. | 0.838167 |
13. A system comprising: at least one processor; and at least one memory, wherein the at least one processor and the at least one memory are configured to perform operations comprising: receiving an input representative of a temporal constraint for a task of a graph-process model, the temporal constraint defining at least one of a commencement delay, a completion delay, a commencement deadline, and a completion deadline; associating the task with the temporal constraint created based on the received input, the temporal constraint defined to have a placement on the task of the graph-process model based on a type of temporal constraint, wherein the placement of the temporal constraint is based on a graphical element, the graphical element comprising a left border, a right border, a top border and a bottom border, wherein the left border is configured to accept placement of the temporal constraint when the temporal constraint corresponds to the commencement delay, wherein the right border is configured to accept placement of the temporal constraint when the temporal constraint corresponds to the completion delay, wherein the top border is configured to accept placement of the temporal constraint when the temporal constraint corresponds to the commencement deadline, and wherein the bottom border is configured to accept placement of the temporal constraint when the temporal constraint corresponds to the completion deadline; and providing the task and the temporal constraint to configure the graph-process model. | 13. A system comprising: at least one processor; and at least one memory, wherein the at least one processor and the at least one memory are configured to perform operations comprising: receiving an input representative of a temporal constraint for a task of a graph-process model, the temporal constraint defining at least one of a commencement delay, a completion delay, a commencement deadline, and a completion deadline; associating the task with the temporal constraint created based on the received input, the temporal constraint defined to have a placement on the task of the graph-process model based on a type of temporal constraint, wherein the placement of the temporal constraint is based on a graphical element, the graphical element comprising a left border, a right border, a top border and a bottom border, wherein the left border is configured to accept placement of the temporal constraint when the temporal constraint corresponds to the commencement delay, wherein the right border is configured to accept placement of the temporal constraint when the temporal constraint corresponds to the completion delay, wherein the top border is configured to accept placement of the temporal constraint when the temporal constraint corresponds to the commencement deadline, and wherein the bottom border is configured to accept placement of the temporal constraint when the temporal constraint corresponds to the completion deadline; and providing the task and the temporal constraint to configure the graph-process model. 15. The system of claim 13 further comprising: providing the task and the temporal constraint to the user interface for presentation. | 0.530488 |
14. One or more tangible, non-transitory computer-readable storage mediums having stored thereon instructions that, when executed, instruct a processor to provide an input verification engine (IVE) within a trusted execution environment (TEE), the IVE including a secure network stack configured to provide encrypted communication and validate packets, the IVE operable for: provisioning a binary translation engine within the TEE, the binary translation engine comprising an interpreter or virtual machine configured to receive a binary object in a first format not suitable for execution on a computing system, and translate the binary object into a second format suitable for execution on the computing system; receiving an input for the binary translation engine; validating the input via the secure network stack without exposing the input outside of the TEE; and exporting the input to an application outside of the TEE. | 14. One or more tangible, non-transitory computer-readable storage mediums having stored thereon instructions that, when executed, instruct a processor to provide an input verification engine (IVE) within a trusted execution environment (TEE), the IVE including a secure network stack configured to provide encrypted communication and validate packets, the IVE operable for: provisioning a binary translation engine within the TEE, the binary translation engine comprising an interpreter or virtual machine configured to receive a binary object in a first format not suitable for execution on a computing system, and translate the binary object into a second format suitable for execution on the computing system; receiving an input for the binary translation engine; validating the input via the secure network stack without exposing the input outside of the TEE; and exporting the input to an application outside of the TEE. 16. The one or more tangible, non-transitory computer-readable mediums of claim 14 , wherein exporting the input further comprises signing the input with a key of the TEE. | 0.562943 |
11. A nametag embodied in a distributed computer system, the nametag comprising at least one logical item name field holding a logical item name, at least one corresponding volatile copy item name field, and at least two corresponding nonvolatile copy item name fields. | 11. A nametag embodied in a distributed computer system, the nametag comprising at least one logical item name field holding a logical item name, at least one corresponding volatile copy item name field, and at least two corresponding nonvolatile copy item name fields. 14. The nametag of claim 11 , further comprising a chronological or sequence number value indicating when at least one value in at least one item name field becomes or became invalid. | 0.518229 |
8. A system comprising: at least one hardware processor; at least one database environment, the database environment supporting triggers and foreign keys; at least one application program; and memory storing: a referential integrity metadata framework that: identifies classes in a hierarchy of objects, identifies, for each class, at least one identifying attribute of the class, identifies, for at least some classes, at least one relationship attribute for the class, and identifies, for each relationship attribute, a relationship with a corresponding identifying attribute in another class, and an initialization module configured to use the referential integrity metadata framework to: generate tables in the database environment based on the referential integrity metadata framework, each table corresponding to a class in the referential integrity metadata framework, generate primary keys for the tables based on the identifying attributes, generate referential integrity structures based on the relationship attributes, and generate at least one class-specific procedure for each class, the procedure for a class extracting a value for each identifying attribute and relationship attribute identified in the referential integrity metadata framework for the class, generate a data manipulation language statement using the extracted values, and issue the data manipulation language statement, wherein the at least one application program uses the database environment to persist entire object data documents in their entirety and enforce referential integrity in relationships between object data documents. | 8. A system comprising: at least one hardware processor; at least one database environment, the database environment supporting triggers and foreign keys; at least one application program; and memory storing: a referential integrity metadata framework that: identifies classes in a hierarchy of objects, identifies, for each class, at least one identifying attribute of the class, identifies, for at least some classes, at least one relationship attribute for the class, and identifies, for each relationship attribute, a relationship with a corresponding identifying attribute in another class, and an initialization module configured to use the referential integrity metadata framework to: generate tables in the database environment based on the referential integrity metadata framework, each table corresponding to a class in the referential integrity metadata framework, generate primary keys for the tables based on the identifying attributes, generate referential integrity structures based on the relationship attributes, and generate at least one class-specific procedure for each class, the procedure for a class extracting a value for each identifying attribute and relationship attribute identified in the referential integrity metadata framework for the class, generate a data manipulation language statement using the extracted values, and issue the data manipulation language statement, wherein the at least one application program uses the database environment to persist entire object data documents in their entirety and enforce referential integrity in relationships between object data documents. 15. The system of claim 8 , wherein the memory further stores instructions that, when executed by the at least one processor, cause the system to perform operations comprising: receiving a request from an application program to insert a new object data document; determining a class for the new object data document; and calling the class-specific procedure for the class of the new object data document, the class-specific procedure generating the data manipulation language statement that inserts the new object data document and extracted values as a row in a table in the database environment, the table corresponding to the class in the referential integrity metadata framework. | 0.5 |
11. One or more computer-readable storage devices storing computer-readable instructions that, when executed by a processing unit, cause the processing unit to perform the method of claim 7 . | 11. One or more computer-readable storage devices storing computer-readable instructions that, when executed by a processing unit, cause the processing unit to perform the method of claim 7 . 12. A system comprising the one or more computer-readable storage devices of claim 11 and the processing unit. | 0.958246 |
22. A computer readable medium having computer executable instructions for creating a hyperlinked table-of-contents in a frameset, comprising: creating the frameset having a TOC document and a target document, the target document being directly editable and including a preselected heading indicating a section in the target document; wherein the TOC documents is created in response to the target document such that the frameset displays both the TOC document and the target document from which the TOC is created; wherein the frameset is self-updating such that changes to the target document are automatically reflected within the TOC document; inserting a reference document field into the TOC document that is operative to set a pointer to the target document; inserting a TOC field into the TOC document that is operative to: scan the target document identified by the pointer to identify the preselected heading, create a first hyperlink entry in the TOC document that corresponds to the preselected heading, and insert a bookmark into the target document at a location proximate to the preselected heading, wherein the bookmark is associated with the first hyperlink entry; and automatically updating the TOC document without direct manual intervention to include a second hyperlink entry in the TOC document that corresponds to a new heading that is newly added to the target document in response to an update event; wherein the update event comprises one or more events comprising printing the TOC document; wherein the first hyperlink and the second hyperlink point to non-contiguous sections of the target document such that the first hyperlink and the second hyperlink point to different sections of the same document; wherein the first hyperlink and the second hyperlink are configured such that when each is selected the target document will scroll to a section of the target document associated with the selected hyperlink. | 22. A computer readable medium having computer executable instructions for creating a hyperlinked table-of-contents in a frameset, comprising: creating the frameset having a TOC document and a target document, the target document being directly editable and including a preselected heading indicating a section in the target document; wherein the TOC documents is created in response to the target document such that the frameset displays both the TOC document and the target document from which the TOC is created; wherein the frameset is self-updating such that changes to the target document are automatically reflected within the TOC document; inserting a reference document field into the TOC document that is operative to set a pointer to the target document; inserting a TOC field into the TOC document that is operative to: scan the target document identified by the pointer to identify the preselected heading, create a first hyperlink entry in the TOC document that corresponds to the preselected heading, and insert a bookmark into the target document at a location proximate to the preselected heading, wherein the bookmark is associated with the first hyperlink entry; and automatically updating the TOC document without direct manual intervention to include a second hyperlink entry in the TOC document that corresponds to a new heading that is newly added to the target document in response to an update event; wherein the update event comprises one or more events comprising printing the TOC document; wherein the first hyperlink and the second hyperlink point to non-contiguous sections of the target document such that the first hyperlink and the second hyperlink point to different sections of the same document; wherein the first hyperlink and the second hyperlink are configured such that when each is selected the target document will scroll to a section of the target document associated with the selected hyperlink. 23. The computer readable medium of claim 22 , wherein the update event comprises opening the TOC document. | 0.568234 |
1. A computer implemented method for process data management, wherein said method can be implemented on computers using the internet, intranet, wireless communication network or mobile devices, the method comprising: (a) displaying a set of natural language prompts related to a problem for each of a plurality of structured stages; (b) receiving input in response to the prompts; (c) using project stages as a reference system for interface design; and (d) supporting transaction and collaboration among a plurality of users. | 1. A computer implemented method for process data management, wherein said method can be implemented on computers using the internet, intranet, wireless communication network or mobile devices, the method comprising: (a) displaying a set of natural language prompts related to a problem for each of a plurality of structured stages; (b) receiving input in response to the prompts; (c) using project stages as a reference system for interface design; and (d) supporting transaction and collaboration among a plurality of users. 20. The method of claim 1 , wherein in the active mode, inputs are logged and operations can be performed on the inputs. | 0.686009 |
7. The method of claim 6 , further comprising processing the information obtained from the marking to validate the completeness of the document collation within the enclosure. | 7. The method of claim 6 , further comprising processing the information obtained from the marking to validate the completeness of the document collation within the enclosure. 11. The method of claim 7 , further comprising: associating an enclosure with a document collation; and marking the enclosure with an enclosure identification mark that is readable through an enclosure that visually obscures the enclosure mark. | 0.931102 |
11. An apparatus comprising processing circuitry configured to: select a transform by receiving a data set comprising a plurality of input strings entered at a particular organization, process the data set using at least two different transforms each of which defines a corresponding transform rule for transforming free text into a corresponding translated value, compare results of the processing for each of the at least two different transforms to the rational range, discount values in the results that are outside the rational range, and select, as the selected transform, one of the at least two different transforms that produced more results within the rational range than other transforms; receive an input string comprising a free text response indicative of a physiologic condition, wherein the free text response is entered by personnel at the organization; and apply the selected transform to the input string to transform the input string into a translated value indicative of a value associated with the physiologic condition for storage in a fact repository, wherein the processing circuitry is configured to apply the selected transform by transforming an initial representation of the input string to the translated value in a standard form of representation, wherein the selected transform is selected from a library of potential transforms by applying the at least two different transforms from the library to the data set and selecting the selected transform from among the library of potential transforms based on results of the selected transform applied to the data set encountered at the respective organization relative to the rational range defined by physiologic limits associated with the physiologic condition and in comparison to results obtained by application of other transforms from the library to the data set. | 11. An apparatus comprising processing circuitry configured to: select a transform by receiving a data set comprising a plurality of input strings entered at a particular organization, process the data set using at least two different transforms each of which defines a corresponding transform rule for transforming free text into a corresponding translated value, compare results of the processing for each of the at least two different transforms to the rational range, discount values in the results that are outside the rational range, and select, as the selected transform, one of the at least two different transforms that produced more results within the rational range than other transforms; receive an input string comprising a free text response indicative of a physiologic condition, wherein the free text response is entered by personnel at the organization; and apply the selected transform to the input string to transform the input string into a translated value indicative of a value associated with the physiologic condition for storage in a fact repository, wherein the processing circuitry is configured to apply the selected transform by transforming an initial representation of the input string to the translated value in a standard form of representation, wherein the selected transform is selected from a library of potential transforms by applying the at least two different transforms from the library to the data set and selecting the selected transform from among the library of potential transforms based on results of the selected transform applied to the data set encountered at the respective organization relative to the rational range defined by physiologic limits associated with the physiologic condition and in comparison to results obtained by application of other transforms from the library to the data set. 13. The apparatus of claim 11 , wherein the processing circuitry is further configured to apply a different transform to a data set to compare results generated by the different transform to results generated using the selected transform to evaluate the selected transform. | 0.842677 |
20. A system comprising: at least one processor; memory storing a voiceprint; and a computer-readable medium including instructions which, when executed by the at least one processor, causes: while a device is in a locked state, receiving non-voice authentication information from a user to put the device into an unlocked state; receiving, at the device, a first speech input from the user; in response to authenticating that the user is an authorized user of the device, transmitting the first speech input to a voiceprint service for generating a voiceprint based on the first speech input; receiving a second speech input at the device while the device is in a locked state, the second speech input including a command associated with a restricted feature of the device; determining whether the second speech input was spoken by an authorized user of the device, the determining including comparing the second speech input to the generated voiceprint; while comparing the second speech input to the voiceprint, processing the second speech input to identify the command; and upon determining that the second speech input was spoken by the authorized user, providing access to the restricted feature of the device according to the command included in the second speech input. | 20. A system comprising: at least one processor; memory storing a voiceprint; and a computer-readable medium including instructions which, when executed by the at least one processor, causes: while a device is in a locked state, receiving non-voice authentication information from a user to put the device into an unlocked state; receiving, at the device, a first speech input from the user; in response to authenticating that the user is an authorized user of the device, transmitting the first speech input to a voiceprint service for generating a voiceprint based on the first speech input; receiving a second speech input at the device while the device is in a locked state, the second speech input including a command associated with a restricted feature of the device; determining whether the second speech input was spoken by an authorized user of the device, the determining including comparing the second speech input to the generated voiceprint; while comparing the second speech input to the voiceprint, processing the second speech input to identify the command; and upon determining that the second speech input was spoken by the authorized user, providing access to the restricted feature of the device according to the command included in the second speech input. 21. The system of claim 20 , wherein the voiceprint is a text-independent voiceprint. | 0.621944 |
19. A method implemented on a computing device, the method comprising: in a graph database, generating a first query vertex comprising a first traversal clause that represents a first query of the graph database, wherein the first traversal clause identifies a vertex type; generating a first edge from a user's vertex to the first query vertex, wherein the generated first edge defines the user's permission to access a first set of vertices of the vertex type; in the graph database, generating a second query vertex comprising a second traversal clause that represents a second query of the graph database, wherein the second traversal clause identifies the vertex type; generating a second edge from the user's vertex to the second query vertex, wherein the generated second edge defines the user's permission to access a second set of vertices of the vertex type; traversing the graph database to locate each vertex of the first set of vertices that is semantically related to the user's vertex; traversing the graph database to locate each vertex of the second set of vertices that is semantically related to the user's vertex, wherein the second set of vertices and the first set of vertices share at least one common vertex; for the at least one common vertex, comparing the permission defined by the first edge and the permission defined by the second edge; and based on a result of the comparison, granting, to the user, either the permission defined by the first edge or the permission defined by the second edge to access to the at least one common vertex. | 19. A method implemented on a computing device, the method comprising: in a graph database, generating a first query vertex comprising a first traversal clause that represents a first query of the graph database, wherein the first traversal clause identifies a vertex type; generating a first edge from a user's vertex to the first query vertex, wherein the generated first edge defines the user's permission to access a first set of vertices of the vertex type; in the graph database, generating a second query vertex comprising a second traversal clause that represents a second query of the graph database, wherein the second traversal clause identifies the vertex type; generating a second edge from the user's vertex to the second query vertex, wherein the generated second edge defines the user's permission to access a second set of vertices of the vertex type; traversing the graph database to locate each vertex of the first set of vertices that is semantically related to the user's vertex; traversing the graph database to locate each vertex of the second set of vertices that is semantically related to the user's vertex, wherein the second set of vertices and the first set of vertices share at least one common vertex; for the at least one common vertex, comparing the permission defined by the first edge and the permission defined by the second edge; and based on a result of the comparison, granting, to the user, either the permission defined by the first edge or the permission defined by the second edge to access to the at least one common vertex. 21. The method of claim 19 , further comprising: granting, to the user, the permission defined by the first edge to access the remaining data in the first set of vertices; and granting, to the user, the permission defined by the second edge to access the remaining data in the second set of vertices. | 0.600295 |
40. The computationally-implemented method of claim 33 , wherein said testing an availability of the adaptation data by comparing a property of the adaptation data located at the referenced location with an expected value of the property of the adaptation data comprises: checking the availability of the adaptation data by comparing the property of the adaptation data located at the referenced location with the expected value of the property of the adaptation data. | 40. The computationally-implemented method of claim 33 , wherein said testing an availability of the adaptation data by comparing a property of the adaptation data located at the referenced location with an expected value of the property of the adaptation data comprises: checking the availability of the adaptation data by comparing the property of the adaptation data located at the referenced location with the expected value of the property of the adaptation data. 47. The computationally-implemented method of claim 40 , wherein said checking the availability of the adaptation data by comparing the property of the adaptation data located at the referenced location with the expected value of the property of the adaptation data comprises: checking the availability of the adaptation data based on whether the adaptation data is currently at the referenced location through a comparison of the property of the adaptation data located at the referenced location with an expected value of the property of the adaptation data. | 0.894452 |
27. The system as described in claim 21 , the PQ processing unit further comprising computer readable instructions stored in the computer memory for execution by a processor for determining a monetary value of the patent document as a product of a normalized value of said PQ index equal to (PQ−PQ min )/(PQ max −PQ max ) and a monetary value of an Etalon Patent (EP) under current market conditions, the EP being devoted to the same problem as the patent document and characterized by the same set of patent indices, values of all patent indices of the EP being equal to respective maximal values for the patent indices. | 27. The system as described in claim 21 , the PQ processing unit further comprising computer readable instructions stored in the computer memory for execution by a processor for determining a monetary value of the patent document as a product of a normalized value of said PQ index equal to (PQ−PQ min )/(PQ max −PQ max ) and a monetary value of an Etalon Patent (EP) under current market conditions, the EP being devoted to the same problem as the patent document and characterized by the same set of patent indices, values of all patent indices of the EP being equal to respective maximal values for the patent indices. 30. The system as described in claim 27 , further comprising a visualization unit comprising computer readable instructions stored in the computer memory for visualizing said PQ index or the monetary value of the patent document by providing a correspondence between the value of said PQ index or the monetary value of the patent document and a mixture of one or more colors of a visible part of light spectrum. | 0.802253 |
14. Apparatus as recited in claim 10, wherein said compiling means comprises: means, performed by the computer, for recognizing said at least one statement comprising a data declaration extension requesting a Year 2000 solution; means, performed by the computer, for recognizing at least one source program statement which involves the processing of date items in data fields affected by said data declaration extension; and means, performed by the computer, for generating object program instructions for performing operations on data fields associated with the data declaration extension in a manner that employs the requested Year 2000 solution. | 14. Apparatus as recited in claim 10, wherein said compiling means comprises: means, performed by the computer, for recognizing said at least one statement comprising a data declaration extension requesting a Year 2000 solution; means, performed by the computer, for recognizing at least one source program statement which involves the processing of date items in data fields affected by said data declaration extension; and means, performed by the computer, for generating object program instructions for performing operations on data fields associated with the data declaration extension in a manner that employs the requested Year 2000 solution. 15. Apparatus as recited in claim 14, wherein said data declaration extension comprises a Year 2000 solution attribute and wherein said apparatus further comprises means, performed by the computer, for recording said Year 2000 solution attribute in a compiler program symbol table. | 0.801209 |
11. A method for ranking search results, the method comprising: discovering a plurality of documents stored on one or more computing devices in a network of computing devices; recording document and link information for each of the plurality of documents; generating a representation of the network from the document and link information, wherein the representation of the network includes a plurality of nodes, each document being represented by one of the plurality of nodes; receiving manually input click distances designating a subset of the plurality of nodes as highest authority nodes, the subset of the plurality of nodes including at least a first highest authority node and a second highest authority node, wherein the manually input click distances indicate a relative importance of each highest authority node with respect to other highest authority nodes; initializing click distances for a second subset of the plurality of nodes to a maximum value, the second subset of the plurality of nodes not including the highest authority nodes and comprising at least a first non-highest authority node and a second non-highest authority node; computing click distances for the first and second non-highest authority nodes by: determining a first click distance for the first non-highest authority node, the first click distance being a first number of branches traversed on a first shortest path between the first non-highest authority node and the first highest authority node; determining a second click distance for the first non-highest authority node, the second click distance being a second number of branches traversed on a second shortest path between the first non-highest authority node and the second highest authority node; determining a third click distance for the second non-highest authority node, the third click distance being a third number of branches traversed on a third shortest path between the second non-highest authority node and the first highest authority node; and determining a fourth distance for the second non-highest authority node, the fourth click distance being a fourth number of branches traversed on a fourth shortest path between the second non-highest authority node and the second highest authority node; storing the first, second, third, and fourth click distances in memory on a computing device in the network, such that the first and second click distances are associated with a first document, and the third and fourth click distances are associated with a second document; calculating search rank results using at least one of the first, second, third, and fourth click distances associated with each of the first and second documents as a query-independent relevance measure in ranking the plurality of documents; and storing the search rank results in the memory on the computing device. | 11. A method for ranking search results, the method comprising: discovering a plurality of documents stored on one or more computing devices in a network of computing devices; recording document and link information for each of the plurality of documents; generating a representation of the network from the document and link information, wherein the representation of the network includes a plurality of nodes, each document being represented by one of the plurality of nodes; receiving manually input click distances designating a subset of the plurality of nodes as highest authority nodes, the subset of the plurality of nodes including at least a first highest authority node and a second highest authority node, wherein the manually input click distances indicate a relative importance of each highest authority node with respect to other highest authority nodes; initializing click distances for a second subset of the plurality of nodes to a maximum value, the second subset of the plurality of nodes not including the highest authority nodes and comprising at least a first non-highest authority node and a second non-highest authority node; computing click distances for the first and second non-highest authority nodes by: determining a first click distance for the first non-highest authority node, the first click distance being a first number of branches traversed on a first shortest path between the first non-highest authority node and the first highest authority node; determining a second click distance for the first non-highest authority node, the second click distance being a second number of branches traversed on a second shortest path between the first non-highest authority node and the second highest authority node; determining a third click distance for the second non-highest authority node, the third click distance being a third number of branches traversed on a third shortest path between the second non-highest authority node and the first highest authority node; and determining a fourth distance for the second non-highest authority node, the fourth click distance being a fourth number of branches traversed on a fourth shortest path between the second non-highest authority node and the second highest authority node; storing the first, second, third, and fourth click distances in memory on a computing device in the network, such that the first and second click distances are associated with a first document, and the third and fourth click distances are associated with a second document; calculating search rank results using at least one of the first, second, third, and fourth click distances associated with each of the first and second documents as a query-independent relevance measure in ranking the plurality of documents; and storing the search rank results in the memory on the computing device. 16. The method of claim 11 wherein the relevance score is offset by a Uniform Resource Locator depth property that smoothes an effect of a click distance on the scoring function when a click distance for a node is disproportionate to a depth of the node in the representation of the network. | 0.590367 |
1. A method comprising: at an electronic device with a display and a battery: receiving a first portion of text for a search query; in response to receiving the first portion of the text: displaying, on the display, a first set of localized results retrieved based on the first portion of text without displaying remote search results from a remote search engine; while displaying the first set of localized results, receiving a second portion of text for the search query; in response to receiving the second portion of the text: in accordance with a determination that the first portion of text and the second portion of text together include more than a predetermined number of characters, wherein the predetermined number of characters is greater than 1 and is based on a low battery charge state of the battery, concurrently displaying, on the display, a plurality of results that include: a set of results received from a remote search engine; and a second set of localized results associated with one or more applications retrieved based on the first portion of the text and the second portion of the text. | 1. A method comprising: at an electronic device with a display and a battery: receiving a first portion of text for a search query; in response to receiving the first portion of the text: displaying, on the display, a first set of localized results retrieved based on the first portion of text without displaying remote search results from a remote search engine; while displaying the first set of localized results, receiving a second portion of text for the search query; in response to receiving the second portion of the text: in accordance with a determination that the first portion of text and the second portion of text together include more than a predetermined number of characters, wherein the predetermined number of characters is greater than 1 and is based on a low battery charge state of the battery, concurrently displaying, on the display, a plurality of results that include: a set of results received from a remote search engine; and a second set of localized results associated with one or more applications retrieved based on the first portion of the text and the second portion of the text. 2. The method of claim 1 , wherein an application of the one or more applications is a map applet, and in response to selection of a respective result in the first set of localized results, displaying a map showing a location that corresponds to the respective result. | 0.790498 |
13. The method of claim 1 , wherein the collaborative user feedback is based on user actions. | 13. The method of claim 1 , wherein the collaborative user feedback is based on user actions. 14. The method of claim 13 , wherein the user actions operate on at least one of: suggested collaborative notes, user notes, user corrections, user pauses. | 0.946078 |
19. A non-transitory, computer readable medium that comprises a computer readable program to integrate legacy COBOL data structures to object instances for object-oriented computer systems, wherein the computer readable program when executed on a computer transforms the computer into a machine and causes the computer to perform: receiving a copybook selection and dynamic COBOL construct criteria; importing a copybook from a database, the copybook corresponding with a set of common business oriented language (COBOL) data stored in the database that includes a REDEFINE clause; creating an object model for the copybook; storing the object model in a model library; receiving the set of COBOL data; retrieve the object model; forming, based at least in part on the set of COBOL data, an object instance that is equivalent to the set of COBOL data, the object instance including one or more representations for a complete set of one or more properties included in the REDEFINE clause without requiring custom coding for the forming of the object instance; identifying an instance of the REDEFINE clause; and automatically forming the REDEFINE clause as an object instance. | 19. A non-transitory, computer readable medium that comprises a computer readable program to integrate legacy COBOL data structures to object instances for object-oriented computer systems, wherein the computer readable program when executed on a computer transforms the computer into a machine and causes the computer to perform: receiving a copybook selection and dynamic COBOL construct criteria; importing a copybook from a database, the copybook corresponding with a set of common business oriented language (COBOL) data stored in the database that includes a REDEFINE clause; creating an object model for the copybook; storing the object model in a model library; receiving the set of COBOL data; retrieve the object model; forming, based at least in part on the set of COBOL data, an object instance that is equivalent to the set of COBOL data, the object instance including one or more representations for a complete set of one or more properties included in the REDEFINE clause without requiring custom coding for the forming of the object instance; identifying an instance of the REDEFINE clause; and automatically forming the REDEFINE clause as an object instance. 20. The non-transitory, computer readable medium of claim 19 wherein the computer readable program when executed on the computer further causes the computer to perform: generating an interface for receiving dynamic COBOL construct criteria; receiving the dynamic COBOL construct criteria; and providing the dynamic COBOL construct criteria to a client computer system interface. | 0.665041 |
52. A computer program product for automatically evaluating Bayesian network models for decision support, as set forth in claim 51 , wherein the outputted representation is a complete representation of probabilities of states for all conclusions given a particular set of combinations of conclusion states. | 52. A computer program product for automatically evaluating Bayesian network models for decision support, as set forth in claim 51 , wherein the outputted representation is a complete representation of probabilities of states for all conclusions given a particular set of combinations of conclusion states. 54. A computer program product for automatically evaluating Bayesian network models for decision support as set forth in claim 52 , wherein the outputted representation is a matrix of averages of probabilities of the conclusion states for implicated conclusions versus a selected set of combinations of conclusion states; whereby a user can determine an accuracy of the BN model's propensity to yield proper conclusions. | 0.842881 |
32. A method of sentence extraction from at least one natural language text using a graph, comprising: selecting, using the processing unit, a plurality of sentences from said at least one natural language text; associating, using the processing unit, the plurality of sentences with a plurality of graph nodes so that each graph node is associated with one of the plurality of sentences selected from said at least one natural language text; determining, using the processing unit, at least one connecting relation between at least two of the plurality of sentences; associating, using the processing unit, the at least one connecting relation with at least one graph edge connecting at least two of the plurality of graph nodes; constructing, using the processing unit, a graph using only the plurality of graph nodes that are associated with one of the text units selected from said at least one natural language text and said at least one graph edge; ranking, using the processing unit, the plurality of graph nodes by applying a graph-based ranking algorithm to the graph; and selecting, using the processing unit, at least one of the plurality of sentences based on the plurality of text units and the plurality of rankings. | 32. A method of sentence extraction from at least one natural language text using a graph, comprising: selecting, using the processing unit, a plurality of sentences from said at least one natural language text; associating, using the processing unit, the plurality of sentences with a plurality of graph nodes so that each graph node is associated with one of the plurality of sentences selected from said at least one natural language text; determining, using the processing unit, at least one connecting relation between at least two of the plurality of sentences; associating, using the processing unit, the at least one connecting relation with at least one graph edge connecting at least two of the plurality of graph nodes; constructing, using the processing unit, a graph using only the plurality of graph nodes that are associated with one of the text units selected from said at least one natural language text and said at least one graph edge; ranking, using the processing unit, the plurality of graph nodes by applying a graph-based ranking algorithm to the graph; and selecting, using the processing unit, at least one of the plurality of sentences based on the plurality of text units and the plurality of rankings. 33. The method of claim 32 , wherein determining at least one connecting relation between at least two of the plurality of sentences comprises determining at least one connecting relation based upon a similarity relation between the at least two of the plurality of sentences. | 0.641811 |
16. The method of claim 8 , further comprising: receiving a document editing request; updating the parallel data structure based on the received document editing request; and modifying only document content sections corresponding to the received document edit request. | 16. The method of claim 8 , further comprising: receiving a document editing request; updating the parallel data structure based on the received document editing request; and modifying only document content sections corresponding to the received document edit request. 17. The method of claim 16 , wherein the updating of the parallel data structure comprises: modifying only pagination selectors that correspond to the modified document content sections. | 0.787742 |
1. An apparatus comprising: at least one processor; a memory coupled to the at least one processor; a repository in the memory that includes a plurality of objects; and a content management system residing in the memory and executed by the at least one processor, the content management system comprising: a voidable link mechanism that upon initial reconstitution of a document in the repository, retrieves from the repository objects corresponding to original links in the document, stores values from the retrieved objects in corresponding fallback elements in the document, generates a list of original links and voidable links to objects referenced by the original links in the document, and replaces any original links in the document that are not voidable links with corresponding voidable links, wherein the voidable link mechanism, upon subsequent reconstitution of the document, determines the original links in the list, queries the repository to determine which of the objects corresponding to the original links in the list have not changed since the last reconstitution of the document, and for each object that has not changed since the last reconstitution of the document, the voidable link mechanism invalidates the corresponding voidable link. | 1. An apparatus comprising: at least one processor; a memory coupled to the at least one processor; a repository in the memory that includes a plurality of objects; and a content management system residing in the memory and executed by the at least one processor, the content management system comprising: a voidable link mechanism that upon initial reconstitution of a document in the repository, retrieves from the repository objects corresponding to original links in the document, stores values from the retrieved objects in corresponding fallback elements in the document, generates a list of original links and voidable links to objects referenced by the original links in the document, and replaces any original links in the document that are not voidable links with corresponding voidable links, wherein the voidable link mechanism, upon subsequent reconstitution of the document, determines the original links in the list, queries the repository to determine which of the objects corresponding to the original links in the list have not changed since the last reconstitution of the document, and for each object that has not changed since the last reconstitution of the document, the voidable link mechanism invalidates the corresponding voidable link. 2. The apparatus of claim 1 wherein the document is an XML document and the original links comprise XInclude elements in the XML document. | 0.647826 |
13. The computer storage media of claim 12 , wherein the revised snippet is provided by: selecting a snippet piece to append to the snippet, determining that the snippet piece is to be appended to the snippet, and appending the snippet piece to the snippet. | 13. The computer storage media of claim 12 , wherein the revised snippet is provided by: selecting a snippet piece to append to the snippet, determining that the snippet piece is to be appended to the snippet, and appending the snippet piece to the snippet. 14. The computer storage media of claim 13 , wherein determining that the snippet piece is to be appended to the snippet is performed based on a similarity score that reflects a similarity between the snippet and the snippet piece. | 0.918778 |
13. The system of claim 10, wherein an adaptive memory is used in selecting at least one variable of the selected constraint and selecting a new value for each selected variable, the adaptive memory comprising: a tabu mechanism that prevents variable changes in the current assignment from returning to variable values in at least some previous assignments; and a memory of prior value changes. | 13. The system of claim 10, wherein an adaptive memory is used in selecting at least one variable of the selected constraint and selecting a new value for each selected variable, the adaptive memory comprising: a tabu mechanism that prevents variable changes in the current assignment from returning to variable values in at least some previous assignments; and a memory of prior value changes. 17. The system of claim 13, wherein the current assignment is generated using a technique for Lagrangean relaxation. | 0.968165 |
11. A system comprising: a processor; and a memory, wherein the processor and the memory are configured to perform operations comprising: accepting a setting for a filter, the filter setting representing a type of information to be included in a list of object descriptions, the type corresponding to at least one of an end-user version of a software documentation or a technical version of the software documentation; accepting a setting for a flag of an object, the flag setting representing a category of documentation relevance for the object stored in a repository, the flag setting corresponding to at least one of a first indication that the object is relevant for the end-user version of the software documentation or a second indication that the object is relevant for the technical version of the software documentation, a third indication that the object is conditional upon the acceptance of another object for inclusion in the software documentation, and a fourth indication that the object is always relevant to generation of the software documentation; comparing the filter setting with the flag setting of the object to determine whether the object is to be included in the software documentation; extracting a description of the object from the repository, when the comparing indicates a match between the filter setting and the flag setting; and generating the list of object descriptions, the list including the description of the object; and generating the software documentation from the generated list of object description. | 11. A system comprising: a processor; and a memory, wherein the processor and the memory are configured to perform operations comprising: accepting a setting for a filter, the filter setting representing a type of information to be included in a list of object descriptions, the type corresponding to at least one of an end-user version of a software documentation or a technical version of the software documentation; accepting a setting for a flag of an object, the flag setting representing a category of documentation relevance for the object stored in a repository, the flag setting corresponding to at least one of a first indication that the object is relevant for the end-user version of the software documentation or a second indication that the object is relevant for the technical version of the software documentation, a third indication that the object is conditional upon the acceptance of another object for inclusion in the software documentation, and a fourth indication that the object is always relevant to generation of the software documentation; comparing the filter setting with the flag setting of the object to determine whether the object is to be included in the software documentation; extracting a description of the object from the repository, when the comparing indicates a match between the filter setting and the flag setting; and generating the list of object descriptions, the list including the description of the object; and generating the software documentation from the generated list of object description. 15. The system of claim 11 , wherein the accepting the setting for the filter further comprises: receiving, from a user interface, a selection of the filter setting. | 0.573488 |
5. A computer program on a computer usable medium containing a search engine for a hierarchial database comprising: view computer code for providing computer screen displays of two search classes, one of the displays of a class covering concept terms and the other of the displays a class covering terms for properties attributable to one of more of the concepts of the hierarchy for the selection, by a user, of one of the classes; dictionary computer code for establishing a third computer screen display for displaying a dictionary of the terms in the hierarchy that fall within a selected one of the two classes and creating a visualization of terms of the selected class for the choosing of search terms from the dictionary; and further dictionary computer code for associating in the third display the terms of the selected class with terms from a nonselected class which terms are related to the search terms for selecting of one of the associated terms as a further search term by the user. | 5. A computer program on a computer usable medium containing a search engine for a hierarchial database comprising: view computer code for providing computer screen displays of two search classes, one of the displays of a class covering concept terms and the other of the displays a class covering terms for properties attributable to one of more of the concepts of the hierarchy for the selection, by a user, of one of the classes; dictionary computer code for establishing a third computer screen display for displaying a dictionary of the terms in the hierarchy that fall within a selected one of the two classes and creating a visualization of terms of the selected class for the choosing of search terms from the dictionary; and further dictionary computer code for associating in the third display the terms of the selected class with terms from a nonselected class which terms are related to the search terms for selecting of one of the associated terms as a further search term by the user. 9. The user interface of claim 5 including selection means for selecting for viewing where a concept either contains the property declaration or the property constraint. | 0.552901 |
6. A computer program product comprising: one or more computer readable storage-media and program instructions stored on at least one of the one or more computer readable storage media, the program instructions comprising: program instructions to receive a dataset of information associated with a website, the information including a first list of users of the website and a list of content that each user posts, wherein each user is associated with one or more other users from the first list of users; program instructions to determine initial values representing variables of the dataset of information on the website, wherein the variables includes one or more topics for the list of content that each user from the first list of users posts on the website; program instructions to perform one or more iterations of Gibbs Sampling utilizing the initial values, wherein performing each of the one or more iterations assigns new values representing variables of the dataset; program instructions to determine that the one or more new values representing variables of the dataset represent a distribution of the one or more topics for the list of content that each user from the first list of users posts; program instructions to execute a topic specific search in a topic search engine based on the distribution of the one or more topics for the list of content that each user from the first list of users posts, the topic search providing a subset list of the first list of users representing influencers in a specific topic; program instructions to identify one or more topics in the list of content that each user of the first list of users posts on the website; program instructions to determine the one or more topics do not exist in the topic search engine; program instructions to create the one or more topics in the topic search engine; program instructions to identify a list of keywords in the list of content that each user from the first list of users posts on the website; and program instructions to consolidate the list of keywords. | 6. A computer program product comprising: one or more computer readable storage-media and program instructions stored on at least one of the one or more computer readable storage media, the program instructions comprising: program instructions to receive a dataset of information associated with a website, the information including a first list of users of the website and a list of content that each user posts, wherein each user is associated with one or more other users from the first list of users; program instructions to determine initial values representing variables of the dataset of information on the website, wherein the variables includes one or more topics for the list of content that each user from the first list of users posts on the website; program instructions to perform one or more iterations of Gibbs Sampling utilizing the initial values, wherein performing each of the one or more iterations assigns new values representing variables of the dataset; program instructions to determine that the one or more new values representing variables of the dataset represent a distribution of the one or more topics for the list of content that each user from the first list of users posts; program instructions to execute a topic specific search in a topic search engine based on the distribution of the one or more topics for the list of content that each user from the first list of users posts, the topic search providing a subset list of the first list of users representing influencers in a specific topic; program instructions to identify one or more topics in the list of content that each user of the first list of users posts on the website; program instructions to determine the one or more topics do not exist in the topic search engine; program instructions to create the one or more topics in the topic search engine; program instructions to identify a list of keywords in the list of content that each user from the first list of users posts on the website; and program instructions to consolidate the list of keywords. 9. The computer program product of claim 6 , wherein performing one or more iterations of Gibbs Sampling utilizing the initial values, further comprises program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to: perform a first iteration of Gibbs Sampling, wherein performing the first iteration assigns a first set of values as new values representing possible variables; and perform a second iteration of Gibbs Sampling, wherein performing the second iteration assigns a second set of values as part of the new values representing possible variables. | 0.516334 |
3. A method comprising: at a recipient system, presenting a keyword user interface to a recipient user; receiving a new keyword from the recipient user via the keyword user interface; receiving a new action associated with the new keyword, from the recipient user; storing the new keyword and the new action in a profile associated with the recipient user; receiving an Instant Message from a message communicator, the Instant Message including instant message content; automatically analyzing the instant message content of the Instant Message to identify at least one keyword of a set of keywords that includes the new keyword, wherein the at least one keyword is included in the instant message content; and identifying a predefined action associated with the at least one keyword, the predefined action defining processing of the Instant Message by the recipient system Instant Message client. | 3. A method comprising: at a recipient system, presenting a keyword user interface to a recipient user; receiving a new keyword from the recipient user via the keyword user interface; receiving a new action associated with the new keyword, from the recipient user; storing the new keyword and the new action in a profile associated with the recipient user; receiving an Instant Message from a message communicator, the Instant Message including instant message content; automatically analyzing the instant message content of the Instant Message to identify at least one keyword of a set of keywords that includes the new keyword, wherein the at least one keyword is included in the instant message content; and identifying a predefined action associated with the at least one keyword, the predefined action defining processing of the Instant Message by the recipient system Instant Message client. 5. The method of claim 3 , in which wherein the predefined action comprises sending the incoming Instant Message to an Instant Message mailbox when the at least one keyword is not found in the instant message content. | 0.691197 |
5. The apparatus of claim 4 , wherein the management unit is further configured to set the conversational message associated with the corresponding number which is deleted or replaced in the single conversational content associated with the one contact to be in a non-reply-able status. | 5. The apparatus of claim 4 , wherein the management unit is further configured to set the conversational message associated with the corresponding number which is deleted or replaced in the single conversational content associated with the one contact to be in a non-reply-able status. 6. The apparatus of claim 5 , wherein the management unit is further configured to set a certain number of the one contact as a number of the one contact to which a reply message for the one contact is to be sent. | 0.920587 |
2. The method of claim 1 , further comprising: in response to determining, by the one or more computers, that the number of the first links that are included in the documents in the set of documents and that (i) have anchor text that includes a term of the search query, and (ii) refer to the particular document does not exceed the predetermined threshold, using a second value to modify a quality score that is associated with the particular document, wherein the second value is different than the first value; and storing, by the one or more computers, the modified quality score for use in ranking the particular document in response to subsequently received search queries. | 2. The method of claim 1 , further comprising: in response to determining, by the one or more computers, that the number of the first links that are included in the documents in the set of documents and that (i) have anchor text that includes a term of the search query, and (ii) refer to the particular document does not exceed the predetermined threshold, using a second value to modify a quality score that is associated with the particular document, wherein the second value is different than the first value; and storing, by the one or more computers, the modified quality score for use in ranking the particular document in response to subsequently received search queries. 3. The method of claim 2 , wherein using the first value or the second value to modify a quality score that is associated with the particular document comprises: associating, by the one or more computers, the first value or the second value with a site that is associated with the particular document. | 0.787979 |
5. The method of claim 1 , wherein the filter logic comprises patterns or rules for identifying a full expression and a moniker that refers to the full expression. | 5. The method of claim 1 , wherein the filter logic comprises patterns or rules for identifying a full expression and a moniker that refers to the full expression. 6. The method of claim 5 , wherein analyzing the renaming directive comprises identifying key predicates/relation words for a domain based on the moniker and full expression of the renaming directive. | 0.930498 |
4. A device, comprising: a touch-sensitive display; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: receiving handwritten inputs with the touch-sensitive display; identifying and presenting a string including two or more logographic characters based on the handwritten inputs; and identifying and presenting a candidate logographic character structurally consisting of the two or more logographic characters, wherein the candidate logographic character is a single character. | 4. A device, comprising: a touch-sensitive display; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: receiving handwritten inputs with the touch-sensitive display; identifying and presenting a string including two or more logographic characters based on the handwritten inputs; and identifying and presenting a candidate logographic character structurally consisting of the two or more logographic characters, wherein the candidate logographic character is a single character. 6. The device of claim 4 , wherein the candidate logographic character is a Chinese character. | 0.590361 |
5. The method of claim 1 , further comprising generating at least one additional aggregated cluster according to the same steps if the additional aggregated cluster satisfies the predetermined combining criterion, the aggregated cluster and the additional aggregated cluster being distinct from one another. | 5. The method of claim 1 , further comprising generating at least one additional aggregated cluster according to the same steps if the additional aggregated cluster satisfies the predetermined combining criterion, the aggregated cluster and the additional aggregated cluster being distinct from one another. 6. The method of claim 5 , further comprising: ranking each cluster relative to one another if at least two clusters are identified; ranking each aggregate cluster relative to one another if at least two aggregate clusters are generated; and ranking each cluster and each aggregate cluster relative to each other if at least one cluster is identified and at least one aggregate cluster is generated. | 0.865047 |
1. A computer program product comprising: a non-transitory computer readable medium retaining program instructions, which instructions when read by a processor, cause the processor to perform: obtaining a training dataset, the training dataset comprises a sample of data-points, wherein with respect to each data-point a label is provided; training a reliability classifier tool using the training dataset and predictions made with respect to data-points of the training dataset made by the classifier tool in response to a training session, wherein the training session comprises training the classifier tool with respect to a portion of the training dataset; obtaining a prediction of a label for a dataset made by a classifier tool, wherein the classifier tool is aimed at predicting the label based on a classification model and in view of a set of features defining the dataset; obtaining a reliability prediction of a reliability label for the prediction based on the reliability classifier tool, wherein the reliability classifier tool is aimed at predicting the reliability label based on a classification model and in view of a second set of features, wherein the second set of features comprises at least one feature that is not comprised by the set of features and at least one feature that is comprised by the set of features; and outputting, at the same stage, to a user the label prediction and the reliability label which indicates a reliability of the label prediction. | 1. A computer program product comprising: a non-transitory computer readable medium retaining program instructions, which instructions when read by a processor, cause the processor to perform: obtaining a training dataset, the training dataset comprises a sample of data-points, wherein with respect to each data-point a label is provided; training a reliability classifier tool using the training dataset and predictions made with respect to data-points of the training dataset made by the classifier tool in response to a training session, wherein the training session comprises training the classifier tool with respect to a portion of the training dataset; obtaining a prediction of a label for a dataset made by a classifier tool, wherein the classifier tool is aimed at predicting the label based on a classification model and in view of a set of features defining the dataset; obtaining a reliability prediction of a reliability label for the prediction based on the reliability classifier tool, wherein the reliability classifier tool is aimed at predicting the reliability label based on a classification model and in view of a second set of features, wherein the second set of features comprises at least one feature that is not comprised by the set of features and at least one feature that is comprised by the set of features; and outputting, at the same stage, to a user the label prediction and the reliability label which indicates a reliability of the label prediction. 5. The computer program product of claim 1 , wherein said training comprises: training the classifier tool based on the training dataset and associated labels; obtaining predictions by the classifier tool with respect to at least a portion of the dataset; and training the reliability classifier tool based on the training dataset and correlation between the predicted label and the associated label with respect to the same data-point. | 0.529747 |
8. A computer program embodied on a tangible, non-transitory computer readable medium for creating an errata report for a transcript, wherein the computer program comprises executable program code executable by a processor, said program comprising: executable program code for providing a first electronic transcript having a total number of alphanumeric characters, wherein said first electronic transcript is organized by pages with a predetermined number of lines per page and a predetermined number of alphanumeric characters per line in the range 1 to x, and wherein each alphanumeric character can be identified by a coordinate page-line-character N, and wherein a portion of said total number of alphanumeric characters forms a sentence that grammatically spans from page 0 -line 0 to page 0 -line 1 ; executable program code for displaying said first electronic transcript with computer logic configured to allow an operator to change said alphanumeric characters in the range 1 to x, wherein alphanumeric characters added in the range 1 to x remain associated with, and are displayable as associated with, page 0 -line 0 , and wherein said changes do not cause said alphanumeric characters to span a line break into subsequent page 0 -line 1 although display of said change appears to cause alphanumeric characters in page 0 -line 0 to wrap; executable program code for compiling a comparison transcript comprising said first electronic transcript and any changed alphanumeric characters; and executable program code for providing an errata report by logic configured to aggregate changes to one or more alphanumeric characters of said first electronic transcript, wherein said errata report comprises a plurality of alphanumeric characters that is substantially smaller in quantity than the total number of alphanumeric characters of said first electronic transcript, and said errata report is distinct from said first electronic transcript. | 8. A computer program embodied on a tangible, non-transitory computer readable medium for creating an errata report for a transcript, wherein the computer program comprises executable program code executable by a processor, said program comprising: executable program code for providing a first electronic transcript having a total number of alphanumeric characters, wherein said first electronic transcript is organized by pages with a predetermined number of lines per page and a predetermined number of alphanumeric characters per line in the range 1 to x, and wherein each alphanumeric character can be identified by a coordinate page-line-character N, and wherein a portion of said total number of alphanumeric characters forms a sentence that grammatically spans from page 0 -line 0 to page 0 -line 1 ; executable program code for displaying said first electronic transcript with computer logic configured to allow an operator to change said alphanumeric characters in the range 1 to x, wherein alphanumeric characters added in the range 1 to x remain associated with, and are displayable as associated with, page 0 -line 0 , and wherein said changes do not cause said alphanumeric characters to span a line break into subsequent page 0 -line 1 although display of said change appears to cause alphanumeric characters in page 0 -line 0 to wrap; executable program code for compiling a comparison transcript comprising said first electronic transcript and any changed alphanumeric characters; and executable program code for providing an errata report by logic configured to aggregate changes to one or more alphanumeric characters of said first electronic transcript, wherein said errata report comprises a plurality of alphanumeric characters that is substantially smaller in quantity than the total number of alphanumeric characters of said first electronic transcript, and said errata report is distinct from said first electronic transcript. 13. The computer program of claim 8 , wherein said comparison transcript can be electronically saved in a format suitable for use with transcript management software, said format being selected from the group comprising ASCII text, .txt, .ptx, .ptf, .pcf, .mdb, .sbf, .cms, .ccs, .cds, .cpl, .dcb, .lfp, .log, .lpt, .tlb, .vid., .html, and .xml. | 0.5 |
3. The method of claim 1 , wherein the approximate hashing technique comprises generating a Stratified Spectral Bloom filter comprising a plurality of levels, each of the levels including a Spectral Bloom filter. | 3. The method of claim 1 , wherein the approximate hashing technique comprises generating a Stratified Spectral Bloom filter comprising a plurality of levels, each of the levels including a Spectral Bloom filter. 4. The method of claim 3 , wherein the at least one count is indicated within each of the levels based on a minimal counter. | 0.896416 |
5. The system of claim 4 , wherein the instructions further cause the processor to determine whether the message content satisfies a particular criteria, and in response to determining that the message content satisfies the particular criteria, transmit the command for generating the audio recording. | 5. The system of claim 4 , wherein the instructions further cause the processor to determine whether the message content satisfies a particular criteria, and in response to determining that the message content satisfies the particular criteria, transmit the command for generating the audio recording. 6. The system of claim 5 , wherein the particular criteria is that the message content is free of malicious data. | 0.86605 |
13. A digital television receiver that receives non-real time (NRT) content, comprising in combination: an Internet protocol (IP) receiver that receives a stream of IP packets and selects an IP subnet containing a packet stream selected as an output packet stream; the output packet stream containing non-real time content, a FLUTE file description table (FDT) and NRT metadata; an electronic storage medium; a demultiplexer that demultiplexes the IP packet stream to produce: NRT content that is stored in the electronic storage medium, the FLUTE FDT, and NRT metadata; an FDT parser that parses the FDT to produce NRT file metadata from the FLUTE FDT; and an NRT metadata parser that produces NRT service metadata and NRT content metadata; where the NRT metadata is stored in an NRT-IT table that has a content ID that indexes table entries in the FLUTE FDT. | 13. A digital television receiver that receives non-real time (NRT) content, comprising in combination: an Internet protocol (IP) receiver that receives a stream of IP packets and selects an IP subnet containing a packet stream selected as an output packet stream; the output packet stream containing non-real time content, a FLUTE file description table (FDT) and NRT metadata; an electronic storage medium; a demultiplexer that demultiplexes the IP packet stream to produce: NRT content that is stored in the electronic storage medium, the FLUTE FDT, and NRT metadata; an FDT parser that parses the FDT to produce NRT file metadata from the FLUTE FDT; and an NRT metadata parser that produces NRT service metadata and NRT content metadata; where the NRT metadata is stored in an NRT-IT table that has a content ID that indexes table entries in the FLUTE FDT. 15. The NRT receiver according to claim 13 , wherein the NRT service metadata is received in a Service Map Table. | 0.800238 |
1. A word recognition system for identifying a spoken word represented by an analog speech signal, said word recognition system comprising: signal processing means for receiving an analog input speech signal and for producing feature vectors from the input speech signal to provide a sequence of feature vectors at predetermined speech frame intervals as an output therefrom; memory means storing a plurality of reference templates of digital speech data respectively representative of individual words and comprising the vocabulary of the word recognition system, each of said reference templates being defined by a predetermined plurality of reference vectors arranged in a predetermined sequence and comprising an acoustic description of an individual word in a time-ordered sequence, each of said reference templates being further defined by at least one mask vector respectively associated with each said sequence of reference templates being further defined by at least one mask vector respectively associated with each said sequence of reference vectors and being indicative of the significance of portions of the reference vector sequence association therewith in establishing the identity of the word represented by the reference template of which said at least one mask vector is a component; means operably associated with said signal processing means for comparing each feature vector of said input speech signal with the corresponding reference vectors of each of said reference templates to provide a distance measure with respect to each of the feature vectors and the predetermined reference vector sequences defining acoustic descriptions of the respective words included in the vocabulary of the word recognition system, said comparing means being responsive to the status of the respective mask vectors comprising components of said plurality of reference templates to ignore elements of reference vectors included in respective reference templates which are indicated by the associated mask vector to be insignificant so as to provide said distance measure based upon significant elements of the reference vectors as included in the predetermined reference vector sequences; and word recognizing means operably associated with said comparing means for determining which one of the plurality of the reference templates is the closest match to said input speech signal based upon the distance measures of said reference vector sequences and successively received feature vectors corresponding to respective speech frames. | 1. A word recognition system for identifying a spoken word represented by an analog speech signal, said word recognition system comprising: signal processing means for receiving an analog input speech signal and for producing feature vectors from the input speech signal to provide a sequence of feature vectors at predetermined speech frame intervals as an output therefrom; memory means storing a plurality of reference templates of digital speech data respectively representative of individual words and comprising the vocabulary of the word recognition system, each of said reference templates being defined by a predetermined plurality of reference vectors arranged in a predetermined sequence and comprising an acoustic description of an individual word in a time-ordered sequence, each of said reference templates being further defined by at least one mask vector respectively associated with each said sequence of reference templates being further defined by at least one mask vector respectively associated with each said sequence of reference vectors and being indicative of the significance of portions of the reference vector sequence association therewith in establishing the identity of the word represented by the reference template of which said at least one mask vector is a component; means operably associated with said signal processing means for comparing each feature vector of said input speech signal with the corresponding reference vectors of each of said reference templates to provide a distance measure with respect to each of the feature vectors and the predetermined reference vector sequences defining acoustic descriptions of the respective words included in the vocabulary of the word recognition system, said comparing means being responsive to the status of the respective mask vectors comprising components of said plurality of reference templates to ignore elements of reference vectors included in respective reference templates which are indicated by the associated mask vector to be insignificant so as to provide said distance measure based upon significant elements of the reference vectors as included in the predetermined reference vector sequences; and word recognizing means operably associated with said comparing means for determining which one of the plurality of the reference templates is the closest match to said input speech signal based upon the distance measures of said reference vector sequences and successively received feature vectors corresponding to respective speech frames. 5. A word recognitio system as set forth in claim 1, wherein each of said mask vectors is a binary vector comprising a plurality of bits, each of said bits of said mask vector selectively assuming alternative predetermined values respectively indicating that a corresponding portion of said reference vector sequence with which said mask vector is associated is either significant or insignificant in the determination of said distance measure in establishing the identity of the word represented by the reference template to which the reference vector sequence corresponds. | 0.643753 |
13. A method for extracting intelligence, enriching, and transforming content implemented by a computing device comprising: providing an unstructured XML file based on an unstructured document; extracting a heading, a quoted text, a text of a table of contents, and a form and table from the unstructured XML file; determining a complexity level of the unstructured XML file based on the extracted heading, quoted text, text of the table of contents, and form and table from the unstructured XML file; generating a plurality of applicable and configurable transformation rules for the unstructured XML file based on the complexity level; transforming the unstructured XML file to a structured XML file based on the plurality of applicable and configurable transformation rules and a predefined set of target schema; and validating the structured XML file against the plurality of applicable and configurable transformation rules to report incorrect transformation in the structured XML file, wherein the validating comprises identifying dropped content and repeated content from the unstructured XML to the transformed structured XML file, creating a list of defective mapping between the unstructured XML file and the structured XML file, and identifying a hierarchy mismatch between the unstructured XML file and the structured XML file. | 13. A method for extracting intelligence, enriching, and transforming content implemented by a computing device comprising: providing an unstructured XML file based on an unstructured document; extracting a heading, a quoted text, a text of a table of contents, and a form and table from the unstructured XML file; determining a complexity level of the unstructured XML file based on the extracted heading, quoted text, text of the table of contents, and form and table from the unstructured XML file; generating a plurality of applicable and configurable transformation rules for the unstructured XML file based on the complexity level; transforming the unstructured XML file to a structured XML file based on the plurality of applicable and configurable transformation rules and a predefined set of target schema; and validating the structured XML file against the plurality of applicable and configurable transformation rules to report incorrect transformation in the structured XML file, wherein the validating comprises identifying dropped content and repeated content from the unstructured XML to the transformed structured XML file, creating a list of defective mapping between the unstructured XML file and the structured XML file, and identifying a hierarchy mismatch between the unstructured XML file and the structured XML file. 16. The method as set forth in claim 13 further comprising: validating the structured XML file based on the predefined set of target schema; and integrating a change in an automated transformation workflow to identify an integration error at regular intervals of time. | 0.761525 |
10. The computer readable storage medium according to claim 8 , wherein the parsing history short messages of a user to generate data associated with contacts further comprises: acquiring identification information on the contacts of the history short messages; and acquiring a name entity list of the history short messages by performing name entity recognition on texts of the history short messages. | 10. The computer readable storage medium according to claim 8 , wherein the parsing history short messages of a user to generate data associated with contacts further comprises: acquiring identification information on the contacts of the history short messages; and acquiring a name entity list of the history short messages by performing name entity recognition on texts of the history short messages. 11. The computer readable storage medium according to claim 10 , wherein the constructing a critical object association database by using the data comprises constructing a name entity association database by using the data. | 0.910315 |
16. A system for generating specialty imaging effects from layered documents, comprising: computer memory, which stores a specialty imaging converter comprising a conversion module configured to: for the at least one page of a layered document, identify at least one visual layer; for each of the at least one identified visual layers: identify at least one visual graphical element within the at least one identified visual layer; and for each of the at least one identified visual graphical element in a visual layer: (i) using a computer processor, identify, as a next effect layer, a closest effect layer above the visual layer which includes an effect graphical element that overlaps, at least in part, the at least one identified visual graphical element, comprising: detecting and storing in memory a location and layer overlay position of the identified visual graphical element; for each next-closest above effect layer on the same page as the identified visual graphical element: (a) identifying any effect graphical elements stored on the next-closest effect layer; (b) cropping each identified effect graphical element at the same place and size as the identified visual graphical element with respect to the visual layer dimensions; (c) determining whether each cropped effect graphical element contains graphical information; (d) if at least one effect graphical element contains graphical information, then identifying the at least one cropped effect graphical element as overlapping, at least in part, the identified visual graphical element and identifying the next-closest above effect layer as the next effect layer; (e) else, repeating (a)-(d) for the next-closest above effect layer on the same page as the identified visual graphical element; (ii) create a new graphical element by merging at least part of the identified visual graphical element with at least part of the overlapping effect graphical element of the identified next effect layer; and (iii) transform the input layered document by replacing the identified visual graphical element on the visual layer with the new graphical element; and a processor in communication with the memory for implementing the specialty imaging converter. | 16. A system for generating specialty imaging effects from layered documents, comprising: computer memory, which stores a specialty imaging converter comprising a conversion module configured to: for the at least one page of a layered document, identify at least one visual layer; for each of the at least one identified visual layers: identify at least one visual graphical element within the at least one identified visual layer; and for each of the at least one identified visual graphical element in a visual layer: (i) using a computer processor, identify, as a next effect layer, a closest effect layer above the visual layer which includes an effect graphical element that overlaps, at least in part, the at least one identified visual graphical element, comprising: detecting and storing in memory a location and layer overlay position of the identified visual graphical element; for each next-closest above effect layer on the same page as the identified visual graphical element: (a) identifying any effect graphical elements stored on the next-closest effect layer; (b) cropping each identified effect graphical element at the same place and size as the identified visual graphical element with respect to the visual layer dimensions; (c) determining whether each cropped effect graphical element contains graphical information; (d) if at least one effect graphical element contains graphical information, then identifying the at least one cropped effect graphical element as overlapping, at least in part, the identified visual graphical element and identifying the next-closest above effect layer as the next effect layer; (e) else, repeating (a)-(d) for the next-closest above effect layer on the same page as the identified visual graphical element; (ii) create a new graphical element by merging at least part of the identified visual graphical element with at least part of the overlapping effect graphical element of the identified next effect layer; and (iii) transform the input layered document by replacing the identified visual graphical element on the visual layer with the new graphical element; and a processor in communication with the memory for implementing the specialty imaging converter. 23. The system of claim 16 , wherein the specialty imaging converter resides on the same computing device as a creative tool used to create the layered document. | 0.566402 |
2. The method of claim 1 , further comprises sending a selection of a web site to the network-based transaction facility, the selection identifying the web site as being selected by a user of the seller application. | 2. The method of claim 1 , further comprises sending a selection of a web site to the network-based transaction facility, the selection identifying the web site as being selected by a user of the seller application. 4. The method of claim 2 , wherein: the selection of the web site is an offline selection of a preference for the web site. | 0.942194 |
17. The computer program product of claim 1 , wherein the analysis module further comprises means for retrieving updated analysis information after a publication date of the at least one the selected files, generating analysis based on the updated analysis information and replacing presented information with the updated analysis information. | 17. The computer program product of claim 1 , wherein the analysis module further comprises means for retrieving updated analysis information after a publication date of the at least one the selected files, generating analysis based on the updated analysis information and replacing presented information with the updated analysis information. 18. The computer program product of claim 17 , wherein the updated analysis information includes one or more of analysis formulas, stock price or exchange rate information. | 0.92601 |
22. The spinal fixation system of claim 17 , wherein the spanning portion is offset from a plane defined by the end of the connecting plate. | 22. The spinal fixation system of claim 17 , wherein the spanning portion is offset from a plane defined by the end of the connecting plate. 24. The spinal fixation system of claim 22 , wherein the spanning portion is offset between about 5 mm to about 10 mm from the plane defined by the end of the connecting plate. | 0.898931 |
6. A computer-implemented method, comprising: under control of one or more computing devices configured with specific computer-executable instructions, receiving an utterance; generating an input finite state transducer (FST) comprising sequences of subword units organized into input FST paths, wherein a path of the input FST paths corresponds to a speech recognition hypothesis of a plurality of speech recognition hypotheses that are based on the received utterance; obtaining a grammar of utterances, wherein each utterance of the grammar of utterances comprises a sequence of subword units; generating, using the grammar of utterances, an utterance FST comprising sequences of subword units organized into utterance FST paths, wherein a path of the utterance FST paths corresponds to a command; generating an output FST using the input FST and the utterance FST, wherein the output FST comprises a first path indicative of a difference between a first path of the input FST paths and a first path of the utterance FST paths, and a second path indicative of a difference between the first path of the input FST paths and a second path of the utterance FST paths; computing a first difference score using the first path of the output FST; computing a second difference score using the second path of the output FST; and determining a first command representative of the received utterance based at least in part on the first difference score and the second difference score. | 6. A computer-implemented method, comprising: under control of one or more computing devices configured with specific computer-executable instructions, receiving an utterance; generating an input finite state transducer (FST) comprising sequences of subword units organized into input FST paths, wherein a path of the input FST paths corresponds to a speech recognition hypothesis of a plurality of speech recognition hypotheses that are based on the received utterance; obtaining a grammar of utterances, wherein each utterance of the grammar of utterances comprises a sequence of subword units; generating, using the grammar of utterances, an utterance FST comprising sequences of subword units organized into utterance FST paths, wherein a path of the utterance FST paths corresponds to a command; generating an output FST using the input FST and the utterance FST, wherein the output FST comprises a first path indicative of a difference between a first path of the input FST paths and a first path of the utterance FST paths, and a second path indicative of a difference between the first path of the input FST paths and a second path of the utterance FST paths; computing a first difference score using the first path of the output FST; computing a second difference score using the second path of the output FST; and determining a first command representative of the received utterance based at least in part on the first difference score and the second difference score. 22. The method of claim 6 , wherein: the first path of the output FST comprises a plurality of nodes and one or more arcs between nodes of the plurality of nodes; an arc of the one or more arcs is associated with a subword included in the first path of the input FST, a subword included in the first path of the utterance FST, and a difference score; and the difference score of the arc is based on a difference between the subword included the first path of the input FST and the subword included in the first path of the utterance FST. | 0.552246 |
1. A system configured to transmit data packets including data formatted in a binary extensible markup language (XML), comprising: a parser configured to convert from an extensible markup language (XML) representation that is compatible with standard XML and includes element start tags, element end tags and data values to a single data stream binary representation by providing binary data representations for element start tags and data values within the XML representation and by not providing binary data representations for element end tags within the XML representation, wherein the binary data representations are each formed using X-bit bytes, and wherein consistent extensible encoding is provided for each binary data representation by using a most-significant-bit of each X-bit byte as a termination indicator bit where a first logic level indicates the byte is a termination byte and a second logic level indicates that more bytes are included in a multi-byte data word, and wherein the XML representation and the binary representation are defined according to document type definition (DTD); a data storage system; a data packager within the parser, the data packager being configured to create data packets for the single data stream binary representation that is formed using the X-bit bytes, and a first interface coupled to the parser and configured to transmit the data packets for the single data stream binary representation through a data channel to a second interface associated with a second system; wherein the element start tags are represented using positive integer binary data representations; and wherein the data values are represented using binary data representations selected from a group comprising a string, an integer, a floating point number, an enumerated value, a pattern, and a packed component. | 1. A system configured to transmit data packets including data formatted in a binary extensible markup language (XML), comprising: a parser configured to convert from an extensible markup language (XML) representation that is compatible with standard XML and includes element start tags, element end tags and data values to a single data stream binary representation by providing binary data representations for element start tags and data values within the XML representation and by not providing binary data representations for element end tags within the XML representation, wherein the binary data representations are each formed using X-bit bytes, and wherein consistent extensible encoding is provided for each binary data representation by using a most-significant-bit of each X-bit byte as a termination indicator bit where a first logic level indicates the byte is a termination byte and a second logic level indicates that more bytes are included in a multi-byte data word, and wherein the XML representation and the binary representation are defined according to document type definition (DTD); a data storage system; a data packager within the parser, the data packager being configured to create data packets for the single data stream binary representation that is formed using the X-bit bytes, and a first interface coupled to the parser and configured to transmit the data packets for the single data stream binary representation through a data channel to a second interface associated with a second system; wherein the element start tags are represented using positive integer binary data representations; and wherein the data values are represented using binary data representations selected from a group comprising a string, an integer, a floating point number, an enumerated value, a pattern, and a packed component. 3. The system of claim 1 , wherein the data values are represented using binary data representations selected from a group consisting of a string, an integer, a floating point number, an enumerated value, a pattern, and a packed component. | 0.641791 |
12. A system comprising: a processor; a computer-readable storage medium storing instructions which, when executed by the processor, cause the processor to perform operations comprising: receiving a message comprising a subject, a first sentence and a second sentence; processing the message to yield a processed subject based on the subject, a processed first sentence based on the first sentence, and a processed second sentence based on the second sentence, wherein processing the message comprises identifying words in the message that are of a predefined word type; and selecting exactly one of the first sentence or the second sentence as a summary text, which summarizes the message, based on: (i) a first number of words of the predefined word type in the processed first sentence; (ii) a second number of words of the predefined word type in the processed second sentence; (iii) first overlapping words, of the predefined word type, occurring both in the processed subject and the processed first sentence; and (iv) second overlapping words, of the predefined word type, occurring both in the processed subject and the processed second sentence. | 12. A system comprising: a processor; a computer-readable storage medium storing instructions which, when executed by the processor, cause the processor to perform operations comprising: receiving a message comprising a subject, a first sentence and a second sentence; processing the message to yield a processed subject based on the subject, a processed first sentence based on the first sentence, and a processed second sentence based on the second sentence, wherein processing the message comprises identifying words in the message that are of a predefined word type; and selecting exactly one of the first sentence or the second sentence as a summary text, which summarizes the message, based on: (i) a first number of words of the predefined word type in the processed first sentence; (ii) a second number of words of the predefined word type in the processed second sentence; (iii) first overlapping words, of the predefined word type, occurring both in the processed subject and the processed first sentence; and (iv) second overlapping words, of the predefined word type, occurring both in the processed subject and the processed second sentence. 19. The system of claim 12 , wherein selecting the exactly one of the first sentence or the second sentence is further based on: (v) a third number of the first overlapping words; (vi) a fourth number of the second overlapping words. | 0.689464 |
17. The system of claim 14 , wherein an order for automatically selecting for playback the subset of the plurality of stored media assets that has the common attribute is determined based on an asset criteria. | 17. The system of claim 14 , wherein an order for automatically selecting for playback the subset of the plurality of stored media assets that has the common attribute is determined based on an asset criteria. 19. The system of claim 17 , wherein the asset criteria is identified by the user. | 0.942387 |
11. The speech recognition apparatus of claim 8 , comprising: a selection unit for selecting the word string from a sequence of word strings that starts from a leaf node word toward a root and ends with a node other than the root of the tree structure, wherein the forward speech comparison unit compares, in order of the sequence, the input speech with a forward acoustic model corresponding to a speech resulting from chronologically reproducing the intermediate word string selected by the selection unit. | 11. The speech recognition apparatus of claim 8 , comprising: a selection unit for selecting the word string from a sequence of word strings that starts from a leaf node word toward a root and ends with a node other than the root of the tree structure, wherein the forward speech comparison unit compares, in order of the sequence, the input speech with a forward acoustic model corresponding to a speech resulting from chronologically reproducing the intermediate word string selected by the selection unit. 13. The speech recognition apparatus of claim 11 , wherein the selection unit selects the intermediate word string based on a highly likely matching word string previously output by the output unit. | 0.859813 |
14. In a mobile consumer messaging system (MCMS), in which the MCMS is in electronic communications with a plurality of mobile device users via one or more mobile carrier networks and is in electronic communications with one or more chat agents utilizing one or more chat platforms, a method for facilitating messages between the plurality of mobile devices users and the one or more chat agents, comprising the steps of: receiving a particular chat message at the MCMS from a specific mobile device user via a respective mobile carrier network, wherein the particular chat message includes message content and message identifying information; extracting via the MCMS the message content and message identifying information from the particular chat message and storing the message content and message identifying information in an MCMS database; comparing the message identifying information to stored message identifying information in the MCMS database, wherein the stored message identifying information is associated with one or more ongoing chat sessions between mobile device users and chat agents; if match exists between the message identifying information and the stored message identifying information, retrieving a specific chat session associated with the stored message identifying information and associating the particular chat message with the specific chat session; generating via the MCMS a new message in a format acceptable to a respective chat platform, wherein the new message includes the message content and is based on the stored message identifying information associated with the specific chat session; and transmitting the new message from the MCMS to a respective chat agent associated with the specific chat session and utilizing a respective chat platform. | 14. In a mobile consumer messaging system (MCMS), in which the MCMS is in electronic communications with a plurality of mobile device users via one or more mobile carrier networks and is in electronic communications with one or more chat agents utilizing one or more chat platforms, a method for facilitating messages between the plurality of mobile devices users and the one or more chat agents, comprising the steps of: receiving a particular chat message at the MCMS from a specific mobile device user via a respective mobile carrier network, wherein the particular chat message includes message content and message identifying information; extracting via the MCMS the message content and message identifying information from the particular chat message and storing the message content and message identifying information in an MCMS database; comparing the message identifying information to stored message identifying information in the MCMS database, wherein the stored message identifying information is associated with one or more ongoing chat sessions between mobile device users and chat agents; if match exists between the message identifying information and the stored message identifying information, retrieving a specific chat session associated with the stored message identifying information and associating the particular chat message with the specific chat session; generating via the MCMS a new message in a format acceptable to a respective chat platform, wherein the new message includes the message content and is based on the stored message identifying information associated with the specific chat session; and transmitting the new message from the MCMS to a respective chat agent associated with the specific chat session and utilizing a respective chat platform. 24. The method of claim 14 , wherein the MCMS includes a management computer system for performing functions of the MCMS. | 0.705454 |
13. A computer program product for identifying related names, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, wherein the computer readable program code, when executed by a processor of a computer, is configured to perform: storing a collection of names from different languages, wherein each of the names has a native orthographic form and a romanized form; receiving an input name in a known encoding scheme; determining an alphabet of the input name based on the known encoding scheme; generating romanized names based on the input name and the determined alphabet using multiple transliteration schemas; identifying a culture associated with the input name; selecting one or more culture-sensitive regularization rules for the identified culture, wherein there are different culture-sensitive regularization rules for different cultures; applying the selected one or more culture-sensitive regularization rules to one of the romanized names to create an additional romanized name; matching the romanized names and the additional romanized name against the romanized names in the collection of names from the different languages; and returning data store records that have romanized names that match at least one of the romanized names and the additional romanized name. | 13. A computer program product for identifying related names, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, wherein the computer readable program code, when executed by a processor of a computer, is configured to perform: storing a collection of names from different languages, wherein each of the names has a native orthographic form and a romanized form; receiving an input name in a known encoding scheme; determining an alphabet of the input name based on the known encoding scheme; generating romanized names based on the input name and the determined alphabet using multiple transliteration schemas; identifying a culture associated with the input name; selecting one or more culture-sensitive regularization rules for the identified culture, wherein there are different culture-sensitive regularization rules for different cultures; applying the selected one or more culture-sensitive regularization rules to one of the romanized names to create an additional romanized name; matching the romanized names and the additional romanized name against the romanized names in the collection of names from the different languages; and returning data store records that have romanized names that match at least one of the romanized names and the additional romanized name. 15. The computer program product of claim 13 , wherein the culture-sensitive regularization rules are applied using a user-supplied cultural value. | 0.696203 |
1. A navigation system for a motor vehicle, comprising: a navigation module for route planning; a display arrangement configured to display information including textual indications of location, additional items of information concerning the locations indicated by the textual indications of location, the additional items of information corresponding to respective destinations within the locations, each destination being assigned respective geographic coordinates, and the display arrangement being further configured to display route information; an input arrangement configured to receive a hierarchical, interactive destination input by, in conjunction with the display arrangement and conditional upon a selecting of an ambiguous textual indication of location by a user, which ambiguous textual indication identifies a plurality of destination alternatives, each of which is displayed with the same name: initially displaying the plurality of destination alternatives identified by the ambiguous textual indication as a list, without displaying the additional items of information, providing the user with a choice between a plurality of categories of additional information, receiving the choice from the user, and subsequently displaying, in response to a user selection of a particular one of the plurality of destination alternatives, those additional items of information that correspond to the selected destination alternative and which belong to a category specified by the choice; and a memory in which each destination alternative is stored together with corresponding geographic coordinates, and the geographic coordinates of the selected destination alternative are used to determine the additional items of information that correspond to the selected destination alternative. | 1. A navigation system for a motor vehicle, comprising: a navigation module for route planning; a display arrangement configured to display information including textual indications of location, additional items of information concerning the locations indicated by the textual indications of location, the additional items of information corresponding to respective destinations within the locations, each destination being assigned respective geographic coordinates, and the display arrangement being further configured to display route information; an input arrangement configured to receive a hierarchical, interactive destination input by, in conjunction with the display arrangement and conditional upon a selecting of an ambiguous textual indication of location by a user, which ambiguous textual indication identifies a plurality of destination alternatives, each of which is displayed with the same name: initially displaying the plurality of destination alternatives identified by the ambiguous textual indication as a list, without displaying the additional items of information, providing the user with a choice between a plurality of categories of additional information, receiving the choice from the user, and subsequently displaying, in response to a user selection of a particular one of the plurality of destination alternatives, those additional items of information that correspond to the selected destination alternative and which belong to a category specified by the choice; and a memory in which each destination alternative is stored together with corresponding geographic coordinates, and the geographic coordinates of the selected destination alternative are used to determine the additional items of information that correspond to the selected destination alternative. 3. The navigation system according to claim 1 , wherein the displaying the additional items of information that correspond to the selected destination alternative includes a displaying of at least one map segment in which the selected destination alternative is located. | 0.646214 |
4. A method, comprising: receiving, from a first device, first audio data representing a first utterance; determining a user account associated with the first device; determining, based on first text data representing the first audio data, that a first intent of the first utterance is for first content to be output; determining, for the user account, content information associated with at least the first device; determining, based on the content information, that a first local version of the first content is stored on the first device; generating a first instruction for the first local version to be output by the first device; sending the first instruction to the first device; receiving, from the first device, second audio data representing a second utterance; determining, based on second text data representing the second audio data, that a second intent of the second utterance is for second content to be output; determining that a second device is also associated with the user account; determining, based on the content information, that a second local version of the second content is stored on the second device; and determining that the second device and the first device are capable of communicating using at least one short-range communications protocol. | 4. A method, comprising: receiving, from a first device, first audio data representing a first utterance; determining a user account associated with the first device; determining, based on first text data representing the first audio data, that a first intent of the first utterance is for first content to be output; determining, for the user account, content information associated with at least the first device; determining, based on the content information, that a first local version of the first content is stored on the first device; generating a first instruction for the first local version to be output by the first device; sending the first instruction to the first device; receiving, from the first device, second audio data representing a second utterance; determining, based on second text data representing the second audio data, that a second intent of the second utterance is for second content to be output; determining that a second device is also associated with the user account; determining, based on the content information, that a second local version of the second content is stored on the second device; and determining that the second device and the first device are capable of communicating using at least one short-range communications protocol. 8. The method of claim 4 , further comprising: determining frequent utterances associated with the user account; generating, prior to receiving third audio data representing one of the frequent utterances, third text data representing at least one response to the frequent utterances; generating third audio data representing the third text data; and sending the third audio data to the first device such that the at least one response is available to be output by the first device. | 0.849464 |
18. The computing device of claim 17 , wherein the one or more processors are further configured to execute the keyboard application to, after receiving the indication of the selection of the search element: output, for display by the presence-sensitive display, the suggested query as one of the one or more suggested queries included in the query suggestion region. | 18. The computing device of claim 17 , wherein the one or more processors are further configured to execute the keyboard application to, after receiving the indication of the selection of the search element: output, for display by the presence-sensitive display, the suggested query as one of the one or more suggested queries included in the query suggestion region. 19. The computing device of claim 18 , wherein the one or more processors are further configured to execute the keyboard application to, after receiving the indication of the selection of the search element: output, for display by the presence-sensitive display, the suggested query as one of the one or more suggested queries included in the query suggestion region. | 0.923807 |
32. A non-transitory computer-readable medium having encoded thereon instructions, wherein the instructions, when executed by a computing apparatus, cause the computing apparatus to: generate a first user interface for receiving, from a user, item information regarding at least one item of interest to the user, wherein the item of interest is an item offered for sale using a network-based service; automatically determine at least one category recommendation from vector representations of the received item information and at least one description for an item category maintained by a network-based service, wherein an item category is associated with a plurality of items and is determined to be a category recommendation if a similarity between the vector representation of the item information and the item category description is less than a threshold value; and generate a second user interface that enables a human reviewer to assign an item category to the item of interest to the user, the item category selected from the at least one category recommendation. | 32. A non-transitory computer-readable medium having encoded thereon instructions, wherein the instructions, when executed by a computing apparatus, cause the computing apparatus to: generate a first user interface for receiving, from a user, item information regarding at least one item of interest to the user, wherein the item of interest is an item offered for sale using a network-based service; automatically determine at least one category recommendation from vector representations of the received item information and at least one description for an item category maintained by a network-based service, wherein an item category is associated with a plurality of items and is determined to be a category recommendation if a similarity between the vector representation of the item information and the item category description is less than a threshold value; and generate a second user interface that enables a human reviewer to assign an item category to the item of interest to the user, the item category selected from the at least one category recommendation. 35. The non-transitory computer-readable medium of claim 32 , wherein the second user interface further enables the received item information to be updated to include the item category assignment. | 0.646302 |
27. A system for dataflow programming development platform comprising: a graphical user interface that is displayed on a screen of a computer; a declarations screen of the graphical user interface of the development platform where a user can specify declarations data types including streams, constants, functions, and patterns, wherein a pattern definition is used to specify a pattern to identify in a stream, and blocks representing the declarations data types are displayed on the screen so that the user can drag and drop the blocks into a desired position on the screen; a reactions screen of the graphical user interface of the development platform where the user can interconnect the blocks of the declarations data types into a graphical representation of a dataflow program, wherein in the reactions screen, the user can specify and alter interconnects between the different blocks; a compute block screen of the graphical user interface of the development platform where the user can view and specify an operation performed by a compute block, wherein the user can specify inputs to the compute block and computations on the inputs, and an output of the computer block; and a code view screen of the graphical user interface of the development platform where the user can view and edit a computer code representation of the operation graphically represented in the compute block screen, wherein the computer code is automatically generated by the development platform. | 27. A system for dataflow programming development platform comprising: a graphical user interface that is displayed on a screen of a computer; a declarations screen of the graphical user interface of the development platform where a user can specify declarations data types including streams, constants, functions, and patterns, wherein a pattern definition is used to specify a pattern to identify in a stream, and blocks representing the declarations data types are displayed on the screen so that the user can drag and drop the blocks into a desired position on the screen; a reactions screen of the graphical user interface of the development platform where the user can interconnect the blocks of the declarations data types into a graphical representation of a dataflow program, wherein in the reactions screen, the user can specify and alter interconnects between the different blocks; a compute block screen of the graphical user interface of the development platform where the user can view and specify an operation performed by a compute block, wherein the user can specify inputs to the compute block and computations on the inputs, and an output of the computer block; and a code view screen of the graphical user interface of the development platform where the user can view and edit a computer code representation of the operation graphically represented in the compute block screen, wherein the computer code is automatically generated by the development platform. 30. The system of claim 27 comprising: an instruction interpreter which emulates the hardware platform in the execution of platform-specific hardware instructions; a dataflow simulator interface which emulates a streaming data environment, providing inputs to and collecting outputs from state machine streams; a program execution flow controller to examine computations and data in-flight and drive computations back and forth; and a simulated publisher-subscriber multiplexer to facilitate the exchange of simulated messages from a plurality of publishers to a plurality of subscribers within a debugging environment. | 0.6236 |
1. A method of displaying composite codes in a display system which receives a data stream of alphanumeric codes and control codes, comprising: formatting said data stream into one or more lines of said codes for storing said codes in a refresh buffer to address a character generator to send pel patterns representing said codes directly to a visual display; detecting a backspace control code in said data stream; storing, at a first address of a temporary store, the pel pattern of an alphanumeric character immediately preceding said backspace control code; storing, at said first address of said temporary store, the pel pattern of an alphanumeric character immediately succeeding said backspace control code; loading the contents of said first address of said temporary store into a second address of a random access memory portion of said character generator; replacing, in said refresh buffer, said alphanumeric code immediately preceding said backspace code with a pointer to said second address of said random access memory portion of said character generator and; inhibiting the response by said refresh buffer and said character generator to said backspace control code and said alphanumeric character immediately succeeding said backspace control code, whereby the content of said random access memory portion of said character generator is displayed. | 1. A method of displaying composite codes in a display system which receives a data stream of alphanumeric codes and control codes, comprising: formatting said data stream into one or more lines of said codes for storing said codes in a refresh buffer to address a character generator to send pel patterns representing said codes directly to a visual display; detecting a backspace control code in said data stream; storing, at a first address of a temporary store, the pel pattern of an alphanumeric character immediately preceding said backspace control code; storing, at said first address of said temporary store, the pel pattern of an alphanumeric character immediately succeeding said backspace control code; loading the contents of said first address of said temporary store into a second address of a random access memory portion of said character generator; replacing, in said refresh buffer, said alphanumeric code immediately preceding said backspace code with a pointer to said second address of said random access memory portion of said character generator and; inhibiting the response by said refresh buffer and said character generator to said backspace control code and said alphanumeric character immediately succeeding said backspace control code, whereby the content of said random access memory portion of said character generator is displayed. 2. The method of claim 1, further comprising: inhibiting the replacing, in said refresh buffer, said alphanumeric code immediately preceding said backspace control code with said pointer, whereby the individual pel patterns which form a composite character can be individually displayed on said visual display. | 0.692079 |
1. A method for improving relevance of web searches for a query, comprising: providing a pre-existing relevance ranking of a plurality of query/uniform resource locator (URL) pairs, respective labels being associated with the plurality of query/URL pairs; computing a click relevance ranking of the plurality of query/URL pairs based upon user log data comprising user click data; and identifying and correcting mislabeled query/URL pairs in the pre-existing relevance ranking based upon the click relevance ranking, the user log data comprising: respective rank associated with a query/URL pair within the plurality of query/URL pairs at one or more times; respective total numbers of impressions (I) for the rank associated with the query/URL pair; and respective total numbers of clicks received (C) for the rank associated with the query/URL pair, wherein the click rate (CR) is the sum of the total number of clicks for all ranks associated with the query/URL pair divided by the sum of the total number of impressions for all ranks associated with the query/URL pair, and computing the click relevance ranking comprises: aggregating the user log data by query and URL; reducing click bias; creating a click relevance ordering of the plurality of query/URL pairs; creating a directed acyclic graph of a relevance relationship between the plurality of query/URL pairs; and mapping the directed acyclic graph into a linear ordering, at least some of one or more of the providing, computing and identifying performed at least in part with a microprocessor. | 1. A method for improving relevance of web searches for a query, comprising: providing a pre-existing relevance ranking of a plurality of query/uniform resource locator (URL) pairs, respective labels being associated with the plurality of query/URL pairs; computing a click relevance ranking of the plurality of query/URL pairs based upon user log data comprising user click data; and identifying and correcting mislabeled query/URL pairs in the pre-existing relevance ranking based upon the click relevance ranking, the user log data comprising: respective rank associated with a query/URL pair within the plurality of query/URL pairs at one or more times; respective total numbers of impressions (I) for the rank associated with the query/URL pair; and respective total numbers of clicks received (C) for the rank associated with the query/URL pair, wherein the click rate (CR) is the sum of the total number of clicks for all ranks associated with the query/URL pair divided by the sum of the total number of impressions for all ranks associated with the query/URL pair, and computing the click relevance ranking comprises: aggregating the user log data by query and URL; reducing click bias; creating a click relevance ordering of the plurality of query/URL pairs; creating a directed acyclic graph of a relevance relationship between the plurality of query/URL pairs; and mapping the directed acyclic graph into a linear ordering, at least some of one or more of the providing, computing and identifying performed at least in part with a microprocessor. 8. The method of claim 1 , comprising: determining a LCS of query/URL pairs that is strictly decreasing in both the pre-existing and click relevance ranking; assigning the pre-existing relevance ranking labels associated with the LCS of query/URL pairs to the click relevance ranking; and relabeling a label associated with the query/URL pair not in the LCS with a new label interpolated from the click relevance ranking. | 0.523208 |
1. A system for processing content, the system comprising: a content data store configured to store an audiobook, the audiobook comprising an audio narration that references a plurality of original objects and includes a recitation of at least one original attribute of each original object; a narration data store configured to store a plurality of audio clips, each audio clip affiliated with a speaker; and a computing device in communication with the content data store and the narration data store, the computing device configured to: access a social graph comprising a plurality of social graph objects; select a social graph object from the plurality of social graph objects, the selected social graph object comprising at least one social graph attribute; select an original object; and replace, in the audio narration of the audiobook, the recitation of at least one original attribute of the selected original object with a replacement recitation of the at least one social graph attribute to form a modified audiobook; wherein the replacement recitation is generated from one or more audio clips stored in the narration data store. | 1. A system for processing content, the system comprising: a content data store configured to store an audiobook, the audiobook comprising an audio narration that references a plurality of original objects and includes a recitation of at least one original attribute of each original object; a narration data store configured to store a plurality of audio clips, each audio clip affiliated with a speaker; and a computing device in communication with the content data store and the narration data store, the computing device configured to: access a social graph comprising a plurality of social graph objects; select a social graph object from the plurality of social graph objects, the selected social graph object comprising at least one social graph attribute; select an original object; and replace, in the audio narration of the audiobook, the recitation of at least one original attribute of the selected original object with a replacement recitation of the at least one social graph attribute to form a modified audiobook; wherein the replacement recitation is generated from one or more audio clips stored in the narration data store. 2. The system for processing content of claim 1 , wherein the generated replacement recitation is synthesized from one or more audio clips. | 0.590253 |
6. The process of claim 5 wherein the context indicator further specifies a field in the web form in which the spoken input is received. | 6. The process of claim 5 wherein the context indicator further specifies a field in the web form in which the spoken input is received. 7. The process of claim 6 , wherein the context indicator further specifies metadata associated with the field in the web form. | 0.94697 |
1. A method comprising: identifying, at a computer, a collection of color themes, each color theme of the collection of color themes comprising at least one color; identifying, at the computer, a color theme, the identified color theme comprising at least one color; determining, by the computer, a distance for each color theme of the collection of color themes from the identified color theme, wherein each distance comprises a color-based distance determined by comparing the identified color theme with the respective color theme of the collection of color themes, wherein, at least one color theme of the collection is a multi-color color theme comprising multiple colors, wherein the distance of the multi-color color theme from the identified color theme is determined based at least in part on color-to-color distances between at least one color of the identified color theme and each of the multiple colors of the multi-color color theme; and selecting, by the computer, a subset of color themes from the collection of color themes based at least in part on the distances from the identified color theme. | 1. A method comprising: identifying, at a computer, a collection of color themes, each color theme of the collection of color themes comprising at least one color; identifying, at the computer, a color theme, the identified color theme comprising at least one color; determining, by the computer, a distance for each color theme of the collection of color themes from the identified color theme, wherein each distance comprises a color-based distance determined by comparing the identified color theme with the respective color theme of the collection of color themes, wherein, at least one color theme of the collection is a multi-color color theme comprising multiple colors, wherein the distance of the multi-color color theme from the identified color theme is determined based at least in part on color-to-color distances between at least one color of the identified color theme and each of the multiple colors of the multi-color color theme; and selecting, by the computer, a subset of color themes from the collection of color themes based at least in part on the distances from the identified color theme. 2. The method of claim 1 , wherein the identified color theme comprises at least two colors. | 0.608524 |
1. A method comprising: generating a first process for a first document; generating a second process for a second document that is related to the first document; generating a third process for a third document that is related to the first document or the second document; wherein two documents of the first document, the second document, and the third document are included in the other document of the first document, the second document, or the third document; generating, by the first process, a message that includes target content that indicates time data that indicates when the first document loaded, wherein the time data is used after the first document is loaded to determine, at a later time, whether to replace the first document with a fourth document; sending, by the first process, the message to the second process; determining, by the second process, that the third process is to receive the target content within the message; and sending, by the second process, the target content to the third process; wherein the method is performed by one or more computing devices. | 1. A method comprising: generating a first process for a first document; generating a second process for a second document that is related to the first document; generating a third process for a third document that is related to the first document or the second document; wherein two documents of the first document, the second document, and the third document are included in the other document of the first document, the second document, or the third document; generating, by the first process, a message that includes target content that indicates time data that indicates when the first document loaded, wherein the time data is used after the first document is loaded to determine, at a later time, whether to replace the first document with a fourth document; sending, by the first process, the message to the second process; determining, by the second process, that the third process is to receive the target content within the message; and sending, by the second process, the target content to the third process; wherein the method is performed by one or more computing devices. 4. The method of claim 1 , further comprising: generating a fourth process for a fourth document; generating a fifth process for a fifth document that is related to the fourth document; generating a sixth process for a sixth document that is related to the fourth document or the fifth document; wherein two documents of the fourth document, the fifth document, and the sixth document are included in the other document of the fourth document, the fifth document, or the sixth document; generating, by the first process, a message that includes second target content that indicates a highlight instruction that the sixth process is to use to visually distinguish the sixth document; sending, by the fourth process, the message to the fifth process; determining, by the fifth process, that the sixth process is to receive the second target content within the message; and sending, by the fifth process, the second target content to the sixth process. | 0.5 |
14. A method for providing keywords of a video apparatus, the method comprising: extracting one or more keywords, from metadata separated from a first content received at the video apparatus, by a keyword extracting unit, the keywords being descriptive of the first content; selecting images corresponding to the extracted keywords; displaying a keyword list including the extracted keywords and images corresponding to the extracted keywords; and receiving a user input to select at least one keyword from the displayed keyword list, wherein the corresponding images are acquired from a second content which is different from the first content where the keywords are extracted, and wherein the selecting of the images comprises, for each keyword: detecting if an image exists on a storage unit of the video apparatus which corresponds to the keyword, selecting, when the image exists on the storage unit, the stored image, and establishing, when the image does not exist on the storage unit, a network connection to select the image from a storage unit exterior to the video apparatus. | 14. A method for providing keywords of a video apparatus, the method comprising: extracting one or more keywords, from metadata separated from a first content received at the video apparatus, by a keyword extracting unit, the keywords being descriptive of the first content; selecting images corresponding to the extracted keywords; displaying a keyword list including the extracted keywords and images corresponding to the extracted keywords; and receiving a user input to select at least one keyword from the displayed keyword list, wherein the corresponding images are acquired from a second content which is different from the first content where the keywords are extracted, and wherein the selecting of the images comprises, for each keyword: detecting if an image exists on a storage unit of the video apparatus which corresponds to the keyword, selecting, when the image exists on the storage unit, the stored image, and establishing, when the image does not exist on the storage unit, a network connection to select the image from a storage unit exterior to the video apparatus. 16. A non-transitory computer readable medium encoded with processing instructions for executing the method of claim 14 using one or more computers. | 0.722817 |
12. The method of claim 1 , further comprising indexing the extracted quotation. | 12. The method of claim 1 , further comprising indexing the extracted quotation. 13. The method of claim 12 wherein indexing the extracted quotation includes storing a speaker-verb-quote triple in an inverted index managed by the content recommendation system. | 0.946777 |
15. A computer program product to perform operations via a spreadsheet, the computer program product comprising: program instructions, stored on at least one of the one or more storage devices, to provide by the spreadsheet a unit type; program instructions, stored on at least one of the one or more storage devices, to create in the spreadsheet one or more objects of unit type, the creating an object of unit type comprising: receiving from a user a specification of the object of unit type; and in response to the receiving, creating the object of unit type; program instructions, stored on at least one of the one or more storage devices, to assign the object of unit type to an element of a spreadsheet; and program instructions, stored on at least one of the one or more storage devices, to perform calculations with the element of the spreadsheet, the performing comprising type-checking values of the element of the spreadsheet. | 15. A computer program product to perform operations via a spreadsheet, the computer program product comprising: program instructions, stored on at least one of the one or more storage devices, to provide by the spreadsheet a unit type; program instructions, stored on at least one of the one or more storage devices, to create in the spreadsheet one or more objects of unit type, the creating an object of unit type comprising: receiving from a user a specification of the object of unit type; and in response to the receiving, creating the object of unit type; program instructions, stored on at least one of the one or more storage devices, to assign the object of unit type to an element of a spreadsheet; and program instructions, stored on at least one of the one or more storage devices, to perform calculations with the element of the spreadsheet, the performing comprising type-checking values of the element of the spreadsheet. 16. The computer program product of claim 15 , wherein: the program instructions to assign comprises program instructions to assign the object of unit type to the element, the object of unit type comprising a unit of measurement; and the program instructions to perform calculations comprise program instructions to receive a value of the element in a comparable unit of measurement and to convert the value to the unit of measurement. | 0.689198 |
18. A method to provide keyword-based notification and content, comprising: monitoring, by a processor, a communication interface, the communication interface configured to transport a communication between an agent and a customer; recognizing, by the processor, a candidate keyword in the communication; retrieving, by the processor from a non-volatile data storage, an information related to the keyword, wherein the non-volatile data storage comprises: a first memory area configured to store a mapping of keywords to keyword information; and a second memory area configured to store a mapping of a customer identifier to information related to how keyword information should be delivered to the customer; and presenting, by the processor, to one of the agent and the customer the information related to the keyword. | 18. A method to provide keyword-based notification and content, comprising: monitoring, by a processor, a communication interface, the communication interface configured to transport a communication between an agent and a customer; recognizing, by the processor, a candidate keyword in the communication; retrieving, by the processor from a non-volatile data storage, an information related to the keyword, wherein the non-volatile data storage comprises: a first memory area configured to store a mapping of keywords to keyword information; and a second memory area configured to store a mapping of a customer identifier to information related to how keyword information should be delivered to the customer; and presenting, by the processor, to one of the agent and the customer the information related to the keyword. 28. The method of claim 18 , wherein the information presented to one of the agent and the customer comprises a link to access the information. | 0.615268 |
5. The method of claim 3 , further comprising: storing the comment and the information associated with the model in a memory; receiving a search query; retrieving, from the memory and based on the search query, at least a portion of the comment and the information associated with the model. | 5. The method of claim 3 , further comprising: storing the comment and the information associated with the model in a memory; receiving a search query; retrieving, from the memory and based on the search query, at least a portion of the comment and the information associated with the model. 6. The method of claim 5 , where the request from the at least one of the one or more users includes the search query, and where the retrieved at least a portion of the comment and the information associated with the model is provided based on receiving the search query. | 0.913596 |
7. A system for distributing a resume of a job seeker to career websites, the system comprising: a server computer connected to a network; a storage device operationally adapted to the server computer; a job seeker profile and resume database stored within the storage device; a user interface presented on a client computer, the client computer communicating with the server computer to capture a list of target career websites from the job seeker; and a plurality of resume blasting bots executing on the server computer, each of the plurality of resume blasting bots navigating to a career website within the list of target career websites without user interaction through the network, if a username and a password for the job seeker for the career website is known, the resume blasting bot logs onto the career website without user interaction using the username and the password; and if the username and the password for the job seeker on the career website is unknown, the resume blasting bot creates a default user account on the career website using a default username and a default password and the resume blasting bot logs onto the career website without user interaction using the default username and the default password and the resume blasting bot fills in fields on the career website using the job seeker profile and resume database without user interaction. | 7. A system for distributing a resume of a job seeker to career websites, the system comprising: a server computer connected to a network; a storage device operationally adapted to the server computer; a job seeker profile and resume database stored within the storage device; a user interface presented on a client computer, the client computer communicating with the server computer to capture a list of target career websites from the job seeker; and a plurality of resume blasting bots executing on the server computer, each of the plurality of resume blasting bots navigating to a career website within the list of target career websites without user interaction through the network, if a username and a password for the job seeker for the career website is known, the resume blasting bot logs onto the career website without user interaction using the username and the password; and if the username and the password for the job seeker on the career website is unknown, the resume blasting bot creates a default user account on the career website using a default username and a default password and the resume blasting bot logs onto the career website without user interaction using the default username and the default password and the resume blasting bot fills in fields on the career website using the job seeker profile and resume database without user interaction. 12. The system according to claim 7 , wherein the resume blasting bot uses a generated username and a generated password to create a default user account on the career website. | 0.608981 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.