sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
7. A computer-implemented method for obtaining human input regarding an item of interest to a user, the method comprising: identifying, by a computing system, a first plurality of human respondents by matching user-defined query criteria with human respondent profile information, wherein the user-defined query criteria identifies one or more characteristics of individual human respondents; based on a determination that the number of human respondents identified in the first plurality of the human respondents does not satisfy a threshold, modifying, by the computing system, the user-defined criteria; identifying, by the computing system, a second plurality of the human respondents by matching the modified user-defined query criteria with human respondent profile information, wherein the number of human respondents identified in the second plurality of human respondents satisfies the threshold; for individual human respondents of the second plurality of human respondents, providing one or more questions regarding the item of interest to a computing device associated with the human respondent; and receiving at least one response to the one or more questions from the human respondent.
|
7. A computer-implemented method for obtaining human input regarding an item of interest to a user, the method comprising: identifying, by a computing system, a first plurality of human respondents by matching user-defined query criteria with human respondent profile information, wherein the user-defined query criteria identifies one or more characteristics of individual human respondents; based on a determination that the number of human respondents identified in the first plurality of the human respondents does not satisfy a threshold, modifying, by the computing system, the user-defined criteria; identifying, by the computing system, a second plurality of the human respondents by matching the modified user-defined query criteria with human respondent profile information, wherein the number of human respondents identified in the second plurality of human respondents satisfies the threshold; for individual human respondents of the second plurality of human respondents, providing one or more questions regarding the item of interest to a computing device associated with the human respondent; and receiving at least one response to the one or more questions from the human respondent. 10. The method of claim 7 , wherein the threshold is a minimum number of human respondents identified in the query criteria.
| 0.676895 |
20. The method of claim 19 wherein capturing how the avatar of the user interacts includes determining how the avatar: answers questions posed by the one or more other characters; or makes purchases at or interacts with virtual stores or venues.
|
20. The method of claim 19 wherein capturing how the avatar of the user interacts includes determining how the avatar: answers questions posed by the one or more other characters; or makes purchases at or interacts with virtual stores or venues. 22. The method of claim 20 wherein the questions posed by the one or more other characters include questions posed by an avatar of another user.
| 0.957521 |
16. A method of providing natural language support for users running queries against a database, comprising: retrieving an abstract query comprising a plurality of logical fields, each corresponding to a logical field specification of a data abstraction model abstractly describing physical data residing in the database; determining, from the data abstraction model, an associated language resource component; determining, from the associated language resource component, at least two natural language expressions for the plurality of logical fields of the abstract query; and displaying the abstract query in one of the at least two determined natural language expressions to a user, wherein the natural language expression displayed is determined by a security setting of the user.
|
16. A method of providing natural language support for users running queries against a database, comprising: retrieving an abstract query comprising a plurality of logical fields, each corresponding to a logical field specification of a data abstraction model abstractly describing physical data residing in the database; determining, from the data abstraction model, an associated language resource component; determining, from the associated language resource component, at least two natural language expressions for the plurality of logical fields of the abstract query; and displaying the abstract query in one of the at least two determined natural language expressions to a user, wherein the natural language expression displayed is determined by a security setting of the user. 18. The method of claim 16 wherein the associated language resource component is a language resource file, the data abstraction model including a reference to the language resource file.
| 0.657829 |
18. A system for determining whether a first merchant item is an alternative of a second merchant item, the system comprising: a computer-readable memory and a processor communicatively coupled to the computer-readable memory, wherein the processor executes application code instructions that are stored in the computer-readable memory and that cause the system to: maintain information regarding a plurality of merchant items; analyze information regarding a plurality of queries to identify a plurality of merchant item-query pairs, each merchant item-query pair comprising a query and a merchant item that was previously selected from results for the query; determine, for each merchant item-query pair, a number of times that the merchant item was selected from results for the query; determine, for each merchant item-query pair, whether the query of the merchant item-query pair is associated with the merchant item of the merchant item-query pair based on the number of times that the merchant item was selected from results for the query relative to a number of times that results for the query were presented; analyze the information regarding the plurality of queries to identify comparison queries directed to a comparison between two or more of the plurality of merchant items; and determine whether a first merchant item is an alternative to a second merchant item based on a number of times that a query associated with the first merchant item is included in a comparison query with a query associated with the second merchant item.
|
18. A system for determining whether a first merchant item is an alternative of a second merchant item, the system comprising: a computer-readable memory and a processor communicatively coupled to the computer-readable memory, wherein the processor executes application code instructions that are stored in the computer-readable memory and that cause the system to: maintain information regarding a plurality of merchant items; analyze information regarding a plurality of queries to identify a plurality of merchant item-query pairs, each merchant item-query pair comprising a query and a merchant item that was previously selected from results for the query; determine, for each merchant item-query pair, a number of times that the merchant item was selected from results for the query; determine, for each merchant item-query pair, whether the query of the merchant item-query pair is associated with the merchant item of the merchant item-query pair based on the number of times that the merchant item was selected from results for the query relative to a number of times that results for the query were presented; analyze the information regarding the plurality of queries to identify comparison queries directed to a comparison between two or more of the plurality of merchant items; and determine whether a first merchant item is an alternative to a second merchant item based on a number of times that a query associated with the first merchant item is included in a comparison query with a query associated with the second merchant item. 21. The system of claim 18 , wherein the processor is further configured to execute computer-executable instructions stored in the computer-readable memory to cause the system to: compute an association weight for each of a plurality of merchant items relative to the second merchant item; rank the plurality of merchant items based on association weight; receive a query for the second merchant item; and transmit information regarding the second merchant item and information regarding at least one of the plurality of merchant items based on the association weight in response to a query for the second merchant item, the at least one product being selected based on association weight.
| 0.608178 |
1. A method executing on a server computer comprising: receiving a connection request from a seller application that is customizable by configuration information that includes a hierarchal product category structure for generating a listing for a product for sale, the seller application executing on a client machine; determining that the seller application has not been customized by a current version of the configuration information; transmitting the current version of the configuration information to the seller application, receiving, from the seller application, a product listing request and a configuration confirmation, the configuration confirmation indicating the seller application on the client machine has been configured using the current version of the configuration information to include the hierarchal product category structure; and generating a product listing using the product listing request.
|
1. A method executing on a server computer comprising: receiving a connection request from a seller application that is customizable by configuration information that includes a hierarchal product category structure for generating a listing for a product for sale, the seller application executing on a client machine; determining that the seller application has not been customized by a current version of the configuration information; transmitting the current version of the configuration information to the seller application, receiving, from the seller application, a product listing request and a configuration confirmation, the configuration confirmation indicating the seller application on the client machine has been configured using the current version of the configuration information to include the hierarchal product category structure; and generating a product listing using the product listing request. 14. The method of claim 1 , wherein: the configuration information further includes a language; and the seller application is configured by the configuration information, in response to the transmitting of the configuration information, to display content in the identified language.
| 0.597255 |
9. An apparatus comprising: an interface circuit configured for receiving, from a user interface, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; and an execution circuit configured for optimizing execution by the apparatus of the operation on the ad hoc geospatial directory, the execution circuit configured for returning to the user interface, via the interface circuit a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, modifying a state of at least a first of the entities, or accessing the first of the entities; wherein the interface circuit is configured for receiving a plurality of requests for execution of respective operations of the geospatial application, the execution circuit configured for optimizing execution of the requests based on: joining the requests into at least one locally-executable request and at least one remotely-executable request, sending the remotely-executable request to a second computing device, receiving from the second computing device a remote result responsive to the remotely-executable request, executing the locally-executable request for generation of a local result, and generating the responses for the respective requests based on selective partitioning of the local result and the remote result.
|
9. An apparatus comprising: an interface circuit configured for receiving, from a user interface, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; and an execution circuit configured for optimizing execution by the apparatus of the operation on the ad hoc geospatial directory, the execution circuit configured for returning to the user interface, via the interface circuit a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, modifying a state of at least a first of the entities, or accessing the first of the entities; wherein the interface circuit is configured for receiving a plurality of requests for execution of respective operations of the geospatial application, the execution circuit configured for optimizing execution of the requests based on: joining the requests into at least one locally-executable request and at least one remotely-executable request, sending the remotely-executable request to a second computing device, receiving from the second computing device a remote result responsive to the remotely-executable request, executing the locally-executable request for generation of a local result, and generating the responses for the respective requests based on selective partitioning of the local result and the remote result. 12. The apparatus of claim 9 , wherein the data structure in the response identifies at least one entity and includes accessor lambda functions for accessing the at least one entity via respective access protocols.
| 0.629708 |
14. A computer-implemented method, comprising: accessing, by a computing devices, a representation of a document category; accessing a set of documents, wherein each of the documents of the set is associated with a label indicating whether or not the document is associated with the document category; compiling a list of terms, wherein the list of terms includes distinct terms found in the documents of the set; computing information gain of each of the terms, wherein information gain is computed with regard to the document category; sorting the list by ordering the terms based on respective information gain; creating multiple association rules, wherein at least one of the association rules includes a logical conjunction of at least two terms of the list and one or more of the association rules includes at least one of the distinct terms; and performing an association rule analysis that includes performing the following operations with respect to each of the association rules: obtaining categorization results by using the association rule in categorizing each of the documents of the set with regard to the document category; recording the categorization results; and evaluating a precision of the association rule based on the respective categorization results.
|
14. A computer-implemented method, comprising: accessing, by a computing devices, a representation of a document category; accessing a set of documents, wherein each of the documents of the set is associated with a label indicating whether or not the document is associated with the document category; compiling a list of terms, wherein the list of terms includes distinct terms found in the documents of the set; computing information gain of each of the terms, wherein information gain is computed with regard to the document category; sorting the list by ordering the terms based on respective information gain; creating multiple association rules, wherein at least one of the association rules includes a logical conjunction of at least two terms of the list and one or more of the association rules includes at least one of the distinct terms; and performing an association rule analysis that includes performing the following operations with respect to each of the association rules: obtaining categorization results by using the association rule in categorizing each of the documents of the set with regard to the document category; recording the categorization results; and evaluating a precision of the association rule based on the respective categorization results. 23. The computer-implemented method of claim 14 , wherein, with respect to each of the association rules, using the association rule in categorizing the documents of the set with regard to the document category includes: identifying a set of negated words, wherein the set of negated words includes words negated by negation terms in the association rule, and wherein the set of negated words is empty when the association rule does not include any negation terms; identifying a set of distinct words, wherein the set of distinct words includes words or expressions used in distinct terms of the association rule; categorizing documents of the set as being included in the document category when both of the following conditions are satisfied: each word or expression in the set of distinct words is included in the document; and each negated word in the set of negated words is absent from the document.
| 0.538928 |
1. An IT system technical solution analysis and development improvement method comprising: receiving, by a computer processor of a computing system, requirements (NRQ) associated with hardware components for an IT system for design, assumptions associated with said requirements (NRQ), dependency data associated with said requirements (NRQ), stakeholder data associated with said requirements (NRQ), and entry criteria readiness data associated with said requirements (NRQ); building, by said processor, said requirements (NRQ) into internal logic of a requirements analytical engine software module of a quality evaluation hardware circuit; evaluating, by said computer processor executing said requirements analytical engine software module, a quality level of said requirements (NRQ); calculating, by said computer processor executing a requirements quality score hardware circuit based on said quality level, a requirements quality sub-score (RSC) for each requirement of said requirements (NRQ); evaluating, by said computer processor executing an assumptions analytical engine of a validate assumptions hardware circuit, said assumptions for hidden requirements of said requirements (NRQ); generating, by said computer processor executing a validate assumptions hardware circuit based on said hidden requirements, an assumptions score for said assumptions; evaluating, by said computer processor executing a dependencies analytical engine of a validate dependencies hardware circuit, said dependency data; generating, by said computer processor executing dependencies score hardware circuit based on results of said evaluating said dependency data, a dependencies score for said dependencies data; evaluating, by said computer processor executing a stakeholder analytical engine, said stakeholder data; generating, by said computer processor based on results of said evaluating said stakeholder data, a stakeholder approval level score for said stakeholder data; evaluating, by said computer processor executing a criteria analytical engine, said entry criteria readiness data; generating, by said computer processor based on results of said evaluating said entry criteria readiness data, an entry criteria readiness score (ECRS) for entry criteria readiness data; building, by said processor, defects internal logic into said requirements analytical engine software module; evaluating, by said computer processor executing said defects internal logic, defects of said hardware components for said IT system for design; generating, by said computer processor, an overall score summary summarizing each said requirements quality score, said assumptions score, said dependencies score, said stakeholder score, and said criteria readiness score, wherein said generating said overall score summary comprises: assigning priorities and weights to said requirements quality score, said assumptions score, said dependencies score, said stakeholder score, and said criteria readiness score, wherein said overall score summary depicts a quality of a technical solution for said IT system under development thereby automatically enabling a system engineer, associated with said IT system for design, to execute a quality analysis against said overall score summary, and wherein said quality analysis results in hardware enabled prompts, links, and automation processes to support and enable said system engineer to develop said IT system for design thereby improving a requirement quality of said IT system; integrating, by said computer processor, a technical solution for improving said requirements (NRQ) associated with said hardware components for said IT system for design; creating and deploying an improved IT system based on said technical solution for improving said requirements (NRQ) associated with said hardware components for said IT system for design; and presenting, by said computer processor via a plotter hardware device over a network, graphical and numerical charts indicating said overall score summary.
|
1. An IT system technical solution analysis and development improvement method comprising: receiving, by a computer processor of a computing system, requirements (NRQ) associated with hardware components for an IT system for design, assumptions associated with said requirements (NRQ), dependency data associated with said requirements (NRQ), stakeholder data associated with said requirements (NRQ), and entry criteria readiness data associated with said requirements (NRQ); building, by said processor, said requirements (NRQ) into internal logic of a requirements analytical engine software module of a quality evaluation hardware circuit; evaluating, by said computer processor executing said requirements analytical engine software module, a quality level of said requirements (NRQ); calculating, by said computer processor executing a requirements quality score hardware circuit based on said quality level, a requirements quality sub-score (RSC) for each requirement of said requirements (NRQ); evaluating, by said computer processor executing an assumptions analytical engine of a validate assumptions hardware circuit, said assumptions for hidden requirements of said requirements (NRQ); generating, by said computer processor executing a validate assumptions hardware circuit based on said hidden requirements, an assumptions score for said assumptions; evaluating, by said computer processor executing a dependencies analytical engine of a validate dependencies hardware circuit, said dependency data; generating, by said computer processor executing dependencies score hardware circuit based on results of said evaluating said dependency data, a dependencies score for said dependencies data; evaluating, by said computer processor executing a stakeholder analytical engine, said stakeholder data; generating, by said computer processor based on results of said evaluating said stakeholder data, a stakeholder approval level score for said stakeholder data; evaluating, by said computer processor executing a criteria analytical engine, said entry criteria readiness data; generating, by said computer processor based on results of said evaluating said entry criteria readiness data, an entry criteria readiness score (ECRS) for entry criteria readiness data; building, by said processor, defects internal logic into said requirements analytical engine software module; evaluating, by said computer processor executing said defects internal logic, defects of said hardware components for said IT system for design; generating, by said computer processor, an overall score summary summarizing each said requirements quality score, said assumptions score, said dependencies score, said stakeholder score, and said criteria readiness score, wherein said generating said overall score summary comprises: assigning priorities and weights to said requirements quality score, said assumptions score, said dependencies score, said stakeholder score, and said criteria readiness score, wherein said overall score summary depicts a quality of a technical solution for said IT system under development thereby automatically enabling a system engineer, associated with said IT system for design, to execute a quality analysis against said overall score summary, and wherein said quality analysis results in hardware enabled prompts, links, and automation processes to support and enable said system engineer to develop said IT system for design thereby improving a requirement quality of said IT system; integrating, by said computer processor, a technical solution for improving said requirements (NRQ) associated with said hardware components for said IT system for design; creating and deploying an improved IT system based on said technical solution for improving said requirements (NRQ) associated with said hardware components for said IT system for design; and presenting, by said computer processor via a plotter hardware device over a network, graphical and numerical charts indicating said overall score summary. 14. The method of claim 1 , wherein said evaluating said criteria readiness data comprises: determining weights (WSCi) associated to standard criteria items of said criteria readiness data; updating default weights for said standard criteria items; initializing criteria assessments (ECAi) of said standard criteria items from i=1 to i=total number of standard criteria items and checklist items for evaluation (ECT); initializing entry criteria points (ECPi) to 0; adding all of said weights (WSCi); and initializing all possible criteria points (TPCP), wherein TPCP=Σ i=1 ECT WSCi.
| 0.522882 |
11. A method by which a first computer system automatically converts a document to an interactive reference that can be interpreted by and displayed on a second computer system having a display screen sensitive to the position of a pointer, a processor in communication with the display screen, and a memory in communication with the processor such that at least portions of the interactive reference residing in the memory can be retrieved by interaction of the pointer with the display screen, the method comprising the following steps: separating the document into content blocks delineated by content commands within the document, some content blocks containing text or a picture, and at least one other content block containing a template for an interactive navigation dialog box allowing live interaction between the pointer and the display screen; creating page descriptions in which the content blocks are arranged on pages whose boundaries are defined by the display screen of the second computer, at least one of the page descriptions specifying the structure of a menu page; linking one or more buttons in the interactive navigation dialog box to other locations in the interactive reference such that when one of the buttons is selected with said pointer, another location within the interactive reference is displayed; and outputting commands describing the interactive reference, the commands having a format, at least when compiled, that can be stored in the memory of the second computer system and interpreted by the processor of the second computer system.
|
11. A method by which a first computer system automatically converts a document to an interactive reference that can be interpreted by and displayed on a second computer system having a display screen sensitive to the position of a pointer, a processor in communication with the display screen, and a memory in communication with the processor such that at least portions of the interactive reference residing in the memory can be retrieved by interaction of the pointer with the display screen, the method comprising the following steps: separating the document into content blocks delineated by content commands within the document, some content blocks containing text or a picture, and at least one other content block containing a template for an interactive navigation dialog box allowing live interaction between the pointer and the display screen; creating page descriptions in which the content blocks are arranged on pages whose boundaries are defined by the display screen of the second computer, at least one of the page descriptions specifying the structure of a menu page; linking one or more buttons in the interactive navigation dialog box to other locations in the interactive reference such that when one of the buttons is selected with said pointer, another location within the interactive reference is displayed; and outputting commands describing the interactive reference, the commands having a format, at least when compiled, that can be stored in the memory of the second computer system and interpreted by the processor of the second computer system. 15. The method of claim 11 further comprising the following steps: determining whether each content block defines a new subject; and and incorporating each new subject encountered in a browser.
| 0.673606 |
8. A computer system for determining a largest common series from one or more sets of ordered statements, the computer system comprising: a hardware processor; and a memory communicatively coupled to the processor, wherein the memory is not a transitory signal per se, wherein the memory is encoded with instructions, and wherein the instructions when executed by the processor include: compiling, in a first Elements Plain Text Table (EPTT), each statement from one or more sets of ordered statements, wherein each statement comprises a portion of plain text computer program code; wherein each EPTT comprises a respective script identifier, a respective script direct reference, a respective step number, and a plain text corresponding to each respective statement; recording, in a first Plain Text Count Table (PTCT) and based on the first EPTT, a respective number of appearances of each respective statement; determining, based on the first PTCT, a statement having a largest number of appearances; compiling, in a second EPTT, each statement following the statement having a largest number of appearances, wherein each statement following the statement having a largest number of appearances comprises a first order sequential statement; wherein each respective first order sequential statement comprises a statement in the first EPTT having a respective step number sequential to and greater than a respective step number of the statement having a largest number of appearances; recording, in a second PTCT, a number of appearances of each first order sequential statement; determining, based on the second PTCT, a first order sequential statement having a largest number of appearances following the statement having a largest number of appearances; and storing each appearance of the statement having a largest number of appearances and the first order sequential statement having a largest number of appearances in a Keywords Reference Links Table (KRLT) as the largest common series; wherein the KRLT comprises a respective potential keyword ID, a respective script, a respective keyword row number, and a respective script step number for each respective appearance.
|
8. A computer system for determining a largest common series from one or more sets of ordered statements, the computer system comprising: a hardware processor; and a memory communicatively coupled to the processor, wherein the memory is not a transitory signal per se, wherein the memory is encoded with instructions, and wherein the instructions when executed by the processor include: compiling, in a first Elements Plain Text Table (EPTT), each statement from one or more sets of ordered statements, wherein each statement comprises a portion of plain text computer program code; wherein each EPTT comprises a respective script identifier, a respective script direct reference, a respective step number, and a plain text corresponding to each respective statement; recording, in a first Plain Text Count Table (PTCT) and based on the first EPTT, a respective number of appearances of each respective statement; determining, based on the first PTCT, a statement having a largest number of appearances; compiling, in a second EPTT, each statement following the statement having a largest number of appearances, wherein each statement following the statement having a largest number of appearances comprises a first order sequential statement; wherein each respective first order sequential statement comprises a statement in the first EPTT having a respective step number sequential to and greater than a respective step number of the statement having a largest number of appearances; recording, in a second PTCT, a number of appearances of each first order sequential statement; determining, based on the second PTCT, a first order sequential statement having a largest number of appearances following the statement having a largest number of appearances; and storing each appearance of the statement having a largest number of appearances and the first order sequential statement having a largest number of appearances in a Keywords Reference Links Table (KRLT) as the largest common series; wherein the KRLT comprises a respective potential keyword ID, a respective script, a respective keyword row number, and a respective script step number for each respective appearance. 13. The computer system of claim 8 , wherein the instructions when executed by the processor further include: determining a second order sequential statement having a largest number of appearances based on a third PTCT, wherein a third EPTT catalogs each statement having a respective step number sequential to and greater than a respective step number of the first order sequential statement, wherein the third PTCT records a respective number of appearances of each statement based on the third EPTT; and storing each appearance of the statement having a largest number of appearances, the first order sequential statement having a largest number of appearances, and the second order sequential statement having a largest number of appearances in the KRLT as the largest common series.
| 0.5 |
1. A method of analyzing speech application performance comprising: determining a call path for each of a plurality of calls from a log of an interactive voice response system comprising a speech application, wherein each call path is defined by an ordered set of dialog nodes of the speech application; counting a number of occurrences of at least one selected type of event for the dialog nodes of the plurality of call paths; and indicating at least one call path from the plurality of call paths according, at least in part, to the number of occurrences of the selected type of event within the at least one indicated call path.
|
1. A method of analyzing speech application performance comprising: determining a call path for each of a plurality of calls from a log of an interactive voice response system comprising a speech application, wherein each call path is defined by an ordered set of dialog nodes of the speech application; counting a number of occurrences of at least one selected type of event for the dialog nodes of the plurality of call paths; and indicating at least one call path from the plurality of call paths according, at least in part, to the number of occurrences of the selected type of event within the at least one indicated call path. 3. The method of claim 1 , wherein, for each node of a call path, determining a number of occurrences further comprises: determining whether the selected type of event occurred at a current dialog node; if no counter for the event type exists at the current dialog node, creating a counter associated with the current dialog node and selected type of event and initializing the counter to a default value; and if a counter is associated with the selected type of event for the current dialog node, incrementing the counter.
| 0.510541 |
1. A system for handwriting synthesis comprising: circuitry configured to: access character shape images of an alphabet, determine a connection point location between two or more character shapes based on a calculated right edge position and a calculated left edge position of the character shape images, extract character features that indicate language attributes and width attributes of characters of the character shape images, the language attributes including character Kashida attributes, identify Kashida extensions as part of the character Kashida attributes; isolate the identified Kashida extensions from pepper noise components based on a predetermined ground-truth label, by constraining the extracted character features to be two consecutive characters, extract the identified Kashida extensions based on the predetermined ground-truth label, and generate images of cursive text based on the character Kashida attributes and the width attributes.
|
1. A system for handwriting synthesis comprising: circuitry configured to: access character shape images of an alphabet, determine a connection point location between two or more character shapes based on a calculated right edge position and a calculated left edge position of the character shape images, extract character features that indicate language attributes and width attributes of characters of the character shape images, the language attributes including character Kashida attributes, identify Kashida extensions as part of the character Kashida attributes; isolate the identified Kashida extensions from pepper noise components based on a predetermined ground-truth label, by constraining the extracted character features to be two consecutive characters, extract the identified Kashida extensions based on the predetermined ground-truth label, and generate images of cursive text based on the character Kashida attributes and the width attributes. 7. The system of claim 1 , wherein the circuitry is further configured to filter out attributes relating to a thickness of a left edge segment and a thickness of a right edge segment of the extracted Kashida.
| 0.556417 |
1. A method for automatically completing a remainder portion of a name as it is being entered, comprising: receiving, at processing circuitry configured to execute instructions stored on a memory, at least a prescribed number of starting characters of a name being entered into a first cell, wherein: the first cell is disposed in a document; the document includes a first table having a first table name and a second table having a second table name; the first table includes a first row or column having a first row or column name and the second table includes a second row or column having a second row or column name; the first row or column name and the second row or column name are the same; and the starting characters of the name being entered into the first cell include a string of characters found in the first row or column name and the second row or column name; using the processing circuitry to determine a set of valid reference names that include the starting characters of the name being entered into the first cell, wherein: a first valid reference name of the set of valid reference names comprises the first row or column name; a second valid reference name of the set of valid reference names comprises the second row or column name; and the first valid reference name comprises the first table name or the second valid reference name comprises the second table name; and providing with the processing circuitry the set of valid reference names as selectable auto-completion options to enable selection between the first valid reference name and the second valid reference name.
|
1. A method for automatically completing a remainder portion of a name as it is being entered, comprising: receiving, at processing circuitry configured to execute instructions stored on a memory, at least a prescribed number of starting characters of a name being entered into a first cell, wherein: the first cell is disposed in a document; the document includes a first table having a first table name and a second table having a second table name; the first table includes a first row or column having a first row or column name and the second table includes a second row or column having a second row or column name; the first row or column name and the second row or column name are the same; and the starting characters of the name being entered into the first cell include a string of characters found in the first row or column name and the second row or column name; using the processing circuitry to determine a set of valid reference names that include the starting characters of the name being entered into the first cell, wherein: a first valid reference name of the set of valid reference names comprises the first row or column name; a second valid reference name of the set of valid reference names comprises the second row or column name; and the first valid reference name comprises the first table name or the second valid reference name comprises the second table name; and providing with the processing circuitry the set of valid reference names as selectable auto-completion options to enable selection between the first valid reference name and the second valid reference name. 6. A method as recited in claim 1 , wherein the prescribed number of starting characters comprises the first two characters of the name.
| 0.685082 |
7. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving, from a user, an utterance that was spoken while focus is set on a field of a form; determining, from among one or more different field types, a field type associated with the field; determining, from among different, predefined levels of speech recognition accuracy and from among different, predefined levels of speech recognition latency, a predefined level of speech recognition accuracy and a predefined level of speech recognition latency that are indicated as acceptable for the field type; selecting, based at least on the predefined level of speech recognition accuracy and a predefined level of speech recognition latency that are indicated as acceptable for the field type, (i) one or more accent libraries that each include phonemes for different pronunciations for words of a language and (ii) a level of correction for a speech recognition system to apply to a transcription; obtaining, from the speech recognition system, the transcription of the utterance that is generated by the speech recognition system; and providing the transcription of the utterance in the field of the form.
|
7. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving, from a user, an utterance that was spoken while focus is set on a field of a form; determining, from among one or more different field types, a field type associated with the field; determining, from among different, predefined levels of speech recognition accuracy and from among different, predefined levels of speech recognition latency, a predefined level of speech recognition accuracy and a predefined level of speech recognition latency that are indicated as acceptable for the field type; selecting, based at least on the predefined level of speech recognition accuracy and a predefined level of speech recognition latency that are indicated as acceptable for the field type, (i) one or more accent libraries that each include phonemes for different pronunciations for words of a language and (ii) a level of correction for a speech recognition system to apply to a transcription; obtaining, from the speech recognition system, the transcription of the utterance that is generated by the speech recognition system; and providing the transcription of the utterance in the field of the form. 8. The system of claim 7 , wherein the operations further comprise: selecting the one or more accent libraries based on personal data that is associated with the user and is stored on a computing device that receives the utterance.
| 0.540604 |
1. A computer-implemented method, comprising: identifying a starting point and a destination point for travel by a user including any constraints of the user regarding the travel; determining one or more initial routes between the starting point and the destination point; for each initial route, segmenting the route into a plurality of segments based on one or more criteria; and determining attribute oriented routes using the segments including: determining one or more entities associated with each segment; identifying attributes for each determined entity; aggregating and ranking the attributes along all the determined initial routes and determining one or more emerging attributes; determining one or more attribute oriented routes based on the emerging attributes including identifying a theme for an attribute oriented route based on one or more of the emerging attributes, identifying a set of entities from the determined entities that are associated with the one or more emerging attributes, and creating the attribute oriented route that passes through a region that includes the set of entities, wherein determining one or more attribute oriented routes includes scoring a particular region based on matching emerging attributes of the particular region compared to one or more goals and determining routes that maximize an aggregate rank based on the scoring under the constraints; and providing at least one attribute oriented route and information related to the theme to a device associated with the user.
|
1. A computer-implemented method, comprising: identifying a starting point and a destination point for travel by a user including any constraints of the user regarding the travel; determining one or more initial routes between the starting point and the destination point; for each initial route, segmenting the route into a plurality of segments based on one or more criteria; and determining attribute oriented routes using the segments including: determining one or more entities associated with each segment; identifying attributes for each determined entity; aggregating and ranking the attributes along all the determined initial routes and determining one or more emerging attributes; determining one or more attribute oriented routes based on the emerging attributes including identifying a theme for an attribute oriented route based on one or more of the emerging attributes, identifying a set of entities from the determined entities that are associated with the one or more emerging attributes, and creating the attribute oriented route that passes through a region that includes the set of entities, wherein determining one or more attribute oriented routes includes scoring a particular region based on matching emerging attributes of the particular region compared to one or more goals and determining routes that maximize an aggregate rank based on the scoring under the constraints; and providing at least one attribute oriented route and information related to the theme to a device associated with the user. 3. The method of claim 1 wherein determining the one or more initial routes further includes determining a plurality of direct routes between the starting point and the destination point.
| 0.575384 |
14. An apparatus comprising: a network interface unit configured to enable communications over a network; a memory; a processor coupled to the network interface unit and the memory, the processor configured to: receive a trigger for an operation command to be executed on one or more network devices in the network; establish a connection to one or more network devices in the network; generate a command line interface command for execution of the operation command by one or more network devices, a randomly generated string being included at the end of the command line interface command; send the command line interface command over the network in order to invoke the operation command on one or more network devices on the network; receive output of the operation command from one or more devices; detect an end of the operation command output based on the randomly generated string; and parse the operation command output generated by the device using an XML based parser.
|
14. An apparatus comprising: a network interface unit configured to enable communications over a network; a memory; a processor coupled to the network interface unit and the memory, the processor configured to: receive a trigger for an operation command to be executed on one or more network devices in the network; establish a connection to one or more network devices in the network; generate a command line interface command for execution of the operation command by one or more network devices, a randomly generated string being included at the end of the command line interface command; send the command line interface command over the network in order to invoke the operation command on one or more network devices on the network; receive output of the operation command from one or more devices; detect an end of the operation command output based on the randomly generated string; and parse the operation command output generated by the device using an XML based parser. 17. The apparatus of claim 14 , wherein processor is configured to respond to the trigger that is automatically scheduled or based on user input.
| 0.644172 |
2. The method of claim 1 , wherein the step of translating one or more original elements further comprises calculating measurements associated with said one or more substitutive elements based on said one or more valuated dependencies.
|
2. The method of claim 1 , wherein the step of translating one or more original elements further comprises calculating measurements associated with said one or more substitutive elements based on said one or more valuated dependencies. 3. The method of claim 2 , wherein the step of translating one or more original elements includes further generating one or more logical dependencies between said one or more substitutive elements.
| 0.892241 |
5. The method of claim 4 , wherein the step (b1) comprises specifying said one or more metadata rules comprising a target name, a target value, a comparison operation for comparing the target value with the second field of the attribute the first field of which matches the target name, and the security access policy, comprising a permission set to be applied to the document for controlling access to the document based on results of the comparison operation.
|
5. The method of claim 4 , wherein the step (b1) comprises specifying said one or more metadata rules comprising a target name, a target value, a comparison operation for comparing the target value with the second field of the attribute the first field of which matches the target name, and the security access policy, comprising a permission set to be applied to the document for controlling access to the document based on results of the comparison operation. 8. The method of claim 5 , wherein the specifying said one or more metadata rules comprises specifying a compound expression for performing multiple comparisons on the target name and the target value.
| 0.836054 |
1. A data evaluation system comprising: at least one module, executing on one or more computer processors, to implement: a language and character set phase, to receive from a client device an authorized character set comprising some authorized characters from among one or more libraries of characters; a document phase including receipt of an input document, the input document comprising document characters; a detection phase including a comparison of the document characters against the authorized characters in the authorized character set to detect unauthorized characters in the input document not forming part of the authorized character set; and a reporting phase to receive from the client device a report configuration, and based on the report configuration cause display of the unauthorized characters to a user within a report.
|
1. A data evaluation system comprising: at least one module, executing on one or more computer processors, to implement: a language and character set phase, to receive from a client device an authorized character set comprising some authorized characters from among one or more libraries of characters; a document phase including receipt of an input document, the input document comprising document characters; a detection phase including a comparison of the document characters against the authorized characters in the authorized character set to detect unauthorized characters in the input document not forming part of the authorized character set; and a reporting phase to receive from the client device a report configuration, and based on the report configuration cause display of the unauthorized characters to a user within a report. 2. The system of claim 1 , wherein the reporting phase further comprises: an identification of a location of the unauthorized characters in the input document.
| 0.580791 |
1. An information associating apparatus comprising: a query extraction unit which compiles for at least each search user queries that were used in a past predetermined time interval taken from data comprising queries used in order to search for information, a preprocessing unit which calculates the parameters necessary for calculating the association degree between key words included in queries extracted for each search user by said query extraction unit, and an association degree calculation unit which calculates the association degree between key words using the parameters calculated by said preprocessing unit.
|
1. An information associating apparatus comprising: a query extraction unit which compiles for at least each search user queries that were used in a past predetermined time interval taken from data comprising queries used in order to search for information, a preprocessing unit which calculates the parameters necessary for calculating the association degree between key words included in queries extracted for each search user by said query extraction unit, and an association degree calculation unit which calculates the association degree between key words using the parameters calculated by said preprocessing unit. 5. An information associating apparatus according to claim 1 wherein: said query extraction unit compiles said queries for each search user in a predetermined time interval from queries used for searching during the said past predetermined time interval, said preprocessing unit calculates said parameters provided with a query parsing unit which parses said queries for each of said search users into key words, and a key word adding unit which calculates for each of said search users the number of uses of each of said key words in said predetermined time interval, and adds for all of said search users the number of uses of each of said key words calculated for each of said search users, and said association degree calculation unit calculates the correlation degree of key words by calculating the coefficient of correlation between two key words based on the number of uses of each of said key words in each of said predetermined time intervals which are added.
| 0.757335 |
10. A tangible computer readable storage medium comprising instructions that, when executed, cause a machine to at least: sort a set of messages based on a set of probabilities, the set of probabilities indicating a likelihood that the set of messages belong to a first classification; assign a first subset of first consecutive ones of the sorted set of messages to a first bucket; assign a second subset of second consecutive ones of the sorted set of messages to a second bucket, wherein a first message of the second bucket is consecutive to a last message of the first bucket with reference to the set of probabilities; determine a mean of probabilities of the first subset of messages assigned to the first bucket; store the mean in a tangible memory; store, for respective ones of the messages assigned to the first bucket, an indication that the respective message is assigned to the first bucket in the tangible memory, repeatedly (1) move a boundary between the first bucket and the second bucket and (2) recalculate the mean of probabilities of messages assigned to the first bucket in response to moving the boundary until deviations of the probabilities within the first bucket with respect to the mean are equal to or less than a threshold; and store a last recalculated mean as representative of the first bucket.
|
10. A tangible computer readable storage medium comprising instructions that, when executed, cause a machine to at least: sort a set of messages based on a set of probabilities, the set of probabilities indicating a likelihood that the set of messages belong to a first classification; assign a first subset of first consecutive ones of the sorted set of messages to a first bucket; assign a second subset of second consecutive ones of the sorted set of messages to a second bucket, wherein a first message of the second bucket is consecutive to a last message of the first bucket with reference to the set of probabilities; determine a mean of probabilities of the first subset of messages assigned to the first bucket; store the mean in a tangible memory; store, for respective ones of the messages assigned to the first bucket, an indication that the respective message is assigned to the first bucket in the tangible memory, repeatedly (1) move a boundary between the first bucket and the second bucket and (2) recalculate the mean of probabilities of messages assigned to the first bucket in response to moving the boundary until deviations of the probabilities within the first bucket with respect to the mean are equal to or less than a threshold; and store a last recalculated mean as representative of the first bucket. 12. The tangible computer readable storage medium as defined in claim 10 , wherein the mean is stored in the tangible memory in a first data structure associating an identifier for the first bucket with the mean and wherein the set of messages are stored in the tangible memory in a second data structure different from the first data structure, the second data structure associating one of the messages in the set of messages with an identifier for the first bucket.
| 0.562617 |
12. A method for extracting semantic information about a plurality of electronic documents autonomously created by different sources and being accessible via a computer network, comprising: accessing an electronic document via the computer network; generating a set of tokens by a computer, the tokens indicative of document object model (DOM) nodes associated with visual information in a displayed document image of the electronic document; deriving a non-prescribed visual grammar from the set of tokens by the computer, to represent a hidden syntax convention of visual presentation in the displayed document image; and applying said derived visual grammar by the computer to construct multiple parse trees that represent semantic structure of the electronic document and interpret a maximum subset of the set of tokens, wherein said non-prescribed visual grammar is derived from autonomous or heterogeneous Web documents to represent the hidden syntax convention of the visual presentation, and said derived non-prescribed visual grammar is a five tuple <Σ, N, s, Pd, Pf> where Σ is a set of terminal symbols, N is a set of nonterminal symbols, sεN is a start symbol, Pd is a set of production rules that represent visual patterns and Pf is a set of preference rules that represent pattern precedence.
|
12. A method for extracting semantic information about a plurality of electronic documents autonomously created by different sources and being accessible via a computer network, comprising: accessing an electronic document via the computer network; generating a set of tokens by a computer, the tokens indicative of document object model (DOM) nodes associated with visual information in a displayed document image of the electronic document; deriving a non-prescribed visual grammar from the set of tokens by the computer, to represent a hidden syntax convention of visual presentation in the displayed document image; and applying said derived visual grammar by the computer to construct multiple parse trees that represent semantic structure of the electronic document and interpret a maximum subset of the set of tokens, wherein said non-prescribed visual grammar is derived from autonomous or heterogeneous Web documents to represent the hidden syntax convention of the visual presentation, and said derived non-prescribed visual grammar is a five tuple <Σ, N, s, Pd, Pf> where Σ is a set of terminal symbols, N is a set of nonterminal symbols, sεN is a start symbol, Pd is a set of production rules that represent visual patterns and Pf is a set of preference rules that represent pattern precedence. 22. The method of claim 12 , wherein said Web documents are Web query forms.
| 0.672066 |
14. The system of claim 10 , further comprising: a user device and a computer storage apparatus in data communication with the data processing apparatus and storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising: receiving from the data processing apparatus the command models for the action; receiving an input sentence of n-grams; applying the command models to the input sentence of n-grams to generate respective action scores; determining, from the command models, an action invoked by the input sentence based on the action scores, the action being one of the actions in the set of actions; and performing the action.
|
14. The system of claim 10 , further comprising: a user device and a computer storage apparatus in data communication with the data processing apparatus and storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising: receiving from the data processing apparatus the command models for the action; receiving an input sentence of n-grams; applying the command models to the input sentence of n-grams to generate respective action scores; determining, from the command models, an action invoked by the input sentence based on the action scores, the action being one of the actions in the set of actions; and performing the action. 16. The system of claim 14 , wherein applying the command models to the input sentence of n-grams comprises, for each command model scoring the input sentence based, in part, on first n-grams that have been determined to be semantically relevant to the action and second n-grams that have been identified as being semantically irrelevant for all actions.
| 0.879986 |
12. A computer-readable storage medium storing a program that, when executed by a processer, causes the processor to: select features of a destination interface control document to generate, wherein the destination interface control document defines one or more of a communication technology employed, a structure of information communicated, or a mandatory message sequence; provide a template document having a list of standard interface control document components; provide a computer aided software engineering tool for maintaining interface control documents; generate the destination interface control document defining a structure using one of the standard interface control document components from the template document that correspond with the selected features, wherein the structure of the destination interface control document is empty and the structure is compatible with the computer aided software engineering tool; store the destination interface control document as an mdl file type in the computer aided software engineering tool, wherein the mdl file type is a modeling file in a proprietary format compatible with the computer aided software engineering tool; designate a source document having source data elements for the destination interface control document, wherein each of the source data elements include a structure name portion, an attribute name portion, a documentation portion maintaining a description of the data element, and a data type portion, and where the source document is an artifact of a software development tool that is incompatible with the computer aided software engineering tool; read at least some of the data elements from the source document; transform the read data elements from a format compatible with the software development tool to a format compatible with the computer aided software engineering tool; load the transformed data elements into the structure of the destination interface control document; and store the destination interface control document having at least some of the data elements in the computer aided software engineering tool.
|
12. A computer-readable storage medium storing a program that, when executed by a processer, causes the processor to: select features of a destination interface control document to generate, wherein the destination interface control document defines one or more of a communication technology employed, a structure of information communicated, or a mandatory message sequence; provide a template document having a list of standard interface control document components; provide a computer aided software engineering tool for maintaining interface control documents; generate the destination interface control document defining a structure using one of the standard interface control document components from the template document that correspond with the selected features, wherein the structure of the destination interface control document is empty and the structure is compatible with the computer aided software engineering tool; store the destination interface control document as an mdl file type in the computer aided software engineering tool, wherein the mdl file type is a modeling file in a proprietary format compatible with the computer aided software engineering tool; designate a source document having source data elements for the destination interface control document, wherein each of the source data elements include a structure name portion, an attribute name portion, a documentation portion maintaining a description of the data element, and a data type portion, and where the source document is an artifact of a software development tool that is incompatible with the computer aided software engineering tool; read at least some of the data elements from the source document; transform the read data elements from a format compatible with the software development tool to a format compatible with the computer aided software engineering tool; load the transformed data elements into the structure of the destination interface control document; and store the destination interface control document having at least some of the data elements in the computer aided software engineering tool. 16. The computer-readable storage medium of claim 12 , wherein the program further causes the processor to: input a use case name related to the interface control document; create a use case realization related to the use case name; and create a use case diagram related to the use case name.
| 0.628866 |
12. The system according to claim 10 wherein the update is initiated automatically in response to satisfaction of a predetermined criterion.
|
12. The system according to claim 10 wherein the update is initiated automatically in response to satisfaction of a predetermined criterion. 16. The system according to claim 12 wherein the predetermined criterion relates to attributes of terms included in the first term repository.
| 0.961826 |
20. A method suitable for use in transition of one or more applications of an organization, the one or more applications being transitioned from a first set of users to a second set of users, the method comprising: a. generating one or more transition plans for the one or more applications, the one or more transition plans being generated based on information corresponding to the one or more applications, the one or more transition plans comprising one or more transition activities; b. capturing a plurality of knowledge elements corresponding to the one or more applications and the one or more transition activities, wherein the plurality of knowledge elements are captured using one or more knowledge capturing tools and one or more predefined knowledge reference components, and wherein the plurality of knowledge elements comprise a set of source code, a use case, and an incident resolution; c. associating each of the plurality of knowledge elements corresponding to a particular application with one or more other elements corresponding to said application, wherein the association between the plurality of knowledge elements is established by the first set of users and the second set of users; d. enabling the first set of users to assess and validate the knowledge of the plurality of knowledge elements and the association between the plurality of knowledge elements, wherein the validation is performed based on a predefined set of rules; and e. providing collaboration between the first set of users and the second set of users, wherein the collaboration enables communication between the first set of users and the second set of users during the transition of the one or more applications.
|
20. A method suitable for use in transition of one or more applications of an organization, the one or more applications being transitioned from a first set of users to a second set of users, the method comprising: a. generating one or more transition plans for the one or more applications, the one or more transition plans being generated based on information corresponding to the one or more applications, the one or more transition plans comprising one or more transition activities; b. capturing a plurality of knowledge elements corresponding to the one or more applications and the one or more transition activities, wherein the plurality of knowledge elements are captured using one or more knowledge capturing tools and one or more predefined knowledge reference components, and wherein the plurality of knowledge elements comprise a set of source code, a use case, and an incident resolution; c. associating each of the plurality of knowledge elements corresponding to a particular application with one or more other elements corresponding to said application, wherein the association between the plurality of knowledge elements is established by the first set of users and the second set of users; d. enabling the first set of users to assess and validate the knowledge of the plurality of knowledge elements and the association between the plurality of knowledge elements, wherein the validation is performed based on a predefined set of rules; and e. providing collaboration between the first set of users and the second set of users, wherein the collaboration enables communication between the first set of users and the second set of users during the transition of the one or more applications. 29. The method of claim 20 further comprising managing the one or more transition activities, wherein the one or more transition activities are managed by a user.
| 0.662531 |
17. A computer program product comprising a computer-readable storage medium having instructions embodied thereon, which when executed by a computer, cause the computer to implement a method, the method comprising: detecting, via a communication component of a vehicle, a presence of a mobile communications device in the vehicle, the mobile communications device configured with a speech recognition component; encoding, via a computer processor embedded in the vehicle, data lists of content stored in a memory device of the vehicle; transmitting, via the computer processor, the data lists of content and a unique identifier of the vehicle over a data connection to the mobile communications device, the data lists of content linked to the unique identifier; in response to receiving a request to initiate a voice recognition session via an input component of the vehicle, transmitting the request and the unique identifier over the data connection to the speech recognition component of the mobile communications device; activating the speech recognition component responsive to the request, the activating causing a computer processor of the mobile communications device to retrieve the data lists of content via the unique identifier; and in response to a user voice command received by the speech recognition component, the speech recognition component interprets the user voice command, determines an action by evaluating the user voice command in view of the data lists of content, and transmits an instruction to the computer processor of the vehicle, the instruction directing the vehicle to implement the action.
|
17. A computer program product comprising a computer-readable storage medium having instructions embodied thereon, which when executed by a computer, cause the computer to implement a method, the method comprising: detecting, via a communication component of a vehicle, a presence of a mobile communications device in the vehicle, the mobile communications device configured with a speech recognition component; encoding, via a computer processor embedded in the vehicle, data lists of content stored in a memory device of the vehicle; transmitting, via the computer processor, the data lists of content and a unique identifier of the vehicle over a data connection to the mobile communications device, the data lists of content linked to the unique identifier; in response to receiving a request to initiate a voice recognition session via an input component of the vehicle, transmitting the request and the unique identifier over the data connection to the speech recognition component of the mobile communications device; activating the speech recognition component responsive to the request, the activating causing a computer processor of the mobile communications device to retrieve the data lists of content via the unique identifier; and in response to a user voice command received by the speech recognition component, the speech recognition component interprets the user voice command, determines an action by evaluating the user voice command in view of the data lists of content, and transmits an instruction to the computer processor of the vehicle, the instruction directing the vehicle to implement the action. 18. The computer program product of claim 17 , wherein the data lists of content include metadata associated with an infotainment system in the vehicle, the metadata including radio station data, and the action includes tuning a radio of the vehicle to a station indicated in the user voice command.
| 0.519924 |
7. The apparatus of claim 1 wherein said vital decoding means includes a single central processor unit responsive to said message for producing an output distinctive of said message, and wherein said multi-bit comparator compares said produced multi-bit word comprising a check word provided by said central processing unit to validate the operations thereof.
|
7. The apparatus of claim 1 wherein said vital decoding means includes a single central processor unit responsive to said message for producing an output distinctive of said message, and wherein said multi-bit comparator compares said produced multi-bit word comprising a check word provided by said central processing unit to validate the operations thereof. 10. The apparatus of claim 7 in which said central processor unit includes: means for decoding said message and writing a signal distinctive thereof in an output port, input means responsive to said signal in said output port for accessing a table and deriving a quantity therefrom, and means employing said quantity in deriving said check word.
| 0.887467 |
19. The non-transitory computer-readable storage medium of claim 14 , further comprising program code to identify a second location in the input text for a second breath, and wherein the synthesized speech comprises a second breath sound at the second location.
|
19. The non-transitory computer-readable storage medium of claim 14 , further comprising program code to identify a second location in the input text for a second breath, and wherein the synthesized speech comprises a second breath sound at the second location. 21. The non-transitory computer-readable storage medium of claim 19 , further comprising program code to determine a distance between the identified location and second location, and wherein the second breath sound is based at least in part on the distance.
| 0.921866 |
11. The method of claim 10 , wherein determining the candidate pause positions comprises applying semantic analysis to the content of the electronic text of the electronic book.
|
11. The method of claim 10 , wherein determining the candidate pause positions comprises applying semantic analysis to the content of the electronic text of the electronic book. 12. The method of claim 11 , wherein applying semantic analysis comprises: determining a portion of the content of the electronic text of the electronic book relating to at least one of a plot point and subject change; and assigning a position of the determined portion of the content as a candidate pause position of the candidate pause positions.
| 0.842654 |
86. A computer program product for producing a digital form of a digital document, wherein the document can be one of several different types and with varying content, the product comprising: a computer readable medium having computer program logic stored thereon, wherein the computer program logic defines: a data requesting component which produces a request for at least part of a document at an output; a data access component which accesses a definition of additional content for a type of the document; a data generation component which receives the type of the document as an input and produces additional content at an output, wherein the data processing component generates the additional content according to the definition of additional content for the type of the document; and a data processing component which receives a selected portion of the content of the document at one input and the output of the data generation component at another input and produces a digital form of the document at an output, wherein the portion was selected in accordance with the request, and wherein the data processing component combines the additional content and the content of the selected portion.
|
86. A computer program product for producing a digital form of a digital document, wherein the document can be one of several different types and with varying content, the product comprising: a computer readable medium having computer program logic stored thereon, wherein the computer program logic defines: a data requesting component which produces a request for at least part of a document at an output; a data access component which accesses a definition of additional content for a type of the document; a data generation component which receives the type of the document as an input and produces additional content at an output, wherein the data processing component generates the additional content according to the definition of additional content for the type of the document; and a data processing component which receives a selected portion of the content of the document at one input and the output of the data generation component at another input and produces a digital form of the document at an output, wherein the portion was selected in accordance with the request, and wherein the data processing component combines the additional content and the content of the selected portion. 87. The computer program product of claim 86, wherein the document is a digital document having fixed text content and fixed structure defined by descriptive markup defining a plurality of hierarchical elements providing an indication of structure of the digital document.
| 0.573786 |
10. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a method comprising: generating a topic vector representing semantic significance of one or more terms, wherein generating the topic vector comprises: performing a search on a sample corpus to obtain a plurality of samples; accessing a sematic space to determine a plurality of semantic vectors based at least in part on the plurality of samples, presenting a user interface comprising a plurality of themes based at least in part on the plurality of semantic vectors, receiving a user selection, via the user interface, of one or more themes from the plurality of themes, and saving the topic vector based at least in part on the user selection of one or more themes; associating a set of alert rules with the topic vector, wherein the set of alert rules define one or more thresholds that trigger one or more alerts; categorizing a set of messages based at least in part on analysis of the set of messages against the topic vector, to obtain a categorized set of messages; determining if the categorized set of messages satisfies the one or more thresholds defined in the set of alert rules; and if the one or more thresholds are satisfied, generating a corresponding alert of the one or more alerts.
|
10. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a method comprising: generating a topic vector representing semantic significance of one or more terms, wherein generating the topic vector comprises: performing a search on a sample corpus to obtain a plurality of samples; accessing a sematic space to determine a plurality of semantic vectors based at least in part on the plurality of samples, presenting a user interface comprising a plurality of themes based at least in part on the plurality of semantic vectors, receiving a user selection, via the user interface, of one or more themes from the plurality of themes, and saving the topic vector based at least in part on the user selection of one or more themes; associating a set of alert rules with the topic vector, wherein the set of alert rules define one or more thresholds that trigger one or more alerts; categorizing a set of messages based at least in part on analysis of the set of messages against the topic vector, to obtain a categorized set of messages; determining if the categorized set of messages satisfies the one or more thresholds defined in the set of alert rules; and if the one or more thresholds are satisfied, generating a corresponding alert of the one or more alerts. 17. The computer program product of claim 10 , wherein at least one alert rule of the set of alert rules corresponds to a change in a volume of the categorized set of messages.
| 0.673984 |
9. A system according to claim 1 , further comprising: a threshold determination module configured to set one or more of the predetermined number of transcribed speech utterances and the predetermined time based on at least one of call type, accuracy of transcription required, and type of service agreement signed by the speaker.
|
9. A system according to claim 1 , further comprising: a threshold determination module configured to set one or more of the predetermined number of transcribed speech utterances and the predetermined time based on at least one of call type, accuracy of transcription required, and type of service agreement signed by the speaker. 10. A system according to claim 9 , wherein the predetermined number of transcribed speech utterances is lower for the live call than for speech utterances from a call recording.
| 0.905828 |
15. A computer program product for detecting and describing lesions automatically, the computer program product comprising a computer-readable storage medium having program code embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program code executable by a processor to cause the processor to: train a convolutional neural network (CNN) to detect features, and train fully connected layers of the CNN, to map detected features to semantic descriptors based on a data set comprising one or more lesions; receive a medical image to be analyzed for lesions; extract feature maps comprising detected features from medical image using the trained CNN; detect a region of interest via the trained CNN and generate a bounding box around the detected region of interest; reduce a dimension of the region of interest based on the feature maps; and generate a semantic description of the region of interest via the trained fully connected layers; and generate and display a diagnostic image comprising the medical image, the bounding box, and the semantic description.
|
15. A computer program product for detecting and describing lesions automatically, the computer program product comprising a computer-readable storage medium having program code embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program code executable by a processor to cause the processor to: train a convolutional neural network (CNN) to detect features, and train fully connected layers of the CNN, to map detected features to semantic descriptors based on a data set comprising one or more lesions; receive a medical image to be analyzed for lesions; extract feature maps comprising detected features from medical image using the trained CNN; detect a region of interest via the trained CNN and generate a bounding box around the detected region of interest; reduce a dimension of the region of interest based on the feature maps; and generate a semantic description of the region of interest via the trained fully connected layers; and generate and display a diagnostic image comprising the medical image, the bounding box, and the semantic description. 19. The computer program product of claim 15 , comprising program code executable by the processor to extract a feature map for each dimension of the medical image.
| 0.663056 |
9. A system to generate a database query to retrieve a set of stored data records from an electronic data record system, the system comprising: a computer that includes one or more hardware processors; a repository of terminology content stored in accordance with an information reference model, wherein the information reference model includes a plurality of backbone classes, wherein the plurality of backbone classes are associated with a plurality of other types of backbone classes to form data structures representing a plurality of higher level healthcare concepts; a concept query system that executes on the computer to receive a concept query request comprising a set of search criteria, wherein the search criteria include a first classification identifier corresponding to a first classification container, and a semantic statement that defines, using the first classification identifier, an expected concept query result generated from a terminology service; generate, via a concept query generator, a classification concept query from the concept query request, wherein the classification concept query includes at least a subset of the search criteria and the first classification identifier, provide the classification concept query to the terminology service that manages the repository of terminology content, wherein the terminology content comprises a plurality of domains of concepts, wherein a plurality of semantically equivalent concepts are stored in different domains of concepts, and are mapped to one another using inter-domain or intra-domain mappings defined in the terminology service, and wherein concepts in each domain are organized into a plurality of classification containers, wherein each classification container represents a collection of semantically equivalent concepts having a corresponding classification identifier, identify, using the defined mappings and the semantic statement, one or more classification containers, wherein each of the one or more classification containers includes a concept semantically equivalent to a concept in the first classification container; and create a concept query result by extracting a plurality of concepts associated with the first classification identifier, from the first classification container and the one or more identified classification containers; and a database query generator to receive the plurality of associated concepts and generate the database query comprising predicates corresponding to the plurality of associated concepts.
|
9. A system to generate a database query to retrieve a set of stored data records from an electronic data record system, the system comprising: a computer that includes one or more hardware processors; a repository of terminology content stored in accordance with an information reference model, wherein the information reference model includes a plurality of backbone classes, wherein the plurality of backbone classes are associated with a plurality of other types of backbone classes to form data structures representing a plurality of higher level healthcare concepts; a concept query system that executes on the computer to receive a concept query request comprising a set of search criteria, wherein the search criteria include a first classification identifier corresponding to a first classification container, and a semantic statement that defines, using the first classification identifier, an expected concept query result generated from a terminology service; generate, via a concept query generator, a classification concept query from the concept query request, wherein the classification concept query includes at least a subset of the search criteria and the first classification identifier, provide the classification concept query to the terminology service that manages the repository of terminology content, wherein the terminology content comprises a plurality of domains of concepts, wherein a plurality of semantically equivalent concepts are stored in different domains of concepts, and are mapped to one another using inter-domain or intra-domain mappings defined in the terminology service, and wherein concepts in each domain are organized into a plurality of classification containers, wherein each classification container represents a collection of semantically equivalent concepts having a corresponding classification identifier, identify, using the defined mappings and the semantic statement, one or more classification containers, wherein each of the one or more classification containers includes a concept semantically equivalent to a concept in the first classification container; and create a concept query result by extracting a plurality of concepts associated with the first classification identifier, from the first classification container and the one or more identified classification containers; and a database query generator to receive the plurality of associated concepts and generate the database query comprising predicates corresponding to the plurality of associated concepts. 11. The system of claim 9 , wherein the associated concepts have an IS-A relationship with the classification container associated with the classification identifier.
| 0.546875 |
1. A system configured to generate a situation-dependent library, comprising: at least one processor and at least one memory, the at least one processor and the at least one memory cooperating to function as: a machine learning trainer configured to receive samples comprising temporal windows of token instances to which a user was exposed and situation identifiers corresponding to situations the user was in while being exposed to the temporal windows; wherein the token instances have overlapping instantiation periods and are spread over a period of time that spans at least a day, and the situation identifiers comprise situation identifiers for first and second situations; the machine learning trainer is further configured to receive target values corresponding to the temporal windows of token instances; the target values represent affective responses of the user to the token instances from the temporal windows of token instances; the machine learning trainer is further configured to train first and second situation-dependent machine learning-based user response models based on respective first and second datasets; wherein the first and second datasets are obtained from partitioning the samples according to the situations the user was in when exposed to the temporal windows of token instances corresponding to the samples; and wherein the first dataset comprises samples comprising situation identifiers for the first situation and corresponding target values, and the second dataset comprises samples comprising situation identifiers for the second situation and corresponding target values; and a model analyzer configured to generate, based on the first and second situation-dependent machine learning-based user response models, the situation-dependent library which describes a first set of expected affective responses of the user to certain tokens while being in the first situation, and a second set of expected affective responses of the user to the certain tokens while being in the second situation; wherein the first set is not identical to the second set, and wherein at least some of the token instances from the temporal windows of token instances are instantiations of the certain tokens.
|
1. A system configured to generate a situation-dependent library, comprising: at least one processor and at least one memory, the at least one processor and the at least one memory cooperating to function as: a machine learning trainer configured to receive samples comprising temporal windows of token instances to which a user was exposed and situation identifiers corresponding to situations the user was in while being exposed to the temporal windows; wherein the token instances have overlapping instantiation periods and are spread over a period of time that spans at least a day, and the situation identifiers comprise situation identifiers for first and second situations; the machine learning trainer is further configured to receive target values corresponding to the temporal windows of token instances; the target values represent affective responses of the user to the token instances from the temporal windows of token instances; the machine learning trainer is further configured to train first and second situation-dependent machine learning-based user response models based on respective first and second datasets; wherein the first and second datasets are obtained from partitioning the samples according to the situations the user was in when exposed to the temporal windows of token instances corresponding to the samples; and wherein the first dataset comprises samples comprising situation identifiers for the first situation and corresponding target values, and the second dataset comprises samples comprising situation identifiers for the second situation and corresponding target values; and a model analyzer configured to generate, based on the first and second situation-dependent machine learning-based user response models, the situation-dependent library which describes a first set of expected affective responses of the user to certain tokens while being in the first situation, and a second set of expected affective responses of the user to the certain tokens while being in the second situation; wherein the first set is not identical to the second set, and wherein at least some of the token instances from the temporal windows of token instances are instantiations of the certain tokens. 9. The system of claim 1 , wherein the machine learning trainer is further configured to train a random forest model, and the situation-dependent library comprises importance parameters for variables of the random forest model.
| 0.566323 |
1. A method for notifying a user when a set of characters is identified in a media file, the method comprising: receiving a set of characters inputted by the user of a computing device; playing the media file; transcribing the media file to form a transcription; determining whether the transcription of the media file includes the set of characters; identifying a sub-segment in which the set of characters occurs, wherein the sub-segment is marked by a beginning time point and an ending time point within a segment; and initiating a notification prompt on a graphical user interface of the computing device in response to determining that the media file includes the set of characters.
|
1. A method for notifying a user when a set of characters is identified in a media file, the method comprising: receiving a set of characters inputted by the user of a computing device; playing the media file; transcribing the media file to form a transcription; determining whether the transcription of the media file includes the set of characters; identifying a sub-segment in which the set of characters occurs, wherein the sub-segment is marked by a beginning time point and an ending time point within a segment; and initiating a notification prompt on a graphical user interface of the computing device in response to determining that the media file includes the set of characters. 5. The method of claim 1 , wherein playing and transcribing the media file occurs at the same time.
| 0.916259 |
6. The method of claim 1 wherein the vocabulary is reduced using hierarchical sampling.
|
6. The method of claim 1 wherein the vocabulary is reduced using hierarchical sampling. 7. The method of claim 6 wherein the hierarchical sampling eliminates words having fewer than five occurrences.
| 0.966019 |
12. A method comprising: obtaining a Document Object Model of a web page; identifying Document Object Model elements, of the Document Object Model, associated with native advertisement placement candidate containers, comprising: identifying, with the Document Object Model, HTML tag sequences that include at least L tags, where L is a specified number, repeat at least R times, where R is a specified number, and all correspond to a single element of the Document Object Model: constructing a suffix tree of a string of tags comprising all tags in the Document Object Model; performing a traversal of the suffix tree, beginning with a root node, and computing, for each node that is non-root and non-leaf, a number of leaf nodes of the each node; analyzing the Document Object Model by performing a recursion of the suffix tree and pruning the recursion when the number of leaf nodes of the each node is less than R; and based at least in part on the analysis relating to the Document Object Model, and utilizing at least some of the identified elements, determining, within the Document Object Model, one or more native advertisement placement candidate containers.
|
12. A method comprising: obtaining a Document Object Model of a web page; identifying Document Object Model elements, of the Document Object Model, associated with native advertisement placement candidate containers, comprising: identifying, with the Document Object Model, HTML tag sequences that include at least L tags, where L is a specified number, repeat at least R times, where R is a specified number, and all correspond to a single element of the Document Object Model: constructing a suffix tree of a string of tags comprising all tags in the Document Object Model; performing a traversal of the suffix tree, beginning with a root node, and computing, for each node that is non-root and non-leaf, a number of leaf nodes of the each node; analyzing the Document Object Model by performing a recursion of the suffix tree and pruning the recursion when the number of leaf nodes of the each node is less than R; and based at least in part on the analysis relating to the Document Object Model, and utilizing at least some of the identified elements, determining, within the Document Object Model, one or more native advertisement placement candidate containers. 13. The method of claim 12 , wherein L and R are parameters that are tuned at least in part to optimize native advertisement placement performance.
| 0.638095 |
1. A method of operating an application service to enhance document productivity, the method comprising: identifying an attempt to add a data connection in a document; in response to identifying the attempt to add the data connection in the document, identifying at least one other document as relevant to the attempt; and communicating a suggestion that identifies at least a portion of the other document for surfacing in a user interface to the application service.
|
1. A method of operating an application service to enhance document productivity, the method comprising: identifying an attempt to add a data connection in a document; in response to identifying the attempt to add the data connection in the document, identifying at least one other document as relevant to the attempt; and communicating a suggestion that identifies at least a portion of the other document for surfacing in a user interface to the application service. 6. The method of claim 1 wherein at least the portion of the other document comprises at least one of another data connection and a report in the other document.
| 0.753659 |
2. The computer program product as recited in claim 1 , wherein the instructions are further configured, upon execution by a processor, to: determine at least one derived feature based on the received domain related data and information; and identify the at least one angle for the narrative story based on the processed domain related data and information and the determined at least one derived feature.
|
2. The computer program product as recited in claim 1 , wherein the instructions are further configured, upon execution by a processor, to: determine at least one derived feature based on the received domain related data and information; and identify the at least one angle for the narrative story based on the processed domain related data and information and the determined at least one derived feature. 4. The computer program product recited in claim 2 , wherein the instructions are further configured, upon execution by a processor, to: determine at least one derived feature based on consideration of at least one member of the group consisting of a focus for the narrative story, a genre for the narrative story, a length of the narrative story, and a point of view for the narrative story.
| 0.820109 |
1. A speech recognition system implemented on a computer, the system comprising: a speech recognition engine comprising a plurality of modules for implementing a call flow having directed dialogs that a caller moves through during a call with the system, the speech recognition engine comprising a global module having defined therein primary concepts, and secondary concepts associated with the primary concepts, that are available to the caller throughout the call flow; a module configured to record a natural language audio input response from a caller; and a module configured to process at least a portion of the call flow and recognize one or more primary concepts and at least one secondary concept associated with each of the one or more primary concepts in an audio input comprising natural language, apply a score to each primary and secondary concept pair found in the audio input, and determine the caller response based on the concept pair with the highest score.
|
1. A speech recognition system implemented on a computer, the system comprising: a speech recognition engine comprising a plurality of modules for implementing a call flow having directed dialogs that a caller moves through during a call with the system, the speech recognition engine comprising a global module having defined therein primary concepts, and secondary concepts associated with the primary concepts, that are available to the caller throughout the call flow; a module configured to record a natural language audio input response from a caller; and a module configured to process at least a portion of the call flow and recognize one or more primary concepts and at least one secondary concept associated with each of the one or more primary concepts in an audio input comprising natural language, apply a score to each primary and secondary concept pair found in the audio input, and determine the caller response based on the concept pair with the highest score. 3. The speech recognition system of claim 1 , wherein the call flow executes a response chain based on the audio input.
| 0.568783 |
9. The method of claim 1 , further comprising excluding a first coupon from the filtered set of one or more coupons because the first coupon has been printed or redeemed a fewer number times with respect to the one or more input search terms than a second coupon.
|
9. The method of claim 1 , further comprising excluding a first coupon from the filtered set of one or more coupons because the first coupon has been printed or redeemed a fewer number times with respect to the one or more input search terms than a second coupon. 10. The method of claim 9 , further comprising including a third coupon from the filtered set of one or more coupons because the third coupon has not been printed or redeemed with respect to the one or more input search terms.
| 0.948409 |
2. The method of claim 1 , wherein the features of the preprocessed Arabic like alphanumeric character include directional features, histogram-based features and statistical features.
|
2. The method of claim 1 , wherein the features of the preprocessed Arabic like alphanumeric character include directional features, histogram-based features and statistical features. 3. The method of claim 2 , further comprising: validating, the classification using the histogram-based features; and refining the classification in response to determining that the classification is not valid.
| 0.927224 |
1. An automated method for creating an implicit profile for use by at least one of a recommendation engine or a question router, comprising: tracking user behavior on one or more electronic devices of a user and an electronic communications network used to access the recommendation engine or question router; analyzing user-related information relating to the user behavior to extract and derive key words therefrom which are used to characterize user interests, expertise, and skills; assigning key word weightings to each of the key words; storing the key words and the key word weightings in a profiles database as the implicit profile; wherein: the key word weightings are assigned based on at least relevancy calculations of the user-related information and recency of the user-related information; the relevancy calculations are based on at least a relation of the user-related information to current key words in the implicit profile; at least the implicit profile is used by the recommendation engine or question router to provide expert recommendations or expert information to the user in response to a recommendation request or information request from the user; access to the recommendation engine or question router is restricted and requires user login; and the tracking is enabled via a crawling or searching application running on the one or more electronic devices of the user for searching various computer applications or storage locations on the one or more electronic devices for obtaining the user-related information.
|
1. An automated method for creating an implicit profile for use by at least one of a recommendation engine or a question router, comprising: tracking user behavior on one or more electronic devices of a user and an electronic communications network used to access the recommendation engine or question router; analyzing user-related information relating to the user behavior to extract and derive key words therefrom which are used to characterize user interests, expertise, and skills; assigning key word weightings to each of the key words; storing the key words and the key word weightings in a profiles database as the implicit profile; wherein: the key word weightings are assigned based on at least relevancy calculations of the user-related information and recency of the user-related information; the relevancy calculations are based on at least a relation of the user-related information to current key words in the implicit profile; at least the implicit profile is used by the recommendation engine or question router to provide expert recommendations or expert information to the user in response to a recommendation request or information request from the user; access to the recommendation engine or question router is restricted and requires user login; and the tracking is enabled via a crawling or searching application running on the one or more electronic devices of the user for searching various computer applications or storage locations on the one or more electronic devices for obtaining the user-related information. 10. The method in accordance with claim 1 , wherein the key word weightings are further assigned based on one or more of an estimate of accuracy of the user-related information, type of the user-related information, source of the user-related information, amount of each type of the user-related information, time spent by user on each type or item of user-related information, and relation of the user-related information to information in the explicit profile of the user.
| 0.64899 |
28. The voice acquisition system of claim 25 , wherein said at least one microphone comprises at least two microphones which generate outputs indicative of sound generated within the vehicle cabin.
|
28. The voice acquisition system of claim 25 , wherein said at least one microphone comprises at least two microphones which generate outputs indicative of sound generated within the vehicle cabin. 29. The voice acquisition system of claim 28 , wherein a control in the vehicle is responsive to said outputs from said at least two microphones, said control at least partially distinguishing vocal signals from non-vocal signals present in said outputs.
| 0.924323 |
1. A method performed by a server, the method comprising: identifying, by a processor of the server, prior query data, where the prior query data includes at least query term information and category information associated with search results returned based on the query term information, where the prior query data further includes at least: query terms associated with a user query for business listing information, a resulting business name returned in response to the user query, and a resulting business category associated with the resulting business name; determining, by the processor, whether the category information is a synonym for the query term information, where the determining comprises: determining whether the prior query data relates to a name query or a categorical query, determining whether the query terms are a candidate synonym of the resulting business category when the prior query data relates to a categorical query, determining whether a query, category pair, associated with the prior query data, is a hyponym, rejecting the query terms as a synonym of the resulting business category when the query, category pair, associated with the prior query data, is a hyponym, and accepting the query terms as a synonym of the resulting business category when the query, category pair associated with the prior query data is not a hyponym; receiving, by the processor, a subsequent search request relating to the query term information or the category information; refining, by the processor, the subsequent search request based on the query term information and the category information when the query term information is a synonym for the category information; performing, by the processor, a search based on the refined search request; and providing, by the processor, search results based on the search.
|
1. A method performed by a server, the method comprising: identifying, by a processor of the server, prior query data, where the prior query data includes at least query term information and category information associated with search results returned based on the query term information, where the prior query data further includes at least: query terms associated with a user query for business listing information, a resulting business name returned in response to the user query, and a resulting business category associated with the resulting business name; determining, by the processor, whether the category information is a synonym for the query term information, where the determining comprises: determining whether the prior query data relates to a name query or a categorical query, determining whether the query terms are a candidate synonym of the resulting business category when the prior query data relates to a categorical query, determining whether a query, category pair, associated with the prior query data, is a hyponym, rejecting the query terms as a synonym of the resulting business category when the query, category pair, associated with the prior query data, is a hyponym, and accepting the query terms as a synonym of the resulting business category when the query, category pair associated with the prior query data is not a hyponym; receiving, by the processor, a subsequent search request relating to the query term information or the category information; refining, by the processor, the subsequent search request based on the query term information and the category information when the query term information is a synonym for the category information; performing, by the processor, a search based on the refined search request; and providing, by the processor, search results based on the search. 2. The method of claim 1 , wherein identifying prior query data further comprises: determining whether the prior query data had received a previous indication of relevancy.
| 0.521222 |
1. A program transformation system, comprising: a processor coupled to a memory, the processor configured to execute the following computer-executable components stored in the memory: a code generation component that generates semantically equivalent code in a class-less scripting language from an object-oriented programming language representation of a hierarchy of one or more classes or interfaces and a virtual constructor component that produces a dispatch construct that captures class and/or interface method implementation to facilitate dynamic dispatch.
|
1. A program transformation system, comprising: a processor coupled to a memory, the processor configured to execute the following computer-executable components stored in the memory: a code generation component that generates semantically equivalent code in a class-less scripting language from an object-oriented programming language representation of a hierarchy of one or more classes or interfaces and a virtual constructor component that produces a dispatch construct that captures class and/or interface method implementation to facilitate dynamic dispatch. 2. The system of claim 1 , the dispatch construct is a dictionary object.
| 0.736919 |
1. An apparatus for creating an electronic version of machine printed matter, the apparatus including: a data reading means arranged to optically obtain image data which can be used to present an electronic image of the printed matter, the electronic image having substantially the same appearance as the printed matter, and a region containing machine printed information which cannot be readily discerned; an input means arranged to obtain and modify text-based information data entered by a user and representing the information contained in the region containing machine printed information which cannot be readily discerned when viewed by a viewer different and remote from the user in a manner that allows the information to be readily discerned; a creating means arranged to create a reference which can be used to retrieve the information data; and a processing means arranged to process the image data and the reference in order to create presentation data, wherein the presentation data can be used to present the electronic image, and to retrieve the information data so that it can be used to present the information contained in the region in a manner that is readily discernible by the viewer.
|
1. An apparatus for creating an electronic version of machine printed matter, the apparatus including: a data reading means arranged to optically obtain image data which can be used to present an electronic image of the printed matter, the electronic image having substantially the same appearance as the printed matter, and a region containing machine printed information which cannot be readily discerned; an input means arranged to obtain and modify text-based information data entered by a user and representing the information contained in the region containing machine printed information which cannot be readily discerned when viewed by a viewer different and remote from the user in a manner that allows the information to be readily discerned; a creating means arranged to create a reference which can be used to retrieve the information data; and a processing means arranged to process the image data and the reference in order to create presentation data, wherein the presentation data can be used to present the electronic image, and to retrieve the information data so that it can be used to present the information contained in the region in a manner that is readily discernible by the viewer. 11. The apparatus of claim 1 , further including distribution means arranged to distribute the presentation data, via a communication system, to a recipient.
| 0.585023 |
1. A computer program product, comprising a non-transitory memory medium having a computer readable program code embodied therein, the computer readable program code causing a computer to implement a method, the method comprising: providing a system accessible to a plurality of subscribers, where the system provides hosted third-party applications and content for a plurality of logically separate organizations, and where each subscriber is associated with at least one of the plurality of organizations; providing, in the system, a set of logically separated storage areas, where each logically separated storage area is associated with a corresponding organization from the plurality of organizations and is inaccessible to organizations other than the corresponding organization; storing, in the system, information describing the plurality of subscribers associated with each of the organizations; receiving a first search request that includes a first search term from a subscriber of a organization of the plurality of organizations; formulating, by the system, a search query that includes the first search term and information describing the subscriber; performing, by the system, the search query within the logically separated storage area of the organization using the first search term and the information describing the subscriber, including performing the search query within a unique search index of the organization, the search index containing a plurality of data records, each of the plurality of data records within the search index including: a last update field indicating a time when the record was last modified by any subscriber of the organization of the system; at least one last activity field indicating a time when an action was last performed utilizing the record; a record owner field indicating an owner of the record within the organization, and a record owner role field indicating a location of the owner of the record within a hierarchy of the organization; and returning, by the system, a plurality of first data records within the unique search index that match the first search term and the information describing the subscriber, where the plurality of first data records are ordered based at least in part on one or more subscriber interactions with the plurality of first data records, the one or more interactions including actions by one or more additional subscribers of the organization of the system, and where the plurality of first data records are ordered by: determining a normalized search relevancy score that is returned by a search engine for each of the plurality of first data records, assigning a last update score to each of the plurality of first data records based on a value of the last update field of each of the plurality of first data records, assigning a last activity score to each of the plurality of first data records based on a value of the last activity field of each of the plurality of first data records, multiplying each of the normalized search relevancy score, the last update score, and the at least one last activity score for each of the plurality of first data records by a unique predetermined weight factor to determine a final relevancy score for each of the plurality of first data records, and ordering the plurality of first data records such that data records of the plurality of first data records having a higher final relevancy score are ranked higher than data records of the plurality of first data records having a lower final relevancy score.
|
1. A computer program product, comprising a non-transitory memory medium having a computer readable program code embodied therein, the computer readable program code causing a computer to implement a method, the method comprising: providing a system accessible to a plurality of subscribers, where the system provides hosted third-party applications and content for a plurality of logically separate organizations, and where each subscriber is associated with at least one of the plurality of organizations; providing, in the system, a set of logically separated storage areas, where each logically separated storage area is associated with a corresponding organization from the plurality of organizations and is inaccessible to organizations other than the corresponding organization; storing, in the system, information describing the plurality of subscribers associated with each of the organizations; receiving a first search request that includes a first search term from a subscriber of a organization of the plurality of organizations; formulating, by the system, a search query that includes the first search term and information describing the subscriber; performing, by the system, the search query within the logically separated storage area of the organization using the first search term and the information describing the subscriber, including performing the search query within a unique search index of the organization, the search index containing a plurality of data records, each of the plurality of data records within the search index including: a last update field indicating a time when the record was last modified by any subscriber of the organization of the system; at least one last activity field indicating a time when an action was last performed utilizing the record; a record owner field indicating an owner of the record within the organization, and a record owner role field indicating a location of the owner of the record within a hierarchy of the organization; and returning, by the system, a plurality of first data records within the unique search index that match the first search term and the information describing the subscriber, where the plurality of first data records are ordered based at least in part on one or more subscriber interactions with the plurality of first data records, the one or more interactions including actions by one or more additional subscribers of the organization of the system, and where the plurality of first data records are ordered by: determining a normalized search relevancy score that is returned by a search engine for each of the plurality of first data records, assigning a last update score to each of the plurality of first data records based on a value of the last update field of each of the plurality of first data records, assigning a last activity score to each of the plurality of first data records based on a value of the last activity field of each of the plurality of first data records, multiplying each of the normalized search relevancy score, the last update score, and the at least one last activity score for each of the plurality of first data records by a unique predetermined weight factor to determine a final relevancy score for each of the plurality of first data records, and ordering the plurality of first data records such that data records of the plurality of first data records having a higher final relevancy score are ranked higher than data records of the plurality of first data records having a lower final relevancy score. 2. The computer program product of claim 1 , wherein formulating the first search query is performed by an application server in response to the first search request received from a subscriber system of the subscriber including the first search term.
| 0.735838 |
2. A translating apparatus, comprising: input means for inputting a range to be translated in an original text; display means for displaying the original text; context process range setting means for setting a context process range in the original text; context processing means for performing a context process for the original text; and translation processing means for translating an original text in the range to be translated into translated text, based on a context in the context process range.
|
2. A translating apparatus, comprising: input means for inputting a range to be translated in an original text; display means for displaying the original text; context process range setting means for setting a context process range in the original text; context processing means for performing a context process for the original text; and translation processing means for translating an original text in the range to be translated into translated text, based on a context in the context process range. 22. The translating apparatus according to claim 2, wherein: said context process range setting means comprises: boundary detecting means for detecting a boundary of context; and terminating means for terminating an extension of the context process range at the boundary, when said boundary detecting means detects the boundary of context.
| 0.5 |
1. A system comprising: a non-transitory memory; and one or more hardware processors coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations comprising: receiving a proposed password from a user; accessing a previous password of the user; decomposing the proposed password and the previous password into a first plurality of components and a second plurality of components, respectively; analyzing the first plurality of components and the second plurality of components in relation to the proposed password and the previous password, respectively, to discern a first set of formation rules used to form the proposed password from the first plurality of components and a second set of formation rules used to form the previous password from the second plurality of components; determining a similarity between the proposed password and the previous password based on a comparison between the first plurality of components and the second plurality of components and a comparison between the first set of formation rules and the second set of formation rules; and determining to accept the proposed password based on the similarity.
|
1. A system comprising: a non-transitory memory; and one or more hardware processors coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations comprising: receiving a proposed password from a user; accessing a previous password of the user; decomposing the proposed password and the previous password into a first plurality of components and a second plurality of components, respectively; analyzing the first plurality of components and the second plurality of components in relation to the proposed password and the previous password, respectively, to discern a first set of formation rules used to form the proposed password from the first plurality of components and a second set of formation rules used to form the previous password from the second plurality of components; determining a similarity between the proposed password and the previous password based on a comparison between the first plurality of components and the second plurality of components and a comparison between the first set of formation rules and the second set of formation rules; and determining to accept the proposed password based on the similarity. 3. The system of claim 1 , wherein the determining the similarity comprises determining a similarity score for the proposed password, and wherein the determining to accept the proposed password based on the similarity includes comparing the similarity score for the proposed password with a threshold score.
| 0.609375 |
1. A system comprising: an imaging device that acquires an image; and, an acquisition layer logically located between a source manager operating in accordance with the TWAIN protocol and the imaging device, the source manager being called by an application when a user of the system requests to acquire the image, the acquisition layer including imaging acquisition logic that receives the image from the imaging device and performs optical character recognition (OCR) that extracts machine editable text from the image, wherein the acquisition layer forwards the image to the application and makes the machine editable text available to the user.
|
1. A system comprising: an imaging device that acquires an image; and, an acquisition layer logically located between a source manager operating in accordance with the TWAIN protocol and the imaging device, the source manager being called by an application when a user of the system requests to acquire the image, the acquisition layer including imaging acquisition logic that receives the image from the imaging device and performs optical character recognition (OCR) that extracts machine editable text from the image, wherein the acquisition layer forwards the image to the application and makes the machine editable text available to the user. 7. The system of claim 1 wherein the acquisition layer makes the machine editable text available to the user before forwarding the image to the application.
| 0.804239 |
1. A system for developing web services, comprising: a Design Time Framework including a code generator that receives a first set of configuration files from a user and generates source code artifacts in an object oriented programming language based on the received first set of configuration files, wherein the first set of configuration files comprises an XML schema file, an XML descriptor file, and an XML rule file, wherein the XML schema file comprises XML schema annotations specifying properties of fields in the XML schema file, wherein an output of the Design Time Framework results from a compiling of the source code artifacts in an object oriented programming language based on the XML schema file, and the output comprises binary objects in a binary format and having field properties specified by the XML schema annotations; an Object-Service Framework that receives a second set of configuration files from the user, wherein the Object-Service Framework comprises a set of pre-built runtime services, wherein each of the pre-built runtime services extends the Object-Service Framework and comprises binary code that was compiled before the compiling of the source code artifacts of the Design Time Framework in an object oriented programming language based on the XML schema file, wherein behaviors of the pre-built runtime services can be dynamically changed using the second set of configuration files, and wherein the Object Service Framework defines an application program interface (API) for each of the pre-built runtime services and wherein the pre-built runtime services interact with the source code artifacts of the Design Time Framework through the application program interface and wherein the pre-built runtime services extend the application program interface, and for CRUD services of the pre-built runtime services that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework to perform on a persistent database of the system at least one of create, retrieve, update, or delete instances of information structures, wherein information is passed between the CRUD services and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, for security field services of the pre-built runtime services that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework and obtains security policy types, security policy operations, and resource values in the second set of configuration files to control the access to the web service and fields of the web service, wherein information is passed between the security field services and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, for an XML marshall service that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework and retrieves dynamic properties specified in the second set of configuration files to create XML formatted data having a first XML format, wherein information is passed between the XML marshall service and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, for an XML transformation service that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework to transform the created XML formatted data having the first XML format to XML formatted data having a second XML format, different from the first XML format, wherein information is passed between the XML transformation service and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, for an XML schema validation service that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework and retrieves dynamic properties specified in the second set of configuration files to validate and convert an input XML formatted data into an instance of the binary form of the Design Time Framework, wherein information is passed between the XML schema validation service and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, and for a key value service that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework and retrieves dynamic properties specified in the second set of configuration files to validate and convert data formatted as name-value pair into an instance of the binary output form of the Design Time Framework, wherein information is passed between the a key value service and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework; and a Run Time Framework, running on a machine including a processor, that comprises pre-built binary code, wherein in response to an incoming event for the web service, the Run Time Framework retrieves from the second set of configuration files a selection of the pre-built runtime services to be placed in a flow for the web service and an order in which the selected pre-built runtime services will be placed in the flow.
|
1. A system for developing web services, comprising: a Design Time Framework including a code generator that receives a first set of configuration files from a user and generates source code artifacts in an object oriented programming language based on the received first set of configuration files, wherein the first set of configuration files comprises an XML schema file, an XML descriptor file, and an XML rule file, wherein the XML schema file comprises XML schema annotations specifying properties of fields in the XML schema file, wherein an output of the Design Time Framework results from a compiling of the source code artifacts in an object oriented programming language based on the XML schema file, and the output comprises binary objects in a binary format and having field properties specified by the XML schema annotations; an Object-Service Framework that receives a second set of configuration files from the user, wherein the Object-Service Framework comprises a set of pre-built runtime services, wherein each of the pre-built runtime services extends the Object-Service Framework and comprises binary code that was compiled before the compiling of the source code artifacts of the Design Time Framework in an object oriented programming language based on the XML schema file, wherein behaviors of the pre-built runtime services can be dynamically changed using the second set of configuration files, and wherein the Object Service Framework defines an application program interface (API) for each of the pre-built runtime services and wherein the pre-built runtime services interact with the source code artifacts of the Design Time Framework through the application program interface and wherein the pre-built runtime services extend the application program interface, and for CRUD services of the pre-built runtime services that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework to perform on a persistent database of the system at least one of create, retrieve, update, or delete instances of information structures, wherein information is passed between the CRUD services and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, for security field services of the pre-built runtime services that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework and obtains security policy types, security policy operations, and resource values in the second set of configuration files to control the access to the web service and fields of the web service, wherein information is passed between the security field services and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, for an XML marshall service that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework and retrieves dynamic properties specified in the second set of configuration files to create XML formatted data having a first XML format, wherein information is passed between the XML marshall service and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, for an XML transformation service that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework to transform the created XML formatted data having the first XML format to XML formatted data having a second XML format, different from the first XML format, wherein information is passed between the XML transformation service and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, for an XML schema validation service that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework and retrieves dynamic properties specified in the second set of configuration files to validate and convert an input XML formatted data into an instance of the binary form of the Design Time Framework, wherein information is passed between the XML schema validation service and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework, and for a key value service that extend the Object-Service Framework, the Object-Service Framework searches the output of the Design Time Framework and retrieves dynamic properties specified in the second set of configuration files to validate and convert data formatted as name-value pair into an instance of the binary output form of the Design Time Framework, wherein information is passed between the a key value service and source code artifacts of the Design Time Framework by way of the application program interface (API) of the Object Service Framework; and a Run Time Framework, running on a machine including a processor, that comprises pre-built binary code, wherein in response to an incoming event for the web service, the Run Time Framework retrieves from the second set of configuration files a selection of the pre-built runtime services to be placed in a flow for the web service and an order in which the selected pre-built runtime services will be placed in the flow. 9. The system of claim 1 wherein the web service is a first web service, the Design Time Framework receives a third set of configuration files, different from the first set of configuration files, the Object-Service Framework receives a fourth set of configuration files, different from the second set of configuration files, and the Run Time Framework generates a second web service, different from the first web service without alteration of the set of pre-built runtime services.
| 0.5 |
15. A non-transitory, tangible machine readable medium on which instructions are stored, the instructions, when executed by one or more processors, cause the one or more processors to perform a method, the method comprising: selecting a first geographic entity of a plurality of distinct geographic entities; identifying a plurality of distinct geographic sub-entities, each distinct geographic sub-entity having a geographic containment relationship with the first geographic entity, the plurality of distinct geographic sub-entities including: a first distinct geographic sub-entity that is both (i) visually represented by at least one landmark corresponding to the first distinct geographic sub-entity and (ii) associated with a pre-stored navigation experience of a plurality of pre-stored navigation experiences that is unique to the first distinct geographic sub-entity, and a second distinct geographic sub-entity that is not at least one of (i) visually represented by at least one landmark corresponding to the second distinct geographic sub-entity and (ii) associated with a pre-stored navigation experience of the plurality of pre-stored navigation experiences that is unique to the second distinct geographic sub-entity, wherein each pre-stored navigation experience in the plurality of pre-stored navigation experiences corresponds to a given geographic entity and comprises a sequence of images and transitions between the images that produces a tour of at least one landmark associated with the given geographic entity; filtering the plurality of distinct geographic sub-entities to remove at least one distinct geographic sub-entity that is not at least one of (i) visually represented by at least one landmark and (ii) associated with a pre-stored navigation experience of the plurality of pre-stored navigation experiences that is unique to the at least one distinct geographic sub-entity, the at least one distinct geographic sub-entity including the second geographic sub-entity; determining a ranking order of the filtered plurality of distinct geographic sub-entities based at least in part on one or more characteristics of each distinct geographic sub-entity in the filtered plurality of distinct geographic sub-entities; selecting a subset of at least two distinct geographic sub-entities based on the ranking order; and generating a semantic image navigation experience for the first geographic entity based on at least the pre-stored navigation experiences associated with the subset of at least two distinct geographic sub-entities by: automatically selecting a plurality of images from each pre-stored navigation experience of the subset of at least two distinct geographic sub-entities, and including the plurality of selected images in the semantic image navigation experience as a sequence of images based on the ranking order.
|
15. A non-transitory, tangible machine readable medium on which instructions are stored, the instructions, when executed by one or more processors, cause the one or more processors to perform a method, the method comprising: selecting a first geographic entity of a plurality of distinct geographic entities; identifying a plurality of distinct geographic sub-entities, each distinct geographic sub-entity having a geographic containment relationship with the first geographic entity, the plurality of distinct geographic sub-entities including: a first distinct geographic sub-entity that is both (i) visually represented by at least one landmark corresponding to the first distinct geographic sub-entity and (ii) associated with a pre-stored navigation experience of a plurality of pre-stored navigation experiences that is unique to the first distinct geographic sub-entity, and a second distinct geographic sub-entity that is not at least one of (i) visually represented by at least one landmark corresponding to the second distinct geographic sub-entity and (ii) associated with a pre-stored navigation experience of the plurality of pre-stored navigation experiences that is unique to the second distinct geographic sub-entity, wherein each pre-stored navigation experience in the plurality of pre-stored navigation experiences corresponds to a given geographic entity and comprises a sequence of images and transitions between the images that produces a tour of at least one landmark associated with the given geographic entity; filtering the plurality of distinct geographic sub-entities to remove at least one distinct geographic sub-entity that is not at least one of (i) visually represented by at least one landmark and (ii) associated with a pre-stored navigation experience of the plurality of pre-stored navigation experiences that is unique to the at least one distinct geographic sub-entity, the at least one distinct geographic sub-entity including the second geographic sub-entity; determining a ranking order of the filtered plurality of distinct geographic sub-entities based at least in part on one or more characteristics of each distinct geographic sub-entity in the filtered plurality of distinct geographic sub-entities; selecting a subset of at least two distinct geographic sub-entities based on the ranking order; and generating a semantic image navigation experience for the first geographic entity based on at least the pre-stored navigation experiences associated with the subset of at least two distinct geographic sub-entities by: automatically selecting a plurality of images from each pre-stored navigation experience of the subset of at least two distinct geographic sub-entities, and including the plurality of selected images in the semantic image navigation experience as a sequence of images based on the ranking order. 16. The medium of claim 15 , wherein the method further comprises: receiving a request from a client computing device; and sending, in response to the request, the semantic image navigation experience for the first geographic entity to the client computing device.
| 0.705645 |
1. A computer-implemented method for creating a tutorial presentation, comprising: (a) matching a profile against a simulation domain, wherein the profile comprises a set of criteria and identifies a desired aspect for a current simulation task; (b) presenting information indicative of a goal: (c) integrating information that motivates accomplishment of the goal; (d) monitoring progress toward the goal, determining at least one profile that is true for the current simulation task from a set of profiles, and providing feedback to a student, based on the at least one profile the at least one profile comprising at least one collective characteristic, the at least one collective characteristic being a conditional using a plurality of characteristics as operands at a particular instance of time, each characteristic identifying a subset of the simulation domain, at least one of the plurality of characteristics being time-dependent; and (e) displaying details of the computer-implemented method and displaying the tutorial presentation as the tutorial presentation executes and further comprises: firing the at least one profile to identify mistakes and correct answers provided by the student; and triggering a topic in a concept tree when the at least one profile fires, wherein the concept tree contains a plurality of concepts associated with the current simulation task and, wherein the tutorial presentation provides a cognitive educational experience.
|
1. A computer-implemented method for creating a tutorial presentation, comprising: (a) matching a profile against a simulation domain, wherein the profile comprises a set of criteria and identifies a desired aspect for a current simulation task; (b) presenting information indicative of a goal: (c) integrating information that motivates accomplishment of the goal; (d) monitoring progress toward the goal, determining at least one profile that is true for the current simulation task from a set of profiles, and providing feedback to a student, based on the at least one profile the at least one profile comprising at least one collective characteristic, the at least one collective characteristic being a conditional using a plurality of characteristics as operands at a particular instance of time, each characteristic identifying a subset of the simulation domain, at least one of the plurality of characteristics being time-dependent; and (e) displaying details of the computer-implemented method and displaying the tutorial presentation as the tutorial presentation executes and further comprises: firing the at least one profile to identify mistakes and correct answers provided by the student; and triggering a topic in a concept tree when the at least one profile fires, wherein the concept tree contains a plurality of concepts associated with the current simulation task and, wherein the tutorial presentation provides a cognitive educational experience. 6. The computer-implemented method for creating a tutorial presentation as recited in claim 1 , including modifying the tutorial presentation based on a user input as the tutorial presentation executes.
| 0.775442 |
1. A computer implemented access control system, the system comprising: a database for storing a serialized version of an eXtensible Access Control Markup Language (XACML) permissions hierarchy; a memory for storing an original version of the XACML permissions hierarchy; and an XACML serialization engine configured to convert the XACML permissions hierarchy into the serialized version, wherein the serialized version contains a listing of at least a portion of the predicates possible in the XACML permission hierarchy and the effect on each of the portion of the predicates, and to aggregate the targets of the XACML permissions hierarchy; wherein each target contains a rule and aggregating the targets includes computing predicates from the rules and aggregating the predicates into a permission set and a prohibited set to create a serialized policy; wherein the XACML serialization engine is further configured to serialize each policy in the XACML permission hierarchy and the XACML serialization engine is configured to create a serialized policy set by combining each of the serialized policies, the serialized policy set including a first table including permissions and second table including prohibitions, the second table being separate from the first table; wherein aggregating the targets includes computing predicates from the rules and aggregating the predicates into a permission set and a prohibited set to create a serialized policy, and wherein creating the table includes serializing each policy in the XACML permissions specification.
|
1. A computer implemented access control system, the system comprising: a database for storing a serialized version of an eXtensible Access Control Markup Language (XACML) permissions hierarchy; a memory for storing an original version of the XACML permissions hierarchy; and an XACML serialization engine configured to convert the XACML permissions hierarchy into the serialized version, wherein the serialized version contains a listing of at least a portion of the predicates possible in the XACML permission hierarchy and the effect on each of the portion of the predicates, and to aggregate the targets of the XACML permissions hierarchy; wherein each target contains a rule and aggregating the targets includes computing predicates from the rules and aggregating the predicates into a permission set and a prohibited set to create a serialized policy; wherein the XACML serialization engine is further configured to serialize each policy in the XACML permission hierarchy and the XACML serialization engine is configured to create a serialized policy set by combining each of the serialized policies, the serialized policy set including a first table including permissions and second table including prohibitions, the second table being separate from the first table; wherein aggregating the targets includes computing predicates from the rules and aggregating the predicates into a permission set and a prohibited set to create a serialized policy, and wherein creating the table includes serializing each policy in the XACML permissions specification. 2. The system of claim 1 , further comprising: a request approval engine configured to receive an access request, examine the serialized version and generate an allow or deny reply based on the examination.
| 0.5 |
16. A computer-implemented system, comprising: a table of textual content, stored on one or more computer-readable devices, that includes multiple portions of text and identifies references to the multiple portions of text; a text type identifier, executed by at least one programmable processor, to identify whether at least a first portion of text and a second portion of text in an input document is included in the table of textual content, wherein the first portion of text matches the second portion of text; an encoder, executed by at least one programmable processor, to (i) include the first portion of text in an output document and update the table of textual content to include the first portion of text as a result of determining that the first portion of text is not included in the table of textual content, (ii) include in the output document a reference to the first portion of text from the table of textual content as a result of determining that the first portion of text is included in the table of textual content, wherein the reference to the first portion of text includes less characters than the first portion of text in the input document, and (iii) include the reference to the first portion of text from the updated table of textual content in the output document as a result of determining that the second portion of text matches the first portion of text.
|
16. A computer-implemented system, comprising: a table of textual content, stored on one or more computer-readable devices, that includes multiple portions of text and identifies references to the multiple portions of text; a text type identifier, executed by at least one programmable processor, to identify whether at least a first portion of text and a second portion of text in an input document is included in the table of textual content, wherein the first portion of text matches the second portion of text; an encoder, executed by at least one programmable processor, to (i) include the first portion of text in an output document and update the table of textual content to include the first portion of text as a result of determining that the first portion of text is not included in the table of textual content, (ii) include in the output document a reference to the first portion of text from the table of textual content as a result of determining that the first portion of text is included in the table of textual content, wherein the reference to the first portion of text includes less characters than the first portion of text in the input document, and (iii) include the reference to the first portion of text from the updated table of textual content in the output document as a result of determining that the second portion of text matches the first portion of text. 20. The system of claim 16 , further comprising: a namespace table, stored on one or more computer-readable devices, that includes multiple namespaces of data elements and identifies corresponding references to the multiple namespaces; and a namespace identifier, executed by at least one programmable processor, to identify whether a namespace of the data element is included in the namespace table, wherein the encoder is further adapted to (iii) include the namespace of the data element and a name of the data element in the output document as a result of determining that the namespace of the data element is not included in the namespace table, and (iv) include the name of the data element and a reference to the namespace of the data element from the namespace table in the output document as a result of determining that the namespace of the data element is included in the namespace table.
| 0.652499 |
1. A method comprising: detecting, by a system including a processor, input incompatible with an original script for an interactive communication over a communication network, wherein the detecting is performed during the interactive communication; modifying, by the system, the original script during the interactive communication into a dynamically updated script different from the original script in accordance with a type of the incompatible input; and providing, by the system over the communication network, information to a device participating in the interactive communication in accordance with the dynamically updated script, wherein at least a portion of a remainder of the interactive communication is conducted in accordance with the dynamically updated script.
|
1. A method comprising: detecting, by a system including a processor, input incompatible with an original script for an interactive communication over a communication network, wherein the detecting is performed during the interactive communication; modifying, by the system, the original script during the interactive communication into a dynamically updated script different from the original script in accordance with a type of the incompatible input; and providing, by the system over the communication network, information to a device participating in the interactive communication in accordance with the dynamically updated script, wherein at least a portion of a remainder of the interactive communication is conducted in accordance with the dynamically updated script. 11. The method of claim 1 , wherein the modifying of the original script comprises providing an instruction to use touch-tone input.
| 0.563578 |
12. The method of claim 11 , wherein the eliminating of the unnecessary event further comprises requiring a set of identifications (IDs) of an event, where the IDs do not overlap each other.
|
12. The method of claim 11 , wherein the eliminating of the unnecessary event further comprises requiring a set of identifications (IDs) of an event, where the IDs do not overlap each other. 13. The method of claim 12 , wherein the set of IDs is a set of the multiple-person interaction primitives composing the event.
| 0.950541 |
15. Non-transitory computer storage comprising computer-executable instructions to: receive, at a first computing device, first feature data determined from an audio signal; perform first speech recognition processing at the first computing device, wherein the first speech recognition processing comprises determining a first set of active nodes of a plurality of nodes using the first feature data by computing at least one first score using the first feature data and a first arc of a plurality of arcs, wherein a directed graph comprises the plurality of nodes and the plurality of arcs, wherein the directed graph comprises complexity information, and wherein the first computing device is configured to predict a future processing demand based on the complexity information; transmit information relating to the first set of active nodes to a second computing device; receive, at the second computing device, second feature data determined from the audio signal; and perform second speech recognition processing at the second computing device, wherein the second speech recognition processing comprises determining a second set of active nodes of the plurality of nodes using the second feature data and the first set of active nodes by computing at least one second score using the second feature data and a second arc of the plurality of arcs.
|
15. Non-transitory computer storage comprising computer-executable instructions to: receive, at a first computing device, first feature data determined from an audio signal; perform first speech recognition processing at the first computing device, wherein the first speech recognition processing comprises determining a first set of active nodes of a plurality of nodes using the first feature data by computing at least one first score using the first feature data and a first arc of a plurality of arcs, wherein a directed graph comprises the plurality of nodes and the plurality of arcs, wherein the directed graph comprises complexity information, and wherein the first computing device is configured to predict a future processing demand based on the complexity information; transmit information relating to the first set of active nodes to a second computing device; receive, at the second computing device, second feature data determined from the audio signal; and perform second speech recognition processing at the second computing device, wherein the second speech recognition processing comprises determining a second set of active nodes of the plurality of nodes using the second feature data and the first set of active nodes by computing at least one second score using the second feature data and a second arc of the plurality of arcs. 17. The non-transitory computer storage of claim 15 , further comprising instructions to: transmit information related to the first set of active nodes to a third computing device; and transmit information related to the second set of active nodes to the third computing device.
| 0.639747 |
15. An apparatus for providing location information, comprising: a processor, a memory coupled to the processor, and a network interface device coupled to the processor, wherein the memory holds instructions that when executed by the processor, cause the apparatus to perform the operations of: distributing a user interface application to at least one client device over a computer network, the user interface application configured for receiving user input selecting a type of a non-network object from a set of object types each characterized by a different location data type, obtaining corresponding location information for the non-network object according to its characteristic location data type at least in part from user input, sending the corresponding location information to the apparatus, and requesting assignment of a unique numeric address for the non-network object; receiving a new address request with the corresponding location information from the at least one client device generated by the user interface application, for each non-network object; determining a numeric address for the each non-network object based at least in part on its selected type that is not used as an address for any other object of an identical type; maintaining each numeric address in association with the corresponding location information for the each non-network object as a record in an on-line data structure holding different numeric addresses each associated with a different one of the corresponding location information; and serving the corresponding location information for the each non-network object selected from the on-line data structure in response to at least one query containing the each numeric address.
|
15. An apparatus for providing location information, comprising: a processor, a memory coupled to the processor, and a network interface device coupled to the processor, wherein the memory holds instructions that when executed by the processor, cause the apparatus to perform the operations of: distributing a user interface application to at least one client device over a computer network, the user interface application configured for receiving user input selecting a type of a non-network object from a set of object types each characterized by a different location data type, obtaining corresponding location information for the non-network object according to its characteristic location data type at least in part from user input, sending the corresponding location information to the apparatus, and requesting assignment of a unique numeric address for the non-network object; receiving a new address request with the corresponding location information from the at least one client device generated by the user interface application, for each non-network object; determining a numeric address for the each non-network object based at least in part on its selected type that is not used as an address for any other object of an identical type; maintaining each numeric address in association with the corresponding location information for the each non-network object as a record in an on-line data structure holding different numeric addresses each associated with a different one of the corresponding location information; and serving the corresponding location information for the each non-network object selected from the on-line data structure in response to at least one query containing the each numeric address. 17. The apparatus of claim 15 , wherein the memory holds further instructions for defining the set of object types comprising a street address type, a mobile address type, a telephone type, and a non-street address type, and a temporary type corresponding to a location data type that includes an active duration of the numeric address for the each non-network object.
| 0.5 |
17. A computer readable medium comprising computer readable program code embodied therein for causing a computer system to: receive a first search phrase for a search within a domain of a product; evaluate the first search phrase based on the domain of the product, wherein evaluating the first search phrase comprises: obtaining a plurality of user-submitted keywords from the first search phrase, querying a keyword repository with at least two user-submitted keywords of the plurality of user-submitted keywords to obtain a derivative keyword of a plurality of derivative keywords, wherein the keyword repository relates each of the plurality of user-submitted keywords to at least one of the plurality of derivative keywords, identifying a facet from a facet repository using the derivative keyword, wherein the facet is a term that is contextually related to the plurality of user-submitted keywords based on historical usage by multiple users of the user-submitted keywords when searching in the domain of the product, and wherein the facet, the derivative keyword, and the plurality of user-submitted keywords are used to obtain a plurality of search terms, applying a backward filter to revise the plurality of search terms into a second search phrase, and identifying a previously submitted question based on the facet, the derivative keyword, and the plurality of user-submitted keywords; and display the second search phrase and the previously submitted question.
|
17. A computer readable medium comprising computer readable program code embodied therein for causing a computer system to: receive a first search phrase for a search within a domain of a product; evaluate the first search phrase based on the domain of the product, wherein evaluating the first search phrase comprises: obtaining a plurality of user-submitted keywords from the first search phrase, querying a keyword repository with at least two user-submitted keywords of the plurality of user-submitted keywords to obtain a derivative keyword of a plurality of derivative keywords, wherein the keyword repository relates each of the plurality of user-submitted keywords to at least one of the plurality of derivative keywords, identifying a facet from a facet repository using the derivative keyword, wherein the facet is a term that is contextually related to the plurality of user-submitted keywords based on historical usage by multiple users of the user-submitted keywords when searching in the domain of the product, and wherein the facet, the derivative keyword, and the plurality of user-submitted keywords are used to obtain a plurality of search terms, applying a backward filter to revise the plurality of search terms into a second search phrase, and identifying a previously submitted question based on the facet, the derivative keyword, and the plurality of user-submitted keywords; and display the second search phrase and the previously submitted question. 18. The computer readable medium of claim 17 , wherein evaluating the first search phrase further comprises: extracting the plurality of search terms from the plurality of user-submitted keywords and the facet, wherein the plurality of search terms are a subset of the plurality of user-submitted keywords.
| 0.608901 |
13. A system, comprising: a processor; a display device coupled to the processor; and a memory medium coupled to the processor, wherein the memory medium stores program instructions executable by the processor to: display a graphical program on the display device, wherein the graphical program comprises a plurality of connected nodes which visually indicate functionality of the graphical program, wherein the graphical program comprises at least one node which corresponds to a textual language program portion, wherein the textual language program portion is written in a dynamically typed programming language, wherein the textual language program portion exists prior to compilation of the graphical program; compile the graphical program for deployment on a real time target, wherein said compiling the graphical program comprises compiling the plurality of connected nodes and the textual language program portion into executable code configured for deterministic real time execution on the real time target, wherein said compiling the graphical program further comprises inferring strict types for the textual language program portion; and store the executable code on a storage device.
|
13. A system, comprising: a processor; a display device coupled to the processor; and a memory medium coupled to the processor, wherein the memory medium stores program instructions executable by the processor to: display a graphical program on the display device, wherein the graphical program comprises a plurality of connected nodes which visually indicate functionality of the graphical program, wherein the graphical program comprises at least one node which corresponds to a textual language program portion, wherein the textual language program portion is written in a dynamically typed programming language, wherein the textual language program portion exists prior to compilation of the graphical program; compile the graphical program for deployment on a real time target, wherein said compiling the graphical program comprises compiling the plurality of connected nodes and the textual language program portion into executable code configured for deterministic real time execution on the real time target, wherein said compiling the graphical program further comprises inferring strict types for the textual language program portion; and store the executable code on a storage device. 17. The system of claim 13 , wherein the real time target comprises a programmable hardware element, wherein said compiling the graphical program comprises generating a hardware description file for the programmable hardware element based on at least a portion of the textual language program portion, and wherein the program instructions are further executable to: configure the programmable hardware element according to the hardware description file.
| 0.504614 |
1. A computer-implemented method of criteria-based message publication control and feedback in a publish/subscribe messaging environment, comprising: receiving, at a message broker, a message published by a message publisher, the message having associated therewith a topic and classification criteria, the classification criteria specifying requirements for determining whether publication of the message is successful; consulting, by the message broker, a subscription registry to locate registered subscriptions of a plurality of message subscribers that have registered with the message broker to receive published messages having the topic, each of the registered subscriptions further specifying subscriber classification information pertaining to the topic; selecting, by the message broker from the located subscriptions, each of at least one of the located subscriptions for which the registered subscriber classification information matches the classification criteria associated with the message, wherein the registered subscriber classification information for at least one of the located subscriptions does not match the classification criteria associated with the message; identifying, for each of the at least one selected subscription, the subscriber that registered the selected subscription; sending the message, by the message broker, to the each identified subscriber; comparing, by the message broker, the subscriber classification information in the at least one selected subscription to the classification criteria associated with the message to determine whether the requirements specified in the classification criteria are met by the at least one selected subscription; and responsive to determining, by the comparing, that the requirements are not met, performing controlled failure handling, the controlled failure handling comprising: responsive to determining that a mode of failure handling applicable for the message indicates a warning mode, sending the message, by the message broker, to each of the message subscribers that registered one of the located subscriptions which was not selected by the selecting and warning the message publisher that publication of the message was not successful; and responsive to determining that the mode of failure handling indicates a failure mode, notifying the message publisher that publication of the message failed while omitting the sending of the message to each of the message subscribers that registered one of the located subscriptions which was not selected by the selecting.
|
1. A computer-implemented method of criteria-based message publication control and feedback in a publish/subscribe messaging environment, comprising: receiving, at a message broker, a message published by a message publisher, the message having associated therewith a topic and classification criteria, the classification criteria specifying requirements for determining whether publication of the message is successful; consulting, by the message broker, a subscription registry to locate registered subscriptions of a plurality of message subscribers that have registered with the message broker to receive published messages having the topic, each of the registered subscriptions further specifying subscriber classification information pertaining to the topic; selecting, by the message broker from the located subscriptions, each of at least one of the located subscriptions for which the registered subscriber classification information matches the classification criteria associated with the message, wherein the registered subscriber classification information for at least one of the located subscriptions does not match the classification criteria associated with the message; identifying, for each of the at least one selected subscription, the subscriber that registered the selected subscription; sending the message, by the message broker, to the each identified subscriber; comparing, by the message broker, the subscriber classification information in the at least one selected subscription to the classification criteria associated with the message to determine whether the requirements specified in the classification criteria are met by the at least one selected subscription; and responsive to determining, by the comparing, that the requirements are not met, performing controlled failure handling, the controlled failure handling comprising: responsive to determining that a mode of failure handling applicable for the message indicates a warning mode, sending the message, by the message broker, to each of the message subscribers that registered one of the located subscriptions which was not selected by the selecting and warning the message publisher that publication of the message was not successful; and responsive to determining that the mode of failure handling indicates a failure mode, notifying the message publisher that publication of the message failed while omitting the sending of the message to each of the message subscribers that registered one of the located subscriptions which was not selected by the selecting. 14. The method according to claim 1 , wherein: the consulting, the selecting, the identifying, the sending, the comparing, and the controlled failure handling are carried out in context of a transaction; and further comprising: committing the transaction or rolling back the transaction, responsive to the a result of the comparing, wherein the transaction is committed responsive to the result comprising determining that the message was published successfully and wherein the transaction is rolled back otherwise.
| 0.601059 |
8. The machine system of claim 1 wherein: the first presentations include automatically presented invitations to information exchange forums which forums include or have further invited thereto, one or more persons who are topically contemporaneous strangers to the first user, where such topically contemporaneous strangers are persons not known to the first user to contemporaneously have substantially same topics of focus or of interest in their minds as a relatively current topic of focus or of interest that the first user is determined by the machine system to more likely than not have in mind, and the one or more topically contemporaneous strangers are predetermined by the machine system to contemporaneously and more likely than not have substantially same topics of focus or of interest in their minds as the relatively current topic of focus or of interest that the first user is predetermined by the machine system to likely have in his or her mind; wherein said likely topics of focus or of interest are determined by the machine system based on specific sub-portions of respective firstly presented content that the first user and the one or more persons respectively centered their attention upon.
|
8. The machine system of claim 1 wherein: the first presentations include automatically presented invitations to information exchange forums which forums include or have further invited thereto, one or more persons who are topically contemporaneous strangers to the first user, where such topically contemporaneous strangers are persons not known to the first user to contemporaneously have substantially same topics of focus or of interest in their minds as a relatively current topic of focus or of interest that the first user is determined by the machine system to more likely than not have in mind, and the one or more topically contemporaneous strangers are predetermined by the machine system to contemporaneously and more likely than not have substantially same topics of focus or of interest in their minds as the relatively current topic of focus or of interest that the first user is predetermined by the machine system to likely have in his or her mind; wherein said likely topics of focus or of interest are determined by the machine system based on specific sub-portions of respective firstly presented content that the first user and the one or more persons respectively centered their attention upon. 20. The machine system of claim 8 wherein: said topically contemporaneous strangers include a person who is a stranger to, rather than a friend of the first user.
| 0.874824 |
1. A method for automatically identifying unique language independent keys comprising the steps of: extracting language independent keys and associated text strings from resource files; inserting said extracted language independent keys and associated text strings in a file; receiving a first value of a first locale; searching for language independent keys in said file associated with said received first value of said first locale; identifying a plurality of language independent keys associated with said received first value of said first locale; identifying a second locale to narrow a number of said plurality of language independent keys; receiving a second value of a second locale; searching for language independent keys out of said plurality of language independent keys that are associated with said received first value of said first locale and associated with said received second value of said second locale; and identifying one or more of said plurality of language independent keys that are associated with said first value of said first locale and associated with said second value of said second locale.
|
1. A method for automatically identifying unique language independent keys comprising the steps of: extracting language independent keys and associated text strings from resource files; inserting said extracted language independent keys and associated text strings in a file; receiving a first value of a first locale; searching for language independent keys in said file associated with said received first value of said first locale; identifying a plurality of language independent keys associated with said received first value of said first locale; identifying a second locale to narrow a number of said plurality of language independent keys; receiving a second value of a second locale; searching for language independent keys out of said plurality of language independent keys that are associated with said received first value of said first locale and associated with said received second value of said second locale; and identifying one or more of said plurality of language independent keys that are associated with said first value of said first locale and associated with said second value of said second locale. 6. The method as recited in claim 1 , wherein said received first value and said received second value are text strings.
| 0.643599 |
23. A system, comprising: a data processing apparatus; and software stored in non-transitory computer readable storage medium storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising: instantiating, within an operating system environment, a native application that generates application pages for display on a user device within the native application, the native application operating independent of a browser application that can operate on the user device; accessing, within the operating system environment, application pages of the native application, and for each of the application pages: extracting application page data describing content of the application page, the application page data being data provided to a rendering process of the native application, wherein the rendering process receives the application page data and renders the content of the application page based on the application page data; associating the application page data with an application page identifier of the application page and a native application identifier of the native application; and indexing the application page data, in part, by the application page identifier and the native application identifier.
|
23. A system, comprising: a data processing apparatus; and software stored in non-transitory computer readable storage medium storing instructions executable by the data processing apparatus and that upon such execution cause the data processing apparatus to perform operations comprising: instantiating, within an operating system environment, a native application that generates application pages for display on a user device within the native application, the native application operating independent of a browser application that can operate on the user device; accessing, within the operating system environment, application pages of the native application, and for each of the application pages: extracting application page data describing content of the application page, the application page data being data provided to a rendering process of the native application, wherein the rendering process receives the application page data and renders the content of the application page based on the application page data; associating the application page data with an application page identifier of the application page and a native application identifier of the native application; and indexing the application page data, in part, by the application page identifier and the native application identifier. 27. The system of claim 23 , the operations further comprising: extracting an image of the application page generated from the application page data by the rendering process; and associating the image of the application page with the application page identifier of the application page and a native application identifier of the native application.
| 0.514906 |
18. The method of claim 1 , further comprising sending one or more of the structured queries for presentation to the first user.
|
18. The method of claim 1 , further comprising sending one or more of the structured queries for presentation to the first user. 19. The method of claim 18 , further comprising presenting the one or more sent structured queries to the first user, wherein, for each sent structured query, one or more of the references of the sent structured query is highlighted as presented to indicate the reference corresponds to an identified second node or an identified edge.
| 0.86269 |
10. The system of claim 1 , the answer generator reformats the query from the user into a focused query directed to at least one search engine.
|
10. The system of claim 1 , the answer generator reformats the query from the user into a focused query directed to at least one search engine. 12. The system of claim 10 , the reformatted query is employed to select a subset of search engines to process the query based in part on the informational goals and the attribute.
| 0.944716 |
1. A method for performing data analytics on outsourced data, the method comprising: generating, by data owner's workstation, a binary tree representing data from the data owner, wherein each node of the binary tree is associated with an identity that represents a data element or an interval of data elements; computing, by the data owner's workstation, an identity token and encrypting the identity token for each of the identities in the binary tree; generating a range query token using an identity selected by a data analyst and a secret key input by the data owner and computing a decryption key for the selected identity; and analyzing the data, at the data analyst's workstation, by comparing the computed decryption key for the selected identity with each of the encrypted identities.
|
1. A method for performing data analytics on outsourced data, the method comprising: generating, by data owner's workstation, a binary tree representing data from the data owner, wherein each node of the binary tree is associated with an identity that represents a data element or an interval of data elements; computing, by the data owner's workstation, an identity token and encrypting the identity token for each of the identities in the binary tree; generating a range query token using an identity selected by a data analyst and a secret key input by the data owner and computing a decryption key for the selected identity; and analyzing the data, at the data analyst's workstation, by comparing the computed decryption key for the selected identity with each of the encrypted identities. 4. The method as in claim 1 further comprising outputting one or more identity query tokens as a result of analyzing the data.
| 0.652668 |
5. The system of claim 4 wherein the natural language text generation module is further configured to, prior to the identifying by the ranking module: i. receive, by a template module, from the content database a corpus comprising a set of pre-segmented texts; ii. create, by the template module, a plurality of modified pre-segmented texts by: 1. extraction, by the template module, of a set of semantic terms for each pre-segmented text within the set of pre-segmented texts; and 2. application, by the template module, of at least one domain tag for each pre-segmented text within the set of pre-segmented texts; iii. cluster, by the template module, the plurality of modified pre-segmented texts into one or more conceptual units, wherein each of the one or more conceptual units is associated with one or more templates, wherein each of the one or more templates corresponds to one of the set of pre-segmented texts, and wherein a conceptual unit identifier is assigned to each modified pre-segmented text and pre-segmented text in the plurality of modified pre-segmented texts and set of pre-segmented texts respectively; and iv. store the plurality of modified pre-segmented texts and the set of semantic terms in the content database.
|
5. The system of claim 4 wherein the natural language text generation module is further configured to, prior to the identifying by the ranking module: i. receive, by a template module, from the content database a corpus comprising a set of pre-segmented texts; ii. create, by the template module, a plurality of modified pre-segmented texts by: 1. extraction, by the template module, of a set of semantic terms for each pre-segmented text within the set of pre-segmented texts; and 2. application, by the template module, of at least one domain tag for each pre-segmented text within the set of pre-segmented texts; iii. cluster, by the template module, the plurality of modified pre-segmented texts into one or more conceptual units, wherein each of the one or more conceptual units is associated with one or more templates, wherein each of the one or more templates corresponds to one of the set of pre-segmented texts, and wherein a conceptual unit identifier is assigned to each modified pre-segmented text and pre-segmented text in the plurality of modified pre-segmented texts and set of pre-segmented texts respectively; and iv. store the plurality of modified pre-segmented texts and the set of semantic terms in the content database. 6. The system of claim 5 wherein the domain tags include domain specific tags and domain general tags.
| 0.794118 |
17. The method of claim 16 wherein identifying comprises selecting subjects for whom emotional state feedback is desired based on user gaze.
|
17. The method of claim 16 wherein identifying comprises selecting subjects for whom emotional state feedback is desired based on user gaze. 18. The method of claim 17 wherein determining a social scenario comprises determining the scenario based on the environment, location and orientation of the system.
| 0.923993 |
15. The system as claimed in claim 12 , including: a query processor for processing a query to divide it into terms, including a numerical term and processing a numerical term of the query to a stem, the stem being in the form of a number, and a distance measurement of the numerical term to the stem, wherein a numerical term is a string of characters identified as a number by a numeric parser; and a retriever for retrieving results for the stem from the index.
|
15. The system as claimed in claim 12 , including: a query processor for processing a query to divide it into terms, including a numerical term and processing a numerical term of the query to a stem, the stem being in the form of a number, and a distance measurement of the numerical term to the stem, wherein a numerical term is a string of characters identified as a number by a numeric parser; and a retriever for retrieving results for the stem from the index. 17. The system as claimed in claim 15 , including a scoring mechanism for scoring results by comparing the distance measurements of the query terms and the document results for the stem.
| 0.799569 |
9. The device of claim 8 , wherein a type definition of the data representation language schema is used to interpret the script.
|
9. The device of claim 8 , wherein a type definition of the data representation language schema is used to interpret the script. 10. The device of claim 9 , wherein at least one of the type definitions is a complex type definition.
| 0.937118 |
1. A computer software menu management system consisting of, storing a keyword in a controlled vocabulary and its predetermined code in a database that links each said keyword to a parent keyword at a parent level thereby creating a hierarchical organization that has a plurality of levels, selecting a set of keywords from said database that are linked to the same said parent keyword and are located at an identical level in said hierarchical organization, generating a list menu based on said set of keywords, adding a navigation control to said menu system, adding a search control to said menu system, displaying said list menu, fetching a selection made by an end-user associated with said navigation control, with said search control, and with said set of keywords in said list menu, generating another said list menu representing a parent and a child level in said hierarchical organization depending upon the type of navigation control selected by said end-user, fetching at least one said keyword selected by said end-user from said list menu selected when said search control is selected by said end-user, generating a database query that includes at least one said keyword selected by said end-user in said list menu when said search control is selected by said end-user.
|
1. A computer software menu management system consisting of, storing a keyword in a controlled vocabulary and its predetermined code in a database that links each said keyword to a parent keyword at a parent level thereby creating a hierarchical organization that has a plurality of levels, selecting a set of keywords from said database that are linked to the same said parent keyword and are located at an identical level in said hierarchical organization, generating a list menu based on said set of keywords, adding a navigation control to said menu system, adding a search control to said menu system, displaying said list menu, fetching a selection made by an end-user associated with said navigation control, with said search control, and with said set of keywords in said list menu, generating another said list menu representing a parent and a child level in said hierarchical organization depending upon the type of navigation control selected by said end-user, fetching at least one said keyword selected by said end-user from said list menu selected when said search control is selected by said end-user, generating a database query that includes at least one said keyword selected by said end-user in said list menu when said search control is selected by said end-user. 7. The menu management system of claim 1 further includes a database query that include an AND condition.
| 0.715054 |
32. A non-transitory computer-readable medium having sets of instructions stored thereon which, when executed by a computer, cause the computer to: receive one or more manually generated tags associated with a video file; based at least in part on the one or more manually entered tags, determine a preliminary category for the video file; based on the preliminary category, generate a targeted transcript of the video file, wherein the targeted transcript includes a plurality of words; generate an ontology of the plurality of words based on the targeted transcript; rank the plurality of words in the ontology based on a plurality of scoring factors; based on the ranking of the plurality of words, generate one or more automated tags associated with the video file, establish a top concepts threshold value; determine that one or more of the rankings of the plurality of words exceeds the top concepts threshold; and associate information about the one or more of the plurality of words with rankings that exceeds the top concepts with the video file to designate the top concepts of the video file, wherein the plurality of scoring factors consists of two or more of: proximity of words relative to other words, distribution of words throughout the targeted transcript of the video file, words related to the plurality of words throughout the targeted transcript of the video file, occurrence age of the related words, information associated with the one or more manually entered tags, vernacular meaning of the plurality of words, or colloquial considerations of the meaning of the plurality of words.
|
32. A non-transitory computer-readable medium having sets of instructions stored thereon which, when executed by a computer, cause the computer to: receive one or more manually generated tags associated with a video file; based at least in part on the one or more manually entered tags, determine a preliminary category for the video file; based on the preliminary category, generate a targeted transcript of the video file, wherein the targeted transcript includes a plurality of words; generate an ontology of the plurality of words based on the targeted transcript; rank the plurality of words in the ontology based on a plurality of scoring factors; based on the ranking of the plurality of words, generate one or more automated tags associated with the video file, establish a top concepts threshold value; determine that one or more of the rankings of the plurality of words exceeds the top concepts threshold; and associate information about the one or more of the plurality of words with rankings that exceeds the top concepts with the video file to designate the top concepts of the video file, wherein the plurality of scoring factors consists of two or more of: proximity of words relative to other words, distribution of words throughout the targeted transcript of the video file, words related to the plurality of words throughout the targeted transcript of the video file, occurrence age of the related words, information associated with the one or more manually entered tags, vernacular meaning of the plurality of words, or colloquial considerations of the meaning of the plurality of words. 34. The non-transitory computer-readable medium of claim 32 , wherein the sets of instructions when further executed by the computer cause the computer to: determine if the rankings for each of the plurality of words exceed a threshold ranking value; and exclude any of the plurality of words that have a ranking value lower than the threshold value.
| 0.786989 |
22. A system for generating a score for a decision question comprising: a first input device, configured to receive, from a first user, a decision question comprising at least two choices; a first output device, configured to present the decision question to at least one second user subsequently to the first input device receiving the decision question; a second input device, configured to receive: at least one secondary question; and for each secondary question, at least one recommendation of at least one of the choices of the decision question, the recommendation specifying a relationship between the secondary question and the recommended choice of the decision question; a storage device, configured to store the received at least one secondary question and the received at least one recommendation; a second output device, configured to present the at least one secondary question to the first user; wherein the first input device is further configured to receive, from the first user, answers to at least a subset of the at least one secondary question, subsequently to the second output device presenting the at least one secondary question to the first user; the system further comprising: a scoring module, configured to, for each received answer, determine a score for at least one of the choices for the decision question, the score being based on the received answer and on at least one recommendation associated with the secondary question; and an aggregator, configured to aggregate the determined scores subsequently to the scoring module determining a score for each received answer; wherein the first output device is further configured to output an indication of the aggregated scores subsequently to the aggregator aggregating the determined scores.
|
22. A system for generating a score for a decision question comprising: a first input device, configured to receive, from a first user, a decision question comprising at least two choices; a first output device, configured to present the decision question to at least one second user subsequently to the first input device receiving the decision question; a second input device, configured to receive: at least one secondary question; and for each secondary question, at least one recommendation of at least one of the choices of the decision question, the recommendation specifying a relationship between the secondary question and the recommended choice of the decision question; a storage device, configured to store the received at least one secondary question and the received at least one recommendation; a second output device, configured to present the at least one secondary question to the first user; wherein the first input device is further configured to receive, from the first user, answers to at least a subset of the at least one secondary question, subsequently to the second output device presenting the at least one secondary question to the first user; the system further comprising: a scoring module, configured to, for each received answer, determine a score for at least one of the choices for the decision question, the score being based on the received answer and on at least one recommendation associated with the secondary question; and an aggregator, configured to aggregate the determined scores subsequently to the scoring module determining a score for each received answer; wherein the first output device is further configured to output an indication of the aggregated scores subsequently to the aggregator aggregating the determined scores. 23. The system of claim 22 , wherein at least one of the input devices is further configured to receive: for at least a subset of the received recommendations, a recommendation strength; and for at least a subset of the received answers, a significance value of the received answer; and wherein the scoring module is further configured to determine a score based on the received answer, the received significance value, and at least one recommendation and recommendation strength associated with the secondary question.
| 0.51915 |
1. A method comprising: determining a message that is to be sent by a sender, wherein the sender is engaged in a plurality of active messaging conversations; identifying, in the message, a first key word that is related to a second key word found in another message, wherein the other message was sent in one of the plurality of conversations, wherein the first key word is identified as being related to the second key word, when the first key word and the second key word comprise a keyword pair, and wherein the key word pair is determined based at least on data from historical conversations; determining the message and the other message are both associated with the one of the plurality of conversations, wherein the determining comprises determining a relevance value corresponding to a degree of relevance of the message and the other message, wherein the relevance value is determined based at least on a quantity of key word pairs present in the message and the other message, a time interval between the message and the other message, and a probability associated with the keyword pair, and wherein the probability indicates a likelihood that a first message that includes the first key word is relevant to a second message that contains the second key word; determining the message is to be sent to at least one recipient, wherein the at least one recipient comprises a party participating in the one of the plurality of conversations; providing, to the sender, a suggestion to send the message to the at least one recipient, when the relevance value is less than a threshold value; and updating, based at least on the message being associated with the one of the plurality of conversations, the data from the historical conversations.
|
1. A method comprising: determining a message that is to be sent by a sender, wherein the sender is engaged in a plurality of active messaging conversations; identifying, in the message, a first key word that is related to a second key word found in another message, wherein the other message was sent in one of the plurality of conversations, wherein the first key word is identified as being related to the second key word, when the first key word and the second key word comprise a keyword pair, and wherein the key word pair is determined based at least on data from historical conversations; determining the message and the other message are both associated with the one of the plurality of conversations, wherein the determining comprises determining a relevance value corresponding to a degree of relevance of the message and the other message, wherein the relevance value is determined based at least on a quantity of key word pairs present in the message and the other message, a time interval between the message and the other message, and a probability associated with the keyword pair, and wherein the probability indicates a likelihood that a first message that includes the first key word is relevant to a second message that contains the second key word; determining the message is to be sent to at least one recipient, wherein the at least one recipient comprises a party participating in the one of the plurality of conversations; providing, to the sender, a suggestion to send the message to the at least one recipient, when the relevance value is less than a threshold value; and updating, based at least on the message being associated with the one of the plurality of conversations, the data from the historical conversations. 2. The method of claim 1 , wherein the data from the historical conversations comprises semantic relations between key words extracted from the historical conversations.
| 0.603088 |
7. A computer-readable medium containing instructions which, when executed on a computer, perform the steps of: identifying dependence relations between statements in a program and enforcement associations between said barrier statements and said dependence relations; classifying said dependence relations as being either of a first type, which are enforceable by point-to-point synchronization or of a second type, which are not enforceable by point-to-point synchronization; determining a subset of said plurality of barrier statements which will enforce said dependence relations of said second type; and replacing at least one of said plurality of barrier statements, which is not in said subset, with a point-to-point synchronization routine; wherein identifying dependence relations between statements in the program further comprises identifying a first subset of said dependence relations by transitively reducing said dependence relations; and wherein transitively reducing said dependence relations further comprises computing H=(D(DoD)), wherein D is a set of dependence relations identified for said parallel program, “” denotes set subtraction, “o” denotes set composition and H is a resulting, transitively reduced set based on D.
|
7. A computer-readable medium containing instructions which, when executed on a computer, perform the steps of: identifying dependence relations between statements in a program and enforcement associations between said barrier statements and said dependence relations; classifying said dependence relations as being either of a first type, which are enforceable by point-to-point synchronization or of a second type, which are not enforceable by point-to-point synchronization; determining a subset of said plurality of barrier statements which will enforce said dependence relations of said second type; and replacing at least one of said plurality of barrier statements, which is not in said subset, with a point-to-point synchronization routine; wherein identifying dependence relations between statements in the program further comprises identifying a first subset of said dependence relations by transitively reducing said dependence relations; and wherein transitively reducing said dependence relations further comprises computing H=(D(DoD)), wherein D is a set of dependence relations identified for said parallel program, “” denotes set subtraction, “o” denotes set composition and H is a resulting, transitively reduced set based on D. 8. The computer-readable medium of claim 7 , wherein said step of classifying said dependence relations as being either of said first type or said second type further comprises, for each dependence relation, the steps of: projecting said dependence relation onto each thread in the parallel program to generate a projection relation; determining, for each thread in said projection relation, whether there is at most one other thread on which said thread depends; if so, identifying said dependence relation as being of said first type; and otherwise, identifying said dependence relation as being of said second type.
| 0.5 |
6. A computing device comprising a processor and a memory coupled to the processor, wherein the processor is configured to execute programmed instructions stored in the memory to: identify one or more application vulnerabilities through a first dynamic security assessment and a static security assessment of an application; fix at least one of a first set of vulnerability instances reported in the static security assessment based on a secure coding practice; run a plurality of other dynamic security assessments to identify one or more of a second set of vulnerability instances reported in the first dynamic security assessment that have been fixed by the fixing of the at least of the first set of one vulnerability instances reported in the static security assessment; identify one or more of a third set of vulnerability instances reported in the plurality of other dynamic security assessments that correspond to the at least one of the first set of vulnerability instances reported in the static security assessment by correlating one or more results of the plurality of other dynamic security assessments and the static security assessment; determine a shortest path to fix the one or more application vulnerabilities when one or more of the third set of vulnerability instances reported in the plurality of other dynamic security assessments correspond to at least one of the first set of vulnerability instances reported in the static security assessment; and fix the one or more application vulnerabilities based on the correlation and the shortest path to fix the one or more application vulnerabilities.
|
6. A computing device comprising a processor and a memory coupled to the processor, wherein the processor is configured to execute programmed instructions stored in the memory to: identify one or more application vulnerabilities through a first dynamic security assessment and a static security assessment of an application; fix at least one of a first set of vulnerability instances reported in the static security assessment based on a secure coding practice; run a plurality of other dynamic security assessments to identify one or more of a second set of vulnerability instances reported in the first dynamic security assessment that have been fixed by the fixing of the at least of the first set of one vulnerability instances reported in the static security assessment; identify one or more of a third set of vulnerability instances reported in the plurality of other dynamic security assessments that correspond to the at least one of the first set of vulnerability instances reported in the static security assessment by correlating one or more results of the plurality of other dynamic security assessments and the static security assessment; determine a shortest path to fix the one or more application vulnerabilities when one or more of the third set of vulnerability instances reported in the plurality of other dynamic security assessments correspond to at least one of the first set of vulnerability instances reported in the static security assessment; and fix the one or more application vulnerabilities based on the correlation and the shortest path to fix the one or more application vulnerabilities. 9. The computing device as claimed in claim 6 , wherein one or more results of the correlation are represented in the form of a bipartite graph.
| 0.876701 |
1. A computer-implemented system for building instrument or front panels, comprising: a computational device providing access to a graphical panel building application, where: the graphical panel building application generates a graphical user interface (GUI) for rendering and placing components on an instrument or front panel, where: at least one component on the instrument or front panel: directly corresponds with, and interacts only with, a section of code in a textual language program, displays input or output values for the textual language program during execution of the textual language program, and does not interact with or correspond with a graphical diagram, the textual language program includes code for the execution of one or more components on the instrument or front panel, and the instrument or front panel runs in a continuous mode of operation during the execution of the textual language program; and a display device in communication with the computational device, the display device displaying the GUI, the GUI: displaying the instrument or front panel, separately displaying the textual language program, and displaying in a window with the textual language program at least one control allowing a user to switch between threads of execution of the textual language program, the threads of execution comprising two or more of: an initialization procedure, a foreground task, a background task, a timed execution task, an event-driven execution task, and a termination procedure.
|
1. A computer-implemented system for building instrument or front panels, comprising: a computational device providing access to a graphical panel building application, where: the graphical panel building application generates a graphical user interface (GUI) for rendering and placing components on an instrument or front panel, where: at least one component on the instrument or front panel: directly corresponds with, and interacts only with, a section of code in a textual language program, displays input or output values for the textual language program during execution of the textual language program, and does not interact with or correspond with a graphical diagram, the textual language program includes code for the execution of one or more components on the instrument or front panel, and the instrument or front panel runs in a continuous mode of operation during the execution of the textual language program; and a display device in communication with the computational device, the display device displaying the GUI, the GUI: displaying the instrument or front panel, separately displaying the textual language program, and displaying in a window with the textual language program at least one control allowing a user to switch between threads of execution of the textual language program, the threads of execution comprising two or more of: an initialization procedure, a foreground task, a background task, a timed execution task, an event-driven execution task, and a termination procedure. 2. The system of claim 1 , wherein there is a one-to-one correspondence between each of the components on the instrument or front panel to corresponding sections of code in the textual language program.
| 0.637174 |
9. The XDBMS of claim 8 , wherein the access privilege index comprises one or more index entries each comprising a reference to a user and/or group, a reference to an XML document, an access privilege and/or an identifier.
|
9. The XDBMS of claim 8 , wherein the access privilege index comprises one or more index entries each comprising a reference to a user and/or group, a reference to an XML document, an access privilege and/or an identifier. 10. The XDBMS of claim 9 , wherein the execution engine is configured to evaluate the first index entry of the access privilege index that matches the user and/or the groups according to an order defined by the identifiers of the index entries.
| 0.86413 |
9. The method of claim 8 , wherein emphasizing and de-emphasizing is achieved through altering a prosodic feature of the word.
|
9. The method of claim 8 , wherein emphasizing and de-emphasizing is achieved through altering a prosodic feature of the word. 10. The method of claim 9 , wherein altering the prosodic feature includes altering at least one of volume, pitch, and phoneme duration.
| 0.924559 |
13. The method of claim 1 further comprising: identifying a second original IVC; identifying a portion of the image format document represented by the second original IVC; generating a second verification data sequence from the identified portion of the image format document; generating a second modified verification data sequence from the second verification data sequence in accordance with the modification rules, wherein at least one element of the second verification data sequence, between the first and final elements of the second verification data sequence, is modified in the second modified verification data sequence; generating a second verification IVC, wherein generating a second verification IVC comprises performing a one-way operation on the second modified verification data sequence; comparing the second verification IVC with the second original IVC; and reporting an indication of tampering to the printed document, responsive to the comparison of the second verification IVC with the second original IVC.
|
13. The method of claim 1 further comprising: identifying a second original IVC; identifying a portion of the image format document represented by the second original IVC; generating a second verification data sequence from the identified portion of the image format document; generating a second modified verification data sequence from the second verification data sequence in accordance with the modification rules, wherein at least one element of the second verification data sequence, between the first and final elements of the second verification data sequence, is modified in the second modified verification data sequence; generating a second verification IVC, wherein generating a second verification IVC comprises performing a one-way operation on the second modified verification data sequence; comparing the second verification IVC with the second original IVC; and reporting an indication of tampering to the printed document, responsive to the comparison of the second verification IVC with the second original IVC. 15. The method of claim 13 wherein the second verification data sequence and the first verification data sequence represent different pages of the image format document.
| 0.776691 |
8. The method of claim 7 , further comprising the step of: refining usefulness by detecting and dampening attractive nuisance assets which show a large amount of activity even though they are not useful.
|
8. The method of claim 7 , further comprising the step of: refining usefulness by detecting and dampening attractive nuisance assets which show a large amount of activity even though they are not useful. 9. The method of claim 8 , further comprising the step of: basing detection of attractive nuisance assets on a number of revisits an asset has received by users in combination with a number of user visits and overall activity on said asset.
| 0.942491 |
2. The object recognition system of claim 1 , wherein each system is configured to measure a different characteristic of the target object.
|
2. The object recognition system of claim 1 , wherein each system is configured to measure a different characteristic of the target object. 3. The object recognition system of claim 2 , wherein the different characteristics include sound, polarization of reflected light, and heat.
| 0.96989 |
20. A non-transitory computer readable medium encoded with a computer program comprising instructions that when executed operate to cause a computer to perform operations: obtaining a plurality of n-grams, each of the n-grams including a unique set of one or more terms; for each of the n-grams: identifying a plurality of training images for training an image classification model, the plurality of training images comprising: positive training images having relevance measures, for the n-gram, that satisfy a relevance threshold; and negative training images having relevance measures, for the n-gram, that do not satisfy the relevance threshold; selecting a training image from the plurality of training images, wherein the selecting comprises semi-randomly selecting the training image subject to a selection requirement specifying that a second image be selected with a specified likelihood; classifying the training image with the image classification model based on a feature vector of the training image, the feature vector comprising image feature values for the training image; and training the image classification model based on the feature vector of the training image and the classification of the training image.
|
20. A non-transitory computer readable medium encoded with a computer program comprising instructions that when executed operate to cause a computer to perform operations: obtaining a plurality of n-grams, each of the n-grams including a unique set of one or more terms; for each of the n-grams: identifying a plurality of training images for training an image classification model, the plurality of training images comprising: positive training images having relevance measures, for the n-gram, that satisfy a relevance threshold; and negative training images having relevance measures, for the n-gram, that do not satisfy the relevance threshold; selecting a training image from the plurality of training images, wherein the selecting comprises semi-randomly selecting the training image subject to a selection requirement specifying that a second image be selected with a specified likelihood; classifying the training image with the image classification model based on a feature vector of the training image, the feature vector comprising image feature values for the training image; and training the image classification model based on the feature vector of the training image and the classification of the training image. 21. The computer readable medium of claim 20 , wherein the instructions cause the computer to perform operations comprising: obtaining text associated with an image; obtaining a feature vector for the image; parsing, in a processing device, the text into candidate labels, each candidate label being a unique n-gram of the text; determining, in the processing device, that an image classification model is trained for an n-gram matching one or more candidate labels; and classifying, in the processing device, the image to the one or more candidate labels based on the feature vector and the image classification model for the n-gram matching the one or more candidate labels.
| 0.5 |
1. A learning system, comprising: a plurality of teacher stations and a plurality of student stations for holding one or more interactive learning sessions on a subject between a teacher of a plurality of teachers and at least two students, wherein the teacher and the at least two of the students interact with each other using free-style handwriting via a shared electronic white board of at least one of the plurality of teacher stations and at least two of the plurality of student stations; a database that stores at least one teacher attribute and at least one student attribute that relate to a language ability and a subject proficiency for the subject; and a server in communication with the database that: (i) serves computer generated instructional material relating to the subject to the at least two students through the at least two student stations, the computer generated instructional material for creating an interactive learning environment during the one or more interactive learning sessions, and wherein the computer generated instructional material is customized for the at least two students based on the language ability of each of the at least two students as determined by the server through each of the at least two student's respective student attributes stored in the database; and (ii) after serving the computer generated instructional material to the at least two students, selects the teacher from the plurality of teachers for the at least two students based on the language ability and the subject proficiency of each of the respective plurality of teachers teacher attributes stored in the database, wherein the teacher teaches the subject to the at least two students during the one or more interactive learning sessions in a language determined based on the language ability.
|
1. A learning system, comprising: a plurality of teacher stations and a plurality of student stations for holding one or more interactive learning sessions on a subject between a teacher of a plurality of teachers and at least two students, wherein the teacher and the at least two of the students interact with each other using free-style handwriting via a shared electronic white board of at least one of the plurality of teacher stations and at least two of the plurality of student stations; a database that stores at least one teacher attribute and at least one student attribute that relate to a language ability and a subject proficiency for the subject; and a server in communication with the database that: (i) serves computer generated instructional material relating to the subject to the at least two students through the at least two student stations, the computer generated instructional material for creating an interactive learning environment during the one or more interactive learning sessions, and wherein the computer generated instructional material is customized for the at least two students based on the language ability of each of the at least two students as determined by the server through each of the at least two student's respective student attributes stored in the database; and (ii) after serving the computer generated instructional material to the at least two students, selects the teacher from the plurality of teachers for the at least two students based on the language ability and the subject proficiency of each of the respective plurality of teachers teacher attributes stored in the database, wherein the teacher teaches the subject to the at least two students during the one or more interactive learning sessions in a language determined based on the language ability. 7. The learning system of claim 1 , wherein the database comprises at least one of a central database and a distributed database.
| 0.52983 |
12. The party kit of claim 9 , wherein the party package page is configured to show a list of items included with the party kit.
|
12. The party kit of claim 9 , wherein the party package page is configured to show a list of items included with the party kit. 13. The party kit of claim 12 , wherein the list of items include at least one of: a parent survival guide; a table set-up; decorations; and a gift box holding the party gifts, all having the one or more characters associated with the animated characters displayed in the bowling center.
| 0.860146 |
23. An active perception module comprising a decision making mechanism according to claim 1 , wherein said active perception module is configured to autonomously investigate scenes.
|
23. An active perception module comprising a decision making mechanism according to claim 1 , wherein said active perception module is configured to autonomously investigate scenes. 24. The active perception module according to claim 23 , wherein said active perception module is implemented in a robot.
| 0.9654 |
1. A computer-based method of scoring recommendations for potential purchase by a customer, comprising: receiving a recommendation context from a customer; using the recommendation context to identify a plurality of candidate recommendations that match the recommendation context, where each candidate recommendation recommends at least one recommended item; with a computer system, determining a score for each candidate recommendation by subtracting a first expected margin value factor for the recommended item that is based on the candidate recommendation not being displayed from a second expected margin value factor for the recommended item that is based on the candidate recommendation being displayed; and ranking the plurality of candidate recommendations using the score for each candidate recommendation to identify at least a highest ranking candidate recommendation.
|
1. A computer-based method of scoring recommendations for potential purchase by a customer, comprising: receiving a recommendation context from a customer; using the recommendation context to identify a plurality of candidate recommendations that match the recommendation context, where each candidate recommendation recommends at least one recommended item; with a computer system, determining a score for each candidate recommendation by subtracting a first expected margin value factor for the recommended item that is based on the candidate recommendation not being displayed from a second expected margin value factor for the recommended item that is based on the candidate recommendation being displayed; and ranking the plurality of candidate recommendations using the score for each candidate recommendation to identify at least a highest ranking candidate recommendation. 8. The method of claim 1 , where the step of determining a score for each candidate recommendation comprises: using a Bayesian network to calculate a first purchase probability measure for a candidate recommendation item, given a relevance measure for the item, an exposure measure for the item if the candidate recommendation is displayed and a clarity measure for the item if the candidate recommendation is displayed; using a Bayesian network to calculate a second purchase probability for the candidate recommendation item, given a relevance measure for the item, an exposure measure for the item if the candidate recommendation is not displayed and a clarity measure for the item if the candidate recommendation is not displayed; subtracting the second purchase probability measure from the first purchase probability measure to form a first difference value; and multiplying the first difference value by a margin value for the candidate recommendation item.
| 0.5 |
17. The system of claim 14 , the operations further comprising sending a software application to a client, wherein execution of the software application by the client provides a graphical user interface that allows selection of user group configuration settings, and the received identification of user group configuration settings includes data generated based on a user interaction with the graphical user interface.
|
17. The system of claim 14 , the operations further comprising sending a software application to a client, wherein execution of the software application by the client provides a graphical user interface that allows selection of user group configuration settings, and the received identification of user group configuration settings includes data generated based on a user interaction with the graphical user interface. 18. The system of claim 17 , wherein the software application comprises at least one of a standalone application or a web application.
| 0.913593 |
11. The method of claim 10 , further comprising selecting a plurality of fields of the first document likely to contain tokens with high IDF values and selecting the token from the selected fields with the highest inverse document frequency (IDF) with regard to all tokens in the document corpus.
|
11. The method of claim 10 , further comprising selecting a plurality of fields of the first document likely to contain tokens with high IDF values and selecting the token from the selected fields with the highest inverse document frequency (IDF) with regard to all tokens in the document corpus. 13. The method of claim 11 , wherein the threshold comprises a predetermined number of tokens.
| 0.94667 |
8. An apparatus comprising: a memory operable to: store an inverted index comprising a plurality of inverted index lists, each inverted index list corresponding to a term, each inverted index list comprising a term identifier of the term and one or more document identifiers indicating one or more documents of a document set in which the term appears; and a processor operable to execute logic to: generating a plurality of ordered pairs from the inverted index, each ordered pair comprising a term identifier and a document identifier of an inverted index list, the ordered pairs being organized primarily based on the document identifiers of the ordered pairs; and generate a term identifier index according to the inverted index, the term identifier index comprising a plurality of sections, each section corresponding to a document, each section comprising one or more term identifiers of one or more terms that appear in the document, the generating the term identifier index according to the inverted index comprising organizing the term identifiers of the ordered pairs in the sections of the term identifier index, wherein organizing the term identifiers of the ordered pairs comprises: removing a selected ordered pair from a data structure; generating a next ordered pair from the inverted index, the next ordered pair comprising a term identifier equivalent to a term identifier of the selected ordered pair; and placing the next ordered pair into the data structure.
|
8. An apparatus comprising: a memory operable to: store an inverted index comprising a plurality of inverted index lists, each inverted index list corresponding to a term, each inverted index list comprising a term identifier of the term and one or more document identifiers indicating one or more documents of a document set in which the term appears; and a processor operable to execute logic to: generating a plurality of ordered pairs from the inverted index, each ordered pair comprising a term identifier and a document identifier of an inverted index list, the ordered pairs being organized primarily based on the document identifiers of the ordered pairs; and generate a term identifier index according to the inverted index, the term identifier index comprising a plurality of sections, each section corresponding to a document, each section comprising one or more term identifiers of one or more terms that appear in the document, the generating the term identifier index according to the inverted index comprising organizing the term identifiers of the ordered pairs in the sections of the term identifier index, wherein organizing the term identifiers of the ordered pairs comprises: removing a selected ordered pair from a data structure; generating a next ordered pair from the inverted index, the next ordered pair comprising a term identifier equivalent to a term identifier of the selected ordered pair; and placing the next ordered pair into the data structure. 14. The apparatus of claim 8 , the processor further operable to: generate an ontology affinity matrix comprising a plurality of entries, each entry corresponding to a directional affinity of a term pair comprising a first term and a second term, the directional affinity comprising the probability that the second term appears in a document of the document set given that the first term appears in the document.
| 0.707921 |
7. The method of claim 6 , further comprising assigning a score for each node in the query syntactic tree.
|
7. The method of claim 6 , further comprising assigning a score for each node in the query syntactic tree. 8. The method of claim 7 , further comprising synthesizing scores for a plurality of nodes.
| 0.966691 |
14. A digital document system apparatus comprising one or more processor readable storage devices having processor readable code on said processor readable storage devices, said processor readable code for programming one or more processor to perform a method for text driven document sizing for a plurality of differently-sized documents in a rendering device, comprising: automatically detecting document sizes for said plurality of differently-sized documents by pre-scanning all sides of said plurality of differently-sized documents to determine said minimum output document sizes needed to accommodate all sides of said plurality of differently-sized documents, wherein reproduced output document sizes of said plurality of differently-sized documents are larger sides of said plurality of differently-sized documents; automatically detecting minimum text sizes of text contained in said plurality of differently-sized documents; recording said minimum text sizes of said text contained in said plurality of differently-sized documents; detecting output document sizes available to said rendering device in response to automatically detecting said minimum text sizes of said text contained in said plurality of differently-sized documents and specifying a particular said minimum set text sizes; utilizing said detected said minimum text sizes and said particular minimum set text sizes to automatically determine image magnification ratios and document sizes required to achieve said particular minimum text sizes in rendered documents via said rendering device, wherein text sizes achieved in said rendered documents are as close as possible to said particular minimum set text sizes if said particular minimum set text sizes specified are unachievable; recalculating said magnification ratio to fill a largest loaded paper size; and automatically optimizing said plurality of differently-sized documents reproduction factors including at least one of original document size, image size, magnification ratios, and output document sizes.
|
14. A digital document system apparatus comprising one or more processor readable storage devices having processor readable code on said processor readable storage devices, said processor readable code for programming one or more processor to perform a method for text driven document sizing for a plurality of differently-sized documents in a rendering device, comprising: automatically detecting document sizes for said plurality of differently-sized documents by pre-scanning all sides of said plurality of differently-sized documents to determine said minimum output document sizes needed to accommodate all sides of said plurality of differently-sized documents, wherein reproduced output document sizes of said plurality of differently-sized documents are larger sides of said plurality of differently-sized documents; automatically detecting minimum text sizes of text contained in said plurality of differently-sized documents; recording said minimum text sizes of said text contained in said plurality of differently-sized documents; detecting output document sizes available to said rendering device in response to automatically detecting said minimum text sizes of said text contained in said plurality of differently-sized documents and specifying a particular said minimum set text sizes; utilizing said detected said minimum text sizes and said particular minimum set text sizes to automatically determine image magnification ratios and document sizes required to achieve said particular minimum text sizes in rendered documents via said rendering device, wherein text sizes achieved in said rendered documents are as close as possible to said particular minimum set text sizes if said particular minimum set text sizes specified are unachievable; recalculating said magnification ratio to fill a largest loaded paper size; and automatically optimizing said plurality of differently-sized documents reproduction factors including at least one of original document size, image size, magnification ratios, and output document sizes. 20. The apparatus of claim 14 further comprising: a user interface associated with said rendering device to collect at least one user reproduction preference; and particular minimum set text sizes based on a user input, wherein said particular minimum set text size is achievable in a rendered document based on text sizes of said plurality of differently-sized documents.
| 0.5 |
33. The non-transitory computer-readable medium of claim 32 , wherein the item information is mathematically represented as an item vector according to a vector space model and the item category description is mathematically represented as a category vector according to the vector space model.
|
33. The non-transitory computer-readable medium of claim 32 , wherein the item information is mathematically represented as an item vector according to a vector space model and the item category description is mathematically represented as a category vector according to the vector space model. 34. The non-transitory computer-readable medium of claim 33 , wherein the similarity between the item vector and the at least one category vector comprises at least one of the deviation of the angles of the respective vectors and the cosine of the angles of the respective vectors.
| 0.86881 |
5. The method of claim 1 further comprising: identifying subsets of available outputs for the context classification; and assigning granularity levels to respective ones of the subsets of available outputs for the context classification.
|
5. The method of claim 1 further comprising: identifying subsets of available outputs for the context classification; and assigning granularity levels to respective ones of the subsets of available outputs for the context classification. 6. The method of claim 5 wherein: the receiving comprises receiving the granularity input comprising one of the subsets of available outputs for the context classification; and the performing comprises performing, by the classifier, the context classification by selecting the context classification output from the one of the subsets of available outputs for the context classification received as the granularity input.
| 0.900875 |
7. The method of claim 1 , wherein the unique features are individual characters.
|
7. The method of claim 1 , wherein the unique features are individual characters. 8. The method of claim 7 , and further comprising: generating a candidate language list based on analyzing Unicode ranges of characters of the text sample; and calculating confidence scores for each language from the candidate language list by calculating the difference between the score of each language and the sum of scores of the remaining languages, wherein identifying at least one language for the text sample is based on the confidence scores.
| 0.882521 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.