patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
9,350,561 | 17 | 19 |
17. A processor readable non-transitory storage media that includes instructions for generating a computer visualization of data, wherein execution of the instructions by one or more hardware processors performs actions, comprising: selecting a visualization model based on at least an allocation model, wherein the visualization model includes one or more visualization model items; mapping one or more allocation model items included in the allocation model to the one or more visualization model items; providing a resource value for each of the one or more visualization model items by at least aggregating an amount of resources corresponding to each of their one or more mapped allocation model items; storing the visualization model in a non-transitory memory of a computer, wherein the visualization model includes one or more resource values for the one or more visualization model items; displaying one or more portions of the visualization model that overlays the allocation model in a user interface of the computer, wherein the allocation model underlies the visualization model; and when a visualization model item is selected using the user interface of the computer, performing further actions, including: traversing the underlying allocation model to identify one or more source allocation model items and one or more target allocation model items that are associated with the selected visualization model item; providing one or more source visualization model items that provide resources to the selected visualization model item based on the one or more identified source allocation model items; providing one or more target visualization model items that receive resources from the selected visualization model item based on the one or more identified target allocation model items; displaying one or more input flow lines that start from the one or more source visualization model items and end at the selected visualization model item; and displaying one or more output flow lines that start from the selected visualization model item and end at the one or more target visualization model items.
|
17. A processor readable non-transitory storage media that includes instructions for generating a computer visualization of data, wherein execution of the instructions by one or more hardware processors performs actions, comprising: selecting a visualization model based on at least an allocation model, wherein the visualization model includes one or more visualization model items; mapping one or more allocation model items included in the allocation model to the one or more visualization model items; providing a resource value for each of the one or more visualization model items by at least aggregating an amount of resources corresponding to each of their one or more mapped allocation model items; storing the visualization model in a non-transitory memory of a computer, wherein the visualization model includes one or more resource values for the one or more visualization model items; displaying one or more portions of the visualization model that overlays the allocation model in a user interface of the computer, wherein the allocation model underlies the visualization model; and when a visualization model item is selected using the user interface of the computer, performing further actions, including: traversing the underlying allocation model to identify one or more source allocation model items and one or more target allocation model items that are associated with the selected visualization model item; providing one or more source visualization model items that provide resources to the selected visualization model item based on the one or more identified source allocation model items; providing one or more target visualization model items that receive resources from the selected visualization model item based on the one or more identified target allocation model items; displaying one or more input flow lines that start from the one or more source visualization model items and end at the selected visualization model item; and displaying one or more output flow lines that start from the selected visualization model item and end at the one or more target visualization model items. 19. The media of claim 17 , wherein providing the one or more target visualization model items further comprises, determining the one or more target visualization model items based on the one or more target allocation model items that receive resources from the one or more source allocation model items that correspond to the selected visualization model item.
| 0.712121 |
8,290,977 | 82 | 83 |
82. The method of claim 81 , wherein said aggregating step includes synchronizing aggregation boundaries so as to associate values with particular nodes of the XML document.
|
82. The method of claim 81 , wherein said aggregating step includes synchronizing aggregation boundaries so as to associate values with particular nodes of the XML document. 83. The method of claim 82 , wherein said aggregating step includes using a state transition mechanism for synchronization of aggregation boundaries.
| 0.5 |
10,120,885 | 1 | 8 |
1. A system comprising: an interface, implemented by one or more hardware processors, configured to receive a data definition statement involving a modification to a database object stored in a database, the data definition statement including a clause imposing a restriction on the modification to the database object based on whether the modification results in invalidation of at least one dependent database object of the database object; a parser, implemented by the one or more hardware processors, configured to determine whether the modification results in invalidation of at least one dependent database object of the database object in response to the clause being included in the data definition statement, the parser being configured to determine whether the modification results in the invalidation of the at least one dependent database object by performing operations including determining whether the at least one dependent database object is able to be successfully recompiled as a result of the modification; and a statement processor implemented by the one or more hardware processors, configured to prevent the modification to the database object based on determining that the modification results in the invalidation of the at least one dependent database object; the statement processor further to perform the modification to the database object based on determining that the modification does not result in the invalidation of the at least one dependent database object.
|
1. A system comprising: an interface, implemented by one or more hardware processors, configured to receive a data definition statement involving a modification to a database object stored in a database, the data definition statement including a clause imposing a restriction on the modification to the database object based on whether the modification results in invalidation of at least one dependent database object of the database object; a parser, implemented by the one or more hardware processors, configured to determine whether the modification results in invalidation of at least one dependent database object of the database object in response to the clause being included in the data definition statement, the parser being configured to determine whether the modification results in the invalidation of the at least one dependent database object by performing operations including determining whether the at least one dependent database object is able to be successfully recompiled as a result of the modification; and a statement processor implemented by the one or more hardware processors, configured to prevent the modification to the database object based on determining that the modification results in the invalidation of the at least one dependent database object; the statement processor further to perform the modification to the database object based on determining that the modification does not result in the invalidation of the at least one dependent database object. 8. The system of claim 1 , wherein the data definition statement includes a command to change an element of the database object.
| 0.696682 |
10,147,336 | 11 | 16 |
11. A system comprising: a keyword store configured to store a plurality of keywords extracted from one or more resources and metadata associated with each respective keyword, the metadata associated with each respective keyword indicating a word difficulty score of the respective keyword; a computer comprising a processor and non-transitory machine-readable storage instructing the processor, wherein the computer is configured to: automatically select from the keyword store a set of one or more keywords based upon the word difficulty score of each respective keyword and one or more skill scores of a learner-record stored in a learner database; generate a set of one or more identified orthographic distractors comprising one or more words of the plurality of words having the edit distance of each respective word satisfying an edit distance amount setting, wherein the edit distance of the word is a number of changes required to the word to be identical to the target word, and wherein the edit distance amount setting determines the number of changes to the word; and generate a set of one or more syntactic distractors comprising a word having a same root word as the keyword and that is a grammatical variant of the keyword.
|
11. A system comprising: a keyword store configured to store a plurality of keywords extracted from one or more resources and metadata associated with each respective keyword, the metadata associated with each respective keyword indicating a word difficulty score of the respective keyword; a computer comprising a processor and non-transitory machine-readable storage instructing the processor, wherein the computer is configured to: automatically select from the keyword store a set of one or more keywords based upon the word difficulty score of each respective keyword and one or more skill scores of a learner-record stored in a learner database; generate a set of one or more identified orthographic distractors comprising one or more words of the plurality of words having the edit distance of each respective word satisfying an edit distance amount setting, wherein the edit distance of the word is a number of changes required to the word to be identical to the target word, and wherein the edit distance amount setting determines the number of changes to the word; and generate a set of one or more syntactic distractors comprising a word having a same root word as the keyword and that is a grammatical variant of the keyword. 16. The system of claim 11 , wherein the computer is further configured to: determine the edit distance according to one or more learner attributes from a learner profile, wherein the edit distance amount has a difficulty level comparable to an ability level of the learner for a language skill.
| 0.5 |
8,074,165 | 26 | 27 |
26. An information storage media that stores a control program for associating annotations with at least one object, the control program including instructions for: searching for the at least one object to annotate; obtaining an object identifier for the at least one object; generating at least one annotation using an annotation device and an input device while displaying the at least one object and the at least one annotation with a viewing device that is distinct from the annotation device; establishing a link associating the at least one annotation with at least one portion of the object; transferring the at least one annotation to the at least one object by associating the at least one annotation with the object identifier at a time different and prior to associating the at least one annotation with the at least one portion of the object based on the link and the object identifier; storing the at least one annotation in a database by the annotation device; and viewing the at least one annotation from the database by the viewing device.
|
26. An information storage media that stores a control program for associating annotations with at least one object, the control program including instructions for: searching for the at least one object to annotate; obtaining an object identifier for the at least one object; generating at least one annotation using an annotation device and an input device while displaying the at least one object and the at least one annotation with a viewing device that is distinct from the annotation device; establishing a link associating the at least one annotation with at least one portion of the object; transferring the at least one annotation to the at least one object by associating the at least one annotation with the object identifier at a time different and prior to associating the at least one annotation with the at least one portion of the object based on the link and the object identifier; storing the at least one annotation in a database by the annotation device; and viewing the at least one annotation from the database by the viewing device. 27. The information storage media of claim 26 , wherein the instructions for associating the at least one annotation with the at least one portion of the object are based on at least one of a graphical technique and a textual technique.
| 0.638037 |
10,013,505 | 9 | 10 |
9. An apparatus according to claim 8 wherein the processor is configured to identify the candidate part name string by identifying a modifier.
|
9. An apparatus according to claim 8 wherein the processor is configured to identify the candidate part name string by identifying a modifier. 10. An apparatus according to claim 9 wherein the processor is configured to identify the modifier by identifying the modifier proximate to an occurrence of the head noun outside of the window.
| 0.5 |
9,442,977 | 9 | 10 |
9. A non-transitory computer readable storage medium as in claim 7 wherein the query engine communicates to the database engine, the structured association type including further information in a third parameter clause.
|
9. A non-transitory computer readable storage medium as in claim 7 wherein the query engine communicates to the database engine, the structured association type including further information in a third parameter clause. 10. A non-transitory computer readable storage medium as in claim 9 wherein the further information is selected from an additional filter condition.
| 0.5 |
8,954,942 | 1 | 6 |
1. A method for reducing a size of a Business Process Execution Language (BPEL) data blob for storage, the method comprising: identifying, by a computer system, one or more dehydration points within BPEL code; performing, by the computer system, a liveness analysis for the one or more dehydration points; identifying, by the computer system, at each of the one or more dehydration points, one or more live variables from a set of variables; creating, by the computer system, an optimization data structure that for each dehydration point identifies the one or more live variables; compiling the BPEL code using a BPEL compiler configured to perform the liveness analysis, thereby creating compiled BPEL code; executing a BPEL process using the compiled BPEL code; dehydrating the BPEL process at a dehydration point during execution of the BPEL process using the compiled BPEL code; and identifying, using the optimization data structure, the one or more live variables for the dehydration point.
|
1. A method for reducing a size of a Business Process Execution Language (BPEL) data blob for storage, the method comprising: identifying, by a computer system, one or more dehydration points within BPEL code; performing, by the computer system, a liveness analysis for the one or more dehydration points; identifying, by the computer system, at each of the one or more dehydration points, one or more live variables from a set of variables; creating, by the computer system, an optimization data structure that for each dehydration point identifies the one or more live variables; compiling the BPEL code using a BPEL compiler configured to perform the liveness analysis, thereby creating compiled BPEL code; executing a BPEL process using the compiled BPEL code; dehydrating the BPEL process at a dehydration point during execution of the BPEL process using the compiled BPEL code; and identifying, using the optimization data structure, the one or more live variables for the dehydration point. 6. The method for reducing the size of the BPEL data blob for storage of claim 1 , wherein at least some variables of the set of variables are extensible markup language (XML) variables.
| 0.7675 |
5,412,756 | 1 | 20 |
1. An artificial intelligence software shell for plant operation simulation comprising: a blackboard module including a database having objects representing plant elements and concepts; at least one knowledge source module including an artificial intelligence operation scheme, in communication with the blackboard module, operating on specific predefined blackboard objects; a user interface module, in communication with the blackboard module, enabling a user to view blackboard status information; and a control module, in communication with the blackboard module and the at least one knowledge source module, receiving input data and controlling operation of the at least one knowledge source module; wherein the control module includes: an event detector module, in communication with the user interface module, determining when the at least one knowledge source should execute, the event detector module including a hash table including a data point structure having entries for objects, and at least one expression list, the hash table being defined by a chaining algorithm.
|
1. An artificial intelligence software shell for plant operation simulation comprising: a blackboard module including a database having objects representing plant elements and concepts; at least one knowledge source module including an artificial intelligence operation scheme, in communication with the blackboard module, operating on specific predefined blackboard objects; a user interface module, in communication with the blackboard module, enabling a user to view blackboard status information; and a control module, in communication with the blackboard module and the at least one knowledge source module, receiving input data and controlling operation of the at least one knowledge source module; wherein the control module includes: an event detector module, in communication with the user interface module, determining when the at least one knowledge source should execute, the event detector module including a hash table including a data point structure having entries for objects, and at least one expression list, the hash table being defined by a chaining algorithm. 20. A software shell as claimed in claim 1 wherein the blackboard module database includes a hierarchy of objects having vertical hierarchical connections and horizontal links.
| 0.841727 |
8,412,628 | 20 | 25 |
20. A method for receiving and processing one or more claim files and authoring and electronically filing legal documents associated with legal actions, comprising the steps of: (A) electronically receiving at a system interface a first claim file in electronic form from a first entity wherein the first claim file includes a first source data element having a first format; (B) electronically receiving at the system interface a second claim file in electronic form from a second entity different from the first entity, wherein the second claim file includes a second source data element having a second format different from the first format; (C) mapping, using a processor, the first and second source data elements into first and second destination data elements conforming to a desired format to form first and second modified claim files; (D) selecting, using the processor, first and second courts, based respectively on data included in the first and second modified claim files and predetermined court selection criteria; (E) generating, using the processor, at least first and second legal documents in electronic form, respectively configured for electronic filing in the first and second courts and which are compliant with requirements of the first and second courts, said generating step using the first and second modified claim files and predetermined requirement data associated with the first and second courts; and (F) electronically filing the first and second legal documents respectively in the first and second courts to thereby institute legal actions in each court.
|
20. A method for receiving and processing one or more claim files and authoring and electronically filing legal documents associated with legal actions, comprising the steps of: (A) electronically receiving at a system interface a first claim file in electronic form from a first entity wherein the first claim file includes a first source data element having a first format; (B) electronically receiving at the system interface a second claim file in electronic form from a second entity different from the first entity, wherein the second claim file includes a second source data element having a second format different from the first format; (C) mapping, using a processor, the first and second source data elements into first and second destination data elements conforming to a desired format to form first and second modified claim files; (D) selecting, using the processor, first and second courts, based respectively on data included in the first and second modified claim files and predetermined court selection criteria; (E) generating, using the processor, at least first and second legal documents in electronic form, respectively configured for electronic filing in the first and second courts and which are compliant with requirements of the first and second courts, said generating step using the first and second modified claim files and predetermined requirement data associated with the first and second courts; and (F) electronically filing the first and second legal documents respectively in the first and second courts to thereby institute legal actions in each court. 25. The method of claim 20 wherein said step of selecting a first court includes the sub-steps of: defining selection rules for selection of the first court; and identifying the selected first court from a list of a plurality of candidate courts using the selection rules and data included in the first claim file.
| 0.797158 |
8,271,256 | 11 | 14 |
11. A non-transitory computer readable medium comprising software instructions to optimize MOSFET device production, wherein the software instructions comprise instructions for causing a computer to perform: calculating theoretical extracted parameters using at least one of key independent parameters in canonical variational form, physics-based analytical models, and corner models; calculating simulated characteristics of a device using at least one of key independent parameters in canonical form or theoretical extracted parameters using a variational model; extracting target data parameters based on at least one of measured data and predicted data; comparing the simulated characteristics to the target data parameters; modifying the theoretical extracted parameters based on the comparison to the target data parameters; modifying the key independent parameters in canonical form based on the modified theoretical extracted parameters; calculating and outputting the simulated characteristics based on the modified theoretical extracted parameters and the modified key independent parameters in canonical form; and modifying the key independent parameters in the device production using the simulated characteristics, wherein the canonical variational form comprises a key independent parameter extracted at nominal, or target, device specifications plus a product of magnitude of a variation of the key independent parameter, relative to a skew of a distribution on device characteristics, and a selected distribution.
|
11. A non-transitory computer readable medium comprising software instructions to optimize MOSFET device production, wherein the software instructions comprise instructions for causing a computer to perform: calculating theoretical extracted parameters using at least one of key independent parameters in canonical variational form, physics-based analytical models, and corner models; calculating simulated characteristics of a device using at least one of key independent parameters in canonical form or theoretical extracted parameters using a variational model; extracting target data parameters based on at least one of measured data and predicted data; comparing the simulated characteristics to the target data parameters; modifying the theoretical extracted parameters based on the comparison to the target data parameters; modifying the key independent parameters in canonical form based on the modified theoretical extracted parameters; calculating and outputting the simulated characteristics based on the modified theoretical extracted parameters and the modified key independent parameters in canonical form; and modifying the key independent parameters in the device production using the simulated characteristics, wherein the canonical variational form comprises a key independent parameter extracted at nominal, or target, device specifications plus a product of magnitude of a variation of the key independent parameter, relative to a skew of a distribution on device characteristics, and a selected distribution. 14. The computer readable medium of claim 11 , wherein the method of extracting the theoretical statistical parameters based on the target data parameters comprises at least one of: identifying and measuring data parameters and distribution of data parameters in process control monitoring; extracting statistical model parameters from measured data parameters; and determining a distribution of model parameters from the measured data parameters and distribution of the measured data parameters.
| 0.637956 |
6,031,577 | 4 | 5 |
4. Apparatus according to claim 1, including means for determining from a second indicator in said packetized program information a language type used in said first text string.
|
4. Apparatus according to claim 1, including means for determining from a second indicator in said packetized program information a language type used in said first text string. 5. Apparatus according to claim 4, including means for decoding said decoded first text string with a decoding function selected in accordance with said determined language type.
| 0.5 |
9,779,428 | 1 | 6 |
1. A method for determining the sentiment of a plurality of words as negative or positive, comprising: receiving, by one or more computer processors, a plurality of words from a user interface of a client machine; for each word in the plurality of words, testing whether the word indicates positive or negative sentiment by using a sentiment mining tool; responsive to detecting an indication of positive sentiment of the word, testing whether there is, in the plurality of words, a known negative word that was mined from the text of feedback from one or more ecommerce transaction logs; responsive to detecting that there is, in the plurality of words, no known negative word that was mined from the text of feedback from one or more ecommerce transaction logs, incrementing a positive word counter in one or more hardware processors; responsive to detecting an indication of negative sentiment of the word, testing whether the word is in a list of negative modifiers; and responsive to detecting that the word is not in the list of negative modifiers, incrementing a negative word counter in the one or more hardware processors.
|
1. A method for determining the sentiment of a plurality of words as negative or positive, comprising: receiving, by one or more computer processors, a plurality of words from a user interface of a client machine; for each word in the plurality of words, testing whether the word indicates positive or negative sentiment by using a sentiment mining tool; responsive to detecting an indication of positive sentiment of the word, testing whether there is, in the plurality of words, a known negative word that was mined from the text of feedback from one or more ecommerce transaction logs; responsive to detecting that there is, in the plurality of words, no known negative word that was mined from the text of feedback from one or more ecommerce transaction logs, incrementing a positive word counter in one or more hardware processors; responsive to detecting an indication of negative sentiment of the word, testing whether the word is in a list of negative modifiers; and responsive to detecting that the word is not in the list of negative modifiers, incrementing a negative word counter in the one or more hardware processors. 6. The method of claim 1 wherein responsive to detecting that the word is in the list of negative modifiers, flagging the plurality of words as indicating a negative sentiment.
| 0.846957 |
8,892,992 | 6 | 9 |
6. A method for defining structure for a document, the method comprising: identifying pairs of nearest primitive elements in a document comprising a plurality of primitive elements that are defined in terms of their position in the document; sorting the pairs of nearest primitive elements based on an order from a pair of nearest primitive elements that are a closest distance apart to a pair of nearest primitive elements that are a furthest distance apart; storing a single value that identifies, from the sorted pairs of nearest primitive elements, a particular pair of nearest primitive elements whose primitive elements are a minimum distance apart to form a partition, wherein each pair of nearest primitive elements that are a greater distance apart than the minimum distance is after the particular pair in the order; identifying partitions between the primitive elements in the document based on the single value and the sorted pairs of nearest primitive elements; and using the partitions to define structural elements for the document.
|
6. A method for defining structure for a document, the method comprising: identifying pairs of nearest primitive elements in a document comprising a plurality of primitive elements that are defined in terms of their position in the document; sorting the pairs of nearest primitive elements based on an order from a pair of nearest primitive elements that are a closest distance apart to a pair of nearest primitive elements that are a furthest distance apart; storing a single value that identifies, from the sorted pairs of nearest primitive elements, a particular pair of nearest primitive elements whose primitive elements are a minimum distance apart to form a partition, wherein each pair of nearest primitive elements that are a greater distance apart than the minimum distance is after the particular pair in the order; identifying partitions between the primitive elements in the document based on the single value and the sorted pairs of nearest primitive elements; and using the partitions to define structural elements for the document. 9. The method of claim 6 , wherein storing the single value comprises storing a plurality of single values that each identify different pairs of nearest primitive elements whose primitive elements are different minimum distances apart to form partitions.
| 0.5 |
7,548,899 | 7 | 12 |
7. A method comprising: receiving, at a device, a first menu list of words or phrases, the received first menu list including a plurality of concepts associated with a natural language query to be formed; sending, from the device to a second device, a first selection of a first word or phrase from the first menu list, wherein the first selection identifies a concept for the natural language query to be formed; receiving a second menu list of words or phrases at the device, wherein the second menu list is based at least in part on the identified concept; sending, from the device to the second device, a second selection of a second word or phrase from the second menu list, the second selection identifying a first segment of the natural language query, wherein the natural language query is based at least in part on the first segment, and further wherein the natural language query does not include the identified concept; and receiving a response to the natural language query at the device.
|
7. A method comprising: receiving, at a device, a first menu list of words or phrases, the received first menu list including a plurality of concepts associated with a natural language query to be formed; sending, from the device to a second device, a first selection of a first word or phrase from the first menu list, wherein the first selection identifies a concept for the natural language query to be formed; receiving a second menu list of words or phrases at the device, wherein the second menu list is based at least in part on the identified concept; sending, from the device to the second device, a second selection of a second word or phrase from the second menu list, the second selection identifying a first segment of the natural language query, wherein the natural language query is based at least in part on the first segment, and further wherein the natural language query does not include the identified concept; and receiving a response to the natural language query at the device. 12. A method as recited in claim 7 , wherein the second menu list is based at least in part on a profile that includes one or more of a selection history, a preference, content, or an application.
| 0.5 |
8,140,535 | 1 | 18 |
1. A computer-implemented method of registering an ontology with a search engine provider, comprising: receiving an ontology definition comprising a plurality of terms from an ontology owner; and creating an ontology index based on the ontology definition and a keyword index, wherein the keyword index includes a plurality of relationships between a plurality of keywords and a plurality of documents residing on a network, and wherein the ontology index includes a plurality of relationships between the plurality of terms and the plurality of documents residing on the network, comprising: creating a plurality of ontology index entries, wherein each of the plurality of ontology index entries corresponds to a respective one of the plurality of terms in the ontology definition; and for each of the plurality of ontology index entries: searching the keyword index for the corresponding one of the plurality of terms to identify one or more related documents; and inserting an identifier of the identified one or more related documents into the ontology index entry.
|
1. A computer-implemented method of registering an ontology with a search engine provider, comprising: receiving an ontology definition comprising a plurality of terms from an ontology owner; and creating an ontology index based on the ontology definition and a keyword index, wherein the keyword index includes a plurality of relationships between a plurality of keywords and a plurality of documents residing on a network, and wherein the ontology index includes a plurality of relationships between the plurality of terms and the plurality of documents residing on the network, comprising: creating a plurality of ontology index entries, wherein each of the plurality of ontology index entries corresponds to a respective one of the plurality of terms in the ontology definition; and for each of the plurality of ontology index entries: searching the keyword index for the corresponding one of the plurality of terms to identify one or more related documents; and inserting an identifier of the identified one or more related documents into the ontology index entry. 18. The method of claim 1 , wherein searching the keyword index for the corresponding one of the plurality of terms to identify one or more related documents further comprises: determining that the corresponding one of the plurality of terms contains a plurality of words; and searching the keyword index to determine that all of the plurality of words appear in each of the identified one or more related documents consecutively and in sequence.
| 0.5 |
8,381,306 | 1 | 8 |
1. A method comprising: providing in a computer, a role based access control (RBAC) store, the RBAC store defining at least one scope wherein each scope represents a set of resources in a networked computing environment; providing in the RBAC store, at least one role definition and at least one role assignment; defining in the RBAC store, based at least in part on the at least one role definition and the at least one role assignment, at least one enterprise role, each enterprise role including a set of permissions that are assigned to principals in a given scope; and using the RBAC store for translating the at least one scope, the at least one enterprise role and at least one resource group representing a role based access control (RBAC) policy to a resource authorization policy model, the RBAC policy mappable to at least one access control list (ACL) in the networked computing environment for configuring an underlying resource authorization policy.
|
1. A method comprising: providing in a computer, a role based access control (RBAC) store, the RBAC store defining at least one scope wherein each scope represents a set of resources in a networked computing environment; providing in the RBAC store, at least one role definition and at least one role assignment; defining in the RBAC store, based at least in part on the at least one role definition and the at least one role assignment, at least one enterprise role, each enterprise role including a set of permissions that are assigned to principals in a given scope; and using the RBAC store for translating the at least one scope, the at least one enterprise role and at least one resource group representing a role based access control (RBAC) policy to a resource authorization policy model, the RBAC policy mappable to at least one access control list (ACL) in the networked computing environment for configuring an underlying resource authorization policy. 8. The method of claim 1 , further comprising: updating the at least one scope when a set of resources associated with a scope changes.
| 0.804348 |
9,715,702 | 12 | 14 |
12. A manufacture comprising: a non-transitory computer-readable storage medium; and a computer executable instruction stored on the non-transitory computer-readable storage medium which, when executed by a computer device, causes the computing device to perform a method comprising: calculating target prices based at least in part on existing price information of a plurality of products, generating price bounds for a set of bounded business rules based at least in part on the calculated target prices, generating rule parameters for a set of comparative business rules based at least in part on the existing price information, and generating at least one recommended price for at least one of the plurality of products by applying the price bounds and the rule parameters to the existing price information.
|
12. A manufacture comprising: a non-transitory computer-readable storage medium; and a computer executable instruction stored on the non-transitory computer-readable storage medium which, when executed by a computer device, causes the computing device to perform a method comprising: calculating target prices based at least in part on existing price information of a plurality of products, generating price bounds for a set of bounded business rules based at least in part on the calculated target prices, generating rule parameters for a set of comparative business rules based at least in part on the existing price information, and generating at least one recommended price for at least one of the plurality of products by applying the price bounds and the rule parameters to the existing price information. 14. The manufacture of claim 12 , wherein generating rule parameters comprises: iteratively generating rule parameters for each comparative rule in the set of comparative rules until the rule parameters are stable, wherein iteratively generating the rule parameters comprises: performing a number of rounds, the number of rounds determined dynamically based on stability of the rule parameters, each round comprising: for each comparative rule in the set of comparative rules, generating rule parameters for the comparative rule, and determining whether the rule parameters are stable.
| 0.5 |
8,473,489 | 1 | 2 |
1. A method performed by a system comprising one or more computers, the method comprising: determining that a first search query includes a respective text reference to each of one or more predetermined attributes, wherein each attribute is associated with a first entity type; generating a second search query including the first search query and one or more terms that refer to the first entity type; and evaluating search results obtained for the second search query to select one or more names of entities of the first entity type to include in a response to the first search query, wherein each search result identifies a respective search result resource, and wherein evaluating the search results comprises: identifying occurrences of references to entities of the first entity type in the same search result resource as one or more terms from the first search query; and selecting the names of entities based on the identified occurrences.
|
1. A method performed by a system comprising one or more computers, the method comprising: determining that a first search query includes a respective text reference to each of one or more predetermined attributes, wherein each attribute is associated with a first entity type; generating a second search query including the first search query and one or more terms that refer to the first entity type; and evaluating search results obtained for the second search query to select one or more names of entities of the first entity type to include in a response to the first search query, wherein each search result identifies a respective search result resource, and wherein evaluating the search results comprises: identifying occurrences of references to entities of the first entity type in the same search result resource as one or more terms from the first search query; and selecting the names of entities based on the identified occurrences. 2. The method of claim 1 , wherein the one or more terms that refer to the first entity type comprise one or more terms that name the first entity type.
| 0.771772 |
7,783,639 | 8 | 9 |
8. The method of claim 1 , wherein assigning the ranking score includes iteratively assigning the ranking score until convergence.
|
8. The method of claim 1 , wherein assigning the ranking score includes iteratively assigning the ranking score until convergence. 9. The method of claim 8 , further comprising: normalizing the ranking score after the iterative assignment of the ranking score is complete.
| 0.5 |
6,064,982 | 5 | 23 |
5. A smart configurator for needs assessment and product configuration, comprising: a configuration tool in the form of a series of cascading style sheets, said configuration tool comprising: a module that assists a user in determining hardware needs; a customer needs identification page for assessing a customer's product requirements, in which a customer may select among various statements; a system needs determination page in which hardware requirements are identified; and a recommended system configuration page that provides a recommended system configuration that includes any of product identification, pricing information, various options that have been selected, and sales terms and conditions that may be desired; a browser for progressing through said style sheets during an interactive, off-line customer needs assessment and product configuration session; and means for automatically recommending a system configuration that most nearly meets a customer's needs, based upon the results of said interactive customer product selection session.
|
5. A smart configurator for needs assessment and product configuration, comprising: a configuration tool in the form of a series of cascading style sheets, said configuration tool comprising: a module that assists a user in determining hardware needs; a customer needs identification page for assessing a customer's product requirements, in which a customer may select among various statements; a system needs determination page in which hardware requirements are identified; and a recommended system configuration page that provides a recommended system configuration that includes any of product identification, pricing information, various options that have been selected, and sales terms and conditions that may be desired; a browser for progressing through said style sheets during an interactive, off-line customer needs assessment and product configuration session; and means for automatically recommending a system configuration that most nearly meets a customer's needs, based upon the results of said interactive customer product selection session. 23. The smart configurator of claim 5, further comprising: a pricing information page.
| 0.873529 |
8,285,537 | 13 | 18 |
13. A method as recited in claim 2 , wherein said augmenting includes adding at least one native pronunciation of the proper noun to a dictionary used by the speech recognizer.
|
13. A method as recited in claim 2 , wherein said augmenting includes adding at least one native pronunciation of the proper noun to a dictionary used by the speech recognizer. 18. A method as recited in claim 13 , wherein said augmenting adds a plurality of different native pronunciations of the proper noun to the dictionary.
| 0.856736 |
9,934,331 | 11 | 12 |
11. A computer-implemented method for building a data query based on one or more query suggestions, the method comprising: detecting access at a data source; comparing non-query data associated with a search query at the data source to a set of default query statements, the non-query data comprising metadata describing identity data, profile data, or contextual information for a client computer accessing the data source; determining that at least a portion of the non-query data is associated with at least one default query statement of the set of default query statements; generating at least one query suggestion for the search query at the data, the at least one query suggestion comprising a selectable query suggestion for appending to the search query; providing the at least one query suggestion to a client device configured to graphically display the query suggestion through a user-interface (UI) configured to receive selections of individual query suggestions of the at least one query suggestion; receiving an indication of an action on the at least one query suggestion; determining an additional query suggestion for the query for the data source based on a query or non-query data; and returning the additional query suggestion.
|
11. A computer-implemented method for building a data query based on one or more query suggestions, the method comprising: detecting access at a data source; comparing non-query data associated with a search query at the data source to a set of default query statements, the non-query data comprising metadata describing identity data, profile data, or contextual information for a client computer accessing the data source; determining that at least a portion of the non-query data is associated with at least one default query statement of the set of default query statements; generating at least one query suggestion for the search query at the data, the at least one query suggestion comprising a selectable query suggestion for appending to the search query; providing the at least one query suggestion to a client device configured to graphically display the query suggestion through a user-interface (UI) configured to receive selections of individual query suggestions of the at least one query suggestion; receiving an indication of an action on the at least one query suggestion; determining an additional query suggestion for the query for the data source based on a query or non-query data; and returning the additional query suggestion. 12. The method of claim 11 , wherein the detecting access at the data source comprises: receiving a request to access data at the data source; receiving a request to receive the query suggestion; or determining that a file has been opened.
| 0.5 |
8,122,043 | 9 | 13 |
9. A system for ranking the relevance of each of a plurality of documents in a corpus to a search query comprising: a) a processing unit capable of performing calculations; b) a storage device on which is stored a corpus of documents; c) an input device for receiving the search query; d) an output device for displaying the results of the ranking; wherein the processing unit groups words in the search query by synonym into one or more word groups; wherein the processing unit, for each word group, counts the number of instances (the “FQ” value) that a word from the word group appears in the search query; wherein the processing unit determines the maximum FQ value among all the word groups; wherein the processing unit calculates a scaling factor K; wherein the processing unit, for each word group, calculates a term frequency (“TF”) value by dividing the FQ value for the word group by the maximum FQ value and applying scaling factor K to the resulting quotient; wherein the processing unit, for each word group, counts the number of documents (“FC”) in the corpus that contain at least one word from the word group; wherein the processing unit counts the number of documents (“N”) in the corpus; wherein the processing unit, for each word group, calculates an inverse document frequency (“IDF”) value by dividing N by FC, adding one to the resulting quotient, and taking the natural logarithm of the resulting sum; wherein the processing unit, for each word group, calculates a TF-IDF value by multiplying said TF value by said IDF value; and wherein the processing unit ranks the relevance of each document in the corpus utilizing the TF-IDF values for the word groups in the search query.
|
9. A system for ranking the relevance of each of a plurality of documents in a corpus to a search query comprising: a) a processing unit capable of performing calculations; b) a storage device on which is stored a corpus of documents; c) an input device for receiving the search query; d) an output device for displaying the results of the ranking; wherein the processing unit groups words in the search query by synonym into one or more word groups; wherein the processing unit, for each word group, counts the number of instances (the “FQ” value) that a word from the word group appears in the search query; wherein the processing unit determines the maximum FQ value among all the word groups; wherein the processing unit calculates a scaling factor K; wherein the processing unit, for each word group, calculates a term frequency (“TF”) value by dividing the FQ value for the word group by the maximum FQ value and applying scaling factor K to the resulting quotient; wherein the processing unit, for each word group, counts the number of documents (“FC”) in the corpus that contain at least one word from the word group; wherein the processing unit counts the number of documents (“N”) in the corpus; wherein the processing unit, for each word group, calculates an inverse document frequency (“IDF”) value by dividing N by FC, adding one to the resulting quotient, and taking the natural logarithm of the resulting sum; wherein the processing unit, for each word group, calculates a TF-IDF value by multiplying said TF value by said IDF value; and wherein the processing unit ranks the relevance of each document in the corpus utilizing the TF-IDF values for the word groups in the search query. 13. The system of claim 9 wherein said scaling factor K is a strictly decreasing function over the domain of positive integers whose range does not exceed 1 or fall below 0 where the domain represents the number of unique words (“C”) in the search query.
| 0.563574 |
8,108,890 | 19 | 20 |
19. A system for automatically authoring a plurality of interactive menu audiovisual assets in a respective plurality of languages, comprising: a database providing a plurality of sets of menu text in a plurality of languages; a menu text template operable to define locations or positions and format text extracted from the database, a menu background element associated with each menu location; and a localized menu component in communication with the database and text template, the localized menu component operable to automatically create links between graphical representations of menu items in a plurality of languages and corresponding audiovisual assets, the links authored as interactive menu audiovisual assets by the automated iterative process of the localized menu component to; retrieve an element of menu text from the database; populate an associated menu text template location, the menu text template dimensioning an associated graphical highlight element to each item of menu text and associated menu background element.
|
19. A system for automatically authoring a plurality of interactive menu audiovisual assets in a respective plurality of languages, comprising: a database providing a plurality of sets of menu text in a plurality of languages; a menu text template operable to define locations or positions and format text extracted from the database, a menu background element associated with each menu location; and a localized menu component in communication with the database and text template, the localized menu component operable to automatically create links between graphical representations of menu items in a plurality of languages and corresponding audiovisual assets, the links authored as interactive menu audiovisual assets by the automated iterative process of the localized menu component to; retrieve an element of menu text from the database; populate an associated menu text template location, the menu text template dimensioning an associated graphical highlight element to each item of menu text and associated menu background element. 20. The system of claim 19 , wherein the text template automatically adjusts the position of each menu text based on a text factor.
| 0.683575 |
9,760,344 | 4 | 5 |
4. The system of claim 3 , further comprising an engine which enables production of a graph of the plurality of rules.
|
4. The system of claim 3 , further comprising an engine which enables production of a graph of the plurality of rules. 5. The system of claim 4 , wherein the graph comprises the documentation of each rule and a graphical display of a rules hierarchy.
| 0.5 |
7,844,045 | 5 | 7 |
5. The system of claim 4 , wherein said human customer service representative selector suggests rerouting the call based on the analysis and selects a new one of plural human customer service representatives.
|
5. The system of claim 4 , wherein said human customer service representative selector suggests rerouting the call based on the analysis and selects a new one of plural human customer service representatives. 7. The system of claim 5 , wherein said human customer service representative selector selects the new one of plural human customer service representatives based on a preexisting supervisory relationship between the new human customer service representative and the human customer service representative interacting with the customer during the analysis.
| 0.504202 |
8,825,584 | 1 | 12 |
1. A system for evaluating communicative acts to determine a social regard score between two communicating entities participating in the communicative act, the two communicating entities collectively defining a communication pair, the system comprising: a patterns database storing behavior recognition patterns defining particular redressive behaviors that may be used in the communicative acts and a redress score associated with each one of the particular redressive behaviors; and an etiquette processor in communication with the patterns database and configured to determine a pairwise regard score for the communicative pair based on ones of the particular redressive behaviors identified in the communicative acts between the two communicating entities of the communicative pair; wherein: the communicative pair is one of a plurality of communicative pairs each including a different two communicating entities, the etiquette processor is configured to determine a different pairwise regard score for each one of the plurality of communicative pairs based on ones of the particular redressive behaviors identified in the communicative acts between a corresponding one of the different two communicating entities of the communicative pair, and the system further comprises: a communications network aggregation processor configured to combine the pairwise regard scores for each one of the plurality of communicative pairs, received from the etiquette processor, into a social regard network representation including a plurality of entities in the social regard network and indicating a respective social regard level of each of the plurality of entities relative to other ones of the plurality of entities, the plurality of entities including the two communicating entities of each one of the plurality of communicative pairs.
|
1. A system for evaluating communicative acts to determine a social regard score between two communicating entities participating in the communicative act, the two communicating entities collectively defining a communication pair, the system comprising: a patterns database storing behavior recognition patterns defining particular redressive behaviors that may be used in the communicative acts and a redress score associated with each one of the particular redressive behaviors; and an etiquette processor in communication with the patterns database and configured to determine a pairwise regard score for the communicative pair based on ones of the particular redressive behaviors identified in the communicative acts between the two communicating entities of the communicative pair; wherein: the communicative pair is one of a plurality of communicative pairs each including a different two communicating entities, the etiquette processor is configured to determine a different pairwise regard score for each one of the plurality of communicative pairs based on ones of the particular redressive behaviors identified in the communicative acts between a corresponding one of the different two communicating entities of the communicative pair, and the system further comprises: a communications network aggregation processor configured to combine the pairwise regard scores for each one of the plurality of communicative pairs, received from the etiquette processor, into a social regard network representation including a plurality of entities in the social regard network and indicating a respective social regard level of each of the plurality of entities relative to other ones of the plurality of entities, the plurality of entities including the two communicating entities of each one of the plurality of communicative pairs. 12. The system of claim 1 , wherein each pairwise regard score is further based on a ranked imposition of each of the communicative acts for the communicative pair.
| 0.830228 |
9,805,126 | 7 | 8 |
7. The method of claim 1 , wherein one or more of the business objectives comprises encouraging users to use one or more of the features.
|
7. The method of claim 1 , wherein one or more of the business objectives comprises encouraging users to use one or more of the features. 8. The method of claim 7 , wherein the lower level of interaction the user has with the one or more features, the higher the one or more ranks of one or more of the identified entities associated with the one or more features are boosted.
| 0.5 |
9,460,086 | 1 | 4 |
1. A method for performing bilingual word alignment on source and target text in bilingual documents, the method comprising: computing probability gains of adding a link between any pair of source and target words in the source and target text; applying a greedy algorithm to iteratively search for a plurality of word alignments that satisfy an inversion transduction grammar constraint, wherein applying the greedy algorithm includes: initializing a pending list; generating a local list by performing an expanding operation to each word alignment in the pending list, and adding to the local list new word alignments that satisfy the inversion transduction grammar constraint; determining whether to update the lists after each iteration according to whether the pending list is empty; and outputting the best alignment from the word alignments in the local list; and outputting a best word alignment among the plurality as a final alignment result.
|
1. A method for performing bilingual word alignment on source and target text in bilingual documents, the method comprising: computing probability gains of adding a link between any pair of source and target words in the source and target text; applying a greedy algorithm to iteratively search for a plurality of word alignments that satisfy an inversion transduction grammar constraint, wherein applying the greedy algorithm includes: initializing a pending list; generating a local list by performing an expanding operation to each word alignment in the pending list, and adding to the local list new word alignments that satisfy the inversion transduction grammar constraint; determining whether to update the lists after each iteration according to whether the pending list is empty; and outputting the best alignment from the word alignments in the local list; and outputting a best word alignment among the plurality as a final alignment result. 4. The method of claim 1 , wherein performing the expanding operation to each word alignment includes: for each word alignment A in the pending list and link l in L, if l is not in A, then adding l to A to produce a new word alignment, where L is a set of links that have positive gains.
| 0.829976 |
9,070,137 | 17 | 18 |
17. The non-transitory computer readable medium of claim 16 , wherein the collecting comprises: collecting one or more events recorded in the client website.
|
17. The non-transitory computer readable medium of claim 16 , wherein the collecting comprises: collecting one or more events recorded in the client website. 18. The non-transitory computer readable medium of claim 17 , wherein the collecting comprises recording one or more of the following events: visits to the client website; number of orders of products from the client website; number of orders of products from the client website divided into a category; and number of downloads from the client website.
| 0.5 |
8,775,325 | 17 | 18 |
17. The computer readable storage medium of claim 14 , wherein the story selected for display is selected from a plurality of stories, wherein the social advertisement and the plurality of the stories generated are sent for display to the client device of the viewing user.
|
17. The computer readable storage medium of claim 14 , wherein the story selected for display is selected from a plurality of stories, wherein the social advertisement and the plurality of the stories generated are sent for display to the client device of the viewing user. 18. The computer readable storage medium of claim 17 , wherein the social advertisement and the plurality of stories sent to the client device comprise a feed of information provided for display.
| 0.5 |
4,558,461 | 1 | 3 |
1. In an optical scanning system having an optical scanning head for sequentially scanning horizontally across a document to create pixel oriented data representing text of the document for subsequent comparison searching to determine the alpha-numeric contents of the document, the improvement for automatically compensating for text line skew comprising: (a) means for dividing the data into equal swaths representing vertical columns on the documents; (b) means for scanning the data by swath to determine the apparent text line initiations and termination contained therein and for creating a data matrix of initiation/termination pairs by swath; said data matrix having at least left and right boundaries; (c) means for sequentially searching the data in the data matrix left and right for each pair in a base vector swath, representative of a predetermined range of apparent text line initiations and terminations, to trace the data indicative of apparent text lines to determine a plurality of points apparently on base lines of respective ones of the apparent text lines of the document; (d) means for determining the apparent skew angle of the text from the points on the apparent base lines; and; (e) means for bounding the data of the apparent text lines for subsequent comparison searching from the found intersection/termination pairs and apparent skew angle determined.
|
1. In an optical scanning system having an optical scanning head for sequentially scanning horizontally across a document to create pixel oriented data representing text of the document for subsequent comparison searching to determine the alpha-numeric contents of the document, the improvement for automatically compensating for text line skew comprising: (a) means for dividing the data into equal swaths representing vertical columns on the documents; (b) means for scanning the data by swath to determine the apparent text line initiations and termination contained therein and for creating a data matrix of initiation/termination pairs by swath; said data matrix having at least left and right boundaries; (c) means for sequentially searching the data in the data matrix left and right for each pair in a base vector swath, representative of a predetermined range of apparent text line initiations and terminations, to trace the data indicative of apparent text lines to determine a plurality of points apparently on base lines of respective ones of the apparent text lines of the document; (d) means for determining the apparent skew angle of the text from the points on the apparent base lines; and; (e) means for bounding the data of the apparent text lines for subsequent comparison searching from the found intersection/termination pairs and apparent skew angle determined. 3. The improvement to an optical scanning system of claim 1 wherein: said scanning means includes means for checking the separation between apparent initiations and terminations and for rejecting apparent pairs which do not meet pre-established separation criteria.
| 0.703579 |
7,836,028 | 26 | 27 |
26. The method set forth in claim 25 wherein: the change is propagated from a version in the leaf workspace to a version in the root workspace.
|
26. The method set forth in claim 25 wherein: the change is propagated from a version in the leaf workspace to a version in the root workspace. 27. The method set forth in claim 26 wherein: the change is propagated from a version in an intermediate workspace to a version in the root workspace.
| 0.5 |
7,908,280 | 10 | 14 |
10. An apparatus comprising: a processor; and a memory including computer program code, the memory and the computer program code configured to, with the processor, cause the apparatus to perform at least the following: receive search criteria from a user, said search criteria including a free text entry query and a domain identifier identifying a domain; determine to request a search of a first corpus of documents to identify a first set of documents; determine to receive a first result set for the first corpus of documents, the first result set identifying the first set of documents in order of relevance; determine to request a search of a second corpus of documents to identify a second set of documents; receive a second result set for the second corpus of documents, the second result set identifying the second set of documents in order of relevance; and determine to merge sort the first and second result sets to produce a new result set that is ordered in relevance; and wherein determining to merge sort is based on a relevancy of the search criteria; and wherein the determined scores for each of the identified documents include a document-to-location relevance score, a document-to-text relevance score, and an abstract quality score; and combining the document-to-location relevance scores, the document-to-text, and the abstract quality score to generate a combined relevance score for the identified document.
|
10. An apparatus comprising: a processor; and a memory including computer program code, the memory and the computer program code configured to, with the processor, cause the apparatus to perform at least the following: receive search criteria from a user, said search criteria including a free text entry query and a domain identifier identifying a domain; determine to request a search of a first corpus of documents to identify a first set of documents; determine to receive a first result set for the first corpus of documents, the first result set identifying the first set of documents in order of relevance; determine to request a search of a second corpus of documents to identify a second set of documents; receive a second result set for the second corpus of documents, the second result set identifying the second set of documents in order of relevance; and determine to merge sort the first and second result sets to produce a new result set that is ordered in relevance; and wherein determining to merge sort is based on a relevancy of the search criteria; and wherein the determined scores for each of the identified documents include a document-to-location relevance score, a document-to-text relevance score, and an abstract quality score; and combining the document-to-location relevance scores, the document-to-text, and the abstract quality score to generate a combined relevance score for the identified document. 14. An apparatus of claim 10 , wherein each document of the first set of documents or the second set of documents: contains anywhere within the document location-related information that identifies a location within the domain; and contains anywhere within the document information that is responsive to the free text entry query, wherein said identified documents are identified by a plurality of document identifiers.
| 0.5 |
8,478,699 | 12 | 13 |
12. The system of claim 11 , further comprising: determining a distributional similarity score between the first query and each second query, the determination of the distributional similarity score between the first query and a second query being based on a comparison of first frequencies of terms that co-occur in text with terms of the first query and second frequencies of terms that co-occur in text with terms of the second query, wherein the similarity score for the first query and each second query is based on the distributional similarity score between the first query and the second query and the temporal correlation score between the first query and the second query, wherein the similarity score is computed according to a trained linear model.
|
12. The system of claim 11 , further comprising: determining a distributional similarity score between the first query and each second query, the determination of the distributional similarity score between the first query and a second query being based on a comparison of first frequencies of terms that co-occur in text with terms of the first query and second frequencies of terms that co-occur in text with terms of the second query, wherein the similarity score for the first query and each second query is based on the distributional similarity score between the first query and the second query and the temporal correlation score between the first query and the second query, wherein the similarity score is computed according to a trained linear model. 13. The system of claim 12 , wherein the operations further comprise: training the linear model based on annotated queries using a machine learning process.
| 0.950445 |
8,381,148 | 25 | 29 |
25. A computer program product for determining a deadlock condition in a circuit, the computer program product comprising a non-transitory computer-readable storage medium containing computer program code for: receiving a circuit design corresponding to the circuit, the circuit design comprising multiple subsystems that includes a plurality of ports; receiving a data-transport related property; analyzing data flow through the circuit design based on the data-transport property; responsive to analyzing the data flow through the circuit design, generating a helper assertion, wherein the helper assertion captures how the data flow through the circuit design; and checking for an absence of the data-transport related property within the circuit in conjunction with the helper assertion.
|
25. A computer program product for determining a deadlock condition in a circuit, the computer program product comprising a non-transitory computer-readable storage medium containing computer program code for: receiving a circuit design corresponding to the circuit, the circuit design comprising multiple subsystems that includes a plurality of ports; receiving a data-transport related property; analyzing data flow through the circuit design based on the data-transport property; responsive to analyzing the data flow through the circuit design, generating a helper assertion, wherein the helper assertion captures how the data flow through the circuit design; and checking for an absence of the data-transport related property within the circuit in conjunction with the helper assertion. 29. The computer program product of claim 25 , wherein analyzing data flow through the circuit design based on the data-transport property further comprises: receiving constraints to keep a subset of ports idle; and identifying illegal route information through payloads and trackers.
| 0.764901 |
9,946,770 | 1 | 2 |
1. A method for searching key words, comprising: obtaining, by a terminal device, a key word typed in a search box; sending, by the terminal device, a search request based on the obtained key word; obtaining, by the terminal device, a first set of directly associated words of the key word from a keyword database based on a matching between the search request and the keyword database, and obtaining a summary extracted from search results queried using the first set of directly associated words; obtaining, by the terminal device, a second set of indirectly associated words of the key word; displaying, by the terminal device as a list, the first set of directly associated words and the second set of indirectly associated words along with but below the first set of directly associated words in the search box; upon displaying the list, triggering a time measurement by the terminal device to acquire a user dwell time on the displayed first set of associated words; monitoring and determining that the user dwell time on the displayed directly associated words has reached a predetermined threshold user dwell time; and displaying, by the terminal device upon determining that the user dwell time has reached the predetermined threshold user dwell time, the summary extracted from the search results along with the displayed first set of associated words.
|
1. A method for searching key words, comprising: obtaining, by a terminal device, a key word typed in a search box; sending, by the terminal device, a search request based on the obtained key word; obtaining, by the terminal device, a first set of directly associated words of the key word from a keyword database based on a matching between the search request and the keyword database, and obtaining a summary extracted from search results queried using the first set of directly associated words; obtaining, by the terminal device, a second set of indirectly associated words of the key word; displaying, by the terminal device as a list, the first set of directly associated words and the second set of indirectly associated words along with but below the first set of directly associated words in the search box; upon displaying the list, triggering a time measurement by the terminal device to acquire a user dwell time on the displayed first set of associated words; monitoring and determining that the user dwell time on the displayed directly associated words has reached a predetermined threshold user dwell time; and displaying, by the terminal device upon determining that the user dwell time has reached the predetermined threshold user dwell time, the summary extracted from the search results along with the displayed first set of associated words. 2. The method of claim 1 , wherein the first set of directly associated words of the key word comprise word groups in the keyword database having at least one word matching the key word.
| 0.701923 |
8,671,417 | 1 | 4 |
1. A method of developing a web application, comprising: exposing an interface for a scripting language-based framework; receiving, via the interface, a call that manages a control included in the scripting language-based framework, wherein the call is provided by an application that references the scripting language-based framework; generating a user interface based on the control as managed by the call; and accessing backend cloud-based services provided by a distributed data store on a cloud platform based on the control as managed by the call.
|
1. A method of developing a web application, comprising: exposing an interface for a scripting language-based framework; receiving, via the interface, a call that manages a control included in the scripting language-based framework, wherein the call is provided by an application that references the scripting language-based framework; generating a user interface based on the control as managed by the call; and accessing backend cloud-based services provided by a distributed data store on a cloud platform based on the control as managed by the call. 4. The method of claim 1 , wherein the control is pre-programmed within the scripting language-based framework to access the backend cloud-based services provided by the distributed data store on the cloud platform.
| 0.839312 |
7,519,588 | 26 | 27 |
26. An article of manufacture comprising: a storage medium; and a plurality of programming instructions designed to program an apparatus and enable the apparatus to receive a collection of documents and/or objects determined by a first process to be relevant to a keyword, wherein the first process comprises searching a multiplicity of documents and/or objects; and process the collection of documents and/or objects to extract one or more keyword characterizations from within at least one of the documents and/or objects of the first collection, the one or more keyword characterizations to be used as proxies for the keyword in a second process, wherein the second process comprises searching a multiplicity of documents and/or objects; wherein process comprises generation of a spectrum of n-grams to characterize the one or more keywords, where n is an integer equal to or greater than 1.
|
26. An article of manufacture comprising: a storage medium; and a plurality of programming instructions designed to program an apparatus and enable the apparatus to receive a collection of documents and/or objects determined by a first process to be relevant to a keyword, wherein the first process comprises searching a multiplicity of documents and/or objects; and process the collection of documents and/or objects to extract one or more keyword characterizations from within at least one of the documents and/or objects of the first collection, the one or more keyword characterizations to be used as proxies for the keyword in a second process, wherein the second process comprises searching a multiplicity of documents and/or objects; wherein process comprises generation of a spectrum of n-grams to characterize the one or more keywords, where n is an integer equal to or greater than 1. 27. The article of claim 26 , wherein the collection of documents and/or objects comprise at least one of: web pages determined to be potentially relevant to the keyword, documents from an electronic information corpus, and data objects including at least one of images, video files, audio files, executable applications, and abstractions of physical objects.
| 0.801876 |
9,824,149 | 16 | 20 |
16. A system, comprising: means for determining a set of one or more use cases based, at least in part, upon a search query, wherein each use case is associated with a set of query patterns that trigger the use case, wherein determining a set of one or more use cases based, at least in part, upon the search query includes: ascertaining one or more query patterns based, at least in part, upon the search query; and identifying at least a subset of use cases associated with the query patterns; means for identifying a set of one or more search results based, at least in part, upon the search query, wherein identifying the set of search results includes identifying, for each query pattern-use case pair, a set of documents; means for obtaining information that answers the search query for at least one of the set of use cases, the information being derived from at least a subset of the set of search results; and means for providing an indication of at least a portion of the information.
|
16. A system, comprising: means for determining a set of one or more use cases based, at least in part, upon a search query, wherein each use case is associated with a set of query patterns that trigger the use case, wherein determining a set of one or more use cases based, at least in part, upon the search query includes: ascertaining one or more query patterns based, at least in part, upon the search query; and identifying at least a subset of use cases associated with the query patterns; means for identifying a set of one or more search results based, at least in part, upon the search query, wherein identifying the set of search results includes identifying, for each query pattern-use case pair, a set of documents; means for obtaining information that answers the search query for at least one of the set of use cases, the information being derived from at least a subset of the set of search results; and means for providing an indication of at least a portion of the information. 20. The system as recited in claim 16 , further comprising: means for ascertaining a search context associated with the search query; wherein at least one of determining a set of one or more use cases or identifying a set of one or more search results is further performed based, at least in part, upon the search context.
| 0.590331 |
6,038,567 | 1 | 3 |
1. A computer-readable medium having computer-executable instructions for performing the steps of: receiving a layout selection command corresponding to a predefined layout for a document; the layout comprising a predefined set of objects, each object having a set of object properties for defining a visible element of the document; each object property having a propagation code associated with an object propagation rule for coordinating that object property with a predefined set of other object properties, wherein the propagation codes and their associated rules are stored within an object propagation rule table; receiving a publication definition command setting an object property definition for a first one of the object properties; using the object propagation code associated with the first object property to retrieve the propagation rule for the first object property from the object propagation rule table; and propagating the object property definition for the first object property to a predefined group of the objects in accordance with the propagation rule for the first object property.
|
1. A computer-readable medium having computer-executable instructions for performing the steps of: receiving a layout selection command corresponding to a predefined layout for a document; the layout comprising a predefined set of objects, each object having a set of object properties for defining a visible element of the document; each object property having a propagation code associated with an object propagation rule for coordinating that object property with a predefined set of other object properties, wherein the propagation codes and their associated rules are stored within an object propagation rule table; receiving a publication definition command setting an object property definition for a first one of the object properties; using the object propagation code associated with the first object property to retrieve the propagation rule for the first object property from the object propagation rule table; and propagating the object property definition for the first object property to a predefined group of the objects in accordance with the propagation rule for the first object property. 3. The computer-readable medium of claim 1, wherein: the layout further comprises a plurality of components, each component comprising a plurality of the objects; each object having an associated identifier; and the propagation rule comprises propagating the object property definition for the first object property to the objects in the same component with the same identifier.
| 0.796336 |
5,384,702 | 18 | 19 |
18. The method of claim 1, wherein a grammar marker of said plurality of grammar markers includes an article insertion and correction marker.
|
18. The method of claim 1, wherein a grammar marker of said plurality of grammar markers includes an article insertion and correction marker. 19. The method of claim 18, wherein said first database includes article "one" correction rules and article "the" correction rules.
| 0.5 |
8,243,116 | 17 | 19 |
17. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computer system with one or more processors, cause the computer system to: receive input video data from a digital camera, the input video data including a first segment of the input video data corresponding to recorded non-verbal behavior of a first participant in a computer mediated communication; generate a first portion of an output stream of video data, wherein generating the first portion of the output stream of video data includes: comparing the recorded non-verbal behavior to a predefined behavioral model, wherein the behavioral model defines behavioral parameters; and in accordance with a determination that the recorded non-verbal behavior is inconsistent with the behavioral model, determining alternative behavior that is consistent with the behavioral model; and including the alternative behavior in the first portion of the output stream of video data in place of behavior representative of the recorded non-verbal behavior in the respective video segment; and transmit the output stream of video data to a second participant in the computer mediated communication.
|
17. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a computer system with one or more processors, cause the computer system to: receive input video data from a digital camera, the input video data including a first segment of the input video data corresponding to recorded non-verbal behavior of a first participant in a computer mediated communication; generate a first portion of an output stream of video data, wherein generating the first portion of the output stream of video data includes: comparing the recorded non-verbal behavior to a predefined behavioral model, wherein the behavioral model defines behavioral parameters; and in accordance with a determination that the recorded non-verbal behavior is inconsistent with the behavioral model, determining alternative behavior that is consistent with the behavioral model; and including the alternative behavior in the first portion of the output stream of video data in place of behavior representative of the recorded non-verbal behavior in the respective video segment; and transmit the output stream of video data to a second participant in the computer mediated communication. 19. The non-transitory computer readable storage medium of claim 17 , wherein, the behavioral parameters include one or more of: direction of gaze while speaking, direction of gaze while listening, direction of gaze while thinking, and duration of gaze in a predefined direction.
| 0.813253 |
8,321,201 | 45 | 46 |
45. The method of claim 44 , wherein gathering switching data from previous queries comprises: identifying possible query phrases from the previous queries; and generating probabilities of switching between query phrases based on patterns observed in the previous queries; wherein the switching probabilities are used to determine whether a switched query phrase will be considered as a candidate synonym for a query phrase.
|
45. The method of claim 44 , wherein gathering switching data from previous queries comprises: identifying possible query phrases from the previous queries; and generating probabilities of switching between query phrases based on patterns observed in the previous queries; wherein the switching probabilities are used to determine whether a switched query phrase will be considered as a candidate synonym for a query phrase. 46. The method of claim 45 , wherein gathering switching data comprises gathering context data for other terms located in proximity to query terms or query phrases in previous queries; and wherein generating the probabilities of switching between query phrases comprises using the context data to consider conditional probabilities.
| 0.5 |
7,970,598 | 18 | 22 |
18. A computer-implemented method comprising: establishing a plurality of conference areas, wherein each conference area supports a language, said plurality of conference areas managed by a conference manager server system; connecting a first plurality of computer users to a first conference area, said first conference area supporting a first language; connecting a second plurality of computer users to a second conference area, said second conference area supporting a second language; electronically receiving, at said conference manager server system, text communications in said first language, said text communications originating from spoken communications by computer users currently connected to said first conference area; automatically translating, at said conference manager server system, said text communications in said first language to translated text communications in said second language; and electronically broadcasting said translated text communications to said second conference area.
|
18. A computer-implemented method comprising: establishing a plurality of conference areas, wherein each conference area supports a language, said plurality of conference areas managed by a conference manager server system; connecting a first plurality of computer users to a first conference area, said first conference area supporting a first language; connecting a second plurality of computer users to a second conference area, said second conference area supporting a second language; electronically receiving, at said conference manager server system, text communications in said first language, said text communications originating from spoken communications by computer users currently connected to said first conference area; automatically translating, at said conference manager server system, said text communications in said first language to translated text communications in said second language; and electronically broadcasting said translated text communications to said second conference area. 22. The method of claim 18 wherein said first language is one of English, German, or French.
| 0.75 |
9,251,142 | 1 | 9 |
1. A communication device comprising: a language input device configured to detect a first language signal associated with a first language; and a recognition and interpretation engine coupled with the language input device and configured to: obtain the first language signal from the language input device; generate a first recognition result set from the first language signal according to at least one of a grammar and statistical language model of the first language, said language model comprising a mobile interference model; generate an improved recognition result set from the first recognition result set by rescoring the first recognition result set according to a domain-specific language model; generate at least one interpretation result from the improved recognition results set; map the at least one interpretation result to a second language representation of a second language; and cause an output device to present an output interpretation according to the second language derived from the second language representation.
|
1. A communication device comprising: a language input device configured to detect a first language signal associated with a first language; and a recognition and interpretation engine coupled with the language input device and configured to: obtain the first language signal from the language input device; generate a first recognition result set from the first language signal according to at least one of a grammar and statistical language model of the first language, said language model comprising a mobile interference model; generate an improved recognition result set from the first recognition result set by rescoring the first recognition result set according to a domain-specific language model; generate at least one interpretation result from the improved recognition results set; map the at least one interpretation result to a second language representation of a second language; and cause an output device to present an output interpretation according to the second language derived from the second language representation. 9. The device of claim 1 , further comprising a server that includes the language input device and recognition and interpretation engine.
| 0.665854 |
6,101,461 | 3 | 6 |
3. A command inputting method used when inputting characters using software for Kana (Japanese character)-to-Chinese character conversion comprising the steps of: receiving a string comprising a plurality of characters through a keyboard; retrieving first Chinese character information or second Chinese character information corresponding to the character string by looking up the string in a Chinese character dictionary in which the first Chinese character information, comprising at least one Chinese character correlated to a character string, and the second Chinese character information, comprising a command and at least one Chinese character correlated to a character string, are previously stored; displaying the retrieved first Chinese character information or second Chinese character information as candidates for conversion in a list; receiving input for selecting a desired Chinese character or a command from the first Chinese character information or second Chinese character information displayed in a list; determining which of a Chinese character or a command has been selected or not according to a result of selection in said selecting step; replacing, when it is determined in said determining step that a Chinese character has been selected, the string with at least one corresponding Chinese character and displaying the at least one Chinese character; and executing the corresponding command when it is determined in said determining step that a command has been selected.
|
3. A command inputting method used when inputting characters using software for Kana (Japanese character)-to-Chinese character conversion comprising the steps of: receiving a string comprising a plurality of characters through a keyboard; retrieving first Chinese character information or second Chinese character information corresponding to the character string by looking up the string in a Chinese character dictionary in which the first Chinese character information, comprising at least one Chinese character correlated to a character string, and the second Chinese character information, comprising a command and at least one Chinese character correlated to a character string, are previously stored; displaying the retrieved first Chinese character information or second Chinese character information as candidates for conversion in a list; receiving input for selecting a desired Chinese character or a command from the first Chinese character information or second Chinese character information displayed in a list; determining which of a Chinese character or a command has been selected or not according to a result of selection in said selecting step; replacing, when it is determined in said determining step that a Chinese character has been selected, the string with at least one corresponding Chinese character and displaying the at least one Chinese character; and executing the corresponding command when it is determined in said determining step that a command has been selected. 6. A command inputting method used when inputting characters using software for Kana-to-Chinese character conversion according to claim 3 further comprising the steps of: generating second Chinese character information that specifies a series of processing steps for the first Chinese character information in said Chinese character dictionary; and changing a command for the second Chinese character information in said Chinese character dictionary to a macro command.
| 0.5 |
7,881,924 | 3 | 5 |
3. A method in accordance with claim 2 wherein: processing the text with the computer comprises identifying categories of information therein; and further comprising quantifying information in each of the categories and determining the psychological state of the person from the quantified information.
|
3. A method in accordance with claim 2 wherein: processing the text with the computer comprises identifying categories of information therein; and further comprising quantifying information in each of the categories and determining the psychological state of the person from the quantified information. 5. A method in accordance with claim 3 wherein: the at least one communication is collected by an organization to which the person affiliated; and the output communication is present on a system of organization.
| 0.851617 |
8,290,977 | 19 | 21 |
19. The method of claim 18 , wherein said aggregating step includes using a state transition mechanism for synchronization of aggregation boundaries.
|
19. The method of claim 18 , wherein said aggregating step includes using a state transition mechanism for synchronization of aggregation boundaries. 21. The method of claim 19 , wherein said state transition mechanism synchronizes nodes without associated values.
| 0.577778 |
9,418,155 | 14 | 15 |
14. A computerized system comprising: one or more processors; and a non-transitory computer storage media storing computer-useable instructions that, when used by the one or more processors, cause the one or more processors to: receive a search query from a user input via an interconnected computing network of the computing system; identify an ambiguous term in the search query by utilizing lists of categories from semi-structured data containing the ambiguous term; infer categories of the ambiguous term via extraction on the semi-structured data; for each of the categories inferred for the ambiguous term, compute an amount of network traffic, wherein computing includes calculating a number of webpage views representing each category and a dwell time for each of the webpage views; compute a total amount of network traffic to all of the webpages representing the categories inferred; determine a probability for each category of the ambiguous term based on the amount of network traffic computed for each of the categories and the total amount of network traffic computed for all categories inferred of the ambiguous entity; identify a most probable category of the ambiguous term, wherein the most probable category has a highest probability compared to remaining categories of the ambiguous term; and return search results representing the most probable category of the ambiguous term to a user via a graphical user interface of the computing system based on the probability calculated for each category of the ambiguous term from the amount of network traffic computed for each of the categories and the total amount of network traffic computed for all categories inferred of the ambiguous entity.
|
14. A computerized system comprising: one or more processors; and a non-transitory computer storage media storing computer-useable instructions that, when used by the one or more processors, cause the one or more processors to: receive a search query from a user input via an interconnected computing network of the computing system; identify an ambiguous term in the search query by utilizing lists of categories from semi-structured data containing the ambiguous term; infer categories of the ambiguous term via extraction on the semi-structured data; for each of the categories inferred for the ambiguous term, compute an amount of network traffic, wherein computing includes calculating a number of webpage views representing each category and a dwell time for each of the webpage views; compute a total amount of network traffic to all of the webpages representing the categories inferred; determine a probability for each category of the ambiguous term based on the amount of network traffic computed for each of the categories and the total amount of network traffic computed for all categories inferred of the ambiguous entity; identify a most probable category of the ambiguous term, wherein the most probable category has a highest probability compared to remaining categories of the ambiguous term; and return search results representing the most probable category of the ambiguous term to a user via a graphical user interface of the computing system based on the probability calculated for each category of the ambiguous term from the amount of network traffic computed for each of the categories and the total amount of network traffic computed for all categories inferred of the ambiguous entity. 15. The system of claim 14 , wherein the semi-structure data containing the ambiguous term includes internal categorized list data and external categorized list data including published traffic data.
| 0.592213 |
9,684,721 | 1 | 15 |
1. A computer-implemented method, comprising: receiving, at one or more computer processors, a user input in an imprecise syntax, wherein: the user input in the imprecise syntax includes at least (i) a word, or a phrase, that corresponds to a formula having a plurality of mathematical or scientific parameters, and (ii) one or more words, and/or one or more phrases, that correspond to one or more parameter values corresponding to the formula, the user input in the imprecise syntax is expressed using natural language and/or informal terminology spoken by a user, and the user input in the imprecise syntax corresponds to a digital representation of an audio signal corresponding to speech spoken by the user, the digital representation of the audio signal corresponding to the speech spoken by the user having been generated by a voice recognition system; analyzing, at the one or more computer processors, the user input in the imprecise syntax to determine the formula with the one or more parameter values integrated into the formula; calculating, at the one or more computer processors, a numerical result using the determined formula with the one or more parameter values integrated into the determined formula; and generating, at the one or more computer processors, an output, using the numerical result, to perform a physical machine action.
|
1. A computer-implemented method, comprising: receiving, at one or more computer processors, a user input in an imprecise syntax, wherein: the user input in the imprecise syntax includes at least (i) a word, or a phrase, that corresponds to a formula having a plurality of mathematical or scientific parameters, and (ii) one or more words, and/or one or more phrases, that correspond to one or more parameter values corresponding to the formula, the user input in the imprecise syntax is expressed using natural language and/or informal terminology spoken by a user, and the user input in the imprecise syntax corresponds to a digital representation of an audio signal corresponding to speech spoken by the user, the digital representation of the audio signal corresponding to the speech spoken by the user having been generated by a voice recognition system; analyzing, at the one or more computer processors, the user input in the imprecise syntax to determine the formula with the one or more parameter values integrated into the formula; calculating, at the one or more computer processors, a numerical result using the determined formula with the one or more parameter values integrated into the determined formula; and generating, at the one or more computer processors, an output, using the numerical result, to perform a physical machine action. 15. The computer-implemented method of claim 1 , wherein generating the output, using the numerical result, to perform the physical machine action further comprises using the numerical result to control a light.
| 0.904178 |
9,639,846 | 1 | 9 |
1. A computer-implemented method comprising: receiving, by a configured computer system, a request for targeted advertising content to be provided to a user along with a page of information, the request including a plurality of words associated with the page; obtaining, by the configured computer system, one or more contextual relationship graphs that represent one or more product categories and include a plurality of nodes corresponding to products within the represented one or more product categories; analyzing, by the configured computer system, the plurality of words and the one or more contextual relationship graphs to identify one or more of the plurality of nodes that are related to the plurality of words, wherein the analyzing is based in part on one or more profile attributes related to the user that include information about a purchase history of the user, and wherein the analyzing is further based on one or more contextual attributes related to the page of information, the one or more contextual attributes including information about prior changes to content of the page of information; receiving click-through-rates of advertising content for each of the plurality of nodes corresponding to the products; filtering at least one of the identified nodes to a filtered set of one or more nodes based on feedback from the click-through-rates being less than a threshold for each of the filtered at least one identified nodes; selecting, by the configured computer system, the targeted advertising content for the received request to reflect one or more products corresponding to the filtered set of one or more nodes; and indicating, by the configured computer system, the selected targeted advertising content to enable the selected targeted advertising content to be provided to the user along with the page of information.
|
1. A computer-implemented method comprising: receiving, by a configured computer system, a request for targeted advertising content to be provided to a user along with a page of information, the request including a plurality of words associated with the page; obtaining, by the configured computer system, one or more contextual relationship graphs that represent one or more product categories and include a plurality of nodes corresponding to products within the represented one or more product categories; analyzing, by the configured computer system, the plurality of words and the one or more contextual relationship graphs to identify one or more of the plurality of nodes that are related to the plurality of words, wherein the analyzing is based in part on one or more profile attributes related to the user that include information about a purchase history of the user, and wherein the analyzing is further based on one or more contextual attributes related to the page of information, the one or more contextual attributes including information about prior changes to content of the page of information; receiving click-through-rates of advertising content for each of the plurality of nodes corresponding to the products; filtering at least one of the identified nodes to a filtered set of one or more nodes based on feedback from the click-through-rates being less than a threshold for each of the filtered at least one identified nodes; selecting, by the configured computer system, the targeted advertising content for the received request to reflect one or more products corresponding to the filtered set of one or more nodes; and indicating, by the configured computer system, the selected targeted advertising content to enable the selected targeted advertising content to be provided to the user along with the page of information. 9. The method of claim 1 wherein the received request further includes the one or more profile attributes related to the user, and wherein the one or more profile attributes further include an IP (Internet Protocol) address associated with the user.
| 0.686398 |
5,423,032 | 1 | 7 |
1. Programmed computer apparatus for extracting a list of candidate multi-word technical terms from an input text file, a multi-word technical term being a string of at least two words having a particular meaning in some technical field, said apparatus comprising: means for storing a stoplist of tokens which are assumed to not occur in multi-word technical terms, a token being a word, character or string of characters delimited by blanks and/or punctuation; means for storing a maximum length parameter specifying a maximum number of tokens in any candidate multi-word technical term to be extracted; means responsive to the stored stoplist for extracting text fragments from an input text file by identifying delimiting tokens in the input text file, including means for identifying as a delimiting token each token in the input text file which is the same as a token in the stored stoplist, the identified delimiting tokens defining text fragments therebetween; means for deriving from the extracted text fragments all possible subsequences of tokens having a length of at least two tokens and not more than a maximum number of tokens specified by the stored maximum length parameter; means for testing each of the derived subsequences against at least one filtering condition; and means for creating a sublist of the derived subsequences which pass the at least one filtering condition, the created sublist being the list of candidate multi-word technical terms.
|
1. Programmed computer apparatus for extracting a list of candidate multi-word technical terms from an input text file, a multi-word technical term being a string of at least two words having a particular meaning in some technical field, said apparatus comprising: means for storing a stoplist of tokens which are assumed to not occur in multi-word technical terms, a token being a word, character or string of characters delimited by blanks and/or punctuation; means for storing a maximum length parameter specifying a maximum number of tokens in any candidate multi-word technical term to be extracted; means responsive to the stored stoplist for extracting text fragments from an input text file by identifying delimiting tokens in the input text file, including means for identifying as a delimiting token each token in the input text file which is the same as a token in the stored stoplist, the identified delimiting tokens defining text fragments therebetween; means for deriving from the extracted text fragments all possible subsequences of tokens having a length of at least two tokens and not more than a maximum number of tokens specified by the stored maximum length parameter; means for testing each of the derived subsequences against at least one filtering condition; and means for creating a sublist of the derived subsequences which pass the at least one filtering condition, the created sublist being the list of candidate multi-word technical terms. 7. Programmed computer apparatus as defined in claim 1 wherein said means for testing comprises: a dictionary of words for identifying potential parts of speech for each word in the dictionary, any word not in said dictionary being considered a potential noun; and means responsive to said dictionary for using as a filtering condition whether a derived subsequence being tested includes a potential noun as a last token.
| 0.5 |
8,112,704 | 9 | 13 |
9. The method of claim 2 further comprising: retrieving the child component from an external database.
|
9. The method of claim 2 further comprising: retrieving the child component from an external database. 13. The method of claim 9 wherein: the database includes a compressed archive file.
| 0.5 |
7,805,710 | 33 | 42 |
33. A computer system, comprising: a target processor; a shared code cache facility; and translator code for translating a subject program code into target code executable on said target processor, said translator code comprising code executable by said target processor to: provide a first translator instance which translates the subject code of a first program into the target code including translating a first portion of the subject code into a portion of the target code; cache said portion of the target code in the shared code cache facility; and provide a second translator instance which translates the subject code of a second program into the target code, wherein the second translator instance is different from the first translator instance and operates simultaneously with the first translator instance, and wherein the second translator instance retrieves the cached portion of the target code from the shared code cache facility upon a compatibility detection between said cached portion of the target code and a second portion of the subject code in the second program, including loading the portion of the target code in the shared code cache facility into a portion of memory which is shared amongst at least the first and second translator instances; and, copying at least one part of the shared code cache facility to a private portion of memory associated with the second translator instance upon modification of the at least one part of the shared code cache facility by the second translator instance.
|
33. A computer system, comprising: a target processor; a shared code cache facility; and translator code for translating a subject program code into target code executable on said target processor, said translator code comprising code executable by said target processor to: provide a first translator instance which translates the subject code of a first program into the target code including translating a first portion of the subject code into a portion of the target code; cache said portion of the target code in the shared code cache facility; and provide a second translator instance which translates the subject code of a second program into the target code, wherein the second translator instance is different from the first translator instance and operates simultaneously with the first translator instance, and wherein the second translator instance retrieves the cached portion of the target code from the shared code cache facility upon a compatibility detection between said cached portion of the target code and a second portion of the subject code in the second program, including loading the portion of the target code in the shared code cache facility into a portion of memory which is shared amongst at least the first and second translator instances; and, copying at least one part of the shared code cache facility to a private portion of memory associated with the second translator instance upon modification of the at least one part of the shared code cache facility by the second translator instance. 42. The computer system combination of claim 33 wherein the portion of target code cached comprises a translation structure including a basic block.
| 0.755776 |
7,502,770 | 27 | 33 |
27. A computer database comprising: a database store for receiving, storing, and allowing access to; a distributed registry for keeping track of where and how said data and associated meta data are stored in said database; means for representing data objects in said database as nodes of a labeled graph, and representing said associated meta data by labeled links connecting said nodes; wherein said nodes represent data of different types and in different formats, including text, image, sound, video, and structured data; a metaweb server which has access to a user's security profile, and access to said distributed registry; wherein said metaweb server obtains a location of data requested by said user, retrieves said data from data servers which themselves maintain rules regarding access to retrieve and update data from said data servers, and assembles said data into coherent data structures; wherein each object is registered in said registry; wherein said registry keeps track of where data and meta data associated with an object are stored; wherein every data object has a unique index which is used to access the registry; wherein said apparatus retrieves said data object from said index by assembling components of data and meta data from various storage devices across a network; and a viewing tool for accessing said data in said database, wherein said viewing tool comprises means for choosing topics that said user wants to learn about, viewing explanations provided to said user as a sequence of presentations, and accepting annotations from said user; said viewing tool further comprising: a module for allowing said user to navigate through links, see patterns in connections, and reorganize information according to multiple navigational schemes; a module for allowing user to see the detailed local information, and also to see how that information fits into a broader global context; and a topic search engine for selecting at least one topic that a user wants to learn about.
|
27. A computer database comprising: a database store for receiving, storing, and allowing access to; a distributed registry for keeping track of where and how said data and associated meta data are stored in said database; means for representing data objects in said database as nodes of a labeled graph, and representing said associated meta data by labeled links connecting said nodes; wherein said nodes represent data of different types and in different formats, including text, image, sound, video, and structured data; a metaweb server which has access to a user's security profile, and access to said distributed registry; wherein said metaweb server obtains a location of data requested by said user, retrieves said data from data servers which themselves maintain rules regarding access to retrieve and update data from said data servers, and assembles said data into coherent data structures; wherein each object is registered in said registry; wherein said registry keeps track of where data and meta data associated with an object are stored; wherein every data object has a unique index which is used to access the registry; wherein said apparatus retrieves said data object from said index by assembling components of data and meta data from various storage devices across a network; and a viewing tool for accessing said data in said database, wherein said viewing tool comprises means for choosing topics that said user wants to learn about, viewing explanations provided to said user as a sequence of presentations, and accepting annotations from said user; said viewing tool further comprising: a module for allowing said user to navigate through links, see patterns in connections, and reorganize information according to multiple navigational schemes; a module for allowing user to see the detailed local information, and also to see how that information fits into a broader global context; and a topic search engine for selecting at least one topic that a user wants to learn about. 33. The apparatus of claim 27 , wherein said registry further comprises: an access process comprising a fast hash and a cryptographically strong signature.
| 0.807214 |
9,483,731 | 6 | 8 |
6. A method comprising: identifying a title and a topical field of a portion of a document in a corpus of data comprising natural language documents, using a computerized device; constructing, by said computerized device, title-oriented documents from said corpus of data, each said title-oriented document comprising said title and said topical field, said topical field comprising a field name and field content associated with said portion of said document in said corpus of data, said field content including at least a portion of text derived from said document; constructing, by said computerized device, a structured knowledge base from said title-oriented documents, said structured knowledge base comprising a relation instance comprising a field identifier for said topical field, a title concept identifier, and a corresponding field content concept identifier; calculating a count for each said relation instance, using said computerized device, based on a number of occurrences of said title concept identifier and said field content concept identifier within a corresponding document in said corpus of data comprising said natural language documents; providing a question to be answered by a Question Answering (QA) system to a processor of said computerized device; said processor analyzing terms in said question and identifying a question content identifier based on previously established question term categories; creating, by said processor, a collection of candidate answers to said question, said collection of candidate answers being created from said structured knowledge base; and generating, by said processor, a score for each candidate answer in said collection of candidate answers by adding each said count from each said relation instance corresponding to each said candidate answer.
|
6. A method comprising: identifying a title and a topical field of a portion of a document in a corpus of data comprising natural language documents, using a computerized device; constructing, by said computerized device, title-oriented documents from said corpus of data, each said title-oriented document comprising said title and said topical field, said topical field comprising a field name and field content associated with said portion of said document in said corpus of data, said field content including at least a portion of text derived from said document; constructing, by said computerized device, a structured knowledge base from said title-oriented documents, said structured knowledge base comprising a relation instance comprising a field identifier for said topical field, a title concept identifier, and a corresponding field content concept identifier; calculating a count for each said relation instance, using said computerized device, based on a number of occurrences of said title concept identifier and said field content concept identifier within a corresponding document in said corpus of data comprising said natural language documents; providing a question to be answered by a Question Answering (QA) system to a processor of said computerized device; said processor analyzing terms in said question and identifying a question content identifier based on previously established question term categories; creating, by said processor, a collection of candidate answers to said question, said collection of candidate answers being created from said structured knowledge base; and generating, by said processor, a score for each candidate answer in said collection of candidate answers by adding each said count from each said relation instance corresponding to each said candidate answer. 8. The method according to claim 6 , said processor analyzing terms in said question further comprising: said processor identifying a type of question; and said processor filtering said candidate answers according to said type of question.
| 0.784685 |
8,312,157 | 12 | 21 |
12. A system for implicitly authenticating a user to access a controlled resource, the system comprising: a user access request receiver configured to receive a request, from a computer device, to access the controlled resource; a selection mechanism configured to select a user behavior model for the user, wherein the user behavior model is derived from historical context data of the user; a determination mechanism configured to determine recent contextual data of the user, wherein the recent contextual data are collected from one or more user devices without prompting the user to perform an action associated with authentication, and wherein the recent contextual data comprise a plurality of data streams which provide a basis for determining whether the user owns the computing device; a behavioral score grader configured to determine a user behavior score which indicates a likelihood that the user owns the computing device, wherein while determining the user behavior score the behavioral score grader is further configured to: observe a recent event that is associated with the user's computing device; calculate a quality measure for the recent event, and a weight associated with a type of the observation; determine that the observed recent event is consistent with the user behavior model; and adjust the user behavior score based on the quality measure and the weight; and an authentication information provision mechanism configured to provide the user behavior score to an access controller of the controlled resource, wherein the access controller is configured to facilitate access to the controlled resource for the user in response to the user behavior score exceeding a predetermined threshold value.
|
12. A system for implicitly authenticating a user to access a controlled resource, the system comprising: a user access request receiver configured to receive a request, from a computer device, to access the controlled resource; a selection mechanism configured to select a user behavior model for the user, wherein the user behavior model is derived from historical context data of the user; a determination mechanism configured to determine recent contextual data of the user, wherein the recent contextual data are collected from one or more user devices without prompting the user to perform an action associated with authentication, and wherein the recent contextual data comprise a plurality of data streams which provide a basis for determining whether the user owns the computing device; a behavioral score grader configured to determine a user behavior score which indicates a likelihood that the user owns the computing device, wherein while determining the user behavior score the behavioral score grader is further configured to: observe a recent event that is associated with the user's computing device; calculate a quality measure for the recent event, and a weight associated with a type of the observation; determine that the observed recent event is consistent with the user behavior model; and adjust the user behavior score based on the quality measure and the weight; and an authentication information provision mechanism configured to provide the user behavior score to an access controller of the controlled resource, wherein the access controller is configured to facilitate access to the controlled resource for the user in response to the user behavior score exceeding a predetermined threshold value. 21. The system of claim 12 , further comprising a model-deriving mechanism configured to derive the user behavior model from a second user behavior model of a group of users sharing similar characteristics.
| 0.818021 |
9,471,560 | 1 | 5 |
1. A method comprising: receiving a sequence of keyboard events representing keystrokes input to a virtual keyboard of a device; traversing a hierarchical data structure according to the sequence of keyboard events to determine candidate words; constructing a word lattice based on a language model, including deriving path weights from candidate word statistics and keyboard error model data, wherein deriving the path weights is based on a function having one or more first parameters including the candidate word statistics and one or more second parameters including the keyboard error model data; searching the word lattice for N best paths, where N is a positive integer; determining one or more candidate sentences comprising candidate words based on the N best paths; and presenting the candidate sentences on a user interface component of the device, where the method is performed by one or more hardware processors of the device.
|
1. A method comprising: receiving a sequence of keyboard events representing keystrokes input to a virtual keyboard of a device; traversing a hierarchical data structure according to the sequence of keyboard events to determine candidate words; constructing a word lattice based on a language model, including deriving path weights from candidate word statistics and keyboard error model data, wherein deriving the path weights is based on a function having one or more first parameters including the candidate word statistics and one or more second parameters including the keyboard error model data; searching the word lattice for N best paths, where N is a positive integer; determining one or more candidate sentences comprising candidate words based on the N best paths; and presenting the candidate sentences on a user interface component of the device, where the method is performed by one or more hardware processors of the device. 5. The method of claim 1 , further comprising: pruning paths in the word lattice based on the path weights.
| 0.623239 |
9,129,020 | 1 | 5 |
1. A computer-implemented method for responding to a search query from a user, the method comprising: receiving a search query from a requesting computer user, the search query being directed to a query topic; obtaining a set of search results responsive to the search query; and determining whether the requesting computer has an interest circle corresponding to the query topic and, upon determining the condition that the requesting computer user does not have an interest circle corresponding to the query topic: identifying a plurality of computer users, each of the plurality of computer users having an established interest circle corresponding to the query topic, wherein identifying the plurality of computer users comprises identifying the plurality of computer users irrespective of any user-established relationship with the requesting computer user; ordering the set of search results according to the interest circles of the identified plurality of computer users; and returning higher ordered search results to the requesting computer user.
|
1. A computer-implemented method for responding to a search query from a user, the method comprising: receiving a search query from a requesting computer user, the search query being directed to a query topic; obtaining a set of search results responsive to the search query; and determining whether the requesting computer has an interest circle corresponding to the query topic and, upon determining the condition that the requesting computer user does not have an interest circle corresponding to the query topic: identifying a plurality of computer users, each of the plurality of computer users having an established interest circle corresponding to the query topic, wherein identifying the plurality of computer users comprises identifying the plurality of computer users irrespective of any user-established relationship with the requesting computer user; ordering the set of search results according to the interest circles of the identified plurality of computer users; and returning higher ordered search results to the requesting computer user. 5. The computer-implemented method of claim 1 , wherein ordering the set of search results comprises ordering the set of search results according to the interest circles of the identified plurality of computer users and according to an interest circle of the requesting computer user corresponding to the query topic.
| 0.739737 |
7,921,067 | 1 | 13 |
1. A method for mood detection using a mood detection device having a processor comprising: receiving audio data; assigning a user to a predetermined group of users; determining, using the mood detection device, a mood for said audio data based on at least one mood model, wherein said determining includes determining or receiving a union mood model, which corresponds to a mood model for said predetermined group of users, and using said union mood model as mood model for determining said mood; communicating the determined mood to the user; thereafter, receiving user feedback of the user for said determined mood, said user feedback being on a gradual scale and indicative as to whether said determined mood corresponds to a perceived mood of said user for said audio data; and adapting said mood model based on said user feedback.
|
1. A method for mood detection using a mood detection device having a processor comprising: receiving audio data; assigning a user to a predetermined group of users; determining, using the mood detection device, a mood for said audio data based on at least one mood model, wherein said determining includes determining or receiving a union mood model, which corresponds to a mood model for said predetermined group of users, and using said union mood model as mood model for determining said mood; communicating the determined mood to the user; thereafter, receiving user feedback of the user for said determined mood, said user feedback being on a gradual scale and indicative as to whether said determined mood corresponds to a perceived mood of said user for said audio data; and adapting said mood model based on said user feedback. 13. The method according to claim 1 , further comprising determining or selecting an initial mood model as mood model, said initial mood model corresponding to a mood model of users from a same geographic location and/or having a same ethnic background.
| 0.5 |
7,533,172 | 1 | 17 |
1. A peer-to-peer network system, comprising: a plurality of peers, wherein each peer comprises a network node configured to communicate with one or more other ones of said peers over one or more networks; a plurality of peer services or content provided by one or more of said peers; a service or content advertisement for each of said services or content, wherein each service or content advertisement comprises an identification of a corresponding service or content and an indication of how to access the corresponding service or content; a peer advertisement for each of said peers, wherein each peer advertisement comprises an identification of a corresponding one of said peers and communication address for the corresponding one of said peers, wherein one or more of said peer advertisements further comprises an indication of a service or a content provided by the peer corresponding to that peer advertisement; wherein one or more of said peers are configured to publish their corresponding peer advertisements and one or more of said service or content advertisements in the peer-to-peer network system to be discoverable by other peers; and wherein each advertisement is a separate programming language independent metadata document.
|
1. A peer-to-peer network system, comprising: a plurality of peers, wherein each peer comprises a network node configured to communicate with one or more other ones of said peers over one or more networks; a plurality of peer services or content provided by one or more of said peers; a service or content advertisement for each of said services or content, wherein each service or content advertisement comprises an identification of a corresponding service or content and an indication of how to access the corresponding service or content; a peer advertisement for each of said peers, wherein each peer advertisement comprises an identification of a corresponding one of said peers and communication address for the corresponding one of said peers, wherein one or more of said peer advertisements further comprises an indication of a service or a content provided by the peer corresponding to that peer advertisement; wherein one or more of said peers are configured to publish their corresponding peer advertisements and one or more of said service or content advertisements in the peer-to-peer network system to be discoverable by other peers; and wherein each advertisement is a separate programming language independent metadata document. 17. The peer-to-peer network system as recited in claim 1 , wherein one or more of said peer advertisements comprises a security credential for authenticating the corresponding peer.
| 0.829588 |
9,632,997 | 6 | 7 |
6. The system according to claim 1 , further comprising a parser component executable by the at least one processor and configured to generate the plurality of elements by executing at least one parse of the transcription information.
|
6. The system according to claim 1 , further comprising a parser component executable by the at least one processor and configured to generate the plurality of elements by executing at least one parse of the transcription information. 7. The system according to claim 6 , wherein the predetermined criteria includes a criterion specifying that elements including more complex grammatical structures be identified over elements including less complex grammatical structures.
| 0.5 |
8,156,508 | 12 | 13 |
12. The non-transitory computer-accessible memory medium of claim 11 , wherein said resolving comprises sending a message to a source indicated in the frame description, if the parameter value is not defined in a current process environment.
|
12. The non-transitory computer-accessible memory medium of claim 11 , wherein said resolving comprises sending a message to a source indicated in the frame description, if the parameter value is not defined in a current process environment. 13. The non-transitory computer-accessible memory medium of claim 12 , wherein the message comprises a value type and a role of the required value, the role reflecting the relation of the parameter to other data of the process environment.
| 0.5 |
9,665,588 | 4 | 7 |
4. The system of claim 1 , wherein the actions further comprise conditionally generating an alert of the change based at least on the imported metadata matching the query.
|
4. The system of claim 1 , wherein the actions further comprise conditionally generating an alert of the change based at least on the imported metadata matching the query. 7. The system of claim 4 , wherein the alert is a visual alert.
| 0.784247 |
9,477,747 | 10 | 11 |
10. A non-transitory computer-readable storage medium storing instructions thereon for execution by one or more processors, the instructions comprising: acquiring a first word set from community data within a period; selecting words from the first word set according to a frequency that each word of the first word set appears in the community data during a first group of days, determining the selected words as hot words and forming the selected words into a second word set, wherein the first group of days are a plurality of days backward from a designated day; and selecting topics from a community topic set according to the second word set, and determining the selected topics as hot topics, wherein the selecting words from the first word set according to a frequency that each word of the first word set appears in the community data during a first group of days, determining the selected words as hot words and forming the selected words into a second word set, comprises: calculating a first ratio of a word contained in the first word set according to a frequency that the word appears in the community data within a first period of time during the designated day and a frequency that the word appears in the community data within the first periods of time during a second group of days, wherein the second group of days are selected from the first group of days and does not comprise the designated day; calculating a second ratio of the word contained in the first word set according to a frequency that the word appears in the community data within the designated day and a frequency that the word appears in the community data within a third group of days, wherein the third group of days are selected from the first group of days and consists of days which are of the same day of a week as the designated day, and wherein the third group of days does not comprise the designated day; calculating a third ratio of the word contained in the first word set according to the frequency that the word appears in the community data within the designated day and a frequency that the word appears within a fourth group of days, wherein the fourth group of days are selected from the first group of days and does not comprise the designated day; calculating a hot degree of the word contained in the first word set according to the first ratio, the second ratio and the third ratio of the word; and determining words with top hot degrees in the first word set as hot words and forming the hot words into the second word set, wherein the number of the words with top hot degrees in the first word set is equal to a first preset threshold, or determining words with hot degrees greater than a first preset hot degree as hot words and forming said hot words into the second word set.
|
10. A non-transitory computer-readable storage medium storing instructions thereon for execution by one or more processors, the instructions comprising: acquiring a first word set from community data within a period; selecting words from the first word set according to a frequency that each word of the first word set appears in the community data during a first group of days, determining the selected words as hot words and forming the selected words into a second word set, wherein the first group of days are a plurality of days backward from a designated day; and selecting topics from a community topic set according to the second word set, and determining the selected topics as hot topics, wherein the selecting words from the first word set according to a frequency that each word of the first word set appears in the community data during a first group of days, determining the selected words as hot words and forming the selected words into a second word set, comprises: calculating a first ratio of a word contained in the first word set according to a frequency that the word appears in the community data within a first period of time during the designated day and a frequency that the word appears in the community data within the first periods of time during a second group of days, wherein the second group of days are selected from the first group of days and does not comprise the designated day; calculating a second ratio of the word contained in the first word set according to a frequency that the word appears in the community data within the designated day and a frequency that the word appears in the community data within a third group of days, wherein the third group of days are selected from the first group of days and consists of days which are of the same day of a week as the designated day, and wherein the third group of days does not comprise the designated day; calculating a third ratio of the word contained in the first word set according to the frequency that the word appears in the community data within the designated day and a frequency that the word appears within a fourth group of days, wherein the fourth group of days are selected from the first group of days and does not comprise the designated day; calculating a hot degree of the word contained in the first word set according to the first ratio, the second ratio and the third ratio of the word; and determining words with top hot degrees in the first word set as hot words and forming the hot words into the second word set, wherein the number of the words with top hot degrees in the first word set is equal to a first preset threshold, or determining words with hot degrees greater than a first preset hot degree as hot words and forming said hot words into the second word set. 11. The non-transitory computer-readable storage medium according to claim 10 , wherein the acquiring a first word set from community data within a period comprises: acquiring the community data periodically to get community data within a period; performing word segmentation on the community data within the period to get words contained in the community data within the period, these words forming a third word set; and excluding a group of preset unwanted words from the third word set to obtain the first word set.
| 0.727081 |
8,032,518 | 13 | 18 |
13. A computer system comprising: memory; one or more processors; and at least one program stored in the memory and executed by the one or more processors, the at least one program including: web crawl control instructions for controlling crawling of each website of a multiplicity of websites, each website having a corresponding current crawl rate limit, the web crawl control instructions including: instructions for crawling a respective website of the multiplicity of websites, in accordance with the current crawl rate limit corresponding to the respective website, to download documents from the respective website for inclusion in a database; instructions for storing crawl data associated with the crawling of the respective website; and instructions for providing, for display, a crawl rate control mechanism to a respective owner of the respective website, including providing, for display to the respective owner, at least a portion of the crawl data, and enabling selection, by the respective owner, of a new crawl rate limit corresponding to the respective website.
|
13. A computer system comprising: memory; one or more processors; and at least one program stored in the memory and executed by the one or more processors, the at least one program including: web crawl control instructions for controlling crawling of each website of a multiplicity of websites, each website having a corresponding current crawl rate limit, the web crawl control instructions including: instructions for crawling a respective website of the multiplicity of websites, in accordance with the current crawl rate limit corresponding to the respective website, to download documents from the respective website for inclusion in a database; instructions for storing crawl data associated with the crawling of the respective website; and instructions for providing, for display, a crawl rate control mechanism to a respective owner of the respective website, including providing, for display to the respective owner, at least a portion of the crawl data, and enabling selection, by the respective owner, of a new crawl rate limit corresponding to the respective website. 18. The computer system of claim 13 , the web crawl control instructions further comprising: instructions for decreasing the current crawl rate in response to a request to decrease the current crawl rate for crawling the respective website.
| 0.784946 |
9,472,186 | 9 | 10 |
9. The method of claim 1 further comprising the step of displaying the plurality of audio-text pairs prior to transmitting the plurality of audio-text pairs to the speech to text engine for training.
|
9. The method of claim 1 further comprising the step of displaying the plurality of audio-text pairs prior to transmitting the plurality of audio-text pairs to the speech to text engine for training. 10. The method of claim 9 further comprising editing the text of at least one of the plurality of audio-text pairs.
| 0.697368 |
8,498,859 | 10 | 12 |
10. The system according to claim 1 , wherein a meaning of said linguistically provided information, which is possible in the current situation context, is subjected to a risk analysis by an expertise module, wherein the expertise module compares the reconstructed meaning of said linguistically provided information with expert knowledge contained in a expert knowledge module, which is part of the knowledge base, by using an appropriate comparison routine.
|
10. The system according to claim 1 , wherein a meaning of said linguistically provided information, which is possible in the current situation context, is subjected to a risk analysis by an expertise module, wherein the expertise module compares the reconstructed meaning of said linguistically provided information with expert knowledge contained in a expert knowledge module, which is part of the knowledge base, by using an appropriate comparison routine. 12. The system according to claim 10 , wherein: the expertise module first transmits a request code to the artificial language intelligence, the request code containing at least information regarding the expertise module, the extracted concept categories to be processed and the expert knowledge module; the artificial language intelligence subsequently processes the request code, thereby selecting a cognitive comparison routine from the pool of cognitive routines, said cognitive comparison routine determined by the combination of information contained in the request code, extracts information from the expert knowledge module in consideration of the extracted concept categories to be processed, and transmits the cognitive comparison routine and the information extracted from the expert knowledge module to the expertise module; and the expertise module compares the reconstructed meaning of said linguistically provided information with said information extracted from the expert knowledge module in consideration of said cognitive comparison routine.
| 0.5 |
8,533,621 | 18 | 19 |
18. A means for using a graphical display for communication based on character recognition between a sender and a receiver, wherein said graphical display is configured from a set of characters associated with a predetermined language and said graphical display enables expeditious discovery of said sender-selected character by said receiver, said graphical display comprising: a plurality of distinct quadrants, wherein said plurality of distinct quadrants each having an array of coordinate locations, wherein each said coordinate location possesses a location value based on the effort required to reach each said coordinate location when said receiver utilizes a top-left based scanning routine, and each said coordinate location is populated with a unique character selected from said set of characters, wherein each said unique character possesses a character value substantially derived from a set of character guidelines, wherein said guidelines provides a character ranking system primarily directed to enable early character detection and selection, said character ranking system includes assigning a higher rank to said unique characters having a greater use frequency within said predetermined language, and said coordinate locations with a higher ranked said location value are substantially populated with a corresponding said unique characters having higher ranked said character values, wherein said higher ranked said coordinate locations are substantially populated with the higher ranked said unique characters, comprising: (a) a means for having a communication that can be conveyed using a written language that a sender or receiver wishes to communicate, wherein the communication is comprised of words constructed from a plurality of characters; said communication commences with the identification of a first letter corresponding to a first word; (b) a means for positioning the graphical display such that the display is visible to both the sender and the receiver; (c) a means for initiating a sequential scan of quadrants located on the graphical display, using a top-left based scanning routine performed by the receiver; (d) a means for observing the sender for a selection motion, thereby communicating to the receiver the particular quadrant containing the first letter of the first word of the communication of step(a); (e) a means for initiating sequential scan of characters contained within the selected quadrant in step(d), using a top-left based scanning routine performed by the receiver; and (f) a means for observing the sender for a selection motion, thereby communicating to the receiver the first character of the first word of step(a); and noting the selected first character.
|
18. A means for using a graphical display for communication based on character recognition between a sender and a receiver, wherein said graphical display is configured from a set of characters associated with a predetermined language and said graphical display enables expeditious discovery of said sender-selected character by said receiver, said graphical display comprising: a plurality of distinct quadrants, wherein said plurality of distinct quadrants each having an array of coordinate locations, wherein each said coordinate location possesses a location value based on the effort required to reach each said coordinate location when said receiver utilizes a top-left based scanning routine, and each said coordinate location is populated with a unique character selected from said set of characters, wherein each said unique character possesses a character value substantially derived from a set of character guidelines, wherein said guidelines provides a character ranking system primarily directed to enable early character detection and selection, said character ranking system includes assigning a higher rank to said unique characters having a greater use frequency within said predetermined language, and said coordinate locations with a higher ranked said location value are substantially populated with a corresponding said unique characters having higher ranked said character values, wherein said higher ranked said coordinate locations are substantially populated with the higher ranked said unique characters, comprising: (a) a means for having a communication that can be conveyed using a written language that a sender or receiver wishes to communicate, wherein the communication is comprised of words constructed from a plurality of characters; said communication commences with the identification of a first letter corresponding to a first word; (b) a means for positioning the graphical display such that the display is visible to both the sender and the receiver; (c) a means for initiating a sequential scan of quadrants located on the graphical display, using a top-left based scanning routine performed by the receiver; (d) a means for observing the sender for a selection motion, thereby communicating to the receiver the particular quadrant containing the first letter of the first word of the communication of step(a); (e) a means for initiating sequential scan of characters contained within the selected quadrant in step(d), using a top-left based scanning routine performed by the receiver; and (f) a means for observing the sender for a selection motion, thereby communicating to the receiver the first character of the first word of step(a); and noting the selected first character. 19. The means for claim 18 , wherein said plurality of distinct quadrants includes a first quadrant, a second quadrant, a third quadrant, a fourth quadrant, and a stop button disposed thereon.
| 0.815385 |
7,575,433 | 1 | 9 |
1. A sports skill evaluation system, comprising: an inputting section for inputting, while course selection items displayed on a screen are selected, required data for each of the items regarding a user; a basic database for storing personal basic data of the user including a level, a match experience, an age and a sex inputted through said inputting section; a coefficient table in which application coefficients including level-based coefficients, age-based coefficients and sex-based coefficients are stored in advance; application coefficient calculation means for referring to said coefficient table based on the level, age and sex inputted through said inputting section to determine respective individual application coefficients; skill item point calculation means for calculating, from a score according to a result of a match of the user inputted through said inputting section and the individual application coefficients determined by said application coefficient calculation section, a skill item point for each of skills required for the match; skill diagnosis graph production means for producing diagnosis graphs for the individual skills from the skill item points for the individual skills calculated by said skill item point calculation means; comment pattern designation value calculation means for converting the level, match experience, age and sex inputted through said inputting section into numerical values and calculating comment pattern designation values for the individual skill items based on the numerical values in accordance with a predetermined calculation expression; a comment table in which a plurality of comments to be presented each as a comment to a user are stored such that the comments are classified for the individual skill items and are numbered for the individual comments; and comment extraction means for extracting a comment of a number corresponding to each of the comment pattern designation values calculated by said comment pattern designation value calculation means for each of the skill items from said comment table.
|
1. A sports skill evaluation system, comprising: an inputting section for inputting, while course selection items displayed on a screen are selected, required data for each of the items regarding a user; a basic database for storing personal basic data of the user including a level, a match experience, an age and a sex inputted through said inputting section; a coefficient table in which application coefficients including level-based coefficients, age-based coefficients and sex-based coefficients are stored in advance; application coefficient calculation means for referring to said coefficient table based on the level, age and sex inputted through said inputting section to determine respective individual application coefficients; skill item point calculation means for calculating, from a score according to a result of a match of the user inputted through said inputting section and the individual application coefficients determined by said application coefficient calculation section, a skill item point for each of skills required for the match; skill diagnosis graph production means for producing diagnosis graphs for the individual skills from the skill item points for the individual skills calculated by said skill item point calculation means; comment pattern designation value calculation means for converting the level, match experience, age and sex inputted through said inputting section into numerical values and calculating comment pattern designation values for the individual skill items based on the numerical values in accordance with a predetermined calculation expression; a comment table in which a plurality of comments to be presented each as a comment to a user are stored such that the comments are classified for the individual skill items and are numbered for the individual comments; and comment extraction means for extracting a comment of a number corresponding to each of the comment pattern designation values calculated by said comment pattern designation value calculation means for each of the skill items from said comment table. 9. A sports skill evaluation system according to claim 1 , wherein said inputting section inputs basic user data of the user including the level, match experience, age and sex, contest results and so forth from a storage medium.
| 0.833089 |
8,275,603 | 1 | 5 |
1. A speech translating apparatus comprising: a processor; a memory storing computer-executable instructions for execution by the processor; an input unit that inputs a speech in a first language; a speech recognizing unit that recognizes the speech and generates a first text; a translating unit that translates the first text into a second language and generates a second text; a first dividing unit that divides the first text into one or more first phrases; a second dividing unit that divides the second text into one or more second phrases; an associating unit that associates, as a phrase pair, a second phrase of the one or more second phrases with a first phrase from the one or more first phrases that is semantically equivalent to the second phrase; a storing unit that stores a plurality of associated phrase pairs as a phrase pair set; and an output unit that outputs, from the phrase pair set, the phrase pair of the second phrase and the first phrase associated with the second phrase in the phrase pair according to the order of appearance of the second phrase in the second text, such that the phrase pair is output in a phrase order of the second text; wherein the input unit inputs replacement speech while the output unit is outputting the phrase pair; and the output unit interrupts the output of the phrase pair when the input unit inputs the replacement speech, outputs the replacement speech, and following output of the replacement speech, resumes output of the remaining phrase pairs from the phrase pair set according to the phrase order of the second text.
|
1. A speech translating apparatus comprising: a processor; a memory storing computer-executable instructions for execution by the processor; an input unit that inputs a speech in a first language; a speech recognizing unit that recognizes the speech and generates a first text; a translating unit that translates the first text into a second language and generates a second text; a first dividing unit that divides the first text into one or more first phrases; a second dividing unit that divides the second text into one or more second phrases; an associating unit that associates, as a phrase pair, a second phrase of the one or more second phrases with a first phrase from the one or more first phrases that is semantically equivalent to the second phrase; a storing unit that stores a plurality of associated phrase pairs as a phrase pair set; and an output unit that outputs, from the phrase pair set, the phrase pair of the second phrase and the first phrase associated with the second phrase in the phrase pair according to the order of appearance of the second phrase in the second text, such that the phrase pair is output in a phrase order of the second text; wherein the input unit inputs replacement speech while the output unit is outputting the phrase pair; and the output unit interrupts the output of the phrase pair when the input unit inputs the replacement speech, outputs the replacement speech, and following output of the replacement speech, resumes output of the remaining phrase pairs from the phrase pair set according to the phrase order of the second text. 5. The apparatus according to claim 1 , wherein the associating unit associates each second phrase in the second language with the first phrase in the first language semantically equivalent to the second phrase, and the outputting unit outputs the second phrase in the second language and the first phrase in the first language associated with the second phrase by the associating unit in a phrase order within the second text.
| 0.5 |
9,600,570 | 9 | 12 |
9. One or more non-transitory computer-readable storage media having computer-executable instructions stored thereupon that, when executed by one or more processors, cause the one or more processors to perform acts comprising: finding a keyword in a text; in an event that a text content matching the keyword in the text is found, conducting a match in the found text content, the match comprising at least one of semantically matching the keyword according to a logical operator or matching an attribute of the text with a filtering condition; and in an event that the match is successful, filtering a matched text context, wherein finding the keyword in the text comprises: obtaining a character c1 in the text; using the c1 as a current character and a root node of a tree-type structure as a current node, the root node corresponding to one of a first character or a last character of the keyword; determining whether the current character matches the current node; in an event that the current character matches the current node and the current node has a child node, setting a next character following or preceding the current character to be the current character, setting the child node to be the current node and repeating the determining of whether the current character matches the current node; in an event that the current character does not match the current node and the current node has a sibling node, setting the sibling node to be the current node and repeating the determining of whether the current character matches the current node; in an event that the current character matches the current node and the current node does not have a child node or the current character does not match the current node and the current node does not have a sibling node, connecting a last matched current node to the root node to obtain a matching route; and determining whether the keyword is found in the text based at least in part on whether the matching route includes a successfully matched leaf node of the tree-type structure.
|
9. One or more non-transitory computer-readable storage media having computer-executable instructions stored thereupon that, when executed by one or more processors, cause the one or more processors to perform acts comprising: finding a keyword in a text; in an event that a text content matching the keyword in the text is found, conducting a match in the found text content, the match comprising at least one of semantically matching the keyword according to a logical operator or matching an attribute of the text with a filtering condition; and in an event that the match is successful, filtering a matched text context, wherein finding the keyword in the text comprises: obtaining a character c1 in the text; using the c1 as a current character and a root node of a tree-type structure as a current node, the root node corresponding to one of a first character or a last character of the keyword; determining whether the current character matches the current node; in an event that the current character matches the current node and the current node has a child node, setting a next character following or preceding the current character to be the current character, setting the child node to be the current node and repeating the determining of whether the current character matches the current node; in an event that the current character does not match the current node and the current node has a sibling node, setting the sibling node to be the current node and repeating the determining of whether the current character matches the current node; in an event that the current character matches the current node and the current node does not have a child node or the current character does not match the current node and the current node does not have a sibling node, connecting a last matched current node to the root node to obtain a matching route; and determining whether the keyword is found in the text based at least in part on whether the matching route includes a successfully matched leaf node of the tree-type structure. 12. The one or more non-transitory computer-readable storage media as recited in claim 9 , wherein filtering the matched text context comprises filtering the matched text content according to a filtering action.
| 0.822091 |
9,542,942 | 15 | 16 |
15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: generating, by a computing device, a prompt for confirming whether to designate a particular phrase that is not currently designated as a hotword, as a hotword; receiving, by the computing device, a confirmation that the particular phrase is to be designated as a hotword; in response to receiving the confirmation that the particular term is to be designated as a hotword, processing, by the computing device, an utterance that begins with the particular phrase as a voice command; and triggering, by the computing device, an action to be performed in response to the computing device processing the utterance that begins with the particular phrase as a voice command.
|
15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: generating, by a computing device, a prompt for confirming whether to designate a particular phrase that is not currently designated as a hotword, as a hotword; receiving, by the computing device, a confirmation that the particular phrase is to be designated as a hotword; in response to receiving the confirmation that the particular term is to be designated as a hotword, processing, by the computing device, an utterance that begins with the particular phrase as a voice command; and triggering, by the computing device, an action to be performed in response to the computing device processing the utterance that begins with the particular phrase as a voice command. 16. The medium of claim 15 , wherein a hotword comprises a sequence of one or more words that causes a computing device to process an utterance beginning with the hotword as a voice command.
| 0.696486 |
9,679,259 | 26 | 37 |
26. A method of using a candidate selection system that includes at least a first trained machine learning system, the method comprising: receiving, by at least one processor-based system, a number of heuristic values each indicative of a strength of a respective pairing between two entities, the heuristic values generated by at least one machine learning system trained with at least a first entity and a second entity that are a historically successful pairing, and trained with a plurality of hypothetical alternative pairings between the first entity of the historically successful pairing and other entities of a first set of entities based at least in part on at least one value of each of at least one of a plurality of attributes associated with the second entity and based on at least one loosened constraint of a number of constraints applied to matches between the values of at least one of the attributes associated with the second entity; and executing, by the at least one processor-based system, a candidate selection algorithm which employs the received heuristic values and respective values for each of the plurality of attributes for each of a second set of entities to identify prospective candidates.
|
26. A method of using a candidate selection system that includes at least a first trained machine learning system, the method comprising: receiving, by at least one processor-based system, a number of heuristic values each indicative of a strength of a respective pairing between two entities, the heuristic values generated by at least one machine learning system trained with at least a first entity and a second entity that are a historically successful pairing, and trained with a plurality of hypothetical alternative pairings between the first entity of the historically successful pairing and other entities of a first set of entities based at least in part on at least one value of each of at least one of a plurality of attributes associated with the second entity and based on at least one loosened constraint of a number of constraints applied to matches between the values of at least one of the attributes associated with the second entity; and executing, by the at least one processor-based system, a candidate selection algorithm which employs the received heuristic values and respective values for each of the plurality of attributes for each of a second set of entities to identify prospective candidates. 37. The method of claim 26 wherein the second set of entities is different from the first set of entities.
| 0.886022 |
7,823,119 | 1 | 3 |
1. A method of controlling the operation of a Radio Frequency Identification (RFID) system comprising: on at least one computer, performing the following steps: receiving, from a first user, a plurality of domain level RFID system constraints, wherein the domain level RFID system constraints are applicable across one or more components of the RFID system; translating the plurality of domain level RFID system constraints into RFID system level constraints, wherein the RFID system level constraints are applicable across the RFID system as a whole; and controlling the RFID system using the RFID system level constraints; receiving RFID data and generating an RFID system incident in response to the RFID data; receiving, at a system level, the RFID system incident; forwarding, at the system level, the RFID system incident to a domain level; modifying the domain level RFID system constraints in response to the RFID system incident; and translating the modified domain level RFID system constraints into modified RFID system level constraints to control the RFID system.
|
1. A method of controlling the operation of a Radio Frequency Identification (RFID) system comprising: on at least one computer, performing the following steps: receiving, from a first user, a plurality of domain level RFID system constraints, wherein the domain level RFID system constraints are applicable across one or more components of the RFID system; translating the plurality of domain level RFID system constraints into RFID system level constraints, wherein the RFID system level constraints are applicable across the RFID system as a whole; and controlling the RFID system using the RFID system level constraints; receiving RFID data and generating an RFID system incident in response to the RFID data; receiving, at a system level, the RFID system incident; forwarding, at the system level, the RFID system incident to a domain level; modifying the domain level RFID system constraints in response to the RFID system incident; and translating the modified domain level RFID system constraints into modified RFID system level constraints to control the RFID system. 3. The method of claim 1 wherein translating the plurality of domain level RFID system constraints comprises generating metadata including the RFID system level constraints.
| 0.699653 |
8,935,275 | 48 | 49 |
48. The system according to claim 28 , wherein nodes, information related to each node, connections among nodes, and information related to connections among nodes are presented at the user interface.
|
48. The system according to claim 28 , wherein nodes, information related to each node, connections among nodes, and information related to connections among nodes are presented at the user interface. 49. The system according to claim 48 , wherein said user interface may comprise an explorer, an application, a service, a web site, and external or third-party domains.
| 0.5 |
8,798,986 | 9 | 10 |
9. The method of claim 1 , wherein the executing includes accessing a second computer system through a communications interface.
|
9. The method of claim 1 , wherein the executing includes accessing a second computer system through a communications interface. 10. The method of claim 9 , wherein the communications interface includes a satellite transmission interface.
| 0.5 |
8,606,563 | 10 | 11 |
10. A non-transitory computer-readable medium comprising instructions, which when implemented by one or more processors perform the following operations: construct a text equivalent from an input text, wherein the text equivalent is an alternating sequence of one or more idea distances and one or more ideas; convert the text equivalent by implementing one or more conversion rules, wherein a conversion rule comprising one or more rule specifications; and display on a monitor an audit diagram comprising the text equivalent constructed from the input text, and a conversion representation comprising an operator indicator and a result arrow.
|
10. A non-transitory computer-readable medium comprising instructions, which when implemented by one or more processors perform the following operations: construct a text equivalent from an input text, wherein the text equivalent is an alternating sequence of one or more idea distances and one or more ideas; convert the text equivalent by implementing one or more conversion rules, wherein a conversion rule comprising one or more rule specifications; and display on a monitor an audit diagram comprising the text equivalent constructed from the input text, and a conversion representation comprising an operator indicator and a result arrow. 11. The non-transitory computer-readable medium of claim 10 , wherein an idea comprises one or more strings of text characters.
| 0.62426 |
8,185,589 | 19 | 20 |
19. The method as recited in claim 7 , wherein the act of presenting the retrieved conversation attribute values along with portions of the one or more electronic mail messages comprises an act of presenting one or more attribute values for an electronic mail message included in the electronic mail conversation.
|
19. The method as recited in claim 7 , wherein the act of presenting the retrieved conversation attribute values along with portions of the one or more electronic mail messages comprises an act of presenting one or more attribute values for an electronic mail message included in the electronic mail conversation. 20. The method as recited in claim 19 , wherein the act of presenting one or more attribute values for an electronic mail message included in the electronic mail conversation comprises an act of presenting one or more attribute values selected from among a sent time value, a sender value, a summary value, a link value, and a recipient delta value.
| 0.5 |
8,140,347 | 3 | 7 |
3. The method of claim 1 , further comprising predefining said trading partner profile associated with a predetermined trading entity.
|
3. The method of claim 1 , further comprising predefining said trading partner profile associated with a predetermined trading entity. 7. The method of claim 3 , wherein said trading partner profile comprises partner data, communication protocol data, transaction data, transaction format data, and XML format version data.
| 0.587719 |
8,832,140 | 1 | 19 |
1. A computer implemented method for optimizing results returned from interaction with a collection of information, the method comprising: establishing criteria associated with at least one operation on a collection of information, wherein the criteria is based, at least in part, on a comparison of a measurement of the distinctiveness of a set of results and a distinctiveness score threshold; establishing a rule that comprises the criteria and the at least one operation; determining the set of results from interaction with a collection of information, wherein the set of results comprises a plurality of documents retrieved from the collection of information, and wherein each of the plurality of documents further comprise a unit of storage of digital data; determining, by a computer system, a measurement of distinctiveness for the set of results based on a statistical distribution of at least one identifying characteristic, wherein the distinctiveness of the set of results is measured in relation to the collection of information, and wherein the determining the measurement of distinctiveness comprises: identifying the at least one identifying characteristic within an evaluated set, and determining a measure of distinctiveness of the evaluated set within the collection of information; modifying, by the computer system, the set of results according to the at least one operation by applying the rule to the set of results in response to determining that the set of results matches the criteria based, at least in part, on the comparison of the measurement of distinctiveness for the set of results and the distinctiveness score threshold; and outputting a modified result.
|
1. A computer implemented method for optimizing results returned from interaction with a collection of information, the method comprising: establishing criteria associated with at least one operation on a collection of information, wherein the criteria is based, at least in part, on a comparison of a measurement of the distinctiveness of a set of results and a distinctiveness score threshold; establishing a rule that comprises the criteria and the at least one operation; determining the set of results from interaction with a collection of information, wherein the set of results comprises a plurality of documents retrieved from the collection of information, and wherein each of the plurality of documents further comprise a unit of storage of digital data; determining, by a computer system, a measurement of distinctiveness for the set of results based on a statistical distribution of at least one identifying characteristic, wherein the distinctiveness of the set of results is measured in relation to the collection of information, and wherein the determining the measurement of distinctiveness comprises: identifying the at least one identifying characteristic within an evaluated set, and determining a measure of distinctiveness of the evaluated set within the collection of information; modifying, by the computer system, the set of results according to the at least one operation by applying the rule to the set of results in response to determining that the set of results matches the criteria based, at least in part, on the comparison of the measurement of distinctiveness for the set of results and the distinctiveness score threshold; and outputting a modified result. 19. The method according to claim 1 , further comprising determining a measurement of distinctiveness for at least one set, wherein the measurement of distinctiveness is determined relative to the collection of information.
| 0.773374 |
9,659,001 | 10 | 12 |
10. A system for processing a query with reference to a hierarchical document that includes recursive nodes, comprising: a processor; and storage coupled to the processor, wherein the storage stores a computer program, and wherein the processor is configured to execute the computer program to perform operations, and wherein the operations comprise: receiving the query, wherein the query is formed by one or more paths, and wherein each path includes one or more steps, wherein a query structure represents the query, wherein the query structure includes query nodes, and wherein each of the query nodes includes a next step in a path of the query, a level for a next step instance, a parent step instance identifier of a next step instance, a matched step instance identifier when a match is found, and is flagged with a FOR binding or a LET binding; receiving the hierarchical document including one or more document nodes; identifying one or more query nodes flagged with the FOR binding in the query structure; determining one or more query node combinations that may be in valid step instance ancestor paths for the identified one or more query nodes; and identifying one or more extraction entries containing the determined query node combinations.
|
10. A system for processing a query with reference to a hierarchical document that includes recursive nodes, comprising: a processor; and storage coupled to the processor, wherein the storage stores a computer program, and wherein the processor is configured to execute the computer program to perform operations, and wherein the operations comprise: receiving the query, wherein the query is formed by one or more paths, and wherein each path includes one or more steps, wherein a query structure represents the query, wherein the query structure includes query nodes, and wherein each of the query nodes includes a next step in a path of the query, a level for a next step instance, a parent step instance identifier of a next step instance, a matched step instance identifier when a match is found, and is flagged with a FOR binding or a LET binding; receiving the hierarchical document including one or more document nodes; identifying one or more query nodes flagged with the FOR binding in the query structure; determining one or more query node combinations that may be in valid step instance ancestor paths for the identified one or more query nodes; and identifying one or more extraction entries containing the determined query node combinations. 12. The system of claim 10 , wherein the operations further comprise: generating results using step instance match candidates for each of the identified one or more extraction entries.
| 0.60515 |
8,832,277 | 1 | 4 |
1. A method, comprising: receiving, via a server computing device executing an open overlay service that manages information distribution between multiple social network services and allows users to indicate which identity resources to share with other users, user-submitted ratings for content that users have actively tagged as high value or low value content, wherein the user-submitted ratings are received from different content providers to allow segment information sharing for the content across the different content providers, and wherein a first user has a first identity resource and a second identity resource, and, in response to a sharing indication from the first user, a second user that has knowledge of the first identity resource and does not have knowledge of the second identity resource is allowed to view both the first identity resource and the second identity resource; identifying a start time and an end time for each of a plurality of segments of the content segments in view of the user-submitted ratings; providing data that indicates the start time and the end time of a segment in the plurality of segments in view of the user-submitted ratings to users of the multiple social network services; receiving, from one of the users, locations of external resources relating to the segment in view of the user-submitted ratings, wherein the external resources indicate a website, a person appearing in the segment, an object appearing in the segment, and a place appearing in the segment; and providing the locations and the segment to a shared identity resource of another one of the users of another one of the multiple social network services via a website of the open overlay service, wherein the locations are keyed to an offset time of the segment.
|
1. A method, comprising: receiving, via a server computing device executing an open overlay service that manages information distribution between multiple social network services and allows users to indicate which identity resources to share with other users, user-submitted ratings for content that users have actively tagged as high value or low value content, wherein the user-submitted ratings are received from different content providers to allow segment information sharing for the content across the different content providers, and wherein a first user has a first identity resource and a second identity resource, and, in response to a sharing indication from the first user, a second user that has knowledge of the first identity resource and does not have knowledge of the second identity resource is allowed to view both the first identity resource and the second identity resource; identifying a start time and an end time for each of a plurality of segments of the content segments in view of the user-submitted ratings; providing data that indicates the start time and the end time of a segment in the plurality of segments in view of the user-submitted ratings to users of the multiple social network services; receiving, from one of the users, locations of external resources relating to the segment in view of the user-submitted ratings, wherein the external resources indicate a website, a person appearing in the segment, an object appearing in the segment, and a place appearing in the segment; and providing the locations and the segment to a shared identity resource of another one of the users of another one of the multiple social network services via a website of the open overlay service, wherein the locations are keyed to an offset time of the segment. 4. The method of claim 1 , wherein the identity resources are account names.
| 0.820755 |
9,854,390 | 1 | 2 |
1. An apparatus comprising: a processor circuit; an interface to communicatively couple the processor circuit to a network; and a storage communicatively coupled to the processor circuit and storing a sequence of instructions that when executed by the processor circuit, causes the processor circuit to: operate the interface to receive context data of a scheduled event and an association data comprising identifiers that each uniquely identify a corresponding accepted computing device with which to engage in interactions; operate the interface to receive an identifier from a computing device; compare the identifier to the association data to determine whether the computing device is an accepted computing device; retrieve an aspect of a current context of the apparatus, the aspect of the current context of the apparatus comprising one or more of a current time or a current location of the apparatus; in response to a determination that the computing device is an accepted computing device, compare the aspect to the context data to determine whether an appropriate context exists to share resources and exchange provision of network services with the computing device through the network; and in response to a determination that the appropriate context exists, engage in the interactions with the computing device through the network, the interactions to comprise receipt of an indication of an available network service and a requested network service from the computing device, provision of the requested network service to the computing device from the apparatus based on the indication, and provision of the available network service to the apparatus from the computing device based on the indication.
|
1. An apparatus comprising: a processor circuit; an interface to communicatively couple the processor circuit to a network; and a storage communicatively coupled to the processor circuit and storing a sequence of instructions that when executed by the processor circuit, causes the processor circuit to: operate the interface to receive context data of a scheduled event and an association data comprising identifiers that each uniquely identify a corresponding accepted computing device with which to engage in interactions; operate the interface to receive an identifier from a computing device; compare the identifier to the association data to determine whether the computing device is an accepted computing device; retrieve an aspect of a current context of the apparatus, the aspect of the current context of the apparatus comprising one or more of a current time or a current location of the apparatus; in response to a determination that the computing device is an accepted computing device, compare the aspect to the context data to determine whether an appropriate context exists to share resources and exchange provision of network services with the computing device through the network; and in response to a determination that the appropriate context exists, engage in the interactions with the computing device through the network, the interactions to comprise receipt of an indication of an available network service and a requested network service from the computing device, provision of the requested network service to the computing device from the apparatus based on the indication, and provision of the available network service to the apparatus from the computing device based on the indication. 2. The apparatus of claim 1 , the aspect of the current context comprising a current time, the context data comprising an indication of the scheduled event having a start time, and determining that an appropriate context exists comprising determining that the start time has been reached.
| 0.622047 |
7,660,793 | 37 | 39 |
37. The system of claim 36 wherein the data store comprises a relational database in which at least a portion of the structured data is stored, and wherein the appliance further comprises a second data store in which at least a portion of the unstructured data is stored.
|
37. The system of claim 36 wherein the data store comprises a relational database in which at least a portion of the structured data is stored, and wherein the appliance further comprises a second data store in which at least a portion of the unstructured data is stored. 39. The system of claim 37 further comprising a second relational database in which structured data is stored, wherein the appliance is in communication with the second relational database over a network, and wherein the processor is further configured to (1) selectively apply yet another portion of the received query to the second relational database and (2) identify the subset of unstructured data based on the portions of the query applied to the two relational databases.
| 0.5 |
8,707,247 | 1 | 5 |
1. A system for generating an application, the system comprising: at least one processor; and at least one memory, wherein the at least one processor and the at least one memory are configured to provide functionality comprising: a graphical editor for graphically modeling the application; an application programming interface providing access to at least a class of a templating mechanism, wherein the templating mechanism is configured to create at least one of a template, a domain template, and a graphics template, wherein the template describes a model of the application, the template created by the templating mechanism that creates the domain template based on a domain model of the application and creates the graphic template based on a graphic model of the application, the graphic model and the domain model linked by at least one text string; one or more binders created by the templating mechanism, the one or more binders configured to synchronize the domain template and the graphic template, the synchronization based on a first path expression representative of a first location in the domain template and a second path expression representative of a second location in the graphic template; and a synchronization framework configured to synchronize the domain model with the graphic model by calling and interpreting the template and the one or more binders based on modeling commands received and processed by the graphical editor, wherein the domain model acts as a workflow gateway for data needed by the application and the graphic model represents graphical objects providing a visualization of the workflow.
|
1. A system for generating an application, the system comprising: at least one processor; and at least one memory, wherein the at least one processor and the at least one memory are configured to provide functionality comprising: a graphical editor for graphically modeling the application; an application programming interface providing access to at least a class of a templating mechanism, wherein the templating mechanism is configured to create at least one of a template, a domain template, and a graphics template, wherein the template describes a model of the application, the template created by the templating mechanism that creates the domain template based on a domain model of the application and creates the graphic template based on a graphic model of the application, the graphic model and the domain model linked by at least one text string; one or more binders created by the templating mechanism, the one or more binders configured to synchronize the domain template and the graphic template, the synchronization based on a first path expression representative of a first location in the domain template and a second path expression representative of a second location in the graphic template; and a synchronization framework configured to synchronize the domain model with the graphic model by calling and interpreting the template and the one or more binders based on modeling commands received and processed by the graphical editor, wherein the domain model acts as a workflow gateway for data needed by the application and the graphic model represents graphical objects providing a visualization of the workflow. 5. The system in accordance with claim 1 , wherein at least one of the domain model and graphic model are stored in a model repository, wherein the model repository is structured as a meta-object facility.
| 0.5 |
7,739,117 | 15 | 17 |
15. A computer-readable storage medium for use in a data communications network, the computer-readable storage medium comprising computer instructions for parsing an X+V document to determine a synchronized voice field in a user profile domain, wherein a synchronized voice field refers to a form field that is filled by a synchronization of speech and graphic inputs, and a user profile domain refers to form fields that are to be filled with data corresponding to a user profile; for each determined synchronized voice field, dynamically generating at least one grammar corresponding to the form field at runtime, the at least one grammar being based on a user profile and comprising a semantic interpretation string; and creating an auto-fill event based upon the at least one grammar and responsive to the speech utterance, the auto-fill event causing the filling of the form field with data corresponding to the user profile and comprising at least some data not in the spoken utterance.
|
15. A computer-readable storage medium for use in a data communications network, the computer-readable storage medium comprising computer instructions for parsing an X+V document to determine a synchronized voice field in a user profile domain, wherein a synchronized voice field refers to a form field that is filled by a synchronization of speech and graphic inputs, and a user profile domain refers to form fields that are to be filled with data corresponding to a user profile; for each determined synchronized voice field, dynamically generating at least one grammar corresponding to the form field at runtime, the at least one grammar being based on a user profile and comprising a semantic interpretation string; and creating an auto-fill event based upon the at least one grammar and responsive to the speech utterance, the auto-fill event causing the filling of the form field with data corresponding to the user profile and comprising at least some data not in the spoken utterance. 17. The computer-readable storage medium of claim 15 , wherein the generating instruction comprises a computer instruction for generating at least one grammar defining a form field grammar corresponding to the synchronized voice form field.
| 0.70297 |
9,542,942 | 11 | 12 |
11. The system of claim 8 , wherein generating a prompt for confirming whether to designate a particular phrase that is not currently designated as a hotword, as a hotword is in response to identifying that the particular phrase is not currently designated as a hotword.
|
11. The system of claim 8 , wherein generating a prompt for confirming whether to designate a particular phrase that is not currently designated as a hotword, as a hotword is in response to identifying that the particular phrase is not currently designated as a hotword. 12. The system of claim 11 , wherein identifying that the particular phrase is not currently designated as a hotword comprises: generating a transcription of an utterance of the particular phrase; and determining from the transcription that the particular phrase is not currently designated as a hotword.
| 0.5 |
8,745,140 | 16 | 17 |
16. The computing device of claim 11 wherein the first message handling service is a Short Messaging Service (SMS), wherein the received message is an SMS message, wherein the second message handling service is an e-mail service, wherein the second message type is e-mail, wherein the information element represents an e-mail Subject field and wherein the computer-executable instructions cause the computing device to generate the Subject element from a portion of a payload of the SMS message, the portion comprising a plurality of characters up to a cut-off point within the payload of the SMS message.
|
16. The computing device of claim 11 wherein the first message handling service is a Short Messaging Service (SMS), wherein the received message is an SMS message, wherein the second message handling service is an e-mail service, wherein the second message type is e-mail, wherein the information element represents an e-mail Subject field and wherein the computer-executable instructions cause the computing device to generate the Subject element from a portion of a payload of the SMS message, the portion comprising a plurality of characters up to a cut-off point within the payload of the SMS message. 17. The computing device of claim 16 wherein the cut-off point is one of a first period in the payload, a first exclamation mark in the payload, a first question mark in the payload, or a first comma in the payload.
| 0.5 |
9,959,579 | 13 | 19 |
13. A system comprising: a memory storing computer-executable instructions; and at least one processor, connected with the memory, that executes the computer-readable instructions to perform a method that comprises: accessing information sources for data related to a user of a social network; determining that profile information is missing for classification of the user on the social network; computing, based on the determining that the profile information is missing, candidate expertise summaries for the user based on the information sources and an inferred classification of the user generated from an evaluation of: popularity of the user including communications posted by the user, re-communications by other users of the communications posted by the user and mentions of the user by the other users in the social network; selecting an expertise summary of the user from the candidate expertise summaries; and presenting the expertise summary for viewing by other users of the social network.
|
13. A system comprising: a memory storing computer-executable instructions; and at least one processor, connected with the memory, that executes the computer-readable instructions to perform a method that comprises: accessing information sources for data related to a user of a social network; determining that profile information is missing for classification of the user on the social network; computing, based on the determining that the profile information is missing, candidate expertise summaries for the user based on the information sources and an inferred classification of the user generated from an evaluation of: popularity of the user including communications posted by the user, re-communications by other users of the communications posted by the user and mentions of the user by the other users in the social network; selecting an expertise summary of the user from the candidate expertise summaries; and presenting the expertise summary for viewing by other users of the social network. 19. The system of claim 13 , wherein the selecting selects the expertise summary from the candidate expertise summaries based on an identification of a relationship between a received query and content of the expertise summary.
| 0.570076 |
9,390,164 | 1 | 15 |
1. A method, comprising: in response to a query regarding a relationship among keywords, using one or more web search engines to identify highly ranked web pages related to the keywords and highly ranked ontologies related to the keywords; extracting semantics that are related to the keywords from the highly ranked web pages; combining the highly ranked ontologies and the extracted semantics to form an integrated ontology; identifying relationships that are related to the keywords from the integrated ontology, the identifying relationships comprising: from the integrated ontology, adding one or more formulas that each includes at least one of the keywords as candidate formulas to a candidate pool, and performing an iterative process, comprising: recording any candidate formula that includes all of the keywords as one of the relationships and removing the recorded candidate formula from the candidate pool, for each candidate formula in the candidate pool, determining one or more formulas from the integrated ontology that are relevant to the candidate formula, for each relevant formula, determining an implicit formula implied from the relevant formula and a corresponding candidate formula, and repeating the iterative process; and ranking the identified relationships.
|
1. A method, comprising: in response to a query regarding a relationship among keywords, using one or more web search engines to identify highly ranked web pages related to the keywords and highly ranked ontologies related to the keywords; extracting semantics that are related to the keywords from the highly ranked web pages; combining the highly ranked ontologies and the extracted semantics to form an integrated ontology; identifying relationships that are related to the keywords from the integrated ontology, the identifying relationships comprising: from the integrated ontology, adding one or more formulas that each includes at least one of the keywords as candidate formulas to a candidate pool, and performing an iterative process, comprising: recording any candidate formula that includes all of the keywords as one of the relationships and removing the recorded candidate formula from the candidate pool, for each candidate formula in the candidate pool, determining one or more formulas from the integrated ontology that are relevant to the candidate formula, for each relevant formula, determining an implicit formula implied from the relevant formula and a corresponding candidate formula, and repeating the iterative process; and ranking the identified relationships. 15. The method of claim 1 , wherein the identifying relationships that are related to the keywords from the integrated ontology comprises identifying, iteratively, relationships that are related to the keywords from the integrated ontology, and wherein the ranking the identified relationships is based on rankings of source data and numbers of iterations to identify the relationships, the source data being the highly ranked web pages and the highly ranked ontologies.
| 0.591304 |
6,044,383 | 1 | 2 |
1. A tabulation device comprising: a grid structure retaining means which maintains text strings composing a table and grid structure; text field size threshold providing means for providing at least a value of one of the width and the height at a plurality of discontinuous points output of a line-breaking function on said text strings composing a table, said line breaking function of a text maps a width/height to a height/width of a rectangular area whose height/width is minimum for laying out the text in said rectangular area; text field size retaining means for retaining a relationship between said text string composing said table and the size of a rectangular area provided by said text field size threshold providing means in response to said text; table layout means for acquiring one of said sizes of rectangular area from said text field size threshold providing means, for causing said text field size threshold retaining means to retain the relationship between said text and said one of the sizes of rectangular area acquired by said table lay out means, based on said grid structure; and evaluating means responsive to the result of comparison of the tabulation by said table lay out means with predetermined conditions for directing said table layout means to acquire another one of the sizes of rectangular area from said text field size threshold providing means, for causing said text field size threshold retaining means to retain the relationship between said another one of the sizes of rectangular area and said text.
|
1. A tabulation device comprising: a grid structure retaining means which maintains text strings composing a table and grid structure; text field size threshold providing means for providing at least a value of one of the width and the height at a plurality of discontinuous points output of a line-breaking function on said text strings composing a table, said line breaking function of a text maps a width/height to a height/width of a rectangular area whose height/width is minimum for laying out the text in said rectangular area; text field size retaining means for retaining a relationship between said text string composing said table and the size of a rectangular area provided by said text field size threshold providing means in response to said text; table layout means for acquiring one of said sizes of rectangular area from said text field size threshold providing means, for causing said text field size threshold retaining means to retain the relationship between said text and said one of the sizes of rectangular area acquired by said table lay out means, based on said grid structure; and evaluating means responsive to the result of comparison of the tabulation by said table lay out means with predetermined conditions for directing said table layout means to acquire another one of the sizes of rectangular area from said text field size threshold providing means, for causing said text field size threshold retaining means to retain the relationship between said another one of the sizes of rectangular area and said text. 2. A tabulation device according to claim 1, further comprising: column/row width upper limit retaining means for retaining the upper limit value of the width of row or column composing said table, wherein said evaluating means directs said table layout means to lay out said text composing said table such that each of the row or column composing said table has the width less than said upper limit value.
| 0.747512 |
9,137,401 | 15 | 16 |
15. A non-transitory computer-readable recording medium that stores a display program executable by a computer in an electronic apparatus, the display program comprising: first program code that causes the computer to store content to be displayed on a touch panel in a content storage unit in different languages; second program code that causes the computer to store a selected language in a selected language storage unit; third program code that causes the computer to display, on the touch panel, content corresponding to the selected language stored in the selected language storage unit, of pieces of content stored in the content storage unit in the languages; fourth program code that causes the computer to display a first language selection screen including items corresponding to regions of the world on the touch panel if a particular operation is accepted in a non-explicit area other than an explicit area that is explicitly indicated as being ready for accepting an operation, the first language selection screen being one of screens displayed on the touch panel; fifth program code that causes, when any one of the items is specified out of the items on the first selection screen, the computer to display a second language selection screen including a region corresponding to the specified item and items corresponding to each of the languages corresponding to the specified item and gray out one or more items on the first language selection screen other than the specified item; and sixth program code that causes the computer to store, in the selected language storage unit, a language selected by an operation accepted on the second language selection screen displayed on the touch panel.
|
15. A non-transitory computer-readable recording medium that stores a display program executable by a computer in an electronic apparatus, the display program comprising: first program code that causes the computer to store content to be displayed on a touch panel in a content storage unit in different languages; second program code that causes the computer to store a selected language in a selected language storage unit; third program code that causes the computer to display, on the touch panel, content corresponding to the selected language stored in the selected language storage unit, of pieces of content stored in the content storage unit in the languages; fourth program code that causes the computer to display a first language selection screen including items corresponding to regions of the world on the touch panel if a particular operation is accepted in a non-explicit area other than an explicit area that is explicitly indicated as being ready for accepting an operation, the first language selection screen being one of screens displayed on the touch panel; fifth program code that causes, when any one of the items is specified out of the items on the first selection screen, the computer to display a second language selection screen including a region corresponding to the specified item and items corresponding to each of the languages corresponding to the specified item and gray out one or more items on the first language selection screen other than the specified item; and sixth program code that causes the computer to store, in the selected language storage unit, a language selected by an operation accepted on the second language selection screen displayed on the touch panel. 16. The non-transitory computer-readable recording medium according to claim 15 , the display program further comprising seventh program code that causes, when displaying at least one of the first language selection screen and the second language selection screen on the touch panel, the computer to gray out a screen that had been displayed on the touch panel before the first language selection screen has been displayed.
| 0.5 |
9,336,297 | 13 | 14 |
13. The method of claim 12 further comprising: grouping the first sub-tree and the plurality of sub-trees by topicality groups, wherein the first subject and the plurality of subjects correspond to the topicality groups.
|
13. The method of claim 12 further comprising: grouping the first sub-tree and the plurality of sub-trees by topicality groups, wherein the first subject and the plurality of subjects correspond to the topicality groups. 14. The method of claim 13 further comprising: determining a matching topicality group corresponding to the user needs expression; determining matching sub-trees by generalizing the user syntactic parse tree to the first sub-tree and each of the plurality of sub-trees in the matching topicality group; and displaying contents corresponding to the matching sub-trees.
| 0.5 |
9,911,055 | 15 | 18 |
15. A non-transitory processor-readable medium storing computer code representing instructions to cause a process for detecting and classifying via an image processor license plates displayed in images captured by an image capturing unit, said computer code comprising code to: capture an image of a vehicle utilizing an image-capturing unit that communicates with an image processor; locate a license plate region in said image of said vehicle after said capture of said image with said image-capturing unit by extracting a set of candidate regions from said image utilizing a weak classifier of said image processor; rank said set of candidate regions utilizing a secondary strong classifier of said image processor; and classify said image according to a confidence driven classification based on classification criteria determined by said weak classifier and said secondary strong classifier, thereby automatically identifying and eliminating un-readable images from human review.
|
15. A non-transitory processor-readable medium storing computer code representing instructions to cause a process for detecting and classifying via an image processor license plates displayed in images captured by an image capturing unit, said computer code comprising code to: capture an image of a vehicle utilizing an image-capturing unit that communicates with an image processor; locate a license plate region in said image of said vehicle after said capture of said image with said image-capturing unit by extracting a set of candidate regions from said image utilizing a weak classifier of said image processor; rank said set of candidate regions utilizing a secondary strong classifier of said image processor; and classify said image according to a confidence driven classification based on classification criteria determined by said weak classifier and said secondary strong classifier, thereby automatically identifying and eliminating un-readable images from human review. 18. The processor-readable medium of claim 15 wherein said secondary strong classifier comprises a neural network.
| 0.882957 |
8,560,827 | 15 | 17 |
15. An apparatus, comprising: circuitry to: receive a business input from a user; with the business input convert an abstract model into a concrete model based on inputs from an objective function adapter, a system behavior predict and a system state adapter, the abstract model comprising a business goal; and optimize the concrete model to solve for system configuration parameters of a system.
|
15. An apparatus, comprising: circuitry to: receive a business input from a user; with the business input convert an abstract model into a concrete model based on inputs from an objective function adapter, a system behavior predict and a system state adapter, the abstract model comprising a business goal; and optimize the concrete model to solve for system configuration parameters of a system. 17. The apparatus of claim 15 wherein the circuitry to generate the system configuration parameters further comprises circuitry to receive state data from the system, and wherein the circuitry to convert the abstract model into the concrete model comprises circuitry to convert an abstract model into a concrete model based on the business input and the state of the system.
| 0.5 |
8,566,331 | 5 | 6 |
5. The method of claim 1 , further comprising: determining that a second image search result, from the plurality of image search results that are responsive to the search query, is a co-irrelevant result, the determination being based on both: a relevance score for the second image search result meeting a specified irrelevance score threshold; and image similarity data for a second image referenced by the second image search result indicating that the second image meets a lower threshold level of visual similarity to at least a second threshold number of the other images that are referenced by the plurality of image search results; and generating an image rank score for the second image search result based on the relevance score and an inverse amplification factor for image search results that are determined to be co-irrelevant.
|
5. The method of claim 1 , further comprising: determining that a second image search result, from the plurality of image search results that are responsive to the search query, is a co-irrelevant result, the determination being based on both: a relevance score for the second image search result meeting a specified irrelevance score threshold; and image similarity data for a second image referenced by the second image search result indicating that the second image meets a lower threshold level of visual similarity to at least a second threshold number of the other images that are referenced by the plurality of image search results; and generating an image rank score for the second image search result based on the relevance score and an inverse amplification factor for image search results that are determined to be co-irrelevant. 6. The method of claim 5 , wherein the irrelevance score threshold is a maximum relevance score allowed for a search result to be eligible to be determined a co-irrelevant search result, and the lower threshold level of visual similarity is a maximum level of visual similarity allowed for a search result to be eligible to be determined a co-irrelevant search result.
| 0.5 |
7,885,807 | 7 | 19 |
7. A system for translating a body of text in an initial language into a target language, the system comprising means for receiving a body of text comprising a plurality of elements, means for analyzing said text and identifying one or more possible characters of said initial language corresponding to respective said elements, means for generating a text array comprising an array of cells, each cell being representative of an element and its location within said body of text and containing data representative of said element, means for retrieving from said text array a stream of data representative of a series of elements of said body of text, means for assigning in respect for each element one or more vectors so as to generate vector paths indicative of one or more possible translations into said target language of a respective element, means for generating data linking said vectors to respective cells of said text array representative of said elements, and means for retrieving from said text array a stream of data representative of a series of elements of said body of text and the respective cells by which they are identified, retrieving said linking data and identifying the possible translations of respective elements represented by respective vector paths, analyzing the possible translations in conjunction with one or more determinatives representative of a conceptual framework of said text to determine which potential translations correspond with said conceptual framework, and means for outputting one or more potential translations determined to correspond with said conceptual framework.
|
7. A system for translating a body of text in an initial language into a target language, the system comprising means for receiving a body of text comprising a plurality of elements, means for analyzing said text and identifying one or more possible characters of said initial language corresponding to respective said elements, means for generating a text array comprising an array of cells, each cell being representative of an element and its location within said body of text and containing data representative of said element, means for retrieving from said text array a stream of data representative of a series of elements of said body of text, means for assigning in respect for each element one or more vectors so as to generate vector paths indicative of one or more possible translations into said target language of a respective element, means for generating data linking said vectors to respective cells of said text array representative of said elements, and means for retrieving from said text array a stream of data representative of a series of elements of said body of text and the respective cells by which they are identified, retrieving said linking data and identifying the possible translations of respective elements represented by respective vector paths, analyzing the possible translations in conjunction with one or more determinatives representative of a conceptual framework of said text to determine which potential translations correspond with said conceptual framework, and means for outputting one or more potential translations determined to correspond with said conceptual framework. 19. A system according to claim 7 , further comprising a multi-dimensional storage grid containing one or more possible translations into said target language, including any alternative translations and spelling variations, corresponding to respective elements, in respect of which said vector paths are assigned to respective elements.
| 0.693431 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.