patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
7,747,633 | 9 | 10 | 9. The computer-implemented method of claim 1 , further comprising creating a position tree including positional information corresponding to the XML data string. | 9. The computer-implemented method of claim 1 , further comprising creating a position tree including positional information corresponding to the XML data string. 10. The computer-implemented method of claim 9 , further comprising searching the position tree to locate a node corresponding to the modification. | 0.5 |
8,332,907 | 12 | 13 | 12. A system comprising: a policy generator adapted to generate a security policy defining at least one protected element contained within a portion of a file, said protected element comprising at least one of a group composed of a keyword; a file name extension; a link to a protected object, a filename and a metadata element, and a disposition action for the file containing said protected element, said protected element containing sensitive information; a file scanner operable and executed on a processor of a remote device and adapted to: scan a portion of file system that is not currently subjected to the security policy for said at least one protected element in a portion of a file to find a first file, said first file comprising both said at least one protected element and at least one unprotected element said protected element within the file having been previously subjected to the security policy, but due to actions performed by a user no longer subjected to the security policy; apply said security policy to said first file, and perform said disposition action on said first file. | 12. A system comprising: a policy generator adapted to generate a security policy defining at least one protected element contained within a portion of a file, said protected element comprising at least one of a group composed of a keyword; a file name extension; a link to a protected object, a filename and a metadata element, and a disposition action for the file containing said protected element, said protected element containing sensitive information; a file scanner operable and executed on a processor of a remote device and adapted to: scan a portion of file system that is not currently subjected to the security policy for said at least one protected element in a portion of a file to find a first file, said first file comprising both said at least one protected element and at least one unprotected element said protected element within the file having been previously subjected to the security policy, but due to actions performed by a user no longer subjected to the security policy; apply said security policy to said first file, and perform said disposition action on said first file. 13. The system of claim 12 , said policy generator being connected to said remote device by a network. | 0.807547 |
10,042,748 | 1 | 7 | 1. A computer implemented method for analyzing a set of data representing game player behavior, comprising: partitioning, with a processor, a first set of data into a plurality of game play periods for a plurality of different players, the set of data being related to a plurality game factors associated with one or more wagering games; analyzing, with a processor, the first set of data within each game play period, creating, with a processor, a plurality of generic game player types based at least in part on the analysis of the first set of data from the plurality of game play periods and from the plurality of different players; associating each of the generic game player types with a corresponding selection of games based on data related to games in the selection of games and the first set of data, wherein the selection of games for a first game player type of the plurality of generic game player types differs from the selection of games for a second game player type of the plurality of generic game player types; collecting a second set of data related to the game factors for game play in an ongoing game by a current game player; analyzing the second set of data; associating at least one game player type of the plurality of generic game player types with the current game player based on the analysis of the second set of data; and displaying to the current game player the corresponding selection of games identified for the at least one game player type associated with the current game player. | 1. A computer implemented method for analyzing a set of data representing game player behavior, comprising: partitioning, with a processor, a first set of data into a plurality of game play periods for a plurality of different players, the set of data being related to a plurality game factors associated with one or more wagering games; analyzing, with a processor, the first set of data within each game play period, creating, with a processor, a plurality of generic game player types based at least in part on the analysis of the first set of data from the plurality of game play periods and from the plurality of different players; associating each of the generic game player types with a corresponding selection of games based on data related to games in the selection of games and the first set of data, wherein the selection of games for a first game player type of the plurality of generic game player types differs from the selection of games for a second game player type of the plurality of generic game player types; collecting a second set of data related to the game factors for game play in an ongoing game by a current game player; analyzing the second set of data; associating at least one game player type of the plurality of generic game player types with the current game player based on the analysis of the second set of data; and displaying to the current game player the corresponding selection of games identified for the at least one game player type associated with the current game player. 7. The method of claim 1 , wherein analyzing the second set of data comprises: detecting indicators from within the second set of data. | 0.956647 |
6,031,537 | 16 | 17 | 16. A method for organizing and processing information using a computer, said information comprising a plurality of thoughts, and said method comprising the steps of: defining a matrix comprising the plurality of thoughts and further comprising a plurality of network relationships among the thoughts, wherein each thought may be related to at least one other of said thoughts, and wherein at least one of the thoughts is directly related to one of the other thoughts, and wherein said matrix references a second matrix; displaying an indicium of a first thought as a central thought on a display; displaying an indicium of a second thought on the display, wherein the second thought having a direct relation to the first thought; and selecting said second thought to be a new central thought, whereby indicia of those thoughts having defined relations with the second thought will be displayed on the display. | 16. A method for organizing and processing information using a computer, said information comprising a plurality of thoughts, and said method comprising the steps of: defining a matrix comprising the plurality of thoughts and further comprising a plurality of network relationships among the thoughts, wherein each thought may be related to at least one other of said thoughts, and wherein at least one of the thoughts is directly related to one of the other thoughts, and wherein said matrix references a second matrix; displaying an indicium of a first thought as a central thought on a display; displaying an indicium of a second thought on the display, wherein the second thought having a direct relation to the first thought; and selecting said second thought to be a new central thought, whereby indicia of those thoughts having defined relations with the second thought will be displayed on the display. 17. The method of claim 16, wherein an administrator may independently assign access privileges to each of said matrices. | 0.5 |
7,490,092 | 143 | 149 | 143. A method of indexing and searching timed media files, as recited in claim 1 , further comprising the step of calculating a magnitude of relevance for at least one relevance interval for an indexing information representation. | 143. A method of indexing and searching timed media files, as recited in claim 1 , further comprising the step of calculating a magnitude of relevance for at least one relevance interval for an indexing information representation. 149. A method of indexing and searching timed media files, as recited in claim 143 , wherein a ranking of said relevance intervals according to said magnitudes of relevance is displayed. | 0.72807 |
9,158,816 | 1 | 2 | 1. A system comprising: a memory; an input adapter configured to receive an event from a source and generate an event object based on the event, wherein the event object includes a payload, a validity start time, and a validity end time; a processor including a query engine configured to execute a query with respect to the event object to produce a result object, wherein the query is represented by an extensible markup language (XML) file that is based on a reusable XML query template that is bindable to a plurality of input adapters and a plurality of output adapters, wherein the query is executed by comparing the event object to static reference data received from a static reference source, and wherein the result object is produced based on an application of at least one operator of the query; and an output adapter configured to generate a result based on the result object and to transmit the result to a sink. | 1. A system comprising: a memory; an input adapter configured to receive an event from a source and generate an event object based on the event, wherein the event object includes a payload, a validity start time, and a validity end time; a processor including a query engine configured to execute a query with respect to the event object to produce a result object, wherein the query is represented by an extensible markup language (XML) file that is based on a reusable XML query template that is bindable to a plurality of input adapters and a plurality of output adapters, wherein the query is executed by comparing the event object to static reference data received from a static reference source, and wherein the result object is produced based on an application of at least one operator of the query; and an output adapter configured to generate a result based on the result object and to transmit the result to a sink. 2. The system of claim 1 , further comprising a second input adapter configured to receive a second event object from a second source that is different from the source and a second output adapter configured to transmit a second result to a second sink that is different from the sink, wherein the query engine is further configured to execute the query with respect to the second event object. | 0.5 |
9,189,069 | 14 | 19 | 14. A mobile device comprising: one or more processors; one or more sensors configured to sense tilting movement of the mobile device and to sense linear acceleration of the mobile device; a user interface; and executable instructions, which when executed by the one or more processors, configure the one or more processors to: display a first application window in the user interface of the mobile device; receive first sensor signals from at least one of the sensors; determine that a tilting gesture has been made with the mobile device based on the first sensor signals, the tilting gesture comprising rotation of the mobile device about at least one axis; alter an image within the displayed first application window based on the stilting gesture: receive a second sensor signal from at least one of the sensors indicating a rapid linear acceleration of the mobile device upon which the mobile device experiences a bulk translation in a substantially linear direction; determine that a flinging gesture has been made with the mobile device, as if the mobile device is being thrown, by utilizing the second sensor signal to distinguish the linear acceleration of the mobile device from the tilting gesture and from a shaking gesture with the mobile device; and based on determining that the flinging gesture has been made with the mobile device, switch from displaying the first application window in the user interface to displaying a second application window in the user interface. | 14. A mobile device comprising: one or more processors; one or more sensors configured to sense tilting movement of the mobile device and to sense linear acceleration of the mobile device; a user interface; and executable instructions, which when executed by the one or more processors, configure the one or more processors to: display a first application window in the user interface of the mobile device; receive first sensor signals from at least one of the sensors; determine that a tilting gesture has been made with the mobile device based on the first sensor signals, the tilting gesture comprising rotation of the mobile device about at least one axis; alter an image within the displayed first application window based on the stilting gesture: receive a second sensor signal from at least one of the sensors indicating a rapid linear acceleration of the mobile device upon which the mobile device experiences a bulk translation in a substantially linear direction; determine that a flinging gesture has been made with the mobile device, as if the mobile device is being thrown, by utilizing the second sensor signal to distinguish the linear acceleration of the mobile device from the tilting gesture and from a shaking gesture with the mobile device; and based on determining that the flinging gesture has been made with the mobile device, switch from displaying the first application window in the user interface to displaying a second application window in the user interface. 19. The mobile device of claim 14 , wherein the executable instructions configure the one or more processors to determine that the flinging gesture has been made with the mobile device based on a value indicative of movement in the substantially linear direction. | 0.5 |
8,959,568 | 15 | 19 | 15. A method for configuring security policies across an enterprise, the method comprising the steps of: configuring a plurality of security product endpoints in the enterprise to share security assessments over a common communication channel; defining a security assessment schema in which assessments of security events are generated by the plurality of security product endpoints in the enterprise, the security product endpoints each being configured for receiving security assessments generated by other security product endpoints over the common communication channel and each security product endpoint being further configured for generating a new security assessment for transmission over the common communication channel, in response to a received security assessment, according to rules which take into account any combination of a. locally-available information about the security events or objects being monitored by the security product endpoint, b. currently active security assessments received by the security product endpoint, and c. local actions taken by the security product endpoint in the past, in which sets of locally-available information for the security product endpoints are mutually exclusive, the security assessments i) using a pre-defined taxonomy to provide contextual meaning to the security events and, ii) being categorized by type, the type providing contextual security meaning to security-related information contained in the security assessments; and using a security assessment as an anchor point to a rules matrix, the rules matrix describing a response to each security assessment type. | 15. A method for configuring security policies across an enterprise, the method comprising the steps of: configuring a plurality of security product endpoints in the enterprise to share security assessments over a common communication channel; defining a security assessment schema in which assessments of security events are generated by the plurality of security product endpoints in the enterprise, the security product endpoints each being configured for receiving security assessments generated by other security product endpoints over the common communication channel and each security product endpoint being further configured for generating a new security assessment for transmission over the common communication channel, in response to a received security assessment, according to rules which take into account any combination of a. locally-available information about the security events or objects being monitored by the security product endpoint, b. currently active security assessments received by the security product endpoint, and c. local actions taken by the security product endpoint in the past, in which sets of locally-available information for the security product endpoints are mutually exclusive, the security assessments i) using a pre-defined taxonomy to provide contextual meaning to the security events and, ii) being categorized by type, the type providing contextual security meaning to security-related information contained in the security assessments; and using a security assessment as an anchor point to a rules matrix, the rules matrix describing a response to each security assessment type. 19. The method of claim 15 in which the rules matrix includes dimensions of assessment fidelity and event severity. | 0.737443 |
8,055,597 | 1 | 2 | 1. A computerized method for organizing media content, comprising: receiving a plurality of records corresponding to media content at a computer, the records each containing categorical data; obtaining a categorical dataset by mapping each of the plurality of records onto predefined fields of a system ontology, wherein the ontology fields correspond to an attribute space comprising a plurality of attributes each characterized by a plurality of terms, the dataset characterized by the attribute space, the dataset being unsorted; modifying the dataset, wherein the modifying the dataset comprises modifying one or more of the plurality of terms characterizing one or more of the plurality of attributes of the attribute space; decomposing the attribute space into a plurality of attribute subspaces each comprising one or more of the plurality of attributes; generating a parent taxonomy of the modified dataset with respect to one of the plurality of attribute subspaces, the parent taxonomy organizing the modified dataset into a plurality of data subsets; generating a child taxonomy with respect to another one of the plurality of attribute subspaces, the child taxonomy organizing each of the plurality of data subsets within the parent taxonomy into at least one data subset; iteratively repeating generating the child taxonomy until a predetermined termination condition is satisfied, wherein the child taxonomy of a preceding iteration is the parent taxonomy of the current iteration; and assigning category labels to the data subsets. | 1. A computerized method for organizing media content, comprising: receiving a plurality of records corresponding to media content at a computer, the records each containing categorical data; obtaining a categorical dataset by mapping each of the plurality of records onto predefined fields of a system ontology, wherein the ontology fields correspond to an attribute space comprising a plurality of attributes each characterized by a plurality of terms, the dataset characterized by the attribute space, the dataset being unsorted; modifying the dataset, wherein the modifying the dataset comprises modifying one or more of the plurality of terms characterizing one or more of the plurality of attributes of the attribute space; decomposing the attribute space into a plurality of attribute subspaces each comprising one or more of the plurality of attributes; generating a parent taxonomy of the modified dataset with respect to one of the plurality of attribute subspaces, the parent taxonomy organizing the modified dataset into a plurality of data subsets; generating a child taxonomy with respect to another one of the plurality of attribute subspaces, the child taxonomy organizing each of the plurality of data subsets within the parent taxonomy into at least one data subset; iteratively repeating generating the child taxonomy until a predetermined termination condition is satisfied, wherein the child taxonomy of a preceding iteration is the parent taxonomy of the current iteration; and assigning category labels to the data subsets. 2. The method of claim 1 , further comprising decomposing the attribute space into a plurality of attribute subspaces such that two attribute subspaces share an attribute. | 0.623348 |
5,555,363 | 1 | 4 | 1. A method for setting the case of a selected textual object displayed on a display screen of a pen-based computer system, the method comprising the steps of: receiving a stroke input on the display screen; determining whether the stroke is a case setting gesture that is formed from a single substantially vertical line that intersects the selected textual object, and does not include a significant horizontal component; and setting the case of at least one character in the intersected selected textual object based upon the direction that the case setting gesture is drawn and the location at which the gesture is drawn relative to the intersected selected textual object when the stroke is determined to be a case setting gesture. | 1. A method for setting the case of a selected textual object displayed on a display screen of a pen-based computer system, the method comprising the steps of: receiving a stroke input on the display screen; determining whether the stroke is a case setting gesture that is formed from a single substantially vertical line that intersects the selected textual object, and does not include a significant horizontal component; and setting the case of at least one character in the intersected selected textual object based upon the direction that the case setting gesture is drawn and the location at which the gesture is drawn relative to the intersected selected textual object when the stroke is determined to be a case setting gesture. 4. A method as recited in claim 1 wherein case setting gestures drawn in the upward direction are interpreted to require that a selected portion of the overlaid text be set to upper case and case setting gestures drawn in the downward direction are interpreted to require that the selected portion of the overlaid text be set to lower case. | 0.602804 |
8,234,313 | 1 | 5 | 1. A method comprising: receiving a selection of a business intelligence report element of a first business intelligence report specification, the first business intelligence report specification in a first file format; creating a serialized description of the business intelligence report element in a second file format based on a business intelligence report element data model; receiving an instruction to add the business intelligence report element to a second business intelligence report specification, the second business intelligence report specification in a third file format; and adding the business intelligence report element to the second business intelligence report specification in the third file format based on the serialized description of the business intelligence report element. | 1. A method comprising: receiving a selection of a business intelligence report element of a first business intelligence report specification, the first business intelligence report specification in a first file format; creating a serialized description of the business intelligence report element in a second file format based on a business intelligence report element data model; receiving an instruction to add the business intelligence report element to a second business intelligence report specification, the second business intelligence report specification in a third file format; and adding the business intelligence report element to the second business intelligence report specification in the third file format based on the serialized description of the business intelligence report element. 5. A method according to claim 1 , wherein the business intelligence report element comprises a structure, a style and a semantic, and wherein adding the business intelligence report element to the second business intelligence report specification in the third file format comprises: determining whether to add the style only, the structure only, the style and structure only, or the style, structure and semantic of the business intelligence report element to the second business intelligence report specification; if it is determined to add the style only, creating the style in a style dictionary of the second business intelligence report specification; if it is determined to add the structure only, creating a template object based on the business intelligence report element; if it is determined to add the style and structure only, creating a template object based on the business intelligence report element, and creating the style in a style dictionary of the second business intelligence report specification; and if it is determined to add the style, structure and semantic, creating data sources in the second business intelligence report specification corresponding to one or more queries of the business intelligence report element, creating the one or more queries in the second business intelligence report specification based on a query definition of the serialized description, creating the business intelligence report element in the second business intelligence report specification, and creating the style in a style dictionary of the second business intelligence report specification. | 0.5 |
8,069,147 | 10 | 12 | 10. A computer-readable storage medium having computer-executable instructions recorded thereon for delivering search results that include data from one or more online data repositories that store a plurality of online reports and one or more offline data repositories that store a plurality of archived or compressed reports in a long-term backup system, the computer-executable instructions operable when executed on a computer to: set security to limit access to the plurality of online reports stored in the online data repositories and the plurality of archived or compressed reports stored in the offline data repositories; specify one or more mandatory criteria fields and one or more optional criteria fields to search the online data repositories and the offline data repositories; search, by a processor, the plurality of online reports stored in the online data repositories to a first report among the plurality of online reports stored in the online data repositories that matches criteria provided in a search query in response to the criteria provided in the search query including at least the one or more mandatory criteria fields; search, by the processor, the plurality of archived or compressed reports stored in the long-term backup system associated with the offline data repositories to identify a second report among the plurality of archived or compressed reports stored in the offline data repositories that matches the criteria provided in the search query in response to the criteria provided in the search query including at least the one or more mandatory criteria fields; export data from the first report identified in the online data repositories in accordance with one or more export options provided for the first report; export data from the second report stored in the offline data repositories in accordance with one or more export options provided for the second report, wherein the computer-executable instructions are further operable to unarchive or decompress the second report identified among the plurality of archived or compressed reports stored in the offline data repositories to export the data from the second report; analyze the data exported from the first report and the data exported from the second report; deliver the analyzed data exported from the first report and the analyzed data exported from the second report to a spreadsheet application in response to a user that submitted the search query having one or more permissions that satisfy the security, wherein manipulating the data delivered to the spreadsheet application does not modify the first report stored in the online data repositories or the second report stored in the long-term backup system associated with the offline data repositories; and track activity associated with the user interacting with the analyzed data delivered to the spreadsheet application to generate an audit log, vary a presentation associated with the first report or the second report depending on read versus unread status, and generate statistical analysis relating to the tracked activity. | 10. A computer-readable storage medium having computer-executable instructions recorded thereon for delivering search results that include data from one or more online data repositories that store a plurality of online reports and one or more offline data repositories that store a plurality of archived or compressed reports in a long-term backup system, the computer-executable instructions operable when executed on a computer to: set security to limit access to the plurality of online reports stored in the online data repositories and the plurality of archived or compressed reports stored in the offline data repositories; specify one or more mandatory criteria fields and one or more optional criteria fields to search the online data repositories and the offline data repositories; search, by a processor, the plurality of online reports stored in the online data repositories to a first report among the plurality of online reports stored in the online data repositories that matches criteria provided in a search query in response to the criteria provided in the search query including at least the one or more mandatory criteria fields; search, by the processor, the plurality of archived or compressed reports stored in the long-term backup system associated with the offline data repositories to identify a second report among the plurality of archived or compressed reports stored in the offline data repositories that matches the criteria provided in the search query in response to the criteria provided in the search query including at least the one or more mandatory criteria fields; export data from the first report identified in the online data repositories in accordance with one or more export options provided for the first report; export data from the second report stored in the offline data repositories in accordance with one or more export options provided for the second report, wherein the computer-executable instructions are further operable to unarchive or decompress the second report identified among the plurality of archived or compressed reports stored in the offline data repositories to export the data from the second report; analyze the data exported from the first report and the data exported from the second report; deliver the analyzed data exported from the first report and the analyzed data exported from the second report to a spreadsheet application in response to a user that submitted the search query having one or more permissions that satisfy the security, wherein manipulating the data delivered to the spreadsheet application does not modify the first report stored in the online data repositories or the second report stored in the long-term backup system associated with the offline data repositories; and track activity associated with the user interacting with the analyzed data delivered to the spreadsheet application to generate an audit log, vary a presentation associated with the first report or the second report depending on read versus unread status, and generate statistical analysis relating to the tracked activity. 12. The computer-readable storage medium of claim 10 , wherein the export options provided for one or more of the first report or the second report include a parsing criteria indicating one or more pages in the respective report having the data to be exported. | 0.774306 |
9,513,941 | 17 | 25 | 17. A non-transitory machine readable medium storing a program which, when executed by at least one processing unit of a device generates a plurality of application programming interfaces (APIs) in a codeless manner, the program comprising sets of instructions for: receiving a request for a plurality of APIs based on a description of a database schema; upon identifying the database schema description, generating a set of data graphs that identifies relationships between a set of data objects included in the description; generating the plurality of APIs based on the set of data graphs and providing the generated APIs to a user for selecting a subset of the plurality of APIs; and upon selection of an API, generating a JavaScript object notation based model (JSON-based model) associated with the selected API, the JSON-based model comprising a JSON file and a JavaScript (JS) file for an application to use to exchange data with the database. | 17. A non-transitory machine readable medium storing a program which, when executed by at least one processing unit of a device generates a plurality of application programming interfaces (APIs) in a codeless manner, the program comprising sets of instructions for: receiving a request for a plurality of APIs based on a description of a database schema; upon identifying the database schema description, generating a set of data graphs that identifies relationships between a set of data objects included in the description; generating the plurality of APIs based on the set of data graphs and providing the generated APIs to a user for selecting a subset of the plurality of APIs; and upon selection of an API, generating a JavaScript object notation based model (JSON-based model) associated with the selected API, the JSON-based model comprising a JSON file and a JavaScript (JS) file for an application to use to exchange data with the database. 25. The non-transitory machine readable medium of claim 17 , wherein at least one API in the selected set of APIs is an aggregated API, wherein the aggregated API is associated with at least two JSON-based models. | 0.679217 |
8,271,418 | 9 | 15 | 9. A system for examining policies for a domain of an enterprise system, the system comprising one or more processors and memory of the enterprise system configured to: in response to user input, represent the policies as a plurality of policy rules specific to a target system of the domain, each of the policy rules including a condition in which one or more binary operator expressions are included, each binary operator expression referring to one or more policy attributes; check one or more of the policy rules; and based on a result of the checking, notify the user as to an anomaly in the rules for the target system; the one or more processors and memory further configured to: for each policy attribute in the one or more policy rules being checked, configure a set of sample values assumable by the policy attribute and sufficient to represent substantially all possible agreements and/or disagreements between two binary operator expressions being compared that refer to the policy attribute; for a policy rule being checked, compare each binary operator expression in the rule with each combination of the sample values for the attributes referred to by the binary operator expressions, in an order determined by a mixed-radix enumeration of the sample values; and based on a result of the comparing, detect a relationship between truth tables for the one or more rules being checked. | 9. A system for examining policies for a domain of an enterprise system, the system comprising one or more processors and memory of the enterprise system configured to: in response to user input, represent the policies as a plurality of policy rules specific to a target system of the domain, each of the policy rules including a condition in which one or more binary operator expressions are included, each binary operator expression referring to one or more policy attributes; check one or more of the policy rules; and based on a result of the checking, notify the user as to an anomaly in the rules for the target system; the one or more processors and memory further configured to: for each policy attribute in the one or more policy rules being checked, configure a set of sample values assumable by the policy attribute and sufficient to represent substantially all possible agreements and/or disagreements between two binary operator expressions being compared that refer to the policy attribute; for a policy rule being checked, compare each binary operator expression in the rule with each combination of the sample values for the attributes referred to by the binary operator expressions, in an order determined by a mixed-radix enumeration of the sample values; and based on a result of the comparing, detect a relationship between truth tables for the one or more rules being checked. 15. The system of claim 9 , the one or more processors and memory configured to provide logical comparisons of binary operator expressions over variables at least one of which has an undefined range of possible values. | 0.594796 |
8,933,962 | 9 | 10 | 9. A method as recited in claim 7 , further comprising: before vectorizing, adjusting a dimension of the clipart image; extracting a stroke of the clipart image; extracting a region of the clipart image; and converting the extracted stroke and the extracted region into a vector-based representation. | 9. A method as recited in claim 7 , further comprising: before vectorizing, adjusting a dimension of the clipart image; extracting a stroke of the clipart image; extracting a region of the clipart image; and converting the extracted stroke and the extracted region into a vector-based representation. 10. A method as recited in claim 9 , wherein extracting the stroke of the clipart image comprises: constructing a stroke mask; filling the stroke that has a region inside the extracted stroke; and removing a false stroke. | 0.599638 |
9,510,044 | 1 | 7 | 1. A method for time aligned identification of video content playing on an electronic client device, the method comprising: receiving by the electronic client device, a video stream for presentation by the electronic client device, the video stream containing a first video content followed by a second video content; generating by the electronic client device, a first set of signatures for the first video content; identifying by the electronic client device, the first video content based on an analysis of the first set of signatures compared to reference signatures stored in a database; detecting by the electronic client device, a scale ratio mapping between video frames of the identified first video content playing on the electronic client device and reference frames stored in the database by calculating a scale ratio along an x axis (Sx) and a difference scale ratio along a y axis (Sy) for a query signature in the first set of signatures and a reliable matching reference signature in the database, wherein the calculated scale ratios Sx and Sy indicate that the video frames of the identified first video content and the reference frames are not in alignment; responsive to calculating the scale ratios, using the detected scale ratio mapping to generate subsequent signatures for subsequent incoming video frames; and monitoring the subsequent incoming video frames for the second video content by the electronic client device to determine that the video stream has made a scene change from the first video content to the second video content. | 1. A method for time aligned identification of video content playing on an electronic client device, the method comprising: receiving by the electronic client device, a video stream for presentation by the electronic client device, the video stream containing a first video content followed by a second video content; generating by the electronic client device, a first set of signatures for the first video content; identifying by the electronic client device, the first video content based on an analysis of the first set of signatures compared to reference signatures stored in a database; detecting by the electronic client device, a scale ratio mapping between video frames of the identified first video content playing on the electronic client device and reference frames stored in the database by calculating a scale ratio along an x axis (Sx) and a difference scale ratio along a y axis (Sy) for a query signature in the first set of signatures and a reliable matching reference signature in the database, wherein the calculated scale ratios Sx and Sy indicate that the video frames of the identified first video content and the reference frames are not in alignment; responsive to calculating the scale ratios, using the detected scale ratio mapping to generate subsequent signatures for subsequent incoming video frames; and monitoring the subsequent incoming video frames for the second video content by the electronic client device to determine that the video stream has made a scene change from the first video content to the second video content. 7. The method of claim 1 , wherein identifying a change in multimedia content comprises: detecting a scene change. | 0.874172 |
7,983,997 | 16 | 17 | 16. An interactive method for learning and executing as recited in claim 3 , wherein for each of said plurality of steps taught by said user, said demonstrations of said user and a primary code object which is associated with said demonstrations of said user are correlated. | 16. An interactive method for learning and executing as recited in claim 3 , wherein for each of said plurality of steps taught by said user, said demonstrations of said user and a primary code object which is associated with said demonstrations of said user are correlated. 17. An interactive method for learning and executing as recited in claim 16 , further comprising for each of said plurality of steps taught by said user, scanning other code objects in proximity to said primary code object which is associated with a particular said user demonstration to search for the presence of words defining said user's objective or synonyms therefor. | 0.5 |
9,454,621 | 2 | 3 | 2. The computer-implemented method of claim 1 , further comprising identifying one or more alternate query suggestions based on the partial search query, wherein the one or more signals includes one or more characteristics of the one or more alternate query suggestions. | 2. The computer-implemented method of claim 1 , further comprising identifying one or more alternate query suggestions based on the partial search query, wherein the one or more signals includes one or more characteristics of the one or more alternate query suggestions. 3. The computer-implemented method of claim 2 , wherein the one or more characteristics of the alternate query suggestions include one or more scores associated with one or more alternate query suggestions. | 0.652027 |
4,362,152 | 1 | 17 | 1. A prosthetic erector comprising: an elongated rod means having first and second ends, a yoke coupled at the first end of the rod means, the yoke having first and second arms forming a pair of spaced apart, generally hooked-shaped arcuate arms adapted for encircling the glans of the penis around and in abutment with the corona sulcus, the extremities of the arms located in the vicinity of the opening at the penis urethra, a supporting arc portion at the second end of the rod means conforming to the contour of the pubic muscles, the rod means having an upward bend with respect to the longitudinal axis of the rod means located at a station about one-third of the length of the rod away from the first end, the bend initially stressing the rod means so that, when the arms support the weight of the penis, the rod means contacts the penis superficial dorsal vein for applying pressure thereto; and securement means at the second end of the rod means for securing the erector to the penis, said means formed from elastomeric material and adapted for securement around the penis scrotum at the root of the penis. | 1. A prosthetic erector comprising: an elongated rod means having first and second ends, a yoke coupled at the first end of the rod means, the yoke having first and second arms forming a pair of spaced apart, generally hooked-shaped arcuate arms adapted for encircling the glans of the penis around and in abutment with the corona sulcus, the extremities of the arms located in the vicinity of the opening at the penis urethra, a supporting arc portion at the second end of the rod means conforming to the contour of the pubic muscles, the rod means having an upward bend with respect to the longitudinal axis of the rod means located at a station about one-third of the length of the rod away from the first end, the bend initially stressing the rod means so that, when the arms support the weight of the penis, the rod means contacts the penis superficial dorsal vein for applying pressure thereto; and securement means at the second end of the rod means for securing the erector to the penis, said means formed from elastomeric material and adapted for securement around the penis scrotum at the root of the penis. 17. The erector of claim 1 wherein the bend comprises a predetermined included angle in the range of about 165.degree. to 175.degree.. | 0.81694 |
7,681,147 | 16 | 18 | 16. A client/server network for determining probable meanings of search query words, comprising: a client computer to enter at least one word on the network; a server to receive an input of the at least one word from the network; a processor to determine a probable meaning of the at least one word in accordance with a prior probability and a context frequency probability of probable meanings of the word, wherein the prior probability comprises a probability that the word refers to a predetermined meaning irregardless of the query context in which the word is used, which prior probability is derived from previous analysis of documents containing the word; wherein the processor: estimates an expected final probability for the at least one word given the prior probability of the at least one word; derives an inverse combine function that uses the prior probability and the expected final probability to determine the context frequency probability of the at least one word; uses a combine mathematical function to combine the prior probability and the context frequency probability to produce a final probability of the probable meaning of the at least one search query word; and a memory coupled with the processor to store the prior probabilities and the context frequency probabilities of probable meanings of previously-inputted words; wherein the processor generates search results listings in accordance with the final probability of the probable meaning of the word for presentation to the client computer. | 16. A client/server network for determining probable meanings of search query words, comprising: a client computer to enter at least one word on the network; a server to receive an input of the at least one word from the network; a processor to determine a probable meaning of the at least one word in accordance with a prior probability and a context frequency probability of probable meanings of the word, wherein the prior probability comprises a probability that the word refers to a predetermined meaning irregardless of the query context in which the word is used, which prior probability is derived from previous analysis of documents containing the word; wherein the processor: estimates an expected final probability for the at least one word given the prior probability of the at least one word; derives an inverse combine function that uses the prior probability and the expected final probability to determine the context frequency probability of the at least one word; uses a combine mathematical function to combine the prior probability and the context frequency probability to produce a final probability of the probable meaning of the at least one search query word; and a memory coupled with the processor to store the prior probabilities and the context frequency probabilities of probable meanings of previously-inputted words; wherein the processor generates search results listings in accordance with the final probability of the probable meaning of the word for presentation to the client computer. 18. The client/server network of claim 16 , wherein a meaning of the word comprises a geographic location. | 0.856369 |
8,793,314 | 5 | 8 | 5. A system for creating a social event by matching a mutual profile with a set of entities, comprising: a processor; a mutual profile module coupled to the processor to: receive profile parameters which enable a plurality of mutual profiles to be created, wherein each mutual profile is an abstract data structure including information relating to at least two or more members, wherein the at least two or more members are acquainted with each other, wherein the profile parameters include attributes of each member of the at least two or more members, and wherein the attributes of the at least two or more members in each mutual profile are aggregated as a particular single merged entity for processing based on mutually shared attributes; and an event scheduling module coupled to the processor to: receive event parameters which enable scheduling of a social event, wherein the scheduling of the social event includes arranging a meeting between the mutual profile and the set of entities at a business venue, and wherein the event parameters includes availability attributes of each member of the mutual profile and each entity of the set of entities; identify a first mutual profile from the plurality of mutual profiles, the first mutual profile being a single merged entity including a first member and a second member, the first and second members having a set of mutual attributes, wherein to identify further includes to: identify a first set of attributes for the first member of the single merged entity and a second set of attributes for the second member of the single merged entity; and identify a first venue wish list for the first member and a second venue wish list for the second member, the first and second venue wish lists each including a plurality of ranked venues, wherein the plurality of ranked venues is listed in an order based on a ranking by a respective member of the first and second members and based on a monitoring of user activity of the respective member using the system, the user activity indicative of an interest in a particular venue; determine the set of mutual attributes, the set of mutual attributes including common attributes between the first set of attributes and the second set of attributes and common venues between the first venue wish list and the second venue wish list; apply a weight to each mutual attribute of the set of mutual attributes; determine, by use of a blending algorithm, the set of entities matching with the single merged entity based, at least in part, on the set of mutual attributes, wherein the set of entities is either (a) a particular member that is not the first or second member, or (b) a particular mutual profile not including the first mutual profile; and arrange a first social event between the single merged entity and the set of entities matched by the blending algorithm, wherein to arrange includes to: transmit an event invitation to each member of (a) the single merged entity and (b) the set of entities, the event invitation configured to request a confirmation from each member for attending the first social event; and responsive to the confirmation, communicate with a venue system to make reservation for a set of members at the venue, the set of members based on a number of confirmations received from the single merged entity and the set of entities. | 5. A system for creating a social event by matching a mutual profile with a set of entities, comprising: a processor; a mutual profile module coupled to the processor to: receive profile parameters which enable a plurality of mutual profiles to be created, wherein each mutual profile is an abstract data structure including information relating to at least two or more members, wherein the at least two or more members are acquainted with each other, wherein the profile parameters include attributes of each member of the at least two or more members, and wherein the attributes of the at least two or more members in each mutual profile are aggregated as a particular single merged entity for processing based on mutually shared attributes; and an event scheduling module coupled to the processor to: receive event parameters which enable scheduling of a social event, wherein the scheduling of the social event includes arranging a meeting between the mutual profile and the set of entities at a business venue, and wherein the event parameters includes availability attributes of each member of the mutual profile and each entity of the set of entities; identify a first mutual profile from the plurality of mutual profiles, the first mutual profile being a single merged entity including a first member and a second member, the first and second members having a set of mutual attributes, wherein to identify further includes to: identify a first set of attributes for the first member of the single merged entity and a second set of attributes for the second member of the single merged entity; and identify a first venue wish list for the first member and a second venue wish list for the second member, the first and second venue wish lists each including a plurality of ranked venues, wherein the plurality of ranked venues is listed in an order based on a ranking by a respective member of the first and second members and based on a monitoring of user activity of the respective member using the system, the user activity indicative of an interest in a particular venue; determine the set of mutual attributes, the set of mutual attributes including common attributes between the first set of attributes and the second set of attributes and common venues between the first venue wish list and the second venue wish list; apply a weight to each mutual attribute of the set of mutual attributes; determine, by use of a blending algorithm, the set of entities matching with the single merged entity based, at least in part, on the set of mutual attributes, wherein the set of entities is either (a) a particular member that is not the first or second member, or (b) a particular mutual profile not including the first mutual profile; and arrange a first social event between the single merged entity and the set of entities matched by the blending algorithm, wherein to arrange includes to: transmit an event invitation to each member of (a) the single merged entity and (b) the set of entities, the event invitation configured to request a confirmation from each member for attending the first social event; and responsive to the confirmation, communicate with a venue system to make reservation for a set of members at the venue, the set of members based on a number of confirmations received from the single merged entity and the set of entities. 8. The system of claim 5 , wherein to determine, by use of the blending algorithm, includes: matching the first mutual profile with a second mutual profile and matching the first mutual profile with a third mutual profile. | 0.690808 |
9,741,142 | 1 | 7 | 1. A computer implemented method comprising: for each original character in a set of original characters present in a scanned document, determining a system font, from a plurality of system fonts, corresponding to the original character; generating, by at least one processor, a synthesized digital font comprising a plurality of synthesized characters corresponding to the set of original characters present in the scanned document; generating, by the at least one processor, an editable version of the scanned document by replacing the set of original characters in the scanned document with corresponding synthesized characters from the plurality of synthesized characters of the synthesized digital font; and enabling editing of the scanned document wherein enabling editing comprises: detecting user input of a new character at a location in the scanned document; identifying a first system font corresponding to a neighboring character of the location of the new character, wherein the first system font is one of the plurality of system fonts and the neighboring character is one of the original characters from set of original characters; adding a synthesized character from the plurality of synthesized characters of the synthesized digital font to the editable version of the scanned document based on the new character, the first system font, and the location. | 1. A computer implemented method comprising: for each original character in a set of original characters present in a scanned document, determining a system font, from a plurality of system fonts, corresponding to the original character; generating, by at least one processor, a synthesized digital font comprising a plurality of synthesized characters corresponding to the set of original characters present in the scanned document; generating, by the at least one processor, an editable version of the scanned document by replacing the set of original characters in the scanned document with corresponding synthesized characters from the plurality of synthesized characters of the synthesized digital font; and enabling editing of the scanned document wherein enabling editing comprises: detecting user input of a new character at a location in the scanned document; identifying a first system font corresponding to a neighboring character of the location of the new character, wherein the first system font is one of the plurality of system fonts and the neighboring character is one of the original characters from set of original characters; adding a synthesized character from the plurality of synthesized characters of the synthesized digital font to the editable version of the scanned document based on the new character, the first system font, and the location. 7. The method of claim 1 , wherein determining the system font for each original character in the set of original characters comprises, for each character in the set of original characters: extracting a monochrome pixmap; and determining the system font, from the plurality of system fonts, that most closely matches the extracted monochrome pixmap. | 0.616484 |
7,526,898 | 7 | 8 | 7. The multiple unit building of claim 3 , wherein each unit includes a semi-private area proximate to the unit and wherein the semi-private area is positioned between the unit and the semi-public area. | 7. The multiple unit building of claim 3 , wherein each unit includes a semi-private area proximate to the unit and wherein the semi-private area is positioned between the unit and the semi-public area. 8. The multiple unit building of claim 7 , wherein each said semi-private area is associated with and proximate to a particular unit and front door into the particular unit. | 0.5 |
9,740,682 | 1 | 7 | 1. A method comprising: receiving, by a computing device, an input natural language text including an input word; searching a semantic register to identify a matching word corresponding to the input word, wherein the semantic register comprises a plurality of records, each record associating a word with a concept of a semantic class; responsive to successfully identifying the matching word, identifying a first plurality of concepts associated with the matching word by the semantic register; ranking a plurality of semantic classes associated with the identified first plurality of concepts according to a probability of the input word being associated with a respective semantic class; selecting a pre-defined number of semantic classes having highest probabilities of the input word being associated with a respective semantic class; iterating through a second plurality of concepts associated, by the semantic register, with the pre-defined number of semantic classes, to identify a concept corresponding to the input word; and responsive to successfully identifying the concept, associating the identified concept with the input word. | 1. A method comprising: receiving, by a computing device, an input natural language text including an input word; searching a semantic register to identify a matching word corresponding to the input word, wherein the semantic register comprises a plurality of records, each record associating a word with a concept of a semantic class; responsive to successfully identifying the matching word, identifying a first plurality of concepts associated with the matching word by the semantic register; ranking a plurality of semantic classes associated with the identified first plurality of concepts according to a probability of the input word being associated with a respective semantic class; selecting a pre-defined number of semantic classes having highest probabilities of the input word being associated with a respective semantic class; iterating through a second plurality of concepts associated, by the semantic register, with the pre-defined number of semantic classes, to identify a concept corresponding to the input word; and responsive to successfully identifying the concept, associating the identified concept with the input word. 7. The method of claim 1 , wherein identifying the concept corresponding to the input word further comprises: identifying, in a parallel natural language text corresponding to the input natural language text, a parallel word corresponding to the input word; and comparing a first context associated the input word to a second context associated with the parallel word in the parallel natural language text. | 0.605825 |
8,442,812 | 22 | 23 | 22. The system as in claim 18 , wherein the text data represents one or more Web pages. | 22. The system as in claim 18 , wherein the text data represents one or more Web pages. 23. The system as in claim 22 , wherein the means for formulating an expression further comprises means for automatically parsing code representing the one or more Web pages to identify the one or more parts. | 0.5 |
8,374,996 | 14 | 16 | 14. A computer-implemented method for identifying contact information for an author of content that is relevant to a topic of interest to a user, the method comprising: receiving, by one or more processors at a first computing system, multiple pieces of content that previously have been published in one or more different media outlets; storing, within a computer memory storage system, at least portions of the received pieces of content that previously have been published; for at least a particular one of the received pieces of content that previously was published, identifying an author of the particular piece of content, wherein identifying an author of the particular piece of content includes identifying a byline for the particular piece of content that specifies the author of the particular piece of content and a media outlet within which the particular piece of content appeared; accessing contact information for each of multiple authors; as a consequence of accessing the contact information for the multiple authors, determining that contact information corresponding to the author of the particular piece of content is included within the accessed contact information; in response to determining that contact information corresponding to the author of the particular piece of content is included within the accessed contact information, establishing a relationship between the particular piece of content and the contact information corresponding to the author of the particular piece of content, wherein establishing a relationship between the particular piece of content and the contact information for the author of the particular piece of content includes creating a database entry that links the byline for the particular piece of content to the contact information for the author of the particular piece of content; receiving, at the first computing system and from a second computing system that is distinct from the first computing system, an indication of a topic of interest to a user; accessing, from the computer memory storage system, at least some of the stored portions of the pieces of content that previously have been published; in response to receiving the indication of the topic of interest, comparing the indication of the topic of interest to the accessed portions of the pieces of content that previously have been published; based on results of comparing the indication of the topic of interest to the accessed portions of the pieces of content that previously have been published, identifying the particular piece of content as being relevant to the topic of interest; in response to identifying the particular piece of content as being relevant to the topic of interest and as a consequence of the established relationship between the particular piece of content and the contact information corresponding to the author of the particular piece of content, identifying the contact information corresponding to the author of the particular piece of content, wherein identifying the contact information for the author of the particular piece of content as a consequence of the established relationship between the particular piece of content and the contact information for the author of the particular piece of content includes: accessing the database entry that links the byline for the particular piece of content to the contact information for the author of the particular piece of content, and identifying the contact information for the author of the particular piece of content based on having accessed the database entry that links the byline for the particular piece of content to the contact information for the author of the particular piece of content; and returning, to the second computing system, an indication of the identity of the author of the particular piece of content and at least some of the identified contact information corresponding to the author of the particular piece of content. | 14. A computer-implemented method for identifying contact information for an author of content that is relevant to a topic of interest to a user, the method comprising: receiving, by one or more processors at a first computing system, multiple pieces of content that previously have been published in one or more different media outlets; storing, within a computer memory storage system, at least portions of the received pieces of content that previously have been published; for at least a particular one of the received pieces of content that previously was published, identifying an author of the particular piece of content, wherein identifying an author of the particular piece of content includes identifying a byline for the particular piece of content that specifies the author of the particular piece of content and a media outlet within which the particular piece of content appeared; accessing contact information for each of multiple authors; as a consequence of accessing the contact information for the multiple authors, determining that contact information corresponding to the author of the particular piece of content is included within the accessed contact information; in response to determining that contact information corresponding to the author of the particular piece of content is included within the accessed contact information, establishing a relationship between the particular piece of content and the contact information corresponding to the author of the particular piece of content, wherein establishing a relationship between the particular piece of content and the contact information for the author of the particular piece of content includes creating a database entry that links the byline for the particular piece of content to the contact information for the author of the particular piece of content; receiving, at the first computing system and from a second computing system that is distinct from the first computing system, an indication of a topic of interest to a user; accessing, from the computer memory storage system, at least some of the stored portions of the pieces of content that previously have been published; in response to receiving the indication of the topic of interest, comparing the indication of the topic of interest to the accessed portions of the pieces of content that previously have been published; based on results of comparing the indication of the topic of interest to the accessed portions of the pieces of content that previously have been published, identifying the particular piece of content as being relevant to the topic of interest; in response to identifying the particular piece of content as being relevant to the topic of interest and as a consequence of the established relationship between the particular piece of content and the contact information corresponding to the author of the particular piece of content, identifying the contact information corresponding to the author of the particular piece of content, wherein identifying the contact information for the author of the particular piece of content as a consequence of the established relationship between the particular piece of content and the contact information for the author of the particular piece of content includes: accessing the database entry that links the byline for the particular piece of content to the contact information for the author of the particular piece of content, and identifying the contact information for the author of the particular piece of content based on having accessed the database entry that links the byline for the particular piece of content to the contact information for the author of the particular piece of content; and returning, to the second computing system, an indication of the identity of the author of the particular piece of content and at least some of the identified contact information corresponding to the author of the particular piece of content. 16. The method of claim 14 wherein: storing, within the computer memory storage system, at least portions of the received pieces of content that previously have been published includes indexing the portions of the received pieces of content that previously have been published; comparing the indication of the topic of interest to the accessed portions of the pieces of content that previously have been published includes comparing the topic of interest to the index of the portions of the pieces of content that previously have been published; and identifying the particular piece of content as being relevant to the topic of interest based on results of comparing the indication of the topic of interest to the accessed portions of the pieces of content that previously have been published includes identifying the particular piece of content as being relevant to the topic of interest based on results of comparing the indication of the topic of interest to the index of the portions of the pieces of content that previously have been published. | 0.541521 |
8,032,517 | 1 | 12 | 1. A computer-aided method for the automatic evaluation of the similarity of two character strings that are stored in a computer or to which the computer has access by means of an interface, the method comprising: locating of associations in the character strings according to a rule stored in the computer; evaluating located associations according to a first rule stored in the computer, whereby cohesive associations—hereinafter also designated as association strings—are evaluated higher for the similarity of the character strings than non-cohesive associations; and deriving of a value, in particular a numerical value, as measure for the similarity of the two character strings from the evaluation of the sought associations according to a second rule stored in the computer, wherein the value for the similarity of the two character strings is constituted by the values of their not overlapping fragments, wherein a fragment is every association and any association string in the two character strings to be compared. | 1. A computer-aided method for the automatic evaluation of the similarity of two character strings that are stored in a computer or to which the computer has access by means of an interface, the method comprising: locating of associations in the character strings according to a rule stored in the computer; evaluating located associations according to a first rule stored in the computer, whereby cohesive associations—hereinafter also designated as association strings—are evaluated higher for the similarity of the character strings than non-cohesive associations; and deriving of a value, in particular a numerical value, as measure for the similarity of the two character strings from the evaluation of the sought associations according to a second rule stored in the computer, wherein the value for the similarity of the two character strings is constituted by the values of their not overlapping fragments, wherein a fragment is every association and any association string in the two character strings to be compared. 12. The method according to claim 1 , wherein the sum of the values of the fragments is added for the evaluation of the similarity of the character strings. | 0.891061 |
9,946,708 | 1 | 5 | 1. A computer program product for identifying word-senses, the computer program product comprising: one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising: program instructions to generate a set of domain tables each comprising one or more arrays of aggregated statistical information corresponding to a plurality of words, one or more word-senses corresponding to the plurality of words, and temporal properties corresponding to the plurality of words, wherein the aggregated statistical information comprises a temporal frequency of occurrence value determined using an n-gram viewer; program instructions to receive a word; program instructions to identify the temporal frequency of occurrence value corresponding to the received word from each domain table in the set of domain tables; program instructions to associate the received word with one or more domain tables in the set of domain tables based on the temporal frequency of occurrence value corresponding to the received word in each of the one or more domain tables meeting a threshold value; and program instructions to identify one or more word-senses corresponding to the received word based on one or more corresponding word-senses in the associated one or more domain tables and based on one or more corresponding word-senses in a corresponding domain dictionary. | 1. A computer program product for identifying word-senses, the computer program product comprising: one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising: program instructions to generate a set of domain tables each comprising one or more arrays of aggregated statistical information corresponding to a plurality of words, one or more word-senses corresponding to the plurality of words, and temporal properties corresponding to the plurality of words, wherein the aggregated statistical information comprises a temporal frequency of occurrence value determined using an n-gram viewer; program instructions to receive a word; program instructions to identify the temporal frequency of occurrence value corresponding to the received word from each domain table in the set of domain tables; program instructions to associate the received word with one or more domain tables in the set of domain tables based on the temporal frequency of occurrence value corresponding to the received word in each of the one or more domain tables meeting a threshold value; and program instructions to identify one or more word-senses corresponding to the received word based on one or more corresponding word-senses in the associated one or more domain tables and based on one or more corresponding word-senses in a corresponding domain dictionary. 5. The computer program product of claim 1 , wherein program instructions to determine the threshold value further comprises: program instructions to receive a set of instructions from a user; and program instructions to receive metadata associated with the received word. | 0.759292 |
7,593,843 | 8 | 13 | 8. The method of claim 1 , wherein calculating a score for each transfer mapping in the set of transfer mappings that describe a select node of the input semantic structure comprises: computing separate scores for a plurality of models; and combining the separate scores to determine the score for each transfer mapping that describe a select node of the input semantic structure. | 8. The method of claim 1 , wherein calculating a score for each transfer mapping in the set of transfer mappings that describe a select node of the input semantic structure comprises: computing separate scores for a plurality of models; and combining the separate scores to determine the score for each transfer mapping that describe a select node of the input semantic structure. 13. The method of claim 8 and further comprising: computing a rank score for each transfer mapping that describe a select node of the input semantic structure, the rank score based on a number of matching binary features in the input semantic structure and the input semantic side of each transfer mapping; and combining the rank score with the separate scores for the plurality of models to determine the score for each transfer mapping that describe a select node of the input semantic structure. | 0.5 |
9,521,047 | 21 | 24 | 21. A non-transitory computer readable storage medium encoding instructions thereon that, in response to execution by one or more processing devices, cause the one or more processing devices to perform operations comprising: causing display of a user interface having a threshold portion associated with a key performance indicator (KPI), the KPI defined by a search query that derives a value from machine data associated with one or more entities that provide a service, the threshold portion enabling a user to indicate one or more thresholds for the KPI and to indicate a per-entity application of the thresholds, each threshold corresponding to a different one of a plurality of KPI states; receiving an indication of the thresholds and of the per-entity application of the thresholds in response to user interaction with the user interface; storing the thresholds in association with a definition of the KPI in accordance with the received indication such that a determining of a KPI state from among a plurality of KPI states is made, for an execution of the search query, on a per-entity basis for at least one of the entities in accordance with the thresholds; and wherein the derived value for the KPI reflects a measure of the performance of the service. | 21. A non-transitory computer readable storage medium encoding instructions thereon that, in response to execution by one or more processing devices, cause the one or more processing devices to perform operations comprising: causing display of a user interface having a threshold portion associated with a key performance indicator (KPI), the KPI defined by a search query that derives a value from machine data associated with one or more entities that provide a service, the threshold portion enabling a user to indicate one or more thresholds for the KPI and to indicate a per-entity application of the thresholds, each threshold corresponding to a different one of a plurality of KPI states; receiving an indication of the thresholds and of the per-entity application of the thresholds in response to user interaction with the user interface; storing the thresholds in association with a definition of the KPI in accordance with the received indication such that a determining of a KPI state from among a plurality of KPI states is made, for an execution of the search query, on a per-entity basis for at least one of the entities in accordance with the thresholds; and wherein the derived value for the KPI reflects a measure of the performance of the service. 24. The non-transitory computer readable storage medium of claim 21 , the operations further comprising: causing display of a user interface portion showing contributions of one or more of the entities and a visual representation of one or more of the plurality of KPI states, wherein the visual representation is determined at least in part by the thresholds. | 0.716535 |
9,077,933 | 4 | 5 | 4. The method as defined in claim 1 , further comprising weighting the relevance ranking score based on viewership ratings. | 4. The method as defined in claim 1 , further comprising weighting the relevance ranking score based on viewership ratings. 5. The method as defined in claim 4 , wherein the viewership ratings are applied on at least one of a day-of-month, a day-of-week or an hour-of-day basis. | 0.5 |
9,685,158 | 1 | 7 | 1. A method, comprising: collecting, by at least one processor, first data associated with prior communications sent to a user, the first data comprising a first profile for a caller that creates a voice message for the user, and the prior communications including at least one prior communication received from the caller; sending, by the at least one processor, to a speech recognition system, the voice message for transcribing using at least a portion of the first data to provide a transcribed message; receiving, from the speech recognition system, the transcribed message; and causing a presentation on a display, the presentation comprising the transcribed message for viewing by the user, and the presentation further comprising a display of options for selection of a corrected word by the user to correct a misspelled word in the transcribed message. | 1. A method, comprising: collecting, by at least one processor, first data associated with prior communications sent to a user, the first data comprising a first profile for a caller that creates a voice message for the user, and the prior communications including at least one prior communication received from the caller; sending, by the at least one processor, to a speech recognition system, the voice message for transcribing using at least a portion of the first data to provide a transcribed message; receiving, from the speech recognition system, the transcribed message; and causing a presentation on a display, the presentation comprising the transcribed message for viewing by the user, and the presentation further comprising a display of options for selection of a corrected word by the user to correct a misspelled word in the transcribed message. 7. The method of claim 1 , further comprising storing the selection of the corrected word, and using the corrected word when transcribing a subsequent voice message. | 0.681467 |
7,720,827 | 23 | 26 | 23. A method for mapping changes to network models in a meta-data library comprising: receiving at least one or more changes associated with one or more telecommunication models; linking one or more portions of one or more stored telecommunication models to the received changes; generating one or more maps of the linked portions; generating one or more transformation models using one or more of the generated maps; and forwarding the one or more transformation models to a mediation unit to enable the generation of one or more normalized models. | 23. A method for mapping changes to network models in a meta-data library comprising: receiving at least one or more changes associated with one or more telecommunication models; linking one or more portions of one or more stored telecommunication models to the received changes; generating one or more maps of the linked portions; generating one or more transformation models using one or more of the generated maps; and forwarding the one or more transformation models to a mediation unit to enable the generation of one or more normalized models. 26. The method as in claim 23 wherein the received changes comprise changes from one or more network elements. | 0.8 |
7,996,403 | 1 | 5 | 1. A method for performing a search request for a name among a database including a plurality of names, the method comprising: receiving the search request for the name; evaluating the name to assign a first cultural classification as a preliminary cultural classification to the name, wherein the first cultural classification is selected from a plurality of cultural classifications, each encompassing a respective plurality of cultural sub-classifications; determining a frequency distribution of the name for at least one country associated with at least one of the plurality of cultural sub-classifications encompassed by the preliminary cultural classification; by operation of one or more computer processors, evaluating the preliminary cultural classification associated with the name to assign a final cultural classification to the name, based on the determined frequency distribution of the name for the at least one country, wherein evaluating the preliminary cultural classification comprises: upon determining that only one cultural sub-classification of the plurality of cultural sub-classifications of the preliminary cultural classification is statistically significant, refining the preliminary cultural classification by assigning the one cultural sub-classification to the name as the final cultural classification to the name; upon determining that more than one cultural sub-classification of the plurality of cultural sub-classifications of the preliminary cultural classification is statistically significant, corroborating the preliminary cultural classification by assigning the preliminary cultural classification as the final cultural classification for the name; and upon determining that none of the plurality of cultural sub-classifications of the preliminary cultural classification are statistically significant and that more than one cultural sub-classification of a second cultural classification is statistically significant, overriding the preliminary cultural classification by assigning the second cultural classification to the name as the final cultural classification for the name; and completing the search request by searching for the name among the plurality of names within the database based on the final cultural classification assigned to the name. | 1. A method for performing a search request for a name among a database including a plurality of names, the method comprising: receiving the search request for the name; evaluating the name to assign a first cultural classification as a preliminary cultural classification to the name, wherein the first cultural classification is selected from a plurality of cultural classifications, each encompassing a respective plurality of cultural sub-classifications; determining a frequency distribution of the name for at least one country associated with at least one of the plurality of cultural sub-classifications encompassed by the preliminary cultural classification; by operation of one or more computer processors, evaluating the preliminary cultural classification associated with the name to assign a final cultural classification to the name, based on the determined frequency distribution of the name for the at least one country, wherein evaluating the preliminary cultural classification comprises: upon determining that only one cultural sub-classification of the plurality of cultural sub-classifications of the preliminary cultural classification is statistically significant, refining the preliminary cultural classification by assigning the one cultural sub-classification to the name as the final cultural classification to the name; upon determining that more than one cultural sub-classification of the plurality of cultural sub-classifications of the preliminary cultural classification is statistically significant, corroborating the preliminary cultural classification by assigning the preliminary cultural classification as the final cultural classification for the name; and upon determining that none of the plurality of cultural sub-classifications of the preliminary cultural classification are statistically significant and that more than one cultural sub-classification of a second cultural classification is statistically significant, overriding the preliminary cultural classification by assigning the second cultural classification to the name as the final cultural classification for the name; and completing the search request by searching for the name among the plurality of names within the database based on the final cultural classification assigned to the name. 5. The method of claim 1 , wherein evaluating the preliminary cultural classification further comprises: upon determining that none of the plurality of cultural sub-classifications of the preliminary cultural classification are statistically significant and that only one cultural sub-classification of the second cultural classification is statistically significant, rejecting the preliminary cultural classification to the name by assigning a generic cultural classification to the name as the final cultural classification for the name. | 0.5 |
9,449,282 | 2 | 4 | 2. The method as recited in claim 1 , wherein the ranking features of each of the plurality of labeled matches further comprise at least one selected from a group consisting of: a query of the first member of the dating website and a query of the corresponding one of the second set of members of the dating website; and wherein the ranking features of each of the unlabeled matches further comprise at least one selected from a group consisting of: the query of the first member of the dating website and a query of the corresponding one of the first set of members of the dating website. | 2. The method as recited in claim 1 , wherein the ranking features of each of the plurality of labeled matches further comprise at least one selected from a group consisting of: a query of the first member of the dating website and a query of the corresponding one of the second set of members of the dating website; and wherein the ranking features of each of the unlabeled matches further comprise at least one selected from a group consisting of: the query of the first member of the dating website and a query of the corresponding one of the first set of members of the dating website. 4. The method as recited in claim 2 , wherein the ranking features of each of the plurality of labeled matches further comprise: match features for which attributes of the dating profile of the first member of the dating website match corresponding attributes in the query of the corresponding one of the second set of members of the dating website; and wherein the ranking features of each of the unlabeled matches further comprise: match features for which the attributes of the dating profile of the first member of the dating website match the corresponding attributes in the query of the corresponding one of the first set of members of the dating website. | 0.5 |
9,570,065 | 16 | 17 | 16. The at least one non-transitory computer-readable storage medium of claim 15 , wherein the identifying comprises: identifying the second speech segment based, at least in part, on how well acoustic characteristics of the second speech segment match acoustic characteristics associated with the desired speaking style. | 16. The at least one non-transitory computer-readable storage medium of claim 15 , wherein the identifying comprises: identifying the second speech segment based, at least in part, on how well acoustic characteristics of the second speech segment match acoustic characteristics associated with the desired speaking style. 17. The at least one non-transitory computer-readable storage medium of claim 16 , wherein the identifying the second speech segment is based, at least in part, on how well prosodic characteristics of the second speech segment match prosodic characteristics associated with the desired speaking style. | 0.522222 |
9,582,639 | 1 | 29 | 1. A computer-implemented method of collecting first and second DNA profile data using first and second different DNA typing technologies about an unidentified remain and first and second DNA profile data of the same first and second DNA typing technologies of each of a selected first and a selected second family member genetically related to a hypothesized identity of the unidentified remain and the first and the second family members being selected via application of a family member selection rule base considering available members of the family for DNA typing, the family member data including first and second DNA profile data obtained from a specimen associated with a selected typed family member and a genetic relationship existing among each of the first and the second selected family member and the hypothesized identity of the unidentified remain, the method for determining one of a likelihood that the unidentified remain corresponds to a missing person genetically related to each of the selected first and second typed family member and that the unidentified remain can be excluded as not consistent with the first and the second selected typed family member, the method for implementation on telecommunications computer apparatus comprising a processor, an input device coupled to the processor comprising one of a touch screen of a display, a camera, a keyboard and a bar code reader for reading one and two dimension bar codes, an output device coupled to the processor comprising a display, a telecommunications interface coupled to the processor, and a memory for storing the first and the second DNA profile data obtained from said unidentified remain and said first and said second DNA profile data obtained from each specimen of said first selected and said second selected typed family member, the memory coupled to the processor, the computer-implemented method comprising: (a) storing the first and the second DNA profile data obtained from typing said unidentified remain using the first and the second DNA typing technologies in said memory via said bar code reader input device for reading a one dimension bar code uniquely identifying the unidentified remain and two different associated two dimension bar codes for transformation to the first and the second DNA profile data of the two different typing technologies for the unidentified remain; (b) storing a genetic relationship in said memory among said hypothesized identity of said unidentified remain of said missing person and each of said first and said second selected family member and family member and hypothesized identity identification data input via said input device; (c) storing said first and said second DNA profile data of each of the first and the second selected family member in said memory, each of the first and the second selected family members uniquely identified by a one dimension bar code and their associated first and second DNA profile data represented by two different two dimension bar codes being uniquely transformable into first and second DNA profile data of the first and the second DNA typing technologies, said first and said second DNA profile data obtained from the specimen associated with each of the first and the second selected typed family member and storing said first and said second DNA profile data from the unidentified remain, said first and said second family member DNA profile data for each of said first and said second selected typed family member being identified with a different two-dimensional bar code representing the same first and second typing technologies used for typing the unidentified remain; (d) displaying a family pedigree representing genetic relationships among the first and the second family members and the hypothesized identity of the unidentified remain, the family pedigree displayed on said display, said family pedigree being responsive to input received by said input device, said input causing information about a selected family member to be displayed including the stored DNA profile data associated with the selected family member, an identity being input by the input device and at least one of a first and a second type of collected DNA profile data each indicated by a predetermined color, each type comprising one of STR, Y-STR and mitochondrial DNA, at least one DNA typing technology comprising STR; (e) evaluating the genetic consistency of said stored genetic relationship by computing a pedigree likelihood ratio for each of said stored first and said second DNA typing technologies using said DNA profile data of each of said selected typed family member with said first and said second DNA profile data of said unidentified remain and a joint likelihood ratio computed as the product of the pedigree likelihood ratios; and (f) using the computed joint likelihood ratio to output a decision whether said stored genetic relationship and said stored first and said second DNA profile data obtained from the specimen associated with the first and second selected typed family member and said unidentified remain are consistent and outputting a decision of whether there exists one of said genetic relationship among the first and second family members and the hypothesized identity of the unidentified remain and exclusion of said genetic relationship among the first and second family members and the unidentified remain, including computing of the pedigree likelihood ratio according to evaluating the genetic consistency using a modified Elston Stewart algorithm for determining a likelihood that the unidentified remain corresponds to a missing person genetically related to each of the typed first and second second family member or can be excluded as not consistent with the typed first and second selected available family member, the modification expressing a probability of mutation. | 1. A computer-implemented method of collecting first and second DNA profile data using first and second different DNA typing technologies about an unidentified remain and first and second DNA profile data of the same first and second DNA typing technologies of each of a selected first and a selected second family member genetically related to a hypothesized identity of the unidentified remain and the first and the second family members being selected via application of a family member selection rule base considering available members of the family for DNA typing, the family member data including first and second DNA profile data obtained from a specimen associated with a selected typed family member and a genetic relationship existing among each of the first and the second selected family member and the hypothesized identity of the unidentified remain, the method for determining one of a likelihood that the unidentified remain corresponds to a missing person genetically related to each of the selected first and second typed family member and that the unidentified remain can be excluded as not consistent with the first and the second selected typed family member, the method for implementation on telecommunications computer apparatus comprising a processor, an input device coupled to the processor comprising one of a touch screen of a display, a camera, a keyboard and a bar code reader for reading one and two dimension bar codes, an output device coupled to the processor comprising a display, a telecommunications interface coupled to the processor, and a memory for storing the first and the second DNA profile data obtained from said unidentified remain and said first and said second DNA profile data obtained from each specimen of said first selected and said second selected typed family member, the memory coupled to the processor, the computer-implemented method comprising: (a) storing the first and the second DNA profile data obtained from typing said unidentified remain using the first and the second DNA typing technologies in said memory via said bar code reader input device for reading a one dimension bar code uniquely identifying the unidentified remain and two different associated two dimension bar codes for transformation to the first and the second DNA profile data of the two different typing technologies for the unidentified remain; (b) storing a genetic relationship in said memory among said hypothesized identity of said unidentified remain of said missing person and each of said first and said second selected family member and family member and hypothesized identity identification data input via said input device; (c) storing said first and said second DNA profile data of each of the first and the second selected family member in said memory, each of the first and the second selected family members uniquely identified by a one dimension bar code and their associated first and second DNA profile data represented by two different two dimension bar codes being uniquely transformable into first and second DNA profile data of the first and the second DNA typing technologies, said first and said second DNA profile data obtained from the specimen associated with each of the first and the second selected typed family member and storing said first and said second DNA profile data from the unidentified remain, said first and said second family member DNA profile data for each of said first and said second selected typed family member being identified with a different two-dimensional bar code representing the same first and second typing technologies used for typing the unidentified remain; (d) displaying a family pedigree representing genetic relationships among the first and the second family members and the hypothesized identity of the unidentified remain, the family pedigree displayed on said display, said family pedigree being responsive to input received by said input device, said input causing information about a selected family member to be displayed including the stored DNA profile data associated with the selected family member, an identity being input by the input device and at least one of a first and a second type of collected DNA profile data each indicated by a predetermined color, each type comprising one of STR, Y-STR and mitochondrial DNA, at least one DNA typing technology comprising STR; (e) evaluating the genetic consistency of said stored genetic relationship by computing a pedigree likelihood ratio for each of said stored first and said second DNA typing technologies using said DNA profile data of each of said selected typed family member with said first and said second DNA profile data of said unidentified remain and a joint likelihood ratio computed as the product of the pedigree likelihood ratios; and (f) using the computed joint likelihood ratio to output a decision whether said stored genetic relationship and said stored first and said second DNA profile data obtained from the specimen associated with the first and second selected typed family member and said unidentified remain are consistent and outputting a decision of whether there exists one of said genetic relationship among the first and second family members and the hypothesized identity of the unidentified remain and exclusion of said genetic relationship among the first and second family members and the unidentified remain, including computing of the pedigree likelihood ratio according to evaluating the genetic consistency using a modified Elston Stewart algorithm for determining a likelihood that the unidentified remain corresponds to a missing person genetically related to each of the typed first and second second family member or can be excluded as not consistent with the typed first and second selected available family member, the modification expressing a probability of mutation. 29. The method of claim 1 wherein said first and said second DNA profile data comprises DNA profile data of one of a selected known available individual member of a family by genetic relationship to another known available individual member of the family and having a genetic family relationship to hypothesized identity of an unidentified remain of a missing person using the same two typing technologies for the first and second selected available family members and for the unidentified remain, one set of first and second DNA profile data taken via STR typing being uniquely transformable to loci data by a two dimension bar code by the input device. | 0.5 |
8,880,430 | 1 | 20 | 1. A computer-implemented method for identifying an on-line bank account utilized for business purposes, the method being performed by a computer and comprising: the computer parsing data of an on-line bank account into a plurality of segments; the computer applying a first set of rules to individual segments and a second set of rules to groups of multiple segments; and the computer determining whether the on-line bank account is a business account or utilized for business purposes based at least in part upon respective scores generated by application of respective first and second sets of rules. | 1. A computer-implemented method for identifying an on-line bank account utilized for business purposes, the method being performed by a computer and comprising: the computer parsing data of an on-line bank account into a plurality of segments; the computer applying a first set of rules to individual segments and a second set of rules to groups of multiple segments; and the computer determining whether the on-line bank account is a business account or utilized for business purposes based at least in part upon respective scores generated by application of respective first and second sets of rules. 20. The method of claim 1 , applying the second set of rules resulting in assigning respective scores to respective groups of segments, the computer determining whether the on-line bank account is a business account or utilized for business purposes based at least in part upon the respective scores for respective groups of segments. | 0.604265 |
9,160,993 | 17 | 18 | 17. The non-transitory computer readable storage medium of claim 16 , further comprising instructions executed by the one or more processors to perform the set of operations of: receiving a search query; wherein analyzing the image to identify the object is based at least in part on the search query; and wherein the graphical element at least partially highlights the object. | 17. The non-transitory computer readable storage medium of claim 16 , further comprising instructions executed by the one or more processors to perform the set of operations of: receiving a search query; wherein analyzing the image to identify the object is based at least in part on the search query; and wherein the graphical element at least partially highlights the object. 18. The non-transitory computer readable storage medium of claim 17 , further comprising instructions executed by the one or more processors to perform the set of operations of: projecting a first graphical element proximate to the object before acquiring the image of the object. | 0.5 |
9,520,126 | 10 | 13 | 10. The system of claim 9 , wherein the mobile terminal receives the voice recognition target word, and performs the voice recognition for the voice recognition target word based on the specific domain search space and the general domain search space when the specific domain search space is present and requests creating the specific domain search space to the voice recognition server to receive the created specific domain search space when the specific domain search space is not present. | 10. The system of claim 9 , wherein the mobile terminal receives the voice recognition target word, and performs the voice recognition for the voice recognition target word based on the specific domain search space and the general domain search space when the specific domain search space is present and requests creating the specific domain search space to the voice recognition server to receive the created specific domain search space when the specific domain search space is not present. 13. The system of claim 10 , wherein the mobile terminal judges whether the specific domain search space is charged and when the specific domain search space is charged, the mobile terminal loads the specific domain search space. | 0.796263 |
9,396,266 | 4 | 5 | 4. The method as claimed in claim 1 , wherein the search query is submitted by way of a software application embedded within or provided as a plug-in for a web-browser GUI. | 4. The method as claimed in claim 1 , wherein the search query is submitted by way of a software application embedded within or provided as a plug-in for a web-browser GUI. 5. The method as claimed in claim 4 , wherein the software application is a client-side application. | 0.5 |
9,640,180 | 1 | 15 | 1. A computer-implemented method comprising: receiving, by a computer-implemented agent specific to a user device, a digital representation of speech encoding an utterance; determining, by the computer-implemented agent, that the utterance specifies a request for another computer-implemented agent represented by data, stored on the user device, that identifies a particular style of expression for the other computer-implemented agent from among two or more different styles of expression for a particular language; receiving, by the user device, identification of a response to the utterance from the other computer-implemented agent; determining, by the user device, the particular style of expression for the other computer-implemented agent to use for presentation of the response; and presenting, by the user device, the response to the utterance received from the other computer-implemented agent according to the particular style of expression. | 1. A computer-implemented method comprising: receiving, by a computer-implemented agent specific to a user device, a digital representation of speech encoding an utterance; determining, by the computer-implemented agent, that the utterance specifies a request for another computer-implemented agent represented by data, stored on the user device, that identifies a particular style of expression for the other computer-implemented agent from among two or more different styles of expression for a particular language; receiving, by the user device, identification of a response to the utterance from the other computer-implemented agent; determining, by the user device, the particular style of expression for the other computer-implemented agent to use for presentation of the response; and presenting, by the user device, the response to the utterance received from the other computer-implemented agent according to the particular style of expression. 15. The method of claim 1 wherein determining, by the computer-implemented agent, that the utterance specifies a request for the other computer-implemented agent comprises: determining, by the computer-implemented agent using the utterance, that the utterance is not specific to a particular second computer-implemented agent; determining, by the computer-implemented agent using the utterance, two or more second computer-implemented agents each of which can respond to the utterance; providing a prompt that requests selection of one of the second computer-implemented agents; receiving indication of a selected one of the second computer-implemented agents; and determining, by the computer-implemented agent, that the utterance specifies a requirement to establish a communication with the selected one of the second computer-implemented agents. | 0.5 |
8,321,371 | 16 | 19 | 16. The method of claim 15 , wherein determining an appropriate response template comprises: dividing the input into word segments; traversing the attribute trie with the input to determine matching attributes; traversing the “that” trie to determine matching “that” patterns from a previous output; traversing the megacategory trie with matching attributes patterns and matching “that” patterns to determine matching megacategories. | 16. The method of claim 15 , wherein determining an appropriate response template comprises: dividing the input into word segments; traversing the attribute trie with the input to determine matching attributes; traversing the “that” trie to determine matching “that” patterns from a previous output; traversing the megacategory trie with matching attributes patterns and matching “that” patterns to determine matching megacategories. 19. The method of claim 16 , further comprising: if more than one megacategory matches, selecting a response template corresponding to a megacategory having the highest summed specificity rank from the set of patterns. | 0.5 |
9,195,660 | 1 | 11 | 1. A computer-implemented method performed by a processor, the method comprising: obtaining a contextual property of a notation to be used in a diagram, wherein the diagram is visual illustration comprising notations and adhering, at least loosely, to grammar of a modeling language, wherein the contextual property defines a context of a usage of the notation in the diagram with respect to the modeling language, and wherein the notation is a graphic symbol; and searching in a notation-base for notations, whereby a search result set is obtained, wherein the search result set comprises notations that were previously used in one or more diagrams in a similar context to the contextual property, wherein the one or more diagrams are visual illustrations adhering, at least loosely, to grammar of the modeling language, wherein the notation-base is stored in a data storage. | 1. A computer-implemented method performed by a processor, the method comprising: obtaining a contextual property of a notation to be used in a diagram, wherein the diagram is visual illustration comprising notations and adhering, at least loosely, to grammar of a modeling language, wherein the contextual property defines a context of a usage of the notation in the diagram with respect to the modeling language, and wherein the notation is a graphic symbol; and searching in a notation-base for notations, whereby a search result set is obtained, wherein the search result set comprises notations that were previously used in one or more diagrams in a similar context to the contextual property, wherein the one or more diagrams are visual illustrations adhering, at least loosely, to grammar of the modeling language, wherein the notation-base is stored in a data storage. 11. The computer-implemented method of claim 1 , further comprising obtaining a set of existing diagrams; and with respect to each existing diagram: determining contextual property of each utilized notation which is used in the existing diagram; and updating the notation-base to reflect usage of the utilized notation. | 0.580263 |
9,613,023 | 7 | 13 | 7. A computer-implemented method for developing and updating ethnic and cultural emoticon dictionaries through crowdsourcing, comprising the steps of: (A) a computer system receiving from a smart device of at least a member of an ethnic or cultural group a new emoticon for inclusion in a downloadable ethnic or cultural emoticon dictionary with the new emoticon including at least a visual image and a written meaning of the new emoticon, and with the member of the ethnic or cultural group transmitting with the new emoticon a primary dictionary to which the new emoticon is requesting to be included; (B) the computer system comparing the new emoticon received at step (A) with emoticons that currently exist in the primary dictionary to which the new emoticon is requesting to be included and all secondary dictionaries that are stored in computer system databases, and if there is a match of the new emoticon's visual image and written meaning with a visual image and written meaning of any emoticons that exist in the primary dictionary, then step (F), otherwise step (C); (C) the computer system comparing the new emoticon's visual image and written meaning with the visual image and written meaning of emoticons that are stored in a dropped emoticon archive of the computer system databases, if there is no match of the new emoticon's visual image and written meaning or there is only a match of the new emoticon's visual image or written meaning but not both, then step (D), and if there is a match of the new emoticon's visual image and written meaning with the visual image and written meaning of any emoticons in the dropped emoticon archive, then step (G); (D) the computer system posting the new emoticon for crowdsource evaluation in the computer system databases accessible by third parties for a predetermined period of time and the computer system compiling the evaluation and transmitting same to an evaluation system to determine if there is consensus from the evaluations of the new emoticon's image and meaning for adding the new emoticon to the primary dictionary and if there is consensus, the evaluation system transmitting instructions to the computer system to add the new emoticon to the primary dictionary; (E) the computer system processing the instructions from the evaluation system and posting the new emoticon in the downloadable primary dictionary, then step (G); (F) the computer system receiving the new emoticon will cease processing the new emoticon; and (G) the consumer system awaiting receipt of another new emoticon and upon receipt of a new emoticon then step (A). | 7. A computer-implemented method for developing and updating ethnic and cultural emoticon dictionaries through crowdsourcing, comprising the steps of: (A) a computer system receiving from a smart device of at least a member of an ethnic or cultural group a new emoticon for inclusion in a downloadable ethnic or cultural emoticon dictionary with the new emoticon including at least a visual image and a written meaning of the new emoticon, and with the member of the ethnic or cultural group transmitting with the new emoticon a primary dictionary to which the new emoticon is requesting to be included; (B) the computer system comparing the new emoticon received at step (A) with emoticons that currently exist in the primary dictionary to which the new emoticon is requesting to be included and all secondary dictionaries that are stored in computer system databases, and if there is a match of the new emoticon's visual image and written meaning with a visual image and written meaning of any emoticons that exist in the primary dictionary, then step (F), otherwise step (C); (C) the computer system comparing the new emoticon's visual image and written meaning with the visual image and written meaning of emoticons that are stored in a dropped emoticon archive of the computer system databases, if there is no match of the new emoticon's visual image and written meaning or there is only a match of the new emoticon's visual image or written meaning but not both, then step (D), and if there is a match of the new emoticon's visual image and written meaning with the visual image and written meaning of any emoticons in the dropped emoticon archive, then step (G); (D) the computer system posting the new emoticon for crowdsource evaluation in the computer system databases accessible by third parties for a predetermined period of time and the computer system compiling the evaluation and transmitting same to an evaluation system to determine if there is consensus from the evaluations of the new emoticon's image and meaning for adding the new emoticon to the primary dictionary and if there is consensus, the evaluation system transmitting instructions to the computer system to add the new emoticon to the primary dictionary; (E) the computer system processing the instructions from the evaluation system and posting the new emoticon in the downloadable primary dictionary, then step (G); (F) the computer system receiving the new emoticon will cease processing the new emoticon; and (G) the consumer system awaiting receipt of another new emoticon and upon receipt of a new emoticon then step (A). 13. The method as recited in claim 7 , wherein the smart device includes a mobile device, tablet device, or laptop. | 0.737443 |
8,996,622 | 1 | 5 | 1. A method, comprising: generating by a network device one or more graphs using data obtained from a query log, the one or more graphs including an anticlick graph, wherein the anticlick graph represents information pertaining to documents in previously provided search results that, according to the data obtained from the query log, have not been clicked by a user that submitted a corresponding search query and does not represent information pertaining to documents in the previously provided search results that, according to the data obtained from the query log, have been clicked by the user that submitted the corresponding search query, wherein the anticlick graph includes one or more nodes representing or corresponding to documents that, according to the data obtained from the query log, have not been clicked by the user that submitted the corresponding search query; ascertaining by the network device values of one or more syntactic features of the one or more graphs; determining by the network device values of one or more semantic features of the one or more graphs by propagating categories from a web directory among nodes in each of the one or more graphs; and detecting by the network device spam hosts based upon the values of the syntactic features and the semantic features; wherein the anti-click graph includes a host-based graph or a document-based graph, wherein the nodes of the host-based graph includes one or more host nodes representing hosts corresponding to the documents that, according to the data obtained from the query log, have not been clicked by the user that submitted the corresponding search query, and wherein the nodes of the document-based graph includes one or more document nodes representing the documents that, according to the data obtained from the query log, have not been clicked by the user that submitted the corresponding search query. | 1. A method, comprising: generating by a network device one or more graphs using data obtained from a query log, the one or more graphs including an anticlick graph, wherein the anticlick graph represents information pertaining to documents in previously provided search results that, according to the data obtained from the query log, have not been clicked by a user that submitted a corresponding search query and does not represent information pertaining to documents in the previously provided search results that, according to the data obtained from the query log, have been clicked by the user that submitted the corresponding search query, wherein the anticlick graph includes one or more nodes representing or corresponding to documents that, according to the data obtained from the query log, have not been clicked by the user that submitted the corresponding search query; ascertaining by the network device values of one or more syntactic features of the one or more graphs; determining by the network device values of one or more semantic features of the one or more graphs by propagating categories from a web directory among nodes in each of the one or more graphs; and detecting by the network device spam hosts based upon the values of the syntactic features and the semantic features; wherein the anti-click graph includes a host-based graph or a document-based graph, wherein the nodes of the host-based graph includes one or more host nodes representing hosts corresponding to the documents that, according to the data obtained from the query log, have not been clicked by the user that submitted the corresponding search query, and wherein the nodes of the document-based graph includes one or more document nodes representing the documents that, according to the data obtained from the query log, have not been clicked by the user that submitted the corresponding search query. 5. The method as recited in claim 1 , wherein the one or more graphs further comprise a click graph and a view graph. | 0.907583 |
9,224,391 | 5 | 6 | 5. The method as claimed in claim 4 , wherein each instantaneous confidence score (C ist (t)) is computed according to the following formula: Cist ( t ) = 1 2 T + 1 ∑ t = - n - T n + T Conf ( t ) wherein (Conf(t)) is said confidence measure, and 2T+1 is width of said moving window centered at time t. | 5. The method as claimed in claim 4 , wherein each instantaneous confidence score (C ist (t)) is computed according to the following formula: Cist ( t ) = 1 2 T + 1 ∑ t = - n - T n + T Conf ( t ) wherein (Conf(t)) is said confidence measure, and 2T+1 is width of said moving window centered at time t. 6. The method as claimed in claim 5 , wherein said first relation is defined by said instantaneous confidence scores being lower than a given threshold. | 0.5 |
9,996,510 | 11 | 15 | 11. A non-transitory computer readable medium having instructions stored thereon, wherein the instructions are executable by at least one computer processor to perform a method, the method comprising: (A) applying automatic speech recognition to an audio signal to produce a structured document representing contents of the audio signal; (B) determining whether the structured document includes an indication of compliance for each of a plurality of best practices to produce a conclusion, the plurality of best practices related to at least one action required to be taken before completion of the structured document, at least one of the plurality of best practices including at least one of a heuristic and a procedure for drawing a conclusion about whether the structured document fails to comply with a standard applicable to the structured document; and (C) inserting content into the structured document, based on the conclusion, to produce a modified structured document, wherein inserting further comprises: (C)(1) obtaining the content from a data source without human input; and (C)(2) inserting the content into the structured document. | 11. A non-transitory computer readable medium having instructions stored thereon, wherein the instructions are executable by at least one computer processor to perform a method, the method comprising: (A) applying automatic speech recognition to an audio signal to produce a structured document representing contents of the audio signal; (B) determining whether the structured document includes an indication of compliance for each of a plurality of best practices to produce a conclusion, the plurality of best practices related to at least one action required to be taken before completion of the structured document, at least one of the plurality of best practices including at least one of a heuristic and a procedure for drawing a conclusion about whether the structured document fails to comply with a standard applicable to the structured document; and (C) inserting content into the structured document, based on the conclusion, to produce a modified structured document, wherein inserting further comprises: (C)(1) obtaining the content from a data source without human input; and (C)(2) inserting the content into the structured document. 15. The computer readable medium of claim 11 , further comprising producing a conclusion that information is missing from the structured document. | 0.78209 |
8,990,225 | 1 | 2 | 1. A computer-executed method for filtering outbound content via inference detection, the method comprising: identifying previously sent content associated with a common first destination identifier; extracting a set of keywords from the identified previously sent content; issuing a set of web search queries that each includes one or more of the extracted keywords to obtain a set of search results; extracting a set of candidate keywords from the set of search results; performing inference detection using the set of search results for the extracted keywords; determining, from the set of candidate keywords, a set of expected-content keywords which are determined to be representative of the previously sent content based on the inference detection; responsive to receiving a piece of outbound content, determining whether the outbound content is proper, which involves performing one of: determining that the outbound content is associated with the first destination identifier, and the number of expected-content keywords present in the outbound content is below a first predetermined threshold; and determining that the outbound content is not associated with the first destination identifier, and the number of expected-content keywords present in the outbound content is above a second predetermined threshold; and; and responsive to the outbound content being improper, displaying the destination identifier for the outbound content and at least one expected-content keyword present in the outbound content. | 1. A computer-executed method for filtering outbound content via inference detection, the method comprising: identifying previously sent content associated with a common first destination identifier; extracting a set of keywords from the identified previously sent content; issuing a set of web search queries that each includes one or more of the extracted keywords to obtain a set of search results; extracting a set of candidate keywords from the set of search results; performing inference detection using the set of search results for the extracted keywords; determining, from the set of candidate keywords, a set of expected-content keywords which are determined to be representative of the previously sent content based on the inference detection; responsive to receiving a piece of outbound content, determining whether the outbound content is proper, which involves performing one of: determining that the outbound content is associated with the first destination identifier, and the number of expected-content keywords present in the outbound content is below a first predetermined threshold; and determining that the outbound content is not associated with the first destination identifier, and the number of expected-content keywords present in the outbound content is above a second predetermined threshold; and; and responsive to the outbound content being improper, displaying the destination identifier for the outbound content and at least one expected-content keyword present in the outbound content. 2. The method of claim 1 , wherein determining the set of expected-content keywords from the search results comprises ranking the expected-content keywords. | 0.696498 |
8,725,756 | 12 | 16 | 12. A system comprising: one or more computers including: a search interface configured to: receive, from a user device, a first search query during a current search session, the first search query comprising one or more first query terms; receive, from the user device, an additional search query during the current search session, the additional search query comprising one or more additional query terms and the additional search query being received subsequent to search results for the first search query being provided in response to the first search query; and a session-based search query suggestion module configured to: store search queries included in a current search session to a session data store and to a query log, organize previous search queries in the query log into a set of previous search sessions based on associations between the previous search queries, each previous search session having concluded prior to the current search session; identify a similar subset of previous search sessions from the set of previous search sessions, each individual previous search session of the similar subset being identified for inclusion in the similar subset based on the individual previous search session being a search session during which the first search query and the additional search query were both received, the similar subset lacking at least one previous search session of the set of previous search sessions; identify, from the similar subset of previous search sessions, a set of follow-up search queries, each follow-up search query being a search query that was received subsequent to receipt of the first search query and the additional search query in at least one of the previous search sessions of the similar subset; identify, for each follow-up search query, a frequency at which the follow-up search query was received in previous search sessions subsequent to receipt of the first search query and the additional search query; aggregate the set of follow-up search queries from the similar subset of previous search sessions; select, from the aggregated follow-up search queries and based on the identified frequencies that have the highest frequency of occurrence, a suggested search query for presentation in response to receipt of the additional search query during the current search session; wherein the search interface is configured to receive the suggested search query and to provide the suggested search query with search results for the additional search query to the user. | 12. A system comprising: one or more computers including: a search interface configured to: receive, from a user device, a first search query during a current search session, the first search query comprising one or more first query terms; receive, from the user device, an additional search query during the current search session, the additional search query comprising one or more additional query terms and the additional search query being received subsequent to search results for the first search query being provided in response to the first search query; and a session-based search query suggestion module configured to: store search queries included in a current search session to a session data store and to a query log, organize previous search queries in the query log into a set of previous search sessions based on associations between the previous search queries, each previous search session having concluded prior to the current search session; identify a similar subset of previous search sessions from the set of previous search sessions, each individual previous search session of the similar subset being identified for inclusion in the similar subset based on the individual previous search session being a search session during which the first search query and the additional search query were both received, the similar subset lacking at least one previous search session of the set of previous search sessions; identify, from the similar subset of previous search sessions, a set of follow-up search queries, each follow-up search query being a search query that was received subsequent to receipt of the first search query and the additional search query in at least one of the previous search sessions of the similar subset; identify, for each follow-up search query, a frequency at which the follow-up search query was received in previous search sessions subsequent to receipt of the first search query and the additional search query; aggregate the set of follow-up search queries from the similar subset of previous search sessions; select, from the aggregated follow-up search queries and based on the identified frequencies that have the highest frequency of occurrence, a suggested search query for presentation in response to receipt of the additional search query during the current search session; wherein the search interface is configured to receive the suggested search query and to provide the suggested search query with search results for the additional search query to the user. 16. The system of claim 12 , wherein the session-based search query suggestion module is further configured to aggregate search queries that immediately follow the first search query and the additional search query in each of the individual previous search sessions of the similar subset. | 0.59322 |
8,423,555 | 10 | 12 | 10. An apparatus comprising: a processor; and memory operatively coupled to the processor and storing computer readable instructions that, when executed, cause the apparatus to: receive text associated with a content item, the text including a plurality of term strings, each term string including one or more terms; determine a set of relevance intervals for a corresponding set of terms in the text, wherein each relevance interval of the set of relevance intervals identifies one or more sections of the content item that are relevant to a corresponding term; generate a first set of nodes for a first term string from the plurality of term strings, wherein the first set of nodes includes a node for each term in the first term string, and at least one node for a term different from the terms in the first term string but whose corresponding relevance interval includes the first term string; generate a second set of nodes for a second term string from the plurality of term strings, wherein the second set of nodes includes a node for each term in the second term string, and at least one node for a term different from the terms in the second term string but whose corresponding relevance interval includes the second term string; and determine a plurality of connections between nodes in the first set of nodes and the second set of nodes, wherein the plurality of connections includes a subset for a first node from the first set of nodes, wherein the subset for the first node includes a connection for each node from the second set of nodes; and use the first set of nodes, the second set of nodes or the plurality of connections to identify one or more segment boundaries within the content item. | 10. An apparatus comprising: a processor; and memory operatively coupled to the processor and storing computer readable instructions that, when executed, cause the apparatus to: receive text associated with a content item, the text including a plurality of term strings, each term string including one or more terms; determine a set of relevance intervals for a corresponding set of terms in the text, wherein each relevance interval of the set of relevance intervals identifies one or more sections of the content item that are relevant to a corresponding term; generate a first set of nodes for a first term string from the plurality of term strings, wherein the first set of nodes includes a node for each term in the first term string, and at least one node for a term different from the terms in the first term string but whose corresponding relevance interval includes the first term string; generate a second set of nodes for a second term string from the plurality of term strings, wherein the second set of nodes includes a node for each term in the second term string, and at least one node for a term different from the terms in the second term string but whose corresponding relevance interval includes the second term string; and determine a plurality of connections between nodes in the first set of nodes and the second set of nodes, wherein the plurality of connections includes a subset for a first node from the first set of nodes, wherein the subset for the first node includes a connection for each node from the second set of nodes; and use the first set of nodes, the second set of nodes or the plurality of connections to identify one or more segment boundaries within the content item. 12. The apparatus of claim 10 , wherein the memory further stores computer readable instructions that, when executed, cause the apparatus to: filter the plurality of connections based on at least one of a number of connections between the first set of nodes and the second set of nodes, or a cumulative value of connection strengths associated with the plurality of connections. | 0.5 |
9,026,851 | 1 | 2 | 1. A computer-implemented method for proactive customer experience management in a communication network, comprising: a) obtaining a performance-indicating alert (PA) from at least one probe; b) identifying relevant alerts from an alert database in absence of possible fault condition from the PA; c) determining a possible problem condition from the PA and the identified relevant alerts; d) raising trace trigger for gathering relevant trace data; e) determining specific problem condition and relevant cause, based on gathered trace data and relevant data from PM/FM, CDR and OSS systems; f) determining appropriate recommendation for resolution of the determined specific problem condition; g) recalculating a probe alert threshold value for triggering the performance-indicating probe alert; h) providing the recalculated probe alert threshold value for modifying a configuration of a performance-indicating probe; i) updating a user interface dashboard using the determination of a root cause of the possible problem and the recommendation for resolution of the possible problem; and j) updating new knowledge into a knowledge base with problem-context, resolution, relevant adjustments to alerts, thresholds and rules. | 1. A computer-implemented method for proactive customer experience management in a communication network, comprising: a) obtaining a performance-indicating alert (PA) from at least one probe; b) identifying relevant alerts from an alert database in absence of possible fault condition from the PA; c) determining a possible problem condition from the PA and the identified relevant alerts; d) raising trace trigger for gathering relevant trace data; e) determining specific problem condition and relevant cause, based on gathered trace data and relevant data from PM/FM, CDR and OSS systems; f) determining appropriate recommendation for resolution of the determined specific problem condition; g) recalculating a probe alert threshold value for triggering the performance-indicating probe alert; h) providing the recalculated probe alert threshold value for modifying a configuration of a performance-indicating probe; i) updating a user interface dashboard using the determination of a root cause of the possible problem and the recommendation for resolution of the possible problem; and j) updating new knowledge into a knowledge base with problem-context, resolution, relevant adjustments to alerts, thresholds and rules. 2. The method of claim 1 , wherein the relevant alerts are identified from the alert database using a rules engine applying pre-defined rules. | 0.736059 |
9,584,991 | 18 | 24 | 18. A computer program product comprising a non-transitory computer usable medium having control logic stored therein for causing a computer processor to enable communications between one or more mobile device(s) using interactive cryptic text and for accessing social network, said control logic comprising: computer readable program code for launching an interaction application configured for communicating between one or more mobile devices using interactive cryptic text and for accessing the social network; computer readable program code for enabling communication between a first mobile device and a second mobile device; computer readable program code for activating privacy controls for intercepting electronic transmissions; computer readable program code for intercepting the incoming transmission for controlling the display of the electronic transmissions on the mobile device computer readable program code for determining presence of an indicator tag for incoming and/or outgoing decoded messages identifying messages for which there is a corresponding cryptic text and for converting the at least one decoded message into cryptic text for displaying on a display; and computer readable program code for enabling user interaction with the cryptic texts via at least one icon, which are embedded with code configured to enable different user interactions with the cryptic text, wherein the embedded code may be executed by dragging the at least one icon to a code execution area of the display. | 18. A computer program product comprising a non-transitory computer usable medium having control logic stored therein for causing a computer processor to enable communications between one or more mobile device(s) using interactive cryptic text and for accessing social network, said control logic comprising: computer readable program code for launching an interaction application configured for communicating between one or more mobile devices using interactive cryptic text and for accessing the social network; computer readable program code for enabling communication between a first mobile device and a second mobile device; computer readable program code for activating privacy controls for intercepting electronic transmissions; computer readable program code for intercepting the incoming transmission for controlling the display of the electronic transmissions on the mobile device computer readable program code for determining presence of an indicator tag for incoming and/or outgoing decoded messages identifying messages for which there is a corresponding cryptic text and for converting the at least one decoded message into cryptic text for displaying on a display; and computer readable program code for enabling user interaction with the cryptic texts via at least one icon, which are embedded with code configured to enable different user interactions with the cryptic text, wherein the embedded code may be executed by dragging the at least one icon to a code execution area of the display. 24. The computer program product of claim 18 further comprising computer readable program code for converting the selected at least one or more message icons into cryptic text. | 0.610619 |
8,665,216 | 2 | 4 | 2. A method of navigating among GUI elements represented in display data extracted from a computer memory, employing a tactile mouse having at least one tactile display and at least one command input control, said method comprising: a. extracting display data from among the GUI elements displayed on the computer screen; b. identifying the GUI elements among the extracted display data; c. reorganizing the GUI elements into a new logical hierarchical structure of GUI elements, said new hierarchical structure having at least two hierarchical levels and being navigable by predetermined directional inputs to the tactile mouse; d. displaying in tactile form upon a tactile display descriptors relating to a first GUI element in said new hierarchical structure; e. sensing input from the tactile mouse, said input including spatial motion of the tactile mouse, and input of commands via the at least one input control; f. in response to said input from the tactile mouse, selecting a second GUI element from said new hierarchical structure in accordance with a navigational mode selected by a user from among a plurality of predetermined different navigational modes; and g. indicating the selected second GUI element to the user. | 2. A method of navigating among GUI elements represented in display data extracted from a computer memory, employing a tactile mouse having at least one tactile display and at least one command input control, said method comprising: a. extracting display data from among the GUI elements displayed on the computer screen; b. identifying the GUI elements among the extracted display data; c. reorganizing the GUI elements into a new logical hierarchical structure of GUI elements, said new hierarchical structure having at least two hierarchical levels and being navigable by predetermined directional inputs to the tactile mouse; d. displaying in tactile form upon a tactile display descriptors relating to a first GUI element in said new hierarchical structure; e. sensing input from the tactile mouse, said input including spatial motion of the tactile mouse, and input of commands via the at least one input control; f. in response to said input from the tactile mouse, selecting a second GUI element from said new hierarchical structure in accordance with a navigational mode selected by a user from among a plurality of predetermined different navigational modes; and g. indicating the selected second GUI element to the user. 4. The method of claim 2 wherein step (g) of indicating the selected second GUI element to the user comprises displaying in tactile form upon said tactile display descriptors relating to the second GUI element. | 0.877193 |
7,773,527 | 1 | 4 | 1. A method for sending a document, comprising: receiving the document from a managed service container for transmission to a connection offering platform, wherein the document is based on an offering, wherein the offering is provided by the connection offering platform for an asset managed by the managed service container; retrieving, from a remote registry, a quality of service policy defined for the offering, wherein the remote registry is located on the connection offering platform; enqueuing the document in a queue corresponding to a quality of service defined in the quality of service policy; dequeuing the document according to the quality of service; and transmitting the document via a network to the connection offering platform, wherein the quality of service policy is described in an extensible markup language (XML) document. | 1. A method for sending a document, comprising: receiving the document from a managed service container for transmission to a connection offering platform, wherein the document is based on an offering, wherein the offering is provided by the connection offering platform for an asset managed by the managed service container; retrieving, from a remote registry, a quality of service policy defined for the offering, wherein the remote registry is located on the connection offering platform; enqueuing the document in a queue corresponding to a quality of service defined in the quality of service policy; dequeuing the document according to the quality of service; and transmitting the document via a network to the connection offering platform, wherein the quality of service policy is described in an extensible markup language (XML) document. 4. The method of claim 1 , wherein the quality of service is no quality of service for delivery of the document. | 0.730769 |
9,137,401 | 1 | 7 | 1. An electric apparatus comprising: a touch panel; a content storage unit that stores content to be displayed on the touch panel in different languages; a selected language storage unit that stores a selected language; a content display unit that displays, 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; and a language setting unit that displays 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, specifies an item if a portion touched on the touch panel reaches an explicit area on the first language selection screen by moving the portion touched on the touch panel, displays a second language selection screen including items corresponding to each of the languages corresponding to the specified item on the first language selection screen, specifies an item if a portion touched on the touch panel reaches an explicit area on the second language selection screen by moving the portion touched on the touch panel, and stores, in the selected language storage unit, a language corresponding to the specified item on the second language selection screen, wherein after the first or second language selection screen has been displayed on the touch panel, if an operation to cancel a state in which the touch panel is touched is accepted before the portion touched on the touch panel reaches the explicit area on the first or second language selection screen, the language setting unit turns off the first or second language selection screen displayed on the touch panel. | 1. An electric apparatus comprising: a touch panel; a content storage unit that stores content to be displayed on the touch panel in different languages; a selected language storage unit that stores a selected language; a content display unit that displays, 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; and a language setting unit that displays 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, specifies an item if a portion touched on the touch panel reaches an explicit area on the first language selection screen by moving the portion touched on the touch panel, displays a second language selection screen including items corresponding to each of the languages corresponding to the specified item on the first language selection screen, specifies an item if a portion touched on the touch panel reaches an explicit area on the second language selection screen by moving the portion touched on the touch panel, and stores, in the selected language storage unit, a language corresponding to the specified item on the second language selection screen, wherein after the first or second language selection screen has been displayed on the touch panel, if an operation to cancel a state in which the touch panel is touched is accepted before the portion touched on the touch panel reaches the explicit area on the first or second language selection screen, the language setting unit turns off the first or second language selection screen displayed on the touch panel. 7. The electric apparatus according to claim 1 , wherein when displaying the second language screen on the touch panel, the language setting unit grays out one or more items on the first language selection screen other than the specified item. | 0.70933 |
7,603,349 | 11 | 12 | 11. A computer-readable storage medium that is volatile memory or non-volatile memory and that stores computer-executable code that, when executed by one or more processors at a client, causes the client to implement a graphical user interface, wherein the graphical user interface: includes a selection control element activating the graphical user interface; includes a query entry area configured to accept entry of one or more query terms by a user; includes a submission control element configured to submit a query including any query terms entered in the query entry area and a separate context vector derived from at least a portion of content in a page currently displayed at the client to a search engine in response to user operation of the submission control element, and includes a pop-up element for displaying at least the query entry area and augmented content based on said context vector; wherein the graphical user interface is configured to display the pop-up element in response to the user activating the user interface via the selection control element; wherein the graphical user interface is configured to send said context vector to a first server upon the user activating the graphical user interface via the selection control element, prior to the user entering any query terms; wherein the graphical user interface is configured to receive said augmented content from the first server, in response to sending the context vector, prior to the user entering any query terms. | 11. A computer-readable storage medium that is volatile memory or non-volatile memory and that stores computer-executable code that, when executed by one or more processors at a client, causes the client to implement a graphical user interface, wherein the graphical user interface: includes a selection control element activating the graphical user interface; includes a query entry area configured to accept entry of one or more query terms by a user; includes a submission control element configured to submit a query including any query terms entered in the query entry area and a separate context vector derived from at least a portion of content in a page currently displayed at the client to a search engine in response to user operation of the submission control element, and includes a pop-up element for displaying at least the query entry area and augmented content based on said context vector; wherein the graphical user interface is configured to display the pop-up element in response to the user activating the user interface via the selection control element; wherein the graphical user interface is configured to send said context vector to a first server upon the user activating the graphical user interface via the selection control element, prior to the user entering any query terms; wherein the graphical user interface is configured to receive said augmented content from the first server, in response to sending the context vector, prior to the user entering any query terms. 12. The computer-readable storage medium of claim 11 , wherein the at least a portion of content is selectable by the user. | 0.853571 |
8,131,540 | 4 | 5 | 4. The method of claim 1 wherein the designated at least one second entity or the action indicates a desire to match any second entity. | 4. The method of claim 1 wherein the designated at least one second entity or the action indicates a desire to match any second entity. 5. The method of claim 4 , each sentence of each document comprising at least one clause, wherein the any second entity is any term used as a subject of a clause of a sentence. | 0.5 |
10,127,911 | 17 | 19 | 17. The system of claim 14 , wherein the speaker profile for the predetermined user comprises a plurality of voice prints. | 17. The system of claim 14 , wherein the speaker profile for the predetermined user comprises a plurality of voice prints. 19. The system of claim 17 , wherein determining whether the speaker of the user speech is the predetermined user based at least in part on the speaker profile for the predetermined user comprises: determining whether the audio input comprising user speech matches at least a threshold number of the plurality of voice prints; in accordance with a determination that the audio input comprising user speech matches at least the threshold number of the plurality of voice prints, determining that the speaker of the user speech is the predetermined user; and in accordance with a determination that the audio input comprising user speech does not match at least the threshold number of the plurality of voice prints, determining that the speaker of the user speech is not the predetermined user. | 0.753267 |
9,058,614 | 10 | 16 | 10. A system for dynamically clustering data items, the system comprising at least one processing unit configured to: receive (a) a plurality of data items originating from at least two sources; (b) a plurality of distinct metadata details; (c) data indicative of associations between said data items and said metadata details, wherein each data item is associated with at least one metadata detail, and wherein at least a first data item originating from a first source and a second data item originating from a second source are related data items associated with at least one shared metadata detail; grade strengths of relationships between at least one of said data items and at least one of said metadata details; and cluster said data items into one or more clusters, based on the calculated grade wherein at least one of said clusters comprises related data items originating from more than one source, wherein said grade comprises applying weighting functions, and the weighting functions are rule-based weighting functions. | 10. A system for dynamically clustering data items, the system comprising at least one processing unit configured to: receive (a) a plurality of data items originating from at least two sources; (b) a plurality of distinct metadata details; (c) data indicative of associations between said data items and said metadata details, wherein each data item is associated with at least one metadata detail, and wherein at least a first data item originating from a first source and a second data item originating from a second source are related data items associated with at least one shared metadata detail; grade strengths of relationships between at least one of said data items and at least one of said metadata details; and cluster said data items into one or more clusters, based on the calculated grade wherein at least one of said clusters comprises related data items originating from more than one source, wherein said grade comprises applying weighting functions, and the weighting functions are rule-based weighting functions. 16. The system of claim 10 , wherein said first data item is further associated with at least one metadata detail not associated with said second data item. | 0.752381 |
7,634,729 | 1 | 10 | 1. A computer system, comprising: an input system that receives a file save command; a rendering system for rendering a file save interface in response to the input system that receives the file save command, the input system is configured to receive in electronic ink format a property value of a document or file as well as a format policy of the property value on or accessible by the computer system in the file save interface, the format policy regulates a manner of rendering for the property value with regard to machine-generated text or electronic ink; a storage system that stores the property value and format policy of the document or file; and an access system that allows the operating system to access the stored property value and policy, wherein the rendering system renders the stored property value in accordance with the format policy as part of a file preview operation, the rendering system converts the property value into a machine-generated text when the format policy dictates rendering of the property value should be of a machine-generated text, the file review discloses a limited information portion of the document or file, and the property value in electronic ink format includes an electronic ink filename for the document or file. | 1. A computer system, comprising: an input system that receives a file save command; a rendering system for rendering a file save interface in response to the input system that receives the file save command, the input system is configured to receive in electronic ink format a property value of a document or file as well as a format policy of the property value on or accessible by the computer system in the file save interface, the format policy regulates a manner of rendering for the property value with regard to machine-generated text or electronic ink; a storage system that stores the property value and format policy of the document or file; and an access system that allows the operating system to access the stored property value and policy, wherein the rendering system renders the stored property value in accordance with the format policy as part of a file preview operation, the rendering system converts the property value into a machine-generated text when the format policy dictates rendering of the property value should be of a machine-generated text, the file review discloses a limited information portion of the document or file, and the property value in electronic ink format includes an electronic ink filename for the document or file. 10. A computer system according to claim 1 , wherein the input system is configured to receive the property value from a touch-sensitive display or a proximity-sensitive display that receives user input by detecting a user's finger. | 0.543307 |
7,743,048 | 12 | 13 | 12. A geographic search system for allowing a user to generate search results relevant to a target location, the system comprising: a geo-entity extractor for operating in conjunction with a crawler to crawl available information sources and extract location information; a geo-tagger for: (1) tagging and indexing information sources with extracted location information˜ (2) appending a text indication indicative of a latitude-longitude centroid pinpoint to web documents that have been determined to have high-confidence geographic matches: one or more location determination components for determining a target location that is geographically located within a predetermined radius from a location identified in a query string submitted by a user to a search engine; determining a target location from one or more keywords in a query string submitted by a user to a search engine; identifying the target location as a geographic city; determining two or more alternative location cities within a pre-defined geographic radius around the geographic city with at least a minimum population of people; suggesting that a user limit a search for at least one of the one or more keywords to the two or more alternative cities; presenting a drop-down menu with the two or more alternative location cities arranged in alphabetic order, receiving an indication, by the user, to limit the search for the at least one of the one or more keywords one of the two or more alternative cities; searching web content for information relevant to the at least one of the one or more keywords and limited to the one of the two or more alternative cities; and transmitting the information. | 12. A geographic search system for allowing a user to generate search results relevant to a target location, the system comprising: a geo-entity extractor for operating in conjunction with a crawler to crawl available information sources and extract location information; a geo-tagger for: (1) tagging and indexing information sources with extracted location information˜ (2) appending a text indication indicative of a latitude-longitude centroid pinpoint to web documents that have been determined to have high-confidence geographic matches: one or more location determination components for determining a target location that is geographically located within a predetermined radius from a location identified in a query string submitted by a user to a search engine; determining a target location from one or more keywords in a query string submitted by a user to a search engine; identifying the target location as a geographic city; determining two or more alternative location cities within a pre-defined geographic radius around the geographic city with at least a minimum population of people; suggesting that a user limit a search for at least one of the one or more keywords to the two or more alternative cities; presenting a drop-down menu with the two or more alternative location cities arranged in alphabetic order, receiving an indication, by the user, to limit the search for the at least one of the one or more keywords one of the two or more alternative cities; searching web content for information relevant to the at least one of the one or more keywords and limited to the one of the two or more alternative cities; and transmitting the information. 13. The system of claim 12 , wherein the location determination components include a user location determination component for finding a reverse IP address of a user inputting a query. | 0.581818 |
9,984,128 | 1 | 2 | 1. A method, comprising: generating, at a master node, configuration data for each indexer of a cluster of indexers under coordination by the master node, wherein the cluster of indexers is distributed across one or more sites, wherein configuration data for a particular indexer of the cluster of indexers indicates whether the particular indexer is a primary indexer with primary responsibility for responding to search queries originating from one or more search heads, wherein each of the one or more sites comprises a plurality of indexers of the cluster, wherein each indexer is operable to store multiple subsets of searchable data, and wherein each subset of searchable data is operable to be replicated across multiple indexers at the one or more sites, and wherein, in response to a search query, each indexer is configured to use configuration data received from the master node to search associated subsets of searchable data for which it has primary responsibility; sending, to each indexer of the cluster of indexers, configuration data generated for a respective indexer, wherein the configuration data further indicates whether a particular indexer is a secondary indexer with secondary responsibility for responding to the search queries related to searchable data replicated between the primary indexer and the secondary indexer. | 1. A method, comprising: generating, at a master node, configuration data for each indexer of a cluster of indexers under coordination by the master node, wherein the cluster of indexers is distributed across one or more sites, wherein configuration data for a particular indexer of the cluster of indexers indicates whether the particular indexer is a primary indexer with primary responsibility for responding to search queries originating from one or more search heads, wherein each of the one or more sites comprises a plurality of indexers of the cluster, wherein each indexer is operable to store multiple subsets of searchable data, and wherein each subset of searchable data is operable to be replicated across multiple indexers at the one or more sites, and wherein, in response to a search query, each indexer is configured to use configuration data received from the master node to search associated subsets of searchable data for which it has primary responsibility; sending, to each indexer of the cluster of indexers, configuration data generated for a respective indexer, wherein the configuration data further indicates whether a particular indexer is a secondary indexer with secondary responsibility for responding to the search queries related to searchable data replicated between the primary indexer and the secondary indexer. 2. The method of claim 1 , wherein the primary indexer responds with one or more results based on data from one or more subsets of searchable data accessible to the primary indexer. | 0.865727 |
7,506,254 | 1 | 3 | 1. A computer-implemented method for predictively converting a partial user input, comprising: receiving a partial user input from a user, the partial user input being Roman characters; converting the partial user input of Roman characters to a converted partial user input, the converted partial user input being first non-Roman characters that are represented by the user input of Roman characters; generating possible completions from the converted partial user input of non-Roman characters, each possible completion including the first non-Roman characters and second non-Roman characters, the first non-Roman characters being a prefix to the second non-Roman characters, and the second non-Roman characters being non-Roman characters that are not represented by the partial user input; outputting one or more of the possible completions. | 1. A computer-implemented method for predictively converting a partial user input, comprising: receiving a partial user input from a user, the partial user input being Roman characters; converting the partial user input of Roman characters to a converted partial user input, the converted partial user input being first non-Roman characters that are represented by the user input of Roman characters; generating possible completions from the converted partial user input of non-Roman characters, each possible completion including the first non-Roman characters and second non-Roman characters, the first non-Roman characters being a prefix to the second non-Roman characters, and the second non-Roman characters being non-Roman characters that are not represented by the partial user input; outputting one or more of the possible completions. 3. The computer-implemented method of claim 1 , wherein the converting is based on a database of user inputs in Roman characters to converted inputs in non-Roman characters. | 0.529891 |
8,767,825 | 16 | 23 | 16. A method for providing an adaptive video transcoding framework for a video hosting service, the method comprising: estimating video coding complexity of a source video, the source video having a plurality of coding parameters and a first resolution; training one or more rate-distortion models and scaling models from a plurality of different encoded videos of a video corpus; transcoding the source video based on the estimated video coding complexity of the source video and a target bitrate estimated by rate-distortion models and scaling models trained by a video rate-distortion modeling engine; and determining an optimal resolution for the source video based on the estimated video coding complexity of the source video, and to transcode the source video with the first resolution into an output video with the optimal resolution. | 16. A method for providing an adaptive video transcoding framework for a video hosting service, the method comprising: estimating video coding complexity of a source video, the source video having a plurality of coding parameters and a first resolution; training one or more rate-distortion models and scaling models from a plurality of different encoded videos of a video corpus; transcoding the source video based on the estimated video coding complexity of the source video and a target bitrate estimated by rate-distortion models and scaling models trained by a video rate-distortion modeling engine; and determining an optimal resolution for the source video based on the estimated video coding complexity of the source video, and to transcode the source video with the first resolution into an output video with the optimal resolution. 23. The method of claim 16 , wherein determining an optimal resolution for the source video comprises: receiving the source video having a first video format and a first resolution; obtaining a video coding complexity score of the source video; determining a second resolution of the source video based on the video coding complexity; and encoding the source video into an output video having the second resolution and a predetermined video output format. | 0.642296 |
8,356,243 | 9 | 15 | 9. A system for processing input text, the system comprising a computer programmed to: locate, within the input text, at least one portion of text corresponding to at least one section heading of a plurality of section headings associated with a report template; visually display at least one indicator for the at least one section heading to indicate that the at least one portion of text corresponding to the at least one section heading has been located in the input text; and generate a structured report according to the report template, the structured report having a plurality of sections, the plurality of sections comprising at least one section corresponding to the at least one section heading, the at least one section being populated with the at least one portion of text corresponding to the at least one section heading, wherein the computer is programmed to display an indicator separate from the structured report. | 9. A system for processing input text, the system comprising a computer programmed to: locate, within the input text, at least one portion of text corresponding to at least one section heading of a plurality of section headings associated with a report template; visually display at least one indicator for the at least one section heading to indicate that the at least one portion of text corresponding to the at least one section heading has been located in the input text; and generate a structured report according to the report template, the structured report having a plurality of sections, the plurality of sections comprising at least one section corresponding to the at least one section heading, the at least one section being populated with the at least one portion of text corresponding to the at least one section heading, wherein the computer is programmed to display an indicator separate from the structured report. 15. The system of claim 9 , wherein the input text is generated at least in part by automatically recognizing dictated speech, and wherein the computer is programmed to locate, within the input text, the at least one section heading dictated by a user. | 0.807044 |
8,706,489 | 8 | 9 | 8. The method according to claim 7 , wherein the speech recognition is one of a direct acoustic wave recognition and an acoustic model recognition. | 8. The method according to claim 7 , wherein the speech recognition is one of a direct acoustic wave recognition and an acoustic model recognition. 9. The method according to claim 8 , wherein the acoustic model recognition is one selected from a group consisting of a hidden Markov model (HMM), a neural network, a dynamic time wrapping (DTW) and a template matching. | 0.5 |
7,810,021 | 21 | 26 | 21. An apparatus for producing an electronic literary macramé of texts from a literary work, comprising: a computer, input means for the computer; display means for the computer; information storage and retrieval means for holding data and instructions for the computer; a repository for information connected to the computer; a set of files residing in the repository for information; a database program or spreadsheet program operating within the computer; a database supported by the database program or spreadsheet program for holding information concerning the characteristics of one or more scenes presented in the literary work; a set of processing control files residing in the repository for information, for linking the scenes of the literary work; a set of scene text files residing in the repository for information and containing the literary work; a set of reference text files residing in the repository for information and containing information supportive of the literary work; a set of link records residing in the repository for information and containing link information interconnecting the contents of the scene text files and reference text files; a set of utility programs and scripts operating within the computer for converting the set of scene text files into a set of scene hypertext files linking among scene text files of the literary work and linking to reference hypertext files and for converting the set of reference text files to reference hypertext files derived from the reference text files and linked among themselves and linked to the scene hypertext; a browser program operating within the computer for displaying interlinked hypertext files; and a set of display processing programs operating within the computer for adapting the presentation of interlinked hypertext files, wherein the database contains one or more data elements comprising attributes of each scene of a story and wherein the one or more data elements comprise for each scene: a scene title; a scene locale; a scene designator or identifier; the point of view from which the scene is rendered; the date and time of the scene within the narrative text; the copyright year of the writing of the scene; one or more keywords characterizing the scene; a designator of the chapter in which the scene appears; a designator of the section of the chapter in which the scene appears; the source file from which the scene text file is taken; the style of presentation required for the scene text; and the location or window of presentation required for the scene text file. | 21. An apparatus for producing an electronic literary macramé of texts from a literary work, comprising: a computer, input means for the computer; display means for the computer; information storage and retrieval means for holding data and instructions for the computer; a repository for information connected to the computer; a set of files residing in the repository for information; a database program or spreadsheet program operating within the computer; a database supported by the database program or spreadsheet program for holding information concerning the characteristics of one or more scenes presented in the literary work; a set of processing control files residing in the repository for information, for linking the scenes of the literary work; a set of scene text files residing in the repository for information and containing the literary work; a set of reference text files residing in the repository for information and containing information supportive of the literary work; a set of link records residing in the repository for information and containing link information interconnecting the contents of the scene text files and reference text files; a set of utility programs and scripts operating within the computer for converting the set of scene text files into a set of scene hypertext files linking among scene text files of the literary work and linking to reference hypertext files and for converting the set of reference text files to reference hypertext files derived from the reference text files and linked among themselves and linked to the scene hypertext; a browser program operating within the computer for displaying interlinked hypertext files; and a set of display processing programs operating within the computer for adapting the presentation of interlinked hypertext files, wherein the database contains one or more data elements comprising attributes of each scene of a story and wherein the one or more data elements comprise for each scene: a scene title; a scene locale; a scene designator or identifier; the point of view from which the scene is rendered; the date and time of the scene within the narrative text; the copyright year of the writing of the scene; one or more keywords characterizing the scene; a designator of the chapter in which the scene appears; a designator of the section of the chapter in which the scene appears; the source file from which the scene text file is taken; the style of presentation required for the scene text; and the location or window of presentation required for the scene text file. 26. The apparatus of claim 21 wherein each hypertext file further comprises a scene hypertext file containing scene text. | 0.927458 |
8,645,679 | 15 | 17 | 15. A computer program product in a non-transitory computer readable medium for use in a data processing system, the computer program product holding computer program instructions which, when executed by the data processing system, perform a method for merging security constraints associated with an application when using security annotations, the method comprising: during application deployment, generating a list of role names; during application runtime, retrieving security constraints for the application from a plurality of sources, the sources including dynamic and static security annotations, and a deployment descriptor; and using the list of role names and the security constraints retrieved from the plurality of sources to generate a set of merged security constraints having an order of precedence. | 15. A computer program product in a non-transitory computer readable medium for use in a data processing system, the computer program product holding computer program instructions which, when executed by the data processing system, perform a method for merging security constraints associated with an application when using security annotations, the method comprising: during application deployment, generating a list of role names; during application runtime, retrieving security constraints for the application from a plurality of sources, the sources including dynamic and static security annotations, and a deployment descriptor; and using the list of role names and the security constraints retrieved from the plurality of sources to generate a set of merged security constraints having an order of precedence. 17. The computer program product as described in claim 15 wherein the static security annotation is an @RoleAllowed static security annotation. | 0.850418 |
7,870,129 | 27 | 29 | 27. A system for handling error documents, comprising: hardware logic performing operations, the operations comprising: storing one or more entries for valid documents and one or more entries for error documents in a documents portion of a text index and storing tokens from the valid documents in a posting lists portion of the text index, wherein each of the entries includes a first field and a second field, wherein the first field for a valid document is indexable and stores one or more tokens forming document text, wherein the first field for an error document is not indexable and stores an error message, and wherein the second field stores an indication of whether the document is an error document; fetching a document with a document identifier; and in response to determining that the document is an error document, adding an entry in the documents portion of the text index that includes an error message in a field that is not searchable in response to a search request using one or more tokens to locate one or more documents indexed by the text index. | 27. A system for handling error documents, comprising: hardware logic performing operations, the operations comprising: storing one or more entries for valid documents and one or more entries for error documents in a documents portion of a text index and storing tokens from the valid documents in a posting lists portion of the text index, wherein each of the entries includes a first field and a second field, wherein the first field for a valid document is indexable and stores one or more tokens forming document text, wherein the first field for an error document is not indexable and stores an error message, and wherein the second field stores an indication of whether the document is an error document; fetching a document with a document identifier; and in response to determining that the document is an error document, adding an entry in the documents portion of the text index that includes an error message in a field that is not searchable in response to a search request using one or more tokens to locate one or more documents indexed by the text index. 29. The system of claim 27 , wherein the operations further comprise: in response to determining that the document does not have an entry in the text index, determining whether the document is an error document. | 0.834898 |
10,146,879 | 12 | 18 | 12. A method comprising: for each of a plurality of application (app) records each specifying an app and including an app download address (ADA) for downloading the app, determining, by an analysis system in a server, one or more connections associated with the app, and determining, by the analysis system, one or more terms associated with one or more resources connected with the app by the one or more connections; receiving, by a search system in the server, a search query from a user device; identifying, by the search system, one or more of the plurality of app records based on the search query; for each of the identified one or more of the plurality of app records, generating, by the search system, a result score based on one or more terms associated with at least one resource connected with an app specified by the identified one or more of the plurality of app records; selecting, by the search system, one or more app records from the identified one or more of the plurality of app records based on the generated result score; selecting, by the search system, the one or more ADAs from the selected one or more app records; and transmitting, by the search system, the one or more ADAs to the user device. | 12. A method comprising: for each of a plurality of application (app) records each specifying an app and including an app download address (ADA) for downloading the app, determining, by an analysis system in a server, one or more connections associated with the app, and determining, by the analysis system, one or more terms associated with one or more resources connected with the app by the one or more connections; receiving, by a search system in the server, a search query from a user device; identifying, by the search system, one or more of the plurality of app records based on the search query; for each of the identified one or more of the plurality of app records, generating, by the search system, a result score based on one or more terms associated with at least one resource connected with an app specified by the identified one or more of the plurality of app records; selecting, by the search system, one or more app records from the identified one or more of the plurality of app records based on the generated result score; selecting, by the search system, the one or more ADAs from the selected one or more app records; and transmitting, by the search system, the one or more ADAs to the user device. 18. The method of claim 12 , wherein each of the plurality of app records further includes one or more app attributes (AAs) that describe the app, and wherein identifying the one or more of the plurality of app records based on the search query comprises identifying each record based on one or more matches between one or more terms of the search query and one or more terms of the one or more AAs included in the identified one or more of the plurality of app records. | 0.737136 |
9,311,395 | 7 | 8 | 7. The computer implemented method of claim 1 , further comprising: applying speaker segments and their probabilities to detect words spoken by a particular individual speaker. | 7. The computer implemented method of claim 1 , further comprising: applying speaker segments and their probabilities to detect words spoken by a particular individual speaker. 8. The computer-implemented method of claim 7 , further comprising: applying detected words from the particular individual speaker to the ranking or filtration of electronic media content; and displaying electronic media content to users based on the ranking or filtration. | 0.5 |
8,140,362 | 1 | 6 | 1. A computer implemented method of automatically processing dynamic business rules in a content management system, comprising: authoring first business rules in a first business rule definition file in the content management system, wherein the authoring is processed using a computer with a computer processor; configuring the first business rules in the first business rule definition file; setting a predetermined action regarding whether to stop processing the first business rules after a first violation of one of the first business rules: classifying the first business rules into stages of data processing actions on the first business rules; creating a first set of the first business rules for testing first input data for validity with respect to numeric and relationship categories; creating a second set of the first business rules for performing first operations on the first input data; creating a third set of the first business rules which provide a mechanism that initiates further action after a content management repository is updated; classifying fourth business rulesets according to different first action types and business ruleset types; managing the first business rules in the first business rule definition file; receiving a set of second input data to which the first business rules apply; determining whether updated data from the user needs to be stored in the content management repository and processed; mapping the first business rules to the set of second input data to identify the first business rules required by the set of second input data; executing the identified first business rules against different backend data models; monitoring the identified first business rules to determine if a new business rule is introduced; updating the first business rule definition file to reflect the new business rule; updating the business rule definition file during the processing of at least two of: the first business rules, the first input data, and the second input data; executing the updated first business rule definition file; and displaying the updated first business file on a display unit, wherein the first business rules are dynamic and are based on the set of second input data stored in the content management repository, to enable querying of the content management repository based on foreign key relationships to auto-fill the fields. | 1. A computer implemented method of automatically processing dynamic business rules in a content management system, comprising: authoring first business rules in a first business rule definition file in the content management system, wherein the authoring is processed using a computer with a computer processor; configuring the first business rules in the first business rule definition file; setting a predetermined action regarding whether to stop processing the first business rules after a first violation of one of the first business rules: classifying the first business rules into stages of data processing actions on the first business rules; creating a first set of the first business rules for testing first input data for validity with respect to numeric and relationship categories; creating a second set of the first business rules for performing first operations on the first input data; creating a third set of the first business rules which provide a mechanism that initiates further action after a content management repository is updated; classifying fourth business rulesets according to different first action types and business ruleset types; managing the first business rules in the first business rule definition file; receiving a set of second input data to which the first business rules apply; determining whether updated data from the user needs to be stored in the content management repository and processed; mapping the first business rules to the set of second input data to identify the first business rules required by the set of second input data; executing the identified first business rules against different backend data models; monitoring the identified first business rules to determine if a new business rule is introduced; updating the first business rule definition file to reflect the new business rule; updating the business rule definition file during the processing of at least two of: the first business rules, the first input data, and the second input data; executing the updated first business rule definition file; and displaying the updated first business file on a display unit, wherein the first business rules are dynamic and are based on the set of second input data stored in the content management repository, to enable querying of the content management repository based on foreign key relationships to auto-fill the fields. 6. The method of claim 1 , wherein the backend data models have different hierarchical schemas. | 0.959712 |
8,584,102 | 7 | 8 | 7. A method implemented at least in part by a computer, the method comprising: receiving a delta that indicates changes in a first computer language to make to a first computer code that is included inside a subroutine encoded in the first computer language to create a second computer code encoded in the first computer language, the delta created by: translating the first computer code to a third computer code encoded in a second computer language, which is a higher level language than the first computer language; via a user interface, receiving modifications in the second computer language to the third computer code, the modifications to the third computer code thereby creates a fourth computer code encoded in the second computer programming language and the modifications include inserting helper computer code and new features to the third computer code; translating the fourth computer code encoded in the second computer programming language into the second computer code encoded in the first computer programming language; determining the delta changes in the first computer code of the first computer language by comparing the first computer code to the second computer code to identify changes in the first and second computer code encoded in the first programming language; and linking an application to the second computer code to access the new features, the linking comprising: receiving, at the helper computer code from the application, a call to access a new feature, the helper computer code includes application programming interfaces (API) that correspond to each respective new feature; and in response to the access call, the helper code using the delta to determine which feature's API to invoke for the requesting application without causing the application to be rebuilt; after the delta is created, loading the first computer code into memory; applying the changes in the first computer language to the first computer code to create the second computer code encoded in the first computer language that resides in the memory; executing at least a portion of the second computer code prior to purging the second computer code from memory; loading a fifth computer code into memory, the fifth computer code having code to access features provided by the changes, the fifth computer code having other code to provide access to these features to a sixth computer code structured to use the first computer code only if a security feature associated with the first computer code indicates that the first computer code has not changed since the security feature was associated with the first computer code. | 7. A method implemented at least in part by a computer, the method comprising: receiving a delta that indicates changes in a first computer language to make to a first computer code that is included inside a subroutine encoded in the first computer language to create a second computer code encoded in the first computer language, the delta created by: translating the first computer code to a third computer code encoded in a second computer language, which is a higher level language than the first computer language; via a user interface, receiving modifications in the second computer language to the third computer code, the modifications to the third computer code thereby creates a fourth computer code encoded in the second computer programming language and the modifications include inserting helper computer code and new features to the third computer code; translating the fourth computer code encoded in the second computer programming language into the second computer code encoded in the first computer programming language; determining the delta changes in the first computer code of the first computer language by comparing the first computer code to the second computer code to identify changes in the first and second computer code encoded in the first programming language; and linking an application to the second computer code to access the new features, the linking comprising: receiving, at the helper computer code from the application, a call to access a new feature, the helper computer code includes application programming interfaces (API) that correspond to each respective new feature; and in response to the access call, the helper code using the delta to determine which feature's API to invoke for the requesting application without causing the application to be rebuilt; after the delta is created, loading the first computer code into memory; applying the changes in the first computer language to the first computer code to create the second computer code encoded in the first computer language that resides in the memory; executing at least a portion of the second computer code prior to purging the second computer code from memory; loading a fifth computer code into memory, the fifth computer code having code to access features provided by the changes, the fifth computer code having other code to provide access to these features to a sixth computer code structured to use the first computer code only if a security feature associated with the first computer code indicates that the first computer code has not changed since the security feature was associated with the first computer code. 8. The method of claim 7 , wherein translating the first computer code to the third computer code comprises decompiling the first computer code to obtain the third computer code. | 0.708197 |
9,430,463 | 1 | 3 | 1. A method for processing natural language comprising: at an electronic device: receiving a first text phrase; determining whether editing the first text phrase to match a second text phrase requires one or more of: inserting a first word into the first text phrase, wherein the second text phrase includes the first word; deleting a second word from the first text phrase; wherein the first text phrase includes the second word; and substituting a third word of the first text phrase with a fourth word, wherein the second text phrase includes the fourth word; in response to determining that editing the first text phrase to match the second text phrase requires one or more of inserting the first word into the first text phrase, deleting the second word from the first text phrase, and substituting the third word of the first text phrase with the fourth word, determining one or more of: an insertion cost associated with inserting the first word into the first text phrase; a deletion cost associated with deleting the second word from the first text phrase; and a substitution cost associated with substituting the third word of the first text phrase with the fourth word; determining, based on the one or more of the insertion cost, the deletion cost, and the substitution cost, a semantic edit distance between the first text phrase and the second text phrase in a semantic space, wherein a degree of semantic similarity between the first text phrase and the second text phrase is based on the semantic edit distance; determining, based on the degree of semantic similarity between the first text phrase and the second text phrase, a first intent associated with the first text phrase; and performing, based on the first intent, a task associated with the first text phrase. | 1. A method for processing natural language comprising: at an electronic device: receiving a first text phrase; determining whether editing the first text phrase to match a second text phrase requires one or more of: inserting a first word into the first text phrase, wherein the second text phrase includes the first word; deleting a second word from the first text phrase; wherein the first text phrase includes the second word; and substituting a third word of the first text phrase with a fourth word, wherein the second text phrase includes the fourth word; in response to determining that editing the first text phrase to match the second text phrase requires one or more of inserting the first word into the first text phrase, deleting the second word from the first text phrase, and substituting the third word of the first text phrase with the fourth word, determining one or more of: an insertion cost associated with inserting the first word into the first text phrase; a deletion cost associated with deleting the second word from the first text phrase; and a substitution cost associated with substituting the third word of the first text phrase with the fourth word; determining, based on the one or more of the insertion cost, the deletion cost, and the substitution cost, a semantic edit distance between the first text phrase and the second text phrase in a semantic space, wherein a degree of semantic similarity between the first text phrase and the second text phrase is based on the semantic edit distance; determining, based on the degree of semantic similarity between the first text phrase and the second text phrase, a first intent associated with the first text phrase; and performing, based on the first intent, a task associated with the first text phrase. 3. The method according to claim 1 , wherein: the deletion cost associated with deleting the second word from the first text phrase is determined in response to determining that editing the first text phrase to match the second text phrase requires deleting the second word from the first text phrase; and the deletion cost is determined based on a second predetermined semantic cost and a salience of the second word. | 0.666134 |
9,684,710 | 21 | 23 | 21. A system having a memory and a processor, the system comprising: a component configured to, for each of a plurality of values of an attribute of documents, the values having an ordering: determine a number of different encrypted instances of the value to generate, wherein the number of different encrypted instances determined for at least one of the plurality of values is greater than one, generate the determined number of different encrypted instances of the value so that the value serves as a basis for generating each of the determined number of different encrypted instances of the value, wherein more than one encrypted instance of the at least one of the plurality of values is generated, and store the generated encrypted instances of the value, wherein each encrypted instance of the value can be decrypted into the value; a component configured to generate a mapping of the values of the attribute to each document having that value for the attribute, wherein the mapping maps different encrypted instances of a value to different documents; a component configured to provide the generated mapping to a document storage service; and a component configured to identify an encrypted document that matches a query that specified a value for the attribute, wherein the component configured to identify the encrypted document that matches a query that specified a value for the attribute is further configured to: determine a lower bound on encrypted instances associated with the value specified by the query, determine an upper bound on encrypted instances associated with the value specified by the query, send the determined lower and upper bounds to a document storage service, and receive from the document storage service an indication of at least one document associated with an encrypted instance between the lower and upper bounds wherein each of the components comprises computer-executable instructions stored in the memory for execution by the system. | 21. A system having a memory and a processor, the system comprising: a component configured to, for each of a plurality of values of an attribute of documents, the values having an ordering: determine a number of different encrypted instances of the value to generate, wherein the number of different encrypted instances determined for at least one of the plurality of values is greater than one, generate the determined number of different encrypted instances of the value so that the value serves as a basis for generating each of the determined number of different encrypted instances of the value, wherein more than one encrypted instance of the at least one of the plurality of values is generated, and store the generated encrypted instances of the value, wherein each encrypted instance of the value can be decrypted into the value; a component configured to generate a mapping of the values of the attribute to each document having that value for the attribute, wherein the mapping maps different encrypted instances of a value to different documents; a component configured to provide the generated mapping to a document storage service; and a component configured to identify an encrypted document that matches a query that specified a value for the attribute, wherein the component configured to identify the encrypted document that matches a query that specified a value for the attribute is further configured to: determine a lower bound on encrypted instances associated with the value specified by the query, determine an upper bound on encrypted instances associated with the value specified by the query, send the determined lower and upper bounds to a document storage service, and receive from the document storage service an indication of at least one document associated with an encrypted instance between the lower and upper bounds wherein each of the components comprises computer-executable instructions stored in the memory for execution by the system. 23. The system of claim 21 wherein the component configured to determine the number of encrypted instances to generate for a value includes a component configured to invoke a random number generator. | 0.795267 |
8,265,926 | 1 | 3 | 1. An input method for an electronic device having a display and a memory having stored therein a number of language objects and a number of associated frequency objects, at least some of the language objects each comprising a number of characters, the method comprising: detecting an ambiguous text input including a set of characters; generating a number of compound language solutions by identifying a language object that corresponds with an initial set of characters of the ambiguous text input and identifying another language object that corresponds with another portion of the ambiguous text input; for at least a first compound language solution, generating a junction object comprising a terminal character of the language object and an initial character of the another language object; determining for at least the first compound language solution a frequency value of a language object corresponding with the junction object or a frequency value of zero if no language object corresponding with the junction object is found; and employing the frequency value in outputting with the display a representation of each of at least some of the compound language solutions. | 1. An input method for an electronic device having a display and a memory having stored therein a number of language objects and a number of associated frequency objects, at least some of the language objects each comprising a number of characters, the method comprising: detecting an ambiguous text input including a set of characters; generating a number of compound language solutions by identifying a language object that corresponds with an initial set of characters of the ambiguous text input and identifying another language object that corresponds with another portion of the ambiguous text input; for at least a first compound language solution, generating a junction object comprising a terminal character of the language object and an initial character of the another language object; determining for at least the first compound language solution a frequency value of a language object corresponding with the junction object or a frequency value of zero if no language object corresponding with the junction object is found; and employing the frequency value in outputting with the display a representation of each of at least some of the compound language solutions. 3. The method of claim 1 , wherein the number of language objects comprise a number of word objects and a number of n-gram objects, and further comprising: assigning to at least the first compound language solution a frequency value of a n-gram object corresponding with the junction object or a frequency value of zero if no n-gram object corresponding with the junction object is found. | 0.630476 |
10,025,782 | 1 | 2 | 1. A computer-based system for managing documents over a network, comprising: a storage device storing software instructions; and a memory coupled to one or more processors configured to execute the software instructions to perform operations including: receiving a first version of a document from a first client, creating, in a document log, an entry associated with the first version of the document, wherein the document log contains multiple entries, each entry corresponding to a different version of the document and identifying the date and storage location of such different version of the document, receiving, from a remote computer that is displaying in an interface a second version of the document, a request for information from one or more entries in the document log, wherein the remote computer is the first client or a second client different from the first client, and providing to the remote computer, instructions for displaying a display window and information from one or more entries in the document log, wherein the display window is displayed as superimposed over a portion of the interface associated with the one or more entries included in the request for information. | 1. A computer-based system for managing documents over a network, comprising: a storage device storing software instructions; and a memory coupled to one or more processors configured to execute the software instructions to perform operations including: receiving a first version of a document from a first client, creating, in a document log, an entry associated with the first version of the document, wherein the document log contains multiple entries, each entry corresponding to a different version of the document and identifying the date and storage location of such different version of the document, receiving, from a remote computer that is displaying in an interface a second version of the document, a request for information from one or more entries in the document log, wherein the remote computer is the first client or a second client different from the first client, and providing to the remote computer, instructions for displaying a display window and information from one or more entries in the document log, wherein the display window is displayed as superimposed over a portion of the interface associated with the one or more entries included in the request for information. 2. The system of claim 1 , wherein the entries in the document log contain information reflecting one or more differences in content between different versions of the document. | 0.689046 |
7,702,499 | 22 | 26 | 22. A computer program product that includes a computer usable storage medium, the computer usable storage medium comprising a sequence of instructions which, when executed by a processor, causes said processor to execute a process for performing software performance analysis for a target machine, the process comprising: describing a system design as a network of logical entities; selecting at least one of the logical entities for a software implementation; implementing a source software program for the logical entities selected for the software implementation; generating an optimized assembler code for the software program, wherein the optimized assembler code is an assembly-language representation of the software implementation; performing a performance analysis using the optimized assembler code, wherein the act of performing the performance analysis is performed by a processor; generating a software simulation model in a high level language format based at least in part upon the optimized assembler code by annotating the software simulation model with information related to hardware on which the software implementation runs based at least in part upon a result of the act of performing the performance analysis to capture a dynamic interaction between tasks during runtime, wherein the act of annotating the software simulation model is performed during a time of the act of generating the software simulation model; storing the software simulation model on a computer usable storage medium; generating a hardware and software co-simulation model using the software simulation model; and storing at least the hardware and software co-simulation model on the computer usable storage medium or a second computer usable storage medium or displaying the at least the hardware and software co-simulation model on a display apparatus. | 22. A computer program product that includes a computer usable storage medium, the computer usable storage medium comprising a sequence of instructions which, when executed by a processor, causes said processor to execute a process for performing software performance analysis for a target machine, the process comprising: describing a system design as a network of logical entities; selecting at least one of the logical entities for a software implementation; implementing a source software program for the logical entities selected for the software implementation; generating an optimized assembler code for the software program, wherein the optimized assembler code is an assembly-language representation of the software implementation; performing a performance analysis using the optimized assembler code, wherein the act of performing the performance analysis is performed by a processor; generating a software simulation model in a high level language format based at least in part upon the optimized assembler code by annotating the software simulation model with information related to hardware on which the software implementation runs based at least in part upon a result of the act of performing the performance analysis to capture a dynamic interaction between tasks during runtime, wherein the act of annotating the software simulation model is performed during a time of the act of generating the software simulation model; storing the software simulation model on a computer usable storage medium; generating a hardware and software co-simulation model using the software simulation model; and storing at least the hardware and software co-simulation model on the computer usable storage medium or a second computer usable storage medium or displaying the at least the hardware and software co-simulation model on a display apparatus. 26. The computer program product of claim 22 , wherein the software program is compiled using a same compiler used to compile a production executable. | 0.802632 |
9,852,215 | 6 | 15 | 6. A method comprising: under control of one or more processors configured with executable instructions, receiving a content item comprising a first body of text, the first body of text comprising at least a first text portion and a second text portion; training a classifier based at least in part on an annotated text portion of a second body of text, the annotated text portion having been associated with a first reason through a user interaction received by a computing device associated with a first user, wherein the first body of text is different from the second body of text, and wherein, once trained, the classifier is configured to assign scores indicating a probability that a corresponding portion of the first text portion will be annotated by a second user based on the annotated text portion of the second body of text; assigning, using the trained classifier, and to the first text portion, a first score that indicates the probability that the first text portion will be annotated by the second user; assigning, using the trained classifier, and to the second text portion, a second score that indicates the probability that the second text portion will be annotated by the second user, wherein the first score and the second score are assigned based at least in part on the annotated text portion; ranking, based at least in part on the first score and the second score, the at least the first text portion and the second text portion of the first body of text; And selecting at least one of the first text portion or the second text portion based at least in part on the raking. | 6. A method comprising: under control of one or more processors configured with executable instructions, receiving a content item comprising a first body of text, the first body of text comprising at least a first text portion and a second text portion; training a classifier based at least in part on an annotated text portion of a second body of text, the annotated text portion having been associated with a first reason through a user interaction received by a computing device associated with a first user, wherein the first body of text is different from the second body of text, and wherein, once trained, the classifier is configured to assign scores indicating a probability that a corresponding portion of the first text portion will be annotated by a second user based on the annotated text portion of the second body of text; assigning, using the trained classifier, and to the first text portion, a first score that indicates the probability that the first text portion will be annotated by the second user; assigning, using the trained classifier, and to the second text portion, a second score that indicates the probability that the second text portion will be annotated by the second user, wherein the first score and the second score are assigned based at least in part on the annotated text portion; ranking, based at least in part on the first score and the second score, the at least the first text portion and the second text portion of the first body of text; And selecting at least one of the first text portion or the second text portion based at least in part on the raking. 15. The method as recited in claim 6 , wherein the ranking the at least the first text portion and the second text portion of the first body of text is based at least in part on whether each text portion of the first body of text is associated with at least one of: a literary character mentioned in the content item; a person mentioned in the content item; a topic mentioned in the content item; an organization mentioned in the content item; a place mentioned in the content item; a thing mentioned in the content item; or a period of a setting mentioned in the content item. | 0.527823 |
8,452,772 | 6 | 7 | 6. The computer implemented method of claim 1 , identifying the pertinent trend in the conversations of the target forum comprising: identifying or receiving one or more trends from an external source; aggregating additional information or data that are associated with the one or more trends; and determining a meaning or an issue based at least in part upon the additional information or data. | 6. The computer implemented method of claim 1 , identifying the pertinent trend in the conversations of the target forum comprising: identifying or receiving one or more trends from an external source; aggregating additional information or data that are associated with the one or more trends; and determining a meaning or an issue based at least in part upon the additional information or data. 7. The computer implemented method of claim 6 , identifying the pertinent trend in the conversations of the target forum comprising: filtering the one or more trends to determine the pertinent trend; and filtering the additional information or data associated with the one or more trends to determine pertinent information or data associated with the pertinent trend. | 0.5 |
5,572,651 | 1 | 8 | 1. An interactive method for operating a processor-controlled system to modify a correlation between two data structures using a table image; the processor-controlled system including input circuitry connected to a user input device for producing graphical signals including strokes indicating actions of a system user; output circuitry connected to at least one display having at least one display area for presenting images; memory for storing data; a processor connected for receiving the graphical signals from the input circuitry connected for providing images to the output circuitry, and connected for accessing the data stored in the memory: the data stored in the memory including instruction data indicating instructions the processor executes; the method comprising: operating the processor to obtain key object data items from a first data structure stored in the memory, and to obtain information data items from a second data structure stored in the memory; at least one of the information data items being associated with at least one respective key object data item such that the information data item is retrievable using the respective key object data item; operating the processor to present a table image in the display area using the key object data items and the information data items; the table image including a plurality of first dimension identifier regions, a plurality of second dimension identifier regions, and a plurality of cell regions; the table image showing a key object image in each of the first dimension identifier regions; each key object image representing one of the key object data items included in the first data structure; the table image further showing an information image in each of the second dimension identifier regions; each information image representing one of the information data items included in the second data structure; the table image further showing, in each cell region at the intersection of a first dimension identifier region and a second dimension identifier region, display features indicating whether the respective key object data item represented by the key object image and the information data item represented by the information image have an associative relationship indicated in the first and second data structures; the table image presenting a grid of key object data items by information data items and a graphical display of associative data structure relationships therebetween; operating the processor to receive a first signal from the user input device indicating a selection action of one of the plurality of cell regions as a selected cell region in the table image; the first signal further including a modification signal indicating a request to modify an associative relationship between a respective key object data item in the first data structure and an information data item in the second data structure represented by the selected cell region; operating the processor to respond to the first signal by: modifying the first or second data structure to indicate a modified associative relationship therebetween using the key object data item and the information data item represented by the selected cell region; and presenting an image in the selected cell region including display features showing the modified associative relationship between the key object data item and the information data item represented by the selected cell region. | 1. An interactive method for operating a processor-controlled system to modify a correlation between two data structures using a table image; the processor-controlled system including input circuitry connected to a user input device for producing graphical signals including strokes indicating actions of a system user; output circuitry connected to at least one display having at least one display area for presenting images; memory for storing data; a processor connected for receiving the graphical signals from the input circuitry connected for providing images to the output circuitry, and connected for accessing the data stored in the memory: the data stored in the memory including instruction data indicating instructions the processor executes; the method comprising: operating the processor to obtain key object data items from a first data structure stored in the memory, and to obtain information data items from a second data structure stored in the memory; at least one of the information data items being associated with at least one respective key object data item such that the information data item is retrievable using the respective key object data item; operating the processor to present a table image in the display area using the key object data items and the information data items; the table image including a plurality of first dimension identifier regions, a plurality of second dimension identifier regions, and a plurality of cell regions; the table image showing a key object image in each of the first dimension identifier regions; each key object image representing one of the key object data items included in the first data structure; the table image further showing an information image in each of the second dimension identifier regions; each information image representing one of the information data items included in the second data structure; the table image further showing, in each cell region at the intersection of a first dimension identifier region and a second dimension identifier region, display features indicating whether the respective key object data item represented by the key object image and the information data item represented by the information image have an associative relationship indicated in the first and second data structures; the table image presenting a grid of key object data items by information data items and a graphical display of associative data structure relationships therebetween; operating the processor to receive a first signal from the user input device indicating a selection action of one of the plurality of cell regions as a selected cell region in the table image; the first signal further including a modification signal indicating a request to modify an associative relationship between a respective key object data item in the first data structure and an information data item in the second data structure represented by the selected cell region; operating the processor to respond to the first signal by: modifying the first or second data structure to indicate a modified associative relationship therebetween using the key object data item and the information data item represented by the selected cell region; and presenting an image in the selected cell region including display features showing the modified associative relationship between the key object data item and the information data item represented by the selected cell region. 8. The interactive method of claim 1 for operating a processor-controlled system to modify a correlation between two data structures wherein the first dimension identifier region is a column region and the second dimension identifier region is a row region; the table image showing key object images in the column identifier regions, information images in the row identifier regions and display features showing associative relationships in intersecting cells; the associative relationships between a respective one of the key object images and all of the information images being visually aligned in a column in the table image so as to show patterns in the associative relationships. | 0.5 |
9,418,565 | 9 | 10 | 9. The method of claim 7 , wherein the second set of data files further comprises at least one of data comprising scripts, data comprising at least one validation module, data comprising the presentation format of the at least one test, data comprising items, and data comprising the data content of the at least one test. | 9. The method of claim 7 , wherein the second set of data files further comprises at least one of data comprising scripts, data comprising at least one validation module, data comprising the presentation format of the at least one test, data comprising items, and data comprising the data content of the at least one test. 10. The method of claim 9 , wherein compiling the second set of data files further comprises: compiling the data comprising scripts; compiling the data comprising the at least one validation module after compiling the data comprising scripts; compiling the data comprising the presentation format of the at least one test after compiling the data comprising the at least one validation module; compiling the data comprising items after compiling the data comprising the presentation format of the at least one test; and compiling the data comprising the data content of the at least one test after compiling the data comprising items. | 0.5 |
7,689,911 | 9 | 17 | 9. A system comprising: a processor; and computer storage media having computer-executable instructions stored thereon that when executed by the processor implement an electronic document editor comprising: a highlight rendering services component including a highlight rendering services interface that provides one or more methods to enable an editor extension to control which section of an electronic document is highlighted on a screen and to control a style of the highlight, the editor extension determining a visual aspect of the highlight without altering the electronic document and the highlight rendering services component determining non-visual functional aspects of the highlight; a designer extensibility mechanism; a plurality of designers, wherein the designers communicate with the electronic document editor through the designer extensibility mechanism and through the highlight rendering services component; a designer registry containing respective entries for the designers, wherein the entries are arranged in sequential order; and an event routing controller adapted to route events related to the highlight rendering services component to at least one of the designers based at least in part on the sequential order of the entries in the designer registry. | 9. A system comprising: a processor; and computer storage media having computer-executable instructions stored thereon that when executed by the processor implement an electronic document editor comprising: a highlight rendering services component including a highlight rendering services interface that provides one or more methods to enable an editor extension to control which section of an electronic document is highlighted on a screen and to control a style of the highlight, the editor extension determining a visual aspect of the highlight without altering the electronic document and the highlight rendering services component determining non-visual functional aspects of the highlight; a designer extensibility mechanism; a plurality of designers, wherein the designers communicate with the electronic document editor through the designer extensibility mechanism and through the highlight rendering services component; a designer registry containing respective entries for the designers, wherein the entries are arranged in sequential order; and an event routing controller adapted to route events related to the highlight rendering services component to at least one of the designers based at least in part on the sequential order of the entries in the designer registry. 17. The system of claim 9 , further comprising an interface to enable the editor extension to control one highlighted section of a document from a group of highlighted sections of the document. | 0.66609 |
7,831,922 | 12 | 21 | 12. A computer readable medium having stored thereon computer executable instructions comprising: providing a transparent first graphical user interface overlaying a second graphical user interface; receiving pointer input in a handwriting area corresponding to the transparent first graphical user interface; displaying a guideline at a first position when a pen contacts a first position in the handwriting area; displaying the guideline at a second position only when the pen is lifted from the first position and subsequently contacts a second position in the handwriting area a threshold distance from the first position, wherein the threshold distance depends upon a direction of movement of the pen from the first position to the second position; displaying handwriting objects represented by the pointer input in the transparent first graphical user interface; recognizing text from the pointer input; and providing the recognized text to a software application. | 12. A computer readable medium having stored thereon computer executable instructions comprising: providing a transparent first graphical user interface overlaying a second graphical user interface; receiving pointer input in a handwriting area corresponding to the transparent first graphical user interface; displaying a guideline at a first position when a pen contacts a first position in the handwriting area; displaying the guideline at a second position only when the pen is lifted from the first position and subsequently contacts a second position in the handwriting area a threshold distance from the first position, wherein the threshold distance depends upon a direction of movement of the pen from the first position to the second position; displaying handwriting objects represented by the pointer input in the transparent first graphical user interface; recognizing text from the pointer input; and providing the recognized text to a software application. 21. The computer readable medium recited in claim 12 , comprising: displaying the guideline at the second position only when the pen is lifted from the first position for a threshold amount of time and subsequently contacts the second position. | 0.669377 |
8,706,713 | 1 | 12 | 1. A method of searching for desired information, the method comprising: receiving, from a user having user profile data associated therewith, a search request comprising a search argument; providing, to a first search engine, the received search argument for correlation with first contextual information in a database of network related information; providing, to a second search engine, the received search argument and the user profile data for correlation with a first advertisement in an advertisement database; providing the first contextual information and the first advertisement to the user as a first search result; updating the user profile data based on at least one of the first contextual information, the first advertisement, selection of the first advertisement by the user, and non-selection of the first advertisement by the user; receiving refinement information comprising a refined search argument from the user; providing, to the first search engine, the refined search argument for correlation with second contextual information in the database of network related information; providing, to the second search engine, the refined search argument and the updated user profile data for correlation with a second advertisement in the advertisement database; and providing the second contextual information and the second advertisement to the user. | 1. A method of searching for desired information, the method comprising: receiving, from a user having user profile data associated therewith, a search request comprising a search argument; providing, to a first search engine, the received search argument for correlation with first contextual information in a database of network related information; providing, to a second search engine, the received search argument and the user profile data for correlation with a first advertisement in an advertisement database; providing the first contextual information and the first advertisement to the user as a first search result; updating the user profile data based on at least one of the first contextual information, the first advertisement, selection of the first advertisement by the user, and non-selection of the first advertisement by the user; receiving refinement information comprising a refined search argument from the user; providing, to the first search engine, the refined search argument for correlation with second contextual information in the database of network related information; providing, to the second search engine, the refined search argument and the updated user profile data for correlation with a second advertisement in the advertisement database; and providing the second contextual information and the second advertisement to the user. 12. The method of claim 1 , comprising customizing, based on the user profile data, the second advertisement for receipt by the user. | 0.67561 |
7,680,749 | 3 | 4 | 3. The machine-readable medium of claim 2 wherein learning conditional variants comprises determining if at least one of an explicit and implicit condition applies to a particular conditional variant of a model. | 3. The machine-readable medium of claim 2 wherein learning conditional variants comprises determining if at least one of an explicit and implicit condition applies to a particular conditional variant of a model. 4. The machine-readable medium of claim 3 wherein for explicit conditions, learning conditional variants further comprises: defining a data bucket for an explicit condition of a target attribute; storing attribute data computed for one or more road segments from a plurality of driving sessions into the appropriate buckets; and forming a conditional variant model for each bucket based on the attribute data in that bucket. | 0.66242 |
8,788,266 | 3 | 7 | 3. The language model creation device according to claim 2 , wherein the dialect language model creation section configures a value of the distribution probability using dialect data including dialect-containing speech data and dialect-containing text data. | 3. The language model creation device according to claim 2 , wherein the dialect language model creation section configures a value of the distribution probability using dialect data including dialect-containing speech data and dialect-containing text data. 7. The language model creation device according to claim 3 , wherein after configuring the distribution probability value, creating the dialect-containing n-grams, and creating the new language model, the dialect language model creation section acquires speech recognition results obtained by an external speech recognition device utilizing the new language model along with the dialect data and updates the distribution probability value based on the acquired speech recognition results and ground truth data used for the dialect data. | 0.5 |
7,912,900 | 18 | 19 | 18. A method for providing an educational alert, comprising: monitoring education-related information maintained on a database comprising a performance threshold and a time threshold; receiving a score for an assignment completed by one or more students at a first time and receiving a further score for the same assignment completed by the student during a second time; determining a score difference between the score and the further score and determining a time difference between the first score and the second score; applying the performance threshold to the score difference and applying the time threshold to the time difference; determining an occurrence of suspected cheating as an event when the score difference fails to satisfy the performance threshold and the time difference fails to satisfy the time threshold; generating an alert for the event, comprising: forming a customized group of educational support members and selecting the customized group of educational support members as recipients of the alert; determining a delivery mechanism based on preferences of each recipient; providing an expiration threshold for the alert; selecting a template for the event as the alert, wherein the template comprises a predetermined format with at least one of text, fillable fields, and a blank text box; and providing to the recipients, suggested response actions comprising at least one of producing additional information, initiating a communication, and sending additional alerts, wherein the suggested response actions are each displayed in the alert by an interactive response action element comprising at least one of response buttons, text recommendations, images, sound, and hyperlinks that allows the recipients of the alert to perform an action; delivering the alert to the recipients using the selected delivery mechanism; and removing the alert upon satisfaction of the expiration threshold. | 18. A method for providing an educational alert, comprising: monitoring education-related information maintained on a database comprising a performance threshold and a time threshold; receiving a score for an assignment completed by one or more students at a first time and receiving a further score for the same assignment completed by the student during a second time; determining a score difference between the score and the further score and determining a time difference between the first score and the second score; applying the performance threshold to the score difference and applying the time threshold to the time difference; determining an occurrence of suspected cheating as an event when the score difference fails to satisfy the performance threshold and the time difference fails to satisfy the time threshold; generating an alert for the event, comprising: forming a customized group of educational support members and selecting the customized group of educational support members as recipients of the alert; determining a delivery mechanism based on preferences of each recipient; providing an expiration threshold for the alert; selecting a template for the event as the alert, wherein the template comprises a predetermined format with at least one of text, fillable fields, and a blank text box; and providing to the recipients, suggested response actions comprising at least one of producing additional information, initiating a communication, and sending additional alerts, wherein the suggested response actions are each displayed in the alert by an interactive response action element comprising at least one of response buttons, text recommendations, images, sound, and hyperlinks that allows the recipients of the alert to perform an action; delivering the alert to the recipients using the selected delivery mechanism; and removing the alert upon satisfaction of the expiration threshold. 19. A method according to claim 18 , wherein the event is analyzed by at least one of the recipients, comprising: comparing the event to one or more of scores, graphs, statistics, and images; and determining a significance of the event. | 0.5 |
7,587,309 | 50 | 51 | 50. A system according to claim 46 , further comprising: a category identifier to retrieve a category name associated with the item description and supplementing the advertising creative with the category name subject to space restrictions. | 50. A system according to claim 46 , further comprising: a category identifier to retrieve a category name associated with the item description and supplementing the advertising creative with the category name subject to space restrictions. 51. A system according to claim 50 , further comprising: a hierarchy of categories; and a category summarizer to summarize the category name by prepending ancestor categories determined from the hierarchy. | 0.5 |
9,043,207 | 11 | 12 | 11. A system for performing speaker recognition, comprising: a database stored and operating on a computer and configured to store speaker information for a target speaker; software means stored and operating on the computer and configured to classify speech samples of telephone calls according to at least one unknown speaker thereby providing one, two or more speaker-dependent classes of speech samples; software means stored and operating on the computer and confugured to extract speaker information for the speech samples of each of the speaker-dependent classes of speech samples; software means stored and operating on the computer and configured to combine the extracted speaker information for each of the speaker-dependent classes of speech samples; software means stored and operating on the computer and configured to compare the combined extracted speaker information for each of the speaker-dependent classes of speech samples with the stored speaker information for the at least one target speaker to obtain at least one comparison result; and software means stored and operating on the computer and configured to determine whether one of the at least one unknown speakers is identical with the at least one target speaker based on the at least one comparison result. | 11. A system for performing speaker recognition, comprising: a database stored and operating on a computer and configured to store speaker information for a target speaker; software means stored and operating on the computer and configured to classify speech samples of telephone calls according to at least one unknown speaker thereby providing one, two or more speaker-dependent classes of speech samples; software means stored and operating on the computer and confugured to extract speaker information for the speech samples of each of the speaker-dependent classes of speech samples; software means stored and operating on the computer and configured to combine the extracted speaker information for each of the speaker-dependent classes of speech samples; software means stored and operating on the computer and configured to compare the combined extracted speaker information for each of the speaker-dependent classes of speech samples with the stored speaker information for the at least one target speaker to obtain at least one comparison result; and software means stored and operating on the computer and configured to determine whether one of the at least one unknown speakers is identical with the at least one target speaker based on the at least one comparison result. 12. The system of claim 11 , further comprising software means stored and operating on the computer and configured to receive telephone calls from at least one unknown speaker. | 0.564356 |
8,676,583 | 1 | 12 | 1. A computer-based method of performing an action in a spoken dialog system comprising: retrieving a policy mapping belief states of user intents to actions; receiving a spoken utterance from a user; determining a belief state of the user's intent based on the spoken utterance using a probabilistic ontology tree (POT) comprising a plurality of unobserved nodes each representing a domain concept and comprising a probability distribution table including probabilities that the concept represented by the unobserved node takes each of a plurality of values, wherein each unobserved node is associated with a dialog slot to which the spoken utterance is assigned based on the relatedness between the spoken utterance and the domain concept represented by the unobserved node; selecting an action to take based on the determined belief state and the retrieved policy; and performing the selected action. | 1. A computer-based method of performing an action in a spoken dialog system comprising: retrieving a policy mapping belief states of user intents to actions; receiving a spoken utterance from a user; determining a belief state of the user's intent based on the spoken utterance using a probabilistic ontology tree (POT) comprising a plurality of unobserved nodes each representing a domain concept and comprising a probability distribution table including probabilities that the concept represented by the unobserved node takes each of a plurality of values, wherein each unobserved node is associated with a dialog slot to which the spoken utterance is assigned based on the relatedness between the spoken utterance and the domain concept represented by the unobserved node; selecting an action to take based on the determined belief state and the retrieved policy; and performing the selected action. 12. The method of claim 1 , wherein determining a belief state of the user's intent based on the spoken utterance comprises: creating an observed node in the POT for each dialog slot associated with an unobserved node to which the spoken utterance is assigned, each observed node comprising a probability distribution table including probabilities that the intended node value of the unobserved node is correctly and incorrectly identified; and determining a belief state of user intent based on the joint probability of the unobserved node probability distribution tables and the observed node probability distribution tables. | 0.5 |
9,734,217 | 6 | 9 | 6. A method for analyzing entity performance, the method comprising: receiving, from a user computer via a network, a request with one or more filter selections; accessing, by a server computer, a data structure in a memory, the data structure comprising a plurality of categories of information showing interactions related to multiple entities; identifying, by the server computer, a set of categories of the plurality of categories within the data structure based on the one or more filter selections, wherein the set of categories within the data structure includes location information related to at least one of the multiple entities, wherein the plurality of categories of the data structure include at least one of: an interaction number category, a consuming entity identification category, a consuming entity location category, a provisioning entity identification category, a provisioning entity location category, a type of provisioning entity category, an interaction amount category, and a time of interaction category; determining, by the server computer, the location information of the at least one of the multiple entities to update the data structure, wherein the location information is determined based on a computed affinity score that is based on computed travel times so that the affinity score can have an inverse proportionality with computed travel times such that a higher affinity score can have a lower travel time, wherein the computed affinity score is used to estimate the location information within an estimated area location for the provisioning entity without an identified location information, wherein the determining includes verifying that a populated category of the plurality of categories is valid data that signifies the location information; updating, by the server computer, the data structure with the determined location information within the area location; processing, by the server computer, the location information of the identified set of the plurality of categories to analyze a performance of one or more entities of the multiple entities in accordance with the one or more filter selections; and providing the processed location information to display the performance of the one or more entities on a graphical user interface of the user computer. | 6. A method for analyzing entity performance, the method comprising: receiving, from a user computer via a network, a request with one or more filter selections; accessing, by a server computer, a data structure in a memory, the data structure comprising a plurality of categories of information showing interactions related to multiple entities; identifying, by the server computer, a set of categories of the plurality of categories within the data structure based on the one or more filter selections, wherein the set of categories within the data structure includes location information related to at least one of the multiple entities, wherein the plurality of categories of the data structure include at least one of: an interaction number category, a consuming entity identification category, a consuming entity location category, a provisioning entity identification category, a provisioning entity location category, a type of provisioning entity category, an interaction amount category, and a time of interaction category; determining, by the server computer, the location information of the at least one of the multiple entities to update the data structure, wherein the location information is determined based on a computed affinity score that is based on computed travel times so that the affinity score can have an inverse proportionality with computed travel times such that a higher affinity score can have a lower travel time, wherein the computed affinity score is used to estimate the location information within an estimated area location for the provisioning entity without an identified location information, wherein the determining includes verifying that a populated category of the plurality of categories is valid data that signifies the location information; updating, by the server computer, the data structure with the determined location information within the area location; processing, by the server computer, the location information of the identified set of the plurality of categories to analyze a performance of one or more entities of the multiple entities in accordance with the one or more filter selections; and providing the processed location information to display the performance of the one or more entities on a graphical user interface of the user computer. 9. The method of claim 6 , wherein the one or more filter selections are mapped to one or more of the plurality of categories of the data structure. | 0.75817 |
9,620,124 | 17 | 19 | 17. A computer-readable medium storing instructions that, when executed, cause the following to occur: identifying a textual item in a user interface; associating a plurality of different audio files with the textual item, wherein the plurality of different audio files comprise a corresponding plurality of different audio announcements of the textual item; receiving, by a computing device, a first selection of the textual item in the user interface; determining a first one of the plurality of different audio files to use for audibly announcing the textual item, wherein the determining is based on a rule governing audio announcement in response to repeated selection of the textual item; causing playback of the first one of the plurality of different audio files based on the determining and responsive to the first selection of the textual item; receiving, by the computing device, a second selection of the textual item in the user interface; determining whether the second selection is a repeated selection of the textual item; and in response to determining that the second selection is a repeated selection of the textual item, causing playback of a second one of the plurality of different audio files responsive to the repeated selection of the textual item, wherein the second one of the plurality of different audio files comprises a different amount of explanatory speech than the first one of the plurality of different audio files. | 17. A computer-readable medium storing instructions that, when executed, cause the following to occur: identifying a textual item in a user interface; associating a plurality of different audio files with the textual item, wherein the plurality of different audio files comprise a corresponding plurality of different audio announcements of the textual item; receiving, by a computing device, a first selection of the textual item in the user interface; determining a first one of the plurality of different audio files to use for audibly announcing the textual item, wherein the determining is based on a rule governing audio announcement in response to repeated selection of the textual item; causing playback of the first one of the plurality of different audio files based on the determining and responsive to the first selection of the textual item; receiving, by the computing device, a second selection of the textual item in the user interface; determining whether the second selection is a repeated selection of the textual item; and in response to determining that the second selection is a repeated selection of the textual item, causing playback of a second one of the plurality of different audio files responsive to the repeated selection of the textual item, wherein the second one of the plurality of different audio files comprises a different amount of explanatory speech than the first one of the plurality of different audio files. 19. The computer-readable medium of claim 17 , further storing instructions that, when executed, cause the following to occur: identifying a plurality of screens of the user interface; associating a first screen audio file with a first screen of the plurality of screens; and in response to a selection of the first screen for display, retrieving the first screen audio file for playback. | 0.608871 |
6,088,524 | 13 | 19 | 13. A computer system for performing database queries involving aggregation given an initial set of predicates which includes one or more aggregation predicates, comprising: means for translating at least one of said aggregation predicates into a representative form which is a functional term symbolized by f.sub.{R,X,A,Y}, wherein R is a relation having one or more attributes, Xrepresents said attributes of R which are grouped and A is an aggregation function applied on attribute Y of R, said representative form suitable for illustrating a relationship involving said aggregation predicates; means for inferring one or more new predicates, using said representative form from said initial set of predicates; and means for solving said database query using said new predicates. | 13. A computer system for performing database queries involving aggregation given an initial set of predicates which includes one or more aggregation predicates, comprising: means for translating at least one of said aggregation predicates into a representative form which is a functional term symbolized by f.sub.{R,X,A,Y}, wherein R is a relation having one or more attributes, Xrepresents said attributes of R which are grouped and A is an aggregation function applied on attribute Y of R, said representative form suitable for illustrating a relationship involving said aggregation predicates; means for inferring one or more new predicates, using said representative form from said initial set of predicates; and means for solving said database query using said new predicates. 19. A computer system according to claim 13 wherein said means for inferring one or more new predicates comprises: means for determining whether one or more of said new predicates is not useful to solve said query; and means for eliminating said non-useful new predicate. | 0.620448 |
9,946,725 | 1 | 4 | 1. A method of collaborative document editing, the method comprising: receiving, at a server from a client system, a first request to access a document stored at the server; providing, by the server, to the client system, an application in a browser of the client system, wherein the application is enabled to modify the document; providing, by the server, to the client system, a first portion of the document in the application; receiving, by the server, a second request to access the document; determining, by the server, whether a user that is associated with the second request is authorized to access the document; in response to determining that the user is authorized to access the document, transmitting, by the server, a second portion of the document; receiving an edit to at least one of the first portion of the document or the second portion of the document; and saving, by the server, the edit to the at least one of the first portion of the document or the second portion of the document. | 1. A method of collaborative document editing, the method comprising: receiving, at a server from a client system, a first request to access a document stored at the server; providing, by the server, to the client system, an application in a browser of the client system, wherein the application is enabled to modify the document; providing, by the server, to the client system, a first portion of the document in the application; receiving, by the server, a second request to access the document; determining, by the server, whether a user that is associated with the second request is authorized to access the document; in response to determining that the user is authorized to access the document, transmitting, by the server, a second portion of the document; receiving an edit to at least one of the first portion of the document or the second portion of the document; and saving, by the server, the edit to the at least one of the first portion of the document or the second portion of the document. 4. The method of claim 1 , wherein in response to determining that the user is not authorized to access the document transmitting an error message. | 0.575145 |
8,538,750 | 2 | 4 | 2. The speech communication system according to claim 1 , wherein the speech processing unit is further configured to generate the response based on a conversation history with the conversation partner. | 2. The speech communication system according to claim 1 , wherein the speech processing unit is further configured to generate the response based on a conversation history with the conversation partner. 4. The speech communication system according to claim 2 , further comprising: a camera; and a microphone. | 0.79249 |
9,262,535 | 1 | 2 | 1. A computer-implemented method comprising: receiving, via a network at a first client computer, a plurality of content items from one or more content sources, wherein each of the plurality of content items is a copy of a content item or a reference to a content item; presenting the plurality of content items in an organizational tool at the first client computer; receiving a first user's interactions with the plurality of content items via the organizational tool, wherein the first user's interactions comprise steps to organize the plurality of content items within a first local hierarchy of folders maintained by the organizational tool; and transmitting the first user's interactions, via the network, from the first client computer to a server computer, wherein a policy engine at the server computer determines whether to update a global hierarchy of folders comprising the plurality of content items based on the first user's interactions and interactions of at least one other user. | 1. A computer-implemented method comprising: receiving, via a network at a first client computer, a plurality of content items from one or more content sources, wherein each of the plurality of content items is a copy of a content item or a reference to a content item; presenting the plurality of content items in an organizational tool at the first client computer; receiving a first user's interactions with the plurality of content items via the organizational tool, wherein the first user's interactions comprise steps to organize the plurality of content items within a first local hierarchy of folders maintained by the organizational tool; and transmitting the first user's interactions, via the network, from the first client computer to a server computer, wherein a policy engine at the server computer determines whether to update a global hierarchy of folders comprising the plurality of content items based on the first user's interactions and interactions of at least one other user. 2. The method of claim 1 , wherein the interactions of at least one other user comprise steps taken by a second user to organize a second plurality of content items within a second local hierarchy of folders maintained by a second organizational tool at a second client computer. | 0.5 |
7,900,134 | 1 | 5 | 1. A method of providing a user interface (UI) comprising: rendering a DHTML document from an XML document using a crystal, the crystal containing one or more behaviors and at least one XSLT transformation (XSL-T); presenting a user interface based, at least in part, on the XSL-T that was used to render the DHTML document; receiving, via the user interface, user interactions with the DHTML document; and mapping, via the one or more behaviors, the user interactions to the XML document. | 1. A method of providing a user interface (UI) comprising: rendering a DHTML document from an XML document using a crystal, the crystal containing one or more behaviors and at least one XSLT transformation (XSL-T); presenting a user interface based, at least in part, on the XSL-T that was used to render the DHTML document; receiving, via the user interface, user interactions with the DHTML document; and mapping, via the one or more behaviors, the user interactions to the XML document. 5. The method of claim 1 , wherein the user interface comprises an accelerator. | 0.754658 |
9,965,484 | 18 | 19 | 18. The computer program product of claim 17 , wherein: the copy template comprises a set of grammatical rules for parsing the source file to extract a set of tokens corresponding with the set of data fields, each token of the set of tokens comprises a character string. | 18. The computer program product of claim 17 , wherein: the copy template comprises a set of grammatical rules for parsing the source file to extract a set of tokens corresponding with the set of data fields, each token of the set of tokens comprises a character string. 19. The computer program product of claim 18 , wherein: the paste template comprises a mapping of the set of tokens into the target file. | 0.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.