sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
17. The method of claim 14 further comprising: creating a hash map that stores hash values of the set of tokens from the dictionary data store; and calculating a hash value of a candidate token from the input text string, wherein presence of the calculated hash value in the hash map indicates that the candidate token matches one of the set of tokens. | 17. The method of claim 14 further comprising: creating a hash map that stores hash values of the set of tokens from the dictionary data store; and calculating a hash value of a candidate token from the input text string, wherein presence of the calculated hash value in the hash map indicates that the candidate token matches one of the set of tokens. 18. The method of claim 17 wherein: the set of tokens is a proper subset of the plurality of tokens in the dictionary data store; and the method further comprises selecting the set of tokens from the plurality of tokens based on a domain of the input text string. | 0.908232 |
19. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving, for each image in a set of images, a corresponding set of labels, each label being determined to be indicative of subject matter of the image; for each label, determining one or more confidence values, each confidence value being a measure of confidence that the label accurately describes the subject matter of a threshold number of respective images to which it corresponds; identifying labels for which each of the one or more confidence values meets a respective confidence threshold as high confidence labels; for each image in the set of images, identifying the labels in its corresponding set of labels that are high confidence labels; and identifying images having a corresponding set of labels that include at least a respective threshold number of high confidence labels as high confidence images. | 19. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving, for each image in a set of images, a corresponding set of labels, each label being determined to be indicative of subject matter of the image; for each label, determining one or more confidence values, each confidence value being a measure of confidence that the label accurately describes the subject matter of a threshold number of respective images to which it corresponds; identifying labels for which each of the one or more confidence values meets a respective confidence threshold as high confidence labels; for each image in the set of images, identifying the labels in its corresponding set of labels that are high confidence labels; and identifying images having a corresponding set of labels that include at least a respective threshold number of high confidence labels as high confidence images. 22. The non-transitory computer storage medium of claim 19 , wherein: determining one or more confidence values comprises: determining, for the label, selected images for which image search results were selected in response to a query that matches the label; and determining a number of unique images in the selected images; and identifying labels for which each of the one or more confidence values meets a respective confidence threshold as high confidence labels comprises identifying labels for which the number of unique images in the selected images meets a first frequency threshold. | 0.649528 |
1. A method for language translation comprising: providing program code to launch a translation window associated with a primary window; providing a link to the program code, wherein when the primary window is displayed on a screen and the user selects the link, the program code causes the translation window to open on the screen in combination with the primary window; in the translation window, indicating input information in a first language; translating the input information from the first language to information in a second language; in the translation window, displaying the information in the second language; and permitting scrolling of the primary window independently from the translation window. | 1. A method for language translation comprising: providing program code to launch a translation window associated with a primary window; providing a link to the program code, wherein when the primary window is displayed on a screen and the user selects the link, the program code causes the translation window to open on the screen in combination with the primary window; in the translation window, indicating input information in a first language; translating the input information from the first language to information in a second language; in the translation window, displaying the information in the second language; and permitting scrolling of the primary window independently from the translation window. 17. The method of claim 1 wherein the user can resize the translation window. | 0.655569 |
6. The method of claim 5 , the each historic behavior data indicating behavior of each one of the selected collective plurality of avatars diverging from the rule greater than an average value of divergence from the rule of a sample group of avatars within the virtual universe. | 6. The method of claim 5 , the each historic behavior data indicating behavior of each one of the selected collective plurality of avatars diverging from the rule greater than an average value of divergence from the rule of a sample group of avatars within the virtual universe. 7. The method of claim 6 , wherein at least one of the collective plurality and the sample group is an entirety of avatars residing within the virtual universe. | 0.927411 |
1. A method for selecting associates for expatriate assignments comprising: (a) establishing a date for a new product launch; (b) determining a first period of years in advance of said date to complete an expatriate associate selection process for expatriate assignments applicable to said new product launch; (c) within said first period of years: (1) identifying a plurality of associates eligible for said expatriate assignments; (2) providing each of said plurality of associates with preview information relevant to a plurality of expatriate assignments, said preview information comprising organization, job description, and career progression information related to said expatriate assignments; (3) receiving identifying information for a first set of candidates from said plurality of associates who have: (A) reviewed said preview information regarding said plurality of expatriate assignments; and (B) agreed to be considered for said expatriate assignments; (4) administering a plurality of assessments to said first set of candidates; (5) entering in a computer assessment data for said first set of candidates completing said plurality of assessments; (6) preparing at said computer a candidate selection summary report for comparing assessment data across all candidates in said first set of candidates; (7) creating an Expatriate Pool of candidates by comparing said assessment data to select from said first set of candidates a subset of candidates to add to said Expatriate Pool of candidates; (8) identifying at said computer specifications for each of a plurality of expatriate assignments for said new product launch, wherein said identifying occurs a second period of years after said plurality of assessments are completed, said second period of years being a subset of said first period of years; (9) after identifying said assignments and after creating said Expatriate Pool of candidates, creating at said computer a group of expatriate associates for said expatriate assignments by matching assignments to candidates from said Expatriate Pool of candidates; (10) establishing at said computer an assignment plan for each associate in said group of expatriate associates, said assignment plan comprising activities to assist in preparing said associates for said expatriate assignments; (11) arranging for said group of expatriate associates to complete said expatriate assignments outside said associates' home countries; (12) arranging for said group of expatriate associates to return said associates' home countries; (d) after said first period of years and completion of said expatriate assignments and by said date, launching said new product. | 1. A method for selecting associates for expatriate assignments comprising: (a) establishing a date for a new product launch; (b) determining a first period of years in advance of said date to complete an expatriate associate selection process for expatriate assignments applicable to said new product launch; (c) within said first period of years: (1) identifying a plurality of associates eligible for said expatriate assignments; (2) providing each of said plurality of associates with preview information relevant to a plurality of expatriate assignments, said preview information comprising organization, job description, and career progression information related to said expatriate assignments; (3) receiving identifying information for a first set of candidates from said plurality of associates who have: (A) reviewed said preview information regarding said plurality of expatriate assignments; and (B) agreed to be considered for said expatriate assignments; (4) administering a plurality of assessments to said first set of candidates; (5) entering in a computer assessment data for said first set of candidates completing said plurality of assessments; (6) preparing at said computer a candidate selection summary report for comparing assessment data across all candidates in said first set of candidates; (7) creating an Expatriate Pool of candidates by comparing said assessment data to select from said first set of candidates a subset of candidates to add to said Expatriate Pool of candidates; (8) identifying at said computer specifications for each of a plurality of expatriate assignments for said new product launch, wherein said identifying occurs a second period of years after said plurality of assessments are completed, said second period of years being a subset of said first period of years; (9) after identifying said assignments and after creating said Expatriate Pool of candidates, creating at said computer a group of expatriate associates for said expatriate assignments by matching assignments to candidates from said Expatriate Pool of candidates; (10) establishing at said computer an assignment plan for each associate in said group of expatriate associates, said assignment plan comprising activities to assist in preparing said associates for said expatriate assignments; (11) arranging for said group of expatriate associates to complete said expatriate assignments outside said associates' home countries; (12) arranging for said group of expatriate associates to return said associates' home countries; (d) after said first period of years and completion of said expatriate assignments and by said date, launching said new product. 6. The method of claim 1 wherein at least one of said assessments is a self-assessment. | 0.524316 |
1. A method for providing an index for a searching a versioned structured document, the method comprising: providing by a server a first plurality of versioned nodes (“vNodes”) representing a plurality of objects of a first version of a structured document, wherein each vNode includes versioning information associated with the first version of the structured document and wherein, collectively, the first plurality of vNodes graphically represent the first version of the structured document in a versioned document object model (“vDOM”) node tree; generating by the server a versioned index (“vIndex”) key associated with a first vNode of the first plurality of vNodes, wherein the vIndex key includes index information based on at least a portion of the versioning information of the first vNode, wherein the at least a portion of the versioning information of the first vNode includes version identifier information, and wherein versioning information of at least another vNode does not include version identifier information; and storing by the server the vIndex key associated with the first vNode in a vIndex associated with the structured document. | 1. A method for providing an index for a searching a versioned structured document, the method comprising: providing by a server a first plurality of versioned nodes (“vNodes”) representing a plurality of objects of a first version of a structured document, wherein each vNode includes versioning information associated with the first version of the structured document and wherein, collectively, the first plurality of vNodes graphically represent the first version of the structured document in a versioned document object model (“vDOM”) node tree; generating by the server a versioned index (“vIndex”) key associated with a first vNode of the first plurality of vNodes, wherein the vIndex key includes index information based on at least a portion of the versioning information of the first vNode, wherein the at least a portion of the versioning information of the first vNode includes version identifier information, and wherein versioning information of at least another vNode does not include version identifier information; and storing by the server the vIndex key associated with the first vNode in a vIndex associated with the structured document. 8. The method of claim 1 further comprising: providing by the server an updated vNode in response to receiving a new head version of the structured document that removes the object represented by the updated vNode from a previous head version of the structured document, wherein the updated vNode includes updated versioning information associated with the new head version of the structured document; identifying by the server an existing vIndex key in the vIndex associated with the updated vNode representing the removed object; generating by the server a new vIndex key corresponding to the updated vNode that includes index information based on at least a portion of the updated versioning information of the updated vNode; and replacing the existing vIndex key with the new vIndex key corresponding to the updated vNode in the vIndex associated with the versioned structured document. | 0.550738 |
1. A method for processing a Web page addressed by a link destination of a hyperlink provided at a device, the method comprising: in response to selecting the hyperlink, storing a text portion of the hyperlink; retrieving at least a portion of the Web page; and identifying at least one frame in the portion of the Web page matching the stored text portion of the hyperlink. | 1. A method for processing a Web page addressed by a link destination of a hyperlink provided at a device, the method comprising: in response to selecting the hyperlink, storing a text portion of the hyperlink; retrieving at least a portion of the Web page; and identifying at least one frame in the portion of the Web page matching the stored text portion of the hyperlink. 2. The method of claim 1 , further comprising presenting a beginning of the frame on a display of the device. | 0.618199 |
8. A system for dynamic Document Object Model (DOM) aware code editing comprising: at least one processor; and at least one non-transitory computer-readable storage medium storing instructions thereon that, when executed by the at least one processor, cause the system to: store, in a DOM model, a plurality of elements in one or more HyperText Markup Language (HTML) files of a project; identify, prior to code execution and in the DOM model at least one modification to the DOM elements that results from the invocation of one or more JavaScript files for the project, wherein during JavaScript code editing, the at least one modification to the DOM is based on an interaction between the JavaScript code and the DOM elements; and access, prior to code execution, the DOM model to perform at least one of code completion or code refactoring. | 8. A system for dynamic Document Object Model (DOM) aware code editing comprising: at least one processor; and at least one non-transitory computer-readable storage medium storing instructions thereon that, when executed by the at least one processor, cause the system to: store, in a DOM model, a plurality of elements in one or more HyperText Markup Language (HTML) files of a project; identify, prior to code execution and in the DOM model at least one modification to the DOM elements that results from the invocation of one or more JavaScript files for the project, wherein during JavaScript code editing, the at least one modification to the DOM is based on an interaction between the JavaScript code and the DOM elements; and access, prior to code execution, the DOM model to perform at least one of code completion or code refactoring. 13. The system as recited in claim 8 , the instructions that cause the system to access the DOM model to perform at least one of code completion or code refactoring further cause the system to perform at least one of code completion or code refactoring after each line of code is entered. | 0.533365 |
5. A computer-readable storage medium having stored thereon computer-executable instructions that, when executed by one or more processors of a computing system, perform a method for facilitating extension of application functionality by generating one or more application programming interfaces (API) that facilitate document development using domain terminology rather than native terminology of a host application, the method comprising: accessing a schema component, the schema component including a schema element representative of a at least one domain terminology term of one or more problems for solving in a host application, wherein the at least one domain terminology term is different from native terminology utilized in a general API of the host application, wherein the native terminology identifies elements by at least one of cell address or range, and the domain terminology identifies the same elements with textual descriptive terms; mapping the schema element to a construct of the general API of the host application, using a mapping component, such that the domain terminology that includes the textual descriptive terms maps to the native terminology that includes the at least one of cell address or range information thereby enabling the host application to operate on the domain terminology utilizing the textual descriptive terms; and generating a new API based upon the mapping created by the mapping component, using a generating component, wherein the new API interfacing with the host application and facilitating document development using the textual descriptive terms of the domain terminology in the host application in lieu of the cell address or range information of the native terminology of the host application. | 5. A computer-readable storage medium having stored thereon computer-executable instructions that, when executed by one or more processors of a computing system, perform a method for facilitating extension of application functionality by generating one or more application programming interfaces (API) that facilitate document development using domain terminology rather than native terminology of a host application, the method comprising: accessing a schema component, the schema component including a schema element representative of a at least one domain terminology term of one or more problems for solving in a host application, wherein the at least one domain terminology term is different from native terminology utilized in a general API of the host application, wherein the native terminology identifies elements by at least one of cell address or range, and the domain terminology identifies the same elements with textual descriptive terms; mapping the schema element to a construct of the general API of the host application, using a mapping component, such that the domain terminology that includes the textual descriptive terms maps to the native terminology that includes the at least one of cell address or range information thereby enabling the host application to operate on the domain terminology utilizing the textual descriptive terms; and generating a new API based upon the mapping created by the mapping component, using a generating component, wherein the new API interfacing with the host application and facilitating document development using the textual descriptive terms of the domain terminology in the host application in lieu of the cell address or range information of the native terminology of the host application. 6. The computer-readable storage medium of claim 5 , wherein the method further comprises using a separation component to separate data from document content. | 0.617478 |
1. A method comprising: monitoring actions associated with users connected to a target user in a social networking system; responsive to identifying a first action associated with a first user connected to the target user, updating a news ticker interface in real time to display the first action and the associated first user as a story within the news ticker interface, the news ticker interface displaying a plurality of stories; and responsive to receiving a selection of a displayed story from a user within the news ticker interface: displaying a story interface containing additional information related to the context of the selected story; identifying a second action of a second user connected to the first user associated with the selected story; and displaying information related to the second action in the story interface. | 1. A method comprising: monitoring actions associated with users connected to a target user in a social networking system; responsive to identifying a first action associated with a first user connected to the target user, updating a news ticker interface in real time to display the first action and the associated first user as a story within the news ticker interface, the news ticker interface displaying a plurality of stories; and responsive to receiving a selection of a displayed story from a user within the news ticker interface: displaying a story interface containing additional information related to the context of the selected story; identifying a second action of a second user connected to the first user associated with the selected story; and displaying information related to the second action in the story interface. 14. The method of claim 1 , wherein the selected story comprises an establishment of a connection between a user connected to the target user and a third user, and wherein the displayed information comprises information related to the third user. | 0.546523 |
9. A method for obstacle detection in an autonomous vehicle, the method comprising: receiving, by a controller including one or more processing devices, two or more audio streams from two or more microphones mounted to the autonomous vehicle; detecting, by the controller, audio features in the two or more audio streams; detecting, by the controller, a direction to a sound source according to the audio features; identifying, by the controller, a class for the sound source according to the audio features; and determining, by the controller, that the class for the sound source is a vehicle, in response to determining that the class for the sound source is a vehicle, invoking obstacle avoidance with respect to the direction to the sound source; wherein identifying the class for the sound source according to the audio features comprises inputting, by the controller, the audio features into a machine learning model; and wherein the method further comprises outputting, by the machine-learning model, a confidence value indicating a probability that the audio features correspond to a vehicle. | 9. A method for obstacle detection in an autonomous vehicle, the method comprising: receiving, by a controller including one or more processing devices, two or more audio streams from two or more microphones mounted to the autonomous vehicle; detecting, by the controller, audio features in the two or more audio streams; detecting, by the controller, a direction to a sound source according to the audio features; identifying, by the controller, a class for the sound source according to the audio features; and determining, by the controller, that the class for the sound source is a vehicle, in response to determining that the class for the sound source is a vehicle, invoking obstacle avoidance with respect to the direction to the sound source; wherein identifying the class for the sound source according to the audio features comprises inputting, by the controller, the audio features into a machine learning model; and wherein the method further comprises outputting, by the machine-learning model, a confidence value indicating a probability that the audio features correspond to a vehicle. 15. The method of claim 9 , wherein identifying the audible features comprises filtering, by the controller, the two or more audio streams to obtain two or more filtered signals each including one or more of the audible features. | 0.629293 |
1. A computer-implemented method of formatting content on a user network site, comprising: receiving format preference information for the user network site from a network site administrator, the format preference information defining a format preference of the user network site; identifying format performance information comprising performance metrics of advertisements, each of the performance metrics based upon a performance of a particular advertisement positioned at a particular advertisement location on network sites having a particular format; based upon the identified format performance information, determining advertisement locations on the user network site that optimize a performance metric of advertisements presented on the user network site; determining a document format for the user network site based on the format preference information and the determined advertisement locations; dynamically adjusting the document format based on changes to the format preference information or the format performance information; and formatting the user network site based on the adjusted document format. | 1. A computer-implemented method of formatting content on a user network site, comprising: receiving format preference information for the user network site from a network site administrator, the format preference information defining a format preference of the user network site; identifying format performance information comprising performance metrics of advertisements, each of the performance metrics based upon a performance of a particular advertisement positioned at a particular advertisement location on network sites having a particular format; based upon the identified format performance information, determining advertisement locations on the user network site that optimize a performance metric of advertisements presented on the user network site; determining a document format for the user network site based on the format preference information and the determined advertisement locations; dynamically adjusting the document format based on changes to the format preference information or the format performance information; and formatting the user network site based on the adjusted document format. 8. The method of claim 1 , wherein the user network site comprises a blog site administrated by at least one human user. | 0.541838 |
10. A computer program product including one or more programs of instructions embodied in a non-transitory computer readable medium and executable by a computer, wherein the computer program product executable by the computer comprises: a map display interface that displays a floormap on an electronic display, wherein one or more device objects are shown on the floormap; and an annotation interface that captures user-entered device information as an annotation object, wherein the map display interface is configured to permit user selection of a device object shown on the floormap and to associate the annotation object with the selected device object, and wherein the map display interface displays the annotation object capturing the user-entered device information, superimposed on the floormap displayed on the electronic display, and permits the user to relocate the annotation object from a first position on the floormap to another position on the floormap, wherein the annotation interface provides a device details user interface including plural device fields associated with the selected device object, the device details user interface being configured to (a) receive user selection of one or more device fields amongst the plural device fields associated with the selected device object and (b) receive user input or selection of device-associated values corresponding to the selected device fields that are to be inserted in the displayed annotation object superimposed on the floormap, wherein each device-associated value selected or input by the user is inserted in the displayed annotation object superimposed on the floormap. | 10. A computer program product including one or more programs of instructions embodied in a non-transitory computer readable medium and executable by a computer, wherein the computer program product executable by the computer comprises: a map display interface that displays a floormap on an electronic display, wherein one or more device objects are shown on the floormap; and an annotation interface that captures user-entered device information as an annotation object, wherein the map display interface is configured to permit user selection of a device object shown on the floormap and to associate the annotation object with the selected device object, and wherein the map display interface displays the annotation object capturing the user-entered device information, superimposed on the floormap displayed on the electronic display, and permits the user to relocate the annotation object from a first position on the floormap to another position on the floormap, wherein the annotation interface provides a device details user interface including plural device fields associated with the selected device object, the device details user interface being configured to (a) receive user selection of one or more device fields amongst the plural device fields associated with the selected device object and (b) receive user input or selection of device-associated values corresponding to the selected device fields that are to be inserted in the displayed annotation object superimposed on the floormap, wherein each device-associated value selected or input by the user is inserted in the displayed annotation object superimposed on the floormap. 12. The computer program product of claim 10 , wherein the displayed floormap includes a floor portion corresponding to space on the floor of the office facility and a whitespace portion disposed to border at least one side of the floor portion and not corresponding to any space on the floor of the office facility. | 0.5 |
1. A method for localizing display of applications for download, the method comprising: receiving, from a user device, a request to download a desired application, the desired application being localized in different languages; determining, by an online store, a local language associated with the user device, wherein determining the local language comprises: determining a plurality of factors associated with the user device, wherein each factor is associated with a secondary language and a weight; grouping the plurality of factors based on the secondary language to form a list of secondary languages; ranking the languages in the list of secondary languages according to the weight of each factor, and assigning a secondary language from the list of secondary languages as the local language according to the ranking; and presenting, by the online store, an interface to download a version of the desired application in the local language when the local language is one of the different languages. | 1. A method for localizing display of applications for download, the method comprising: receiving, from a user device, a request to download a desired application, the desired application being localized in different languages; determining, by an online store, a local language associated with the user device, wherein determining the local language comprises: determining a plurality of factors associated with the user device, wherein each factor is associated with a secondary language and a weight; grouping the plurality of factors based on the secondary language to form a list of secondary languages; ranking the languages in the list of secondary languages according to the weight of each factor, and assigning a secondary language from the list of secondary languages as the local language according to the ranking; and presenting, by the online store, an interface to download a version of the desired application in the local language when the local language is one of the different languages. 26. The method of claim 1 , wherein identifying the conflict between the two or more of the plurality of factors further comprises: determining that at least two of the plurality of factors are associated with a different secondary language, and wherein a greatest weight is associated with one factor, of the at least two of the plurality of factors, based on an indication that the one factor indicates a highest likelihood of a user language preference. | 0.51024 |
22. The system of claim 17 , wherein the one or more campaign configuration parameters include a calibration parameter that indicates that a calibration test should be performed, and wherein the user device is further programmed to: configure the computer program instructions to perform a calibration test prior to presenting to the user the one or more utterances, wherein to perform the calibration test, the user device is further programmed to: determine a level of ambient noise; and determine whether the level of ambient noise satisfies the calibration test; and present to the user the one or more utterances to be uttered by the user responsive to a determination that the ambient level of audio satisfies the calibration test. | 22. The system of claim 17 , wherein the one or more campaign configuration parameters include a calibration parameter that indicates that a calibration test should be performed, and wherein the user device is further programmed to: configure the computer program instructions to perform a calibration test prior to presenting to the user the one or more utterances, wherein to perform the calibration test, the user device is further programmed to: determine a level of ambient noise; and determine whether the level of ambient noise satisfies the calibration test; and present to the user the one or more utterances to be uttered by the user responsive to a determination that the ambient level of audio satisfies the calibration test. 24. The system of claim 22 , wherein the calibration parameter specifies a maximum level of ambient noise to satisfy the calibration test. | 0.78101 |
1. A system comprising: means for generating a hardware description language (HDL) implementation of a circuit design to be implemented on a programmable logic device (PLD) device; means for partitioning the circuit design into a public portion and a secret portion; means for generating an HDL implementation or a netlist implementation of the public portion without the secret portion included; means for generating an HDL implementation or a netlist implementation of an interface for coupling the public portion and the secret portion; and means for generating a programming file including configuration settings for only the secret portion based on the HDL implementation of the secret portion of the circuit design for use in programming the secret portion of the circuit design into a PLD device. | 1. A system comprising: means for generating a hardware description language (HDL) implementation of a circuit design to be implemented on a programmable logic device (PLD) device; means for partitioning the circuit design into a public portion and a secret portion; means for generating an HDL implementation or a netlist implementation of the public portion without the secret portion included; means for generating an HDL implementation or a netlist implementation of an interface for coupling the public portion and the secret portion; and means for generating a programming file including configuration settings for only the secret portion based on the HDL implementation of the secret portion of the circuit design for use in programming the secret portion of the circuit design into a PLD device. 13. The system of claim 1 , wherein the interface includes one or more boundary lookup tables (LUTs) for mapping signals from the secret portion to the public portion and from the public portion to the secret portion. | 0.690816 |
11. A computing device for generating a task, the computing device comprising: a memory storing data associated with one or more client devices, and computer-executable instructions; and a processor configured to execute the computer-executable instructions to: receive, by the computing device, a first instruction to define a configurable automation task based on structured data; apply access controls to the configurable automation task that match a group stored on the computing device; adjust one or more remote target systems in the configurable automation task based on the group stored on the computing device; upon determining that the configurable automation task is at least partly a remote task rather than a local task, obtain data relating to a first remote target system of the one or more remote target systems associated with the configurable automation task; upon determining that the obtained data relating to the first remote target system of the one or more remote target systems matches data of at least one target systems associated with the computing device, receive one or more parameter types and parameter definitions associated with the configurable automation task; generate a first user interface based on the received one or more parameter definitions and one or more parameter types; receive one or more parameter definition values via the generated first user interface; generate a script based on the received first instruction, the received one or more parameter definitions, and the received one or more parameter definition values; transmit the generated script to the first remote target system to perform a first operation of one or more operations associated with the configurable automation task in accordance with the received one or more parameter definitions, and the received one or more parameter definition values; and utilize a second user interface configured to integrate the generated script with one or more remote execution capabilities of the one or more remote target systems by transmitting, to a second remote target system of the one or more remote target systems, a second instruction to perform a second operation of the one or more operations associated with the configurable automation task, the second operation being different from the first operation. | 11. A computing device for generating a task, the computing device comprising: a memory storing data associated with one or more client devices, and computer-executable instructions; and a processor configured to execute the computer-executable instructions to: receive, by the computing device, a first instruction to define a configurable automation task based on structured data; apply access controls to the configurable automation task that match a group stored on the computing device; adjust one or more remote target systems in the configurable automation task based on the group stored on the computing device; upon determining that the configurable automation task is at least partly a remote task rather than a local task, obtain data relating to a first remote target system of the one or more remote target systems associated with the configurable automation task; upon determining that the obtained data relating to the first remote target system of the one or more remote target systems matches data of at least one target systems associated with the computing device, receive one or more parameter types and parameter definitions associated with the configurable automation task; generate a first user interface based on the received one or more parameter definitions and one or more parameter types; receive one or more parameter definition values via the generated first user interface; generate a script based on the received first instruction, the received one or more parameter definitions, and the received one or more parameter definition values; transmit the generated script to the first remote target system to perform a first operation of one or more operations associated with the configurable automation task in accordance with the received one or more parameter definitions, and the received one or more parameter definition values; and utilize a second user interface configured to integrate the generated script with one or more remote execution capabilities of the one or more remote target systems by transmitting, to a second remote target system of the one or more remote target systems, a second instruction to perform a second operation of the one or more operations associated with the configurable automation task, the second operation being different from the first operation. 20. The computing device of claim 11 , wherein the processor is further configured to execute the computer-executable instructions to receive input specifying a task group identifier associated with the script, the task group identifier for comparison with a target group identifier on at least one target system to determine script access based on the comparison. | 0.514354 |
1. A method comprising: receiving, with a database system, a first query and a second query for a Resource Description Framework (RDF) database that stores a plurality of data chunks to one or more storage drives, wherein each of the plurality of data chunks includes a plurality of triples that represent an RDF subgraph of the RDF database; accessing a first index that indexes one or more of the data chunks to identify a first subset of the data chunks relevant to the first query, wherein the first index comprises keys defined by a first characteristic of the first subset of the data chunks; loading the first subset of the data chunks to a main memory associated with the database system; executing the first query only against triples included within the subset of the data chunks loaded to the main memory to obtain a query result for the first query; based on the query result for the first query, accessing a second index to identify a second subset of the data chunks relevant to the second query, wherein the second index comprises keys defined by a second characteristic of the second subset of the data chunks; loading the second subset of the data chunks to the main memory; and executing the second query only against triples included within the first subset of the data chunks and the second subset of the data chunks loaded to the main memory to obtain a query result for the second query. | 1. A method comprising: receiving, with a database system, a first query and a second query for a Resource Description Framework (RDF) database that stores a plurality of data chunks to one or more storage drives, wherein each of the plurality of data chunks includes a plurality of triples that represent an RDF subgraph of the RDF database; accessing a first index that indexes one or more of the data chunks to identify a first subset of the data chunks relevant to the first query, wherein the first index comprises keys defined by a first characteristic of the first subset of the data chunks; loading the first subset of the data chunks to a main memory associated with the database system; executing the first query only against triples included within the subset of the data chunks loaded to the main memory to obtain a query result for the first query; based on the query result for the first query, accessing a second index to identify a second subset of the data chunks relevant to the second query, wherein the second index comprises keys defined by a second characteristic of the second subset of the data chunks; loading the second subset of the data chunks to the main memory; and executing the second query only against triples included within the first subset of the data chunks and the second subset of the data chunks loaded to the main memory to obtain a query result for the second query. 9. The method of claim 1 , further comprising: using the query result of the first query to select at least one data chunk of the first subset of data chunks to be cleared from main memory prior to loading the second subset of the data chunks. | 0.621643 |
10. A communication device for determining contextual information, comprising: a processing unit interconnected with a memory device, a communication interface and a display device, said processing unit enabled to: receive textual information from calendar data associated with a calendar event; process said textual information to automatically extract contextual data embedded in said textual information in response to said receiving; automatically retrieve supplementary contextual data based on said contextual data from a remote data source via said communication interface in response to said processing; and, automatically render said supplementary contextual data at said display device in association with said calendar event from which the textual information was received and said contextual data in response to receiving said supplementary contextual data; and determine a time for automatically rendering said supplementary contextual data at said display device in association with said contextual data, using said supplementary context data. | 10. A communication device for determining contextual information, comprising: a processing unit interconnected with a memory device, a communication interface and a display device, said processing unit enabled to: receive textual information from calendar data associated with a calendar event; process said textual information to automatically extract contextual data embedded in said textual information in response to said receiving; automatically retrieve supplementary contextual data based on said contextual data from a remote data source via said communication interface in response to said processing; and, automatically render said supplementary contextual data at said display device in association with said calendar event from which the textual information was received and said contextual data in response to receiving said supplementary contextual data; and determine a time for automatically rendering said supplementary contextual data at said display device in association with said contextual data, using said supplementary context data. 16. The communication device of claim 10 , wherein said processing unit is further enabled to change at least one user experience application within a given time period prior to said time, said change based on at least one of said supplementary context data and said contextual data. | 0.555556 |
32. A computer-based system for parameterizing a steady-state model of an in-situ hydrocarbon reservoir, the model having a plurality of model parameters for mapping model input to model output through a stored representation of said reservoir, the system comprising: a computer, comprising: a processor; and a memory medium coupled to the processor; an input coupled to the processor and the memory medium, wherein the input is operable to receive a training data set comprising a plurality of input values and a plurality of target output values, wherein the training data set is representative of production operations of said reservoir; and an output coupled to the processor and the memory medium; wherein the memory medium stores program instructions which are executable by the processor to: receive a next at least one input value of the plurality of input values and a next target output value of the plurality of target output values; parameterize the model with a predetermined algorithm using said next at least one input value and said next target output value, and one or more derivative constraints, wherein the one or more derivative constraints are imposed to constrain relationships between the at least one input value and a resulting model output value, wherein said parameterizing comprises using an optimizer to perform constrained optimization on the plurality of model parameters to satisfy an objective function subject to the derivative constraints; iteratively perform said receiving and said parameterizing using the optimizer to generate a parameterized model, wherein the model comprises a model function, wherein the one or more derivative constraints comprise upper and/or lower bounds on one or more model function derivatives, wherein one or more of the model function derivatives comprise one or more of: a first order derivative of the model function, wherein the first order derivative represents inter-well transmissibilities; a second order derivative of the model function, wherein the second order derivative of the model function represents curvature of the inter-well transmissibilities; and/or a third order derivative of the model function, wherein the third order derivative of the model function represents rate of curvature of the inter-well transmissibilities; and store the parameterized model in the memory medium, wherein the parameterized model is usable to analyze reservoir operations; and wherein the output is operable to provide the parameterized model and/or the resulting model output values to other systems or processes to manage the reservoir operations. | 32. A computer-based system for parameterizing a steady-state model of an in-situ hydrocarbon reservoir, the model having a plurality of model parameters for mapping model input to model output through a stored representation of said reservoir, the system comprising: a computer, comprising: a processor; and a memory medium coupled to the processor; an input coupled to the processor and the memory medium, wherein the input is operable to receive a training data set comprising a plurality of input values and a plurality of target output values, wherein the training data set is representative of production operations of said reservoir; and an output coupled to the processor and the memory medium; wherein the memory medium stores program instructions which are executable by the processor to: receive a next at least one input value of the plurality of input values and a next target output value of the plurality of target output values; parameterize the model with a predetermined algorithm using said next at least one input value and said next target output value, and one or more derivative constraints, wherein the one or more derivative constraints are imposed to constrain relationships between the at least one input value and a resulting model output value, wherein said parameterizing comprises using an optimizer to perform constrained optimization on the plurality of model parameters to satisfy an objective function subject to the derivative constraints; iteratively perform said receiving and said parameterizing using the optimizer to generate a parameterized model, wherein the model comprises a model function, wherein the one or more derivative constraints comprise upper and/or lower bounds on one or more model function derivatives, wherein one or more of the model function derivatives comprise one or more of: a first order derivative of the model function, wherein the first order derivative represents inter-well transmissibilities; a second order derivative of the model function, wherein the second order derivative of the model function represents curvature of the inter-well transmissibilities; and/or a third order derivative of the model function, wherein the third order derivative of the model function represents rate of curvature of the inter-well transmissibilities; and store the parameterized model in the memory medium, wherein the parameterized model is usable to analyze reservoir operations; and wherein the output is operable to provide the parameterized model and/or the resulting model output values to other systems or processes to manage the reservoir operations. 42. The system of claim 32 , wherein said one or more derivative constraints comprise: estimated allowable ranges for one or more derivatives. | 0.543029 |
7. A computer program product for making non-shared linked documents in email messages accessible to recipients, comprising a computer readable storage medium storing computer program code, wherein the computer program code when executed on a computer, causes the computer to: upon initiation of sending of an email message by a user, automatically parse through the MIME to detect URL tags indicating that a linked document is contained within the email message, upon detection of a URL tag, check a prefix of the URL tag to determine if the linked document is accessible to a recipient, if the prefix indicates that the linked document is not accessible to the recipient, provide for selection of at least sending the linked document as an in-line document by converting the document into HTML format and embedding it into a multi part MIME message; and if the sender is sending the email message with a linked Notes email and upon determining that the recipient of the email was originally a recipient of the Notes email, converting a Notes Universal ID of the linked Notes email to a MIME id of the Notes email, wherein the MIME id of the linked Notes email provides the recipient with access to the linked Notes email message. | 7. A computer program product for making non-shared linked documents in email messages accessible to recipients, comprising a computer readable storage medium storing computer program code, wherein the computer program code when executed on a computer, causes the computer to: upon initiation of sending of an email message by a user, automatically parse through the MIME to detect URL tags indicating that a linked document is contained within the email message, upon detection of a URL tag, check a prefix of the URL tag to determine if the linked document is accessible to a recipient, if the prefix indicates that the linked document is not accessible to the recipient, provide for selection of at least sending the linked document as an in-line document by converting the document into HTML format and embedding it into a multi part MIME message; and if the sender is sending the email message with a linked Notes email and upon determining that the recipient of the email was originally a recipient of the Notes email, converting a Notes Universal ID of the linked Notes email to a MIME id of the Notes email, wherein the MIME id of the linked Notes email provides the recipient with access to the linked Notes email message. 9. The computer program product of claim 7 , wherein the computer readable medium further causes the computer to provide for selection of an option of not sending the message. | 0.631985 |
12. The computer system of claim 8 , wherein: the processor system includes a machine learning processor; the analyzing of the image data to extract image features data for each one of the one or more images is performed using the machine learning processor; the analyzing of the image data to extract metadata of the one or more images is performed using the machine learning processor. | 12. The computer system of claim 8 , wherein: the processor system includes a machine learning processor; the analyzing of the image data to extract image features data for each one of the one or more images is performed using the machine learning processor; the analyzing of the image data to extract metadata of the one or more images is performed using the machine learning processor. 13. The computer system of claim 12 wherein the image features data comprises image feature vectors. | 0.970674 |
1. A method to facilitate user productivity in visualizing and reviewing a set of document search results, the method comprising: receiving a query request comprising two or more search terms as a computer machine input, wherein each search term from the one or more search terms is assigned a graphical indicator; searching a corpora of electronically stored content for a set of at least two documents relevant to the query request; scoring a set of paragraphs associated with the set of at least two documents; ranking the set of paragraphs based on the scoring; and displaying at least one boxed abacus icon that indicates whether the two or more search terms in the query request are present in a subset of the set of paragraphs, wherein: the subset comprises a preset number of paragraphs receiving higher scores determined in the ranking step than a set of paragraphs not included in the subset, each paragraph in the subset is assigned to a vertical line in a set of vertical lines, and the at least one boxed abacus icon comprises a depiction of the graphical indicators on each vertical line corresponding to a presence of the search term in the paragraph. | 1. A method to facilitate user productivity in visualizing and reviewing a set of document search results, the method comprising: receiving a query request comprising two or more search terms as a computer machine input, wherein each search term from the one or more search terms is assigned a graphical indicator; searching a corpora of electronically stored content for a set of at least two documents relevant to the query request; scoring a set of paragraphs associated with the set of at least two documents; ranking the set of paragraphs based on the scoring; and displaying at least one boxed abacus icon that indicates whether the two or more search terms in the query request are present in a subset of the set of paragraphs, wherein: the subset comprises a preset number of paragraphs receiving higher scores determined in the ranking step than a set of paragraphs not included in the subset, each paragraph in the subset is assigned to a vertical line in a set of vertical lines, and the at least one boxed abacus icon comprises a depiction of the graphical indicators on each vertical line corresponding to a presence of the search term in the paragraph. 4. The method of claim 1 , wherein scoring of the set of paragraphs is based at least in part on a weighted term diversity variable and a weighted term density variable. | 0.860884 |
13. A non-transitory computer readable storage medium storing one or more programs to be executed by a computer system, the one or more programs comprising: instructions for receiving a portion of the search query from a search requestor at a client system that is distinct from the search query processing system; instructions for responding to receiving the portion of the search query, including: instructions for predicting from the portion of the search query a plurality of predicted queries; instructions for selecting one or more of the plurality of predicted queries; instructions for obtaining search results for the selected one or more predicted queries; instructions for selecting one or more of the obtained search results; and instructions for transmitting the selected one or more predicted queries and the selected one or more of the obtained search results to the search requestor at the client system. | 13. A non-transitory computer readable storage medium storing one or more programs to be executed by a computer system, the one or more programs comprising: instructions for receiving a portion of the search query from a search requestor at a client system that is distinct from the search query processing system; instructions for responding to receiving the portion of the search query, including: instructions for predicting from the portion of the search query a plurality of predicted queries; instructions for selecting one or more of the plurality of predicted queries; instructions for obtaining search results for the selected one or more predicted queries; instructions for selecting one or more of the obtained search results; and instructions for transmitting the selected one or more predicted queries and the selected one or more of the obtained search results to the search requestor at the client system. 16. The non-transitory computer readable storage medium of claim 13 , wherein a respective predicted query of the plurality of predicted queries includes a first query term followed by one or more subsequent query terms and one of the subsequent query terms begins with the received portion of the search query. | 0.665447 |
8. A system for determining sentiment of a message, comprising: a processor, a storage, a network interface, and wherein the processor is operable to obtain a message from the storage, the message having an associated context; wherein the processor is further operable to determine the sentiment of the context; set the sentiment of the message in accord with the sentiment of the context; and wherein the processor determines the sentiment of the context by determining the sentiment in accord with an attribute of the context. | 8. A system for determining sentiment of a message, comprising: a processor, a storage, a network interface, and wherein the processor is operable to obtain a message from the storage, the message having an associated context; wherein the processor is further operable to determine the sentiment of the context; set the sentiment of the message in accord with the sentiment of the context; and wherein the processor determines the sentiment of the context by determining the sentiment in accord with an attribute of the context. 10. The system of claim 8 , wherein the processor is further operable to: select a plurality of contexts, each associated with the message; and set the sentiment of the message in accord with the plurality of contexts. | 0.5 |
12. A mobile device, comprising: a processor; at least one input device; a display; and a memory or storage device storing computer-executable instructions that when executed by the processor cause the mobile device to perform a method of context-based auto-correction, the method comprising: performing context-based checking of a word using surrounding words in a text entry, highlighting a word or phrase of the text entry as incorrect on the display, with the input device, receiving user input selecting the highlighted word or phrase on the display, displaying one or more suggestion candidates for the highlighted word or phrase in a candidates area of the display, with the input device, receiving input selecting one of the suggestion candidates, and automatically: replacing the highlighted word with the selected suggestion candidate and displaying an updated text entry with the display, checking the updated text entry for correctness based at least in part on context of the replaced word in the updated text entry, and correcting one or more additional words of the updated text entry other than the first word. | 12. A mobile device, comprising: a processor; at least one input device; a display; and a memory or storage device storing computer-executable instructions that when executed by the processor cause the mobile device to perform a method of context-based auto-correction, the method comprising: performing context-based checking of a word using surrounding words in a text entry, highlighting a word or phrase of the text entry as incorrect on the display, with the input device, receiving user input selecting the highlighted word or phrase on the display, displaying one or more suggestion candidates for the highlighted word or phrase in a candidates area of the display, with the input device, receiving input selecting one of the suggestion candidates, and automatically: replacing the highlighted word with the selected suggestion candidate and displaying an updated text entry with the display, checking the updated text entry for correctness based at least in part on context of the replaced word in the updated text entry, and correcting one or more additional words of the updated text entry other than the first word. 20. The mobile device of claim 12 , wherein a touchscreen display comprises the input device and the display. | 0.541457 |
10. Apparatus for partitioning a speech pattern into syllabic intervals according to claim 1 wherein: said means for forming a frame sequence of autocorrelation signals corresponding to the speech pattern comprises means for forming a frame sequence of zeroth order autocorrelation signals and a frame sequence of first order autocorrelation signals; said means for generating a frame sequence of speech energy signals comprises means responsive to said zeroth order autocorrelation signals for generating speech energy signals; said candidate peak and minimum energy signal producing means comprises means responsive to said peak energy frame signal sequence and said first order autocorrelation signal sequence for producing a sequence of candidate peak and minimum signals. | 10. Apparatus for partitioning a speech pattern into syllabic intervals according to claim 1 wherein: said means for forming a frame sequence of autocorrelation signals corresponding to the speech pattern comprises means for forming a frame sequence of zeroth order autocorrelation signals and a frame sequence of first order autocorrelation signals; said means for generating a frame sequence of speech energy signals comprises means responsive to said zeroth order autocorrelation signals for generating speech energy signals; said candidate peak and minimum energy signal producing means comprises means responsive to said peak energy frame signal sequence and said first order autocorrelation signal sequence for producing a sequence of candidate peak and minimum signals. 23. Apparatus for partitioning a speech pattern into syllabic subunits according to claim 10 wherein said candidate peak and minimum energy frame sequence producing means comprises means for generating a predetermined threshold signal and means for comparing the first order autocorrelation signal corresponding to each successive peak energy frame to said predetermined threshold signal. | 0.820983 |
1. A method, executed on a suitably programmed computing device, for managing data, the method comprising: extracting, by a search engine, a plurality of data field descriptors from at least one database from each of a plurality of disparate data sources, comprising the search engine: performing a preliminary database access function to determine access to each of the at least one database, wherein for each database: determining a schema of the database, and determining available data fields of the database; using the plurality of data field descriptors from each of the at least one database, developing a data field result list upon which a query may be run, by: providing a display of the plurality of data field descriptors and control data from the at least one database, the control data comprising one or more of constraints, fields, keywords, and truncations used for extracting the plurality of data field descriptors from the at least one database, and saving the plurality of data field descriptors and the control data as the data field result list for each of the at least one database; receiving, from a graphical user interface, a user search request directed to the data field result list; transforming the user search request into a dataset query based on the data field result list by combining the user search request with an API request; communicating the dataset query to the at least one database; searching the at least one database using the dataset query; and managing, based on the data field result list, data from the at least one database comprising providing a response to the dataset query of the at least one database. | 1. A method, executed on a suitably programmed computing device, for managing data, the method comprising: extracting, by a search engine, a plurality of data field descriptors from at least one database from each of a plurality of disparate data sources, comprising the search engine: performing a preliminary database access function to determine access to each of the at least one database, wherein for each database: determining a schema of the database, and determining available data fields of the database; using the plurality of data field descriptors from each of the at least one database, developing a data field result list upon which a query may be run, by: providing a display of the plurality of data field descriptors and control data from the at least one database, the control data comprising one or more of constraints, fields, keywords, and truncations used for extracting the plurality of data field descriptors from the at least one database, and saving the plurality of data field descriptors and the control data as the data field result list for each of the at least one database; receiving, from a graphical user interface, a user search request directed to the data field result list; transforming the user search request into a dataset query based on the data field result list by combining the user search request with an API request; communicating the dataset query to the at least one database; searching the at least one database using the dataset query; and managing, based on the data field result list, data from the at least one database comprising providing a response to the dataset query of the at least one database. 6. The method of claim 1 , wherein the user search request is transformed into a system search request and the system search request is transformed into the dataset query. | 0.628565 |
1. Context sensitive text input method, comprising the steps of: determining a list of candidate words for the present input context, a candidate word being a possible textual continuation of the present context; wherein the present context comprises at least one preceding word or delimiter; arranging the candidate words in groups, each group having a group designator; displaying the group designators; prompting the user to select a group and receiving the user selection; displaying candidate words of the selected group, the displayed candidate words being arranged according to their respective contextual relevance; prompting the user to select a candidate word and receiving the user selection; and accepting the selected candidate word as text input and updating the context. | 1. Context sensitive text input method, comprising the steps of: determining a list of candidate words for the present input context, a candidate word being a possible textual continuation of the present context; wherein the present context comprises at least one preceding word or delimiter; arranging the candidate words in groups, each group having a group designator; displaying the group designators; prompting the user to select a group and receiving the user selection; displaying candidate words of the selected group, the displayed candidate words being arranged according to their respective contextual relevance; prompting the user to select a candidate word and receiving the user selection; and accepting the selected candidate word as text input and updating the context. 6. Method according to claim 1 , wherein the group designators and the candidate words of the selected group are arranged in a two-dimensional structure, the group designators listed in one dimension and the candidate words of the selected group listed in the other dimension. | 0.679115 |
1. A method of disambiguating an input into a handheld electronic device that comprises an input apparatus comprising a plurality of input members including a multiple-axis input device, an output apparatus, and a memory having stored therein a plurality of objects, the memory comprising a plurality of data sources each having a number of the objects stored therein, at least some of the input members each having a plurality of characters assigned thereto, the method comprising: detecting an input from the multiple-axis input device and, responsive thereto, moving an input focus to an input field; detecting an ambiguous input into the input field; determining that the input field is a special input field and, responsive thereto, identifying a predetermined data source from the plurality of data sources for analysis prior to analysis of at least one other data source to obtain a proposed disambiguation result, the predetermined data source being analyzed, if at all, without priority over the at least one other data source when the input field is not determined to be a special input field. | 1. A method of disambiguating an input into a handheld electronic device that comprises an input apparatus comprising a plurality of input members including a multiple-axis input device, an output apparatus, and a memory having stored therein a plurality of objects, the memory comprising a plurality of data sources each having a number of the objects stored therein, at least some of the input members each having a plurality of characters assigned thereto, the method comprising: detecting an input from the multiple-axis input device and, responsive thereto, moving an input focus to an input field; detecting an ambiguous input into the input field; determining that the input field is a special input field and, responsive thereto, identifying a predetermined data source from the plurality of data sources for analysis prior to analysis of at least one other data source to obtain a proposed disambiguation result, the predetermined data source being analyzed, if at all, without priority over the at least one other data source when the input field is not determined to be a special input field. 6. The method of claim 1 , further comprising detecting an input from a touch screen display as being the input from the multiple-axis input device. | 0.721774 |
8. A knowledge-based authentication (KBA) system constructed and arranged to provide a set of questions, comprising: a set of adaptors, each adaptor of the set of adaptors including: a network interface; memory; and a controller including controlling circuitry couple to the memory, the controlling circuitry being constructed and arranged to: receive facts from multiple fact sources, each fact source being associated with a distinct data format; and convert the facts in a distinct data format with which a fact source is associated to a common data format, and a database server connected to each adaptor of the set of adaptors, the database server including: a network interface; memory; and a controller including controlling circuitry couple to the memory, the controlling circuitry being constructed and arranged to: generate the set of questions from the facts in the common data format, the set of questions being configured to elicit, from a user, a corresponding set of responses from which a KBA result is produced; wherein the database server further includes: a storage device, and wherein the controlling circuitry of the database server is further constructed and arranged to: store the facts in a database stored on the storage device of the database server when the facts have been converted to the common data format, the database including a set of entries, each entry of the set of entries being associated with a fact and including at least one identifier associated with a customer; and wherein generating the set of questions from the facts in the common data format includes: producing a ranking value associated with a candidate question, the ranking value being indicative of a likelihood that a particular response to the question implies that the user is the customer; including the candidate question in the set of questions when the ranking value is greater than a threshold value; and excluding the candidate question from the set of questions when the ranking value is less than a threshold value. | 8. A knowledge-based authentication (KBA) system constructed and arranged to provide a set of questions, comprising: a set of adaptors, each adaptor of the set of adaptors including: a network interface; memory; and a controller including controlling circuitry couple to the memory, the controlling circuitry being constructed and arranged to: receive facts from multiple fact sources, each fact source being associated with a distinct data format; and convert the facts in a distinct data format with which a fact source is associated to a common data format, and a database server connected to each adaptor of the set of adaptors, the database server including: a network interface; memory; and a controller including controlling circuitry couple to the memory, the controlling circuitry being constructed and arranged to: generate the set of questions from the facts in the common data format, the set of questions being configured to elicit, from a user, a corresponding set of responses from which a KBA result is produced; wherein the database server further includes: a storage device, and wherein the controlling circuitry of the database server is further constructed and arranged to: store the facts in a database stored on the storage device of the database server when the facts have been converted to the common data format, the database including a set of entries, each entry of the set of entries being associated with a fact and including at least one identifier associated with a customer; and wherein generating the set of questions from the facts in the common data format includes: producing a ranking value associated with a candidate question, the ranking value being indicative of a likelihood that a particular response to the question implies that the user is the customer; including the candidate question in the set of questions when the ranking value is greater than a threshold value; and excluding the candidate question from the set of questions when the ranking value is less than a threshold value. 12. A system according to claim 8 , wherein a fact source either resides at a remote site or is local to the KBA system, and wherein converting the facts in the distinct data format with which the fact source is associated to the common data format includes: when the fact source resides at a remote site, initiating a conversion of the facts from the fact source at the remote site; and when the fact source is local to the KBA system, initiating the conversion of the facts from the fact source at the KBA system. | 0.5 |
37. A method for automatically preparing customized communications for a plurality of consumer entities, the method comprising the steps of: using data from a first electronic data file containing financial product and/or financial service data for the customized communications, which financial product and/or financial service data includes a plurality of separate descriptions, characteristics and/or identifications for at least a first financial product and/or financial service; using data from a second electronic data file containing customer information for at least certain of the plurality of consumer entities, said customer information including customer related data in addition to, but not excluding, any one or more of customer name, customer address and customer account information obtained for said certain of the plurality of consumer entities; performing an automated composition process using one or more computing systems configured to access said first electronic data file and second electronic data file to compose an electronic document file representing a customized communication for at least one of said certain of the plurality of the consumer entities; wherein said customized communication includes an identifying section adapted to present identifying content to identify a consumer entity, and a separate customized section adapted to present at least some customized content relating to an offering for said consumer entity of said first financial product and/or financial service; wherein at least some of said customized content included in said customized communication for said separate customized section is variable information that is determined for said consumer entity from said first electronic data file and said second electronic data file during creation of said electronic document file; delivering said customized communications to said at least one of said certain of the plurality of consumer entities based on said electronic document file. | 37. A method for automatically preparing customized communications for a plurality of consumer entities, the method comprising the steps of: using data from a first electronic data file containing financial product and/or financial service data for the customized communications, which financial product and/or financial service data includes a plurality of separate descriptions, characteristics and/or identifications for at least a first financial product and/or financial service; using data from a second electronic data file containing customer information for at least certain of the plurality of consumer entities, said customer information including customer related data in addition to, but not excluding, any one or more of customer name, customer address and customer account information obtained for said certain of the plurality of consumer entities; performing an automated composition process using one or more computing systems configured to access said first electronic data file and second electronic data file to compose an electronic document file representing a customized communication for at least one of said certain of the plurality of the consumer entities; wherein said customized communication includes an identifying section adapted to present identifying content to identify a consumer entity, and a separate customized section adapted to present at least some customized content relating to an offering for said consumer entity of said first financial product and/or financial service; wherein at least some of said customized content included in said customized communication for said separate customized section is variable information that is determined for said consumer entity from said first electronic data file and said second electronic data file during creation of said electronic document file; delivering said customized communications to said at least one of said certain of the plurality of consumer entities based on said electronic document file. 61. The method of claim 37 , wherein each customized communication is presented on multiple pages. | 0.578755 |
1. A method for processing external events in a persistent human-to-human conversational space, the method comprising the steps of: persisting a human-to-human conversational space; posting turns in said persistent human-to-human conversational space; receiving different notifications of external events, the different notifications of external events indicate events occurring externally to said persistent human-to-human conversational space, the external events including a creation of a timestamp for a file, a creation of a timestamp for a different human-to-human conversational space, a creation of meta-data for a file, a creation of meta-data for a message, and a creation of meta-data for a different human-to-human conversational space; responsive to receiving said notifications of external events, converting said notifications of external events into respectively different textual descriptions of the different notifications of external events; and, further posting the converted different textual descriptions of the different notifications of external events in said persistent human-to-human conversational space. | 1. A method for processing external events in a persistent human-to-human conversational space, the method comprising the steps of: persisting a human-to-human conversational space; posting turns in said persistent human-to-human conversational space; receiving different notifications of external events, the different notifications of external events indicate events occurring externally to said persistent human-to-human conversational space, the external events including a creation of a timestamp for a file, a creation of a timestamp for a different human-to-human conversational space, a creation of meta-data for a file, a creation of meta-data for a message, and a creation of meta-data for a different human-to-human conversational space; responsive to receiving said notifications of external events, converting said notifications of external events into respectively different textual descriptions of the different notifications of external events; and, further posting the converted different textual descriptions of the different notifications of external events in said persistent human-to-human conversational space. 6. The method of claim 1 , wherein said converting step comprises the step of creating markup language formatted content related to said notifications. | 0.893557 |
23. A computer-readable storage medium, comprising computer instructions which, when executed by a processor, cause the processor to perform operations comprising: detecting a voice conference to discuss a presentation of a media program; analyzing textual dialog derived from the voice conference to detect a behavioral pattern of at least one of a plurality of users engaged in the voice conference; and identifying for the plurality of users at least one of advertisement content or marketing content according to the behavioral pattern of the at least one user. | 23. A computer-readable storage medium, comprising computer instructions which, when executed by a processor, cause the processor to perform operations comprising: detecting a voice conference to discuss a presentation of a media program; analyzing textual dialog derived from the voice conference to detect a behavioral pattern of at least one of a plurality of users engaged in the voice conference; and identifying for the plurality of users at least one of advertisement content or marketing content according to the behavioral pattern of the at least one user. 26. The storage medium of claim 23 , wherein the storage medium comprises computer instructions for: identifying previously recorded behavior patterns of a least a portion of the users; and correlating the previously recorded behavior patterns with the detected behavioral pattern of the least one of the plurality of users to target one of new advertisements or new content to the plurality of users. | 0.502262 |
1. A computer system for identifying potential community members of a community, the system comprising: a data store that identifies objects of different types and relationships between objects of different types, one type of object representing a person, another type of object representing a community of persons, one relationship indicating that a person is a member of a community, each community having a ranking, each relationship having an associated time; a memory storing computer-executable instructions for a generate heterogeneous graph component that generates a heterogeneous graph with vertices representing distinct objects and edges representing the relationships between objects, each edge having a time period and a weight; and a generate time vector heterogeneous graph component that generates a time vector heterogeneous graph from the heterogeneous graph, the time vector heterogeneous graph having a vertex for each vertex of the heterogeneous graph and an edge between objects representing a relationship between the objects, each edge having a time vector representing the weights of the relationship over time periods; a component that extracts features relating to each person from the objects and their relationships as indicated by the generated time vector heterogeneous graph, the extracted features representing evolution of the features over time; a generate best community training data component that generates training data for a best community classifier having a label associated with a person, the label indicating potential to be a community member, the training data being generated by, for each time period and each person who is a community member of a community within that time period: setting best community training data to the extracted features for that person; labeling the best community training data for that person with a rank of the highest ranking community that that person is a community member; and setting a time period for the best community training data for that person; a train best community classifier component that trains a best community classifier using the best community training data to classify the potential for a person represented by their features to be a community member of a community; a generate multi-class community classifier training data component that generates training data for a multi-class community classifier having a label associated with a person, the label indicating potential to be a community member, the multi-class community training data being generated by, for each time period, each community, and community member of a community within that time period: setting multi-class community training data to the extracted features for that person; labeling the multi-class community training data for that person with the community; and setting a time period for the multi-class community training data for that person; a train multi-class community classifier component that trains a multi-class community classifier using the multi-class community training data to classify the potential for a person represented by their features to be a community member of a community; and a classify person component that classifies a person as a potential community member using the best community classifier and when the person is classified as a potential community member for multiple communities, using the multi-class community classifier to classify the person as a potential community member for a single community; and a processor for executing the computer-executable instructions stored in the memory. | 1. A computer system for identifying potential community members of a community, the system comprising: a data store that identifies objects of different types and relationships between objects of different types, one type of object representing a person, another type of object representing a community of persons, one relationship indicating that a person is a member of a community, each community having a ranking, each relationship having an associated time; a memory storing computer-executable instructions for a generate heterogeneous graph component that generates a heterogeneous graph with vertices representing distinct objects and edges representing the relationships between objects, each edge having a time period and a weight; and a generate time vector heterogeneous graph component that generates a time vector heterogeneous graph from the heterogeneous graph, the time vector heterogeneous graph having a vertex for each vertex of the heterogeneous graph and an edge between objects representing a relationship between the objects, each edge having a time vector representing the weights of the relationship over time periods; a component that extracts features relating to each person from the objects and their relationships as indicated by the generated time vector heterogeneous graph, the extracted features representing evolution of the features over time; a generate best community training data component that generates training data for a best community classifier having a label associated with a person, the label indicating potential to be a community member, the training data being generated by, for each time period and each person who is a community member of a community within that time period: setting best community training data to the extracted features for that person; labeling the best community training data for that person with a rank of the highest ranking community that that person is a community member; and setting a time period for the best community training data for that person; a train best community classifier component that trains a best community classifier using the best community training data to classify the potential for a person represented by their features to be a community member of a community; a generate multi-class community classifier training data component that generates training data for a multi-class community classifier having a label associated with a person, the label indicating potential to be a community member, the multi-class community training data being generated by, for each time period, each community, and community member of a community within that time period: setting multi-class community training data to the extracted features for that person; labeling the multi-class community training data for that person with the community; and setting a time period for the multi-class community training data for that person; a train multi-class community classifier component that trains a multi-class community classifier using the multi-class community training data to classify the potential for a person represented by their features to be a community member of a community; and a classify person component that classifies a person as a potential community member using the best community classifier and when the person is classified as a potential community member for multiple communities, using the multi-class community classifier to classify the person as a potential community member for a single community; and a processor for executing the computer-executable instructions stored in the memory. 6. The system of claim 1 wherein the community members are potential rising stars in a community and wherein the object types include person, paper, and conference and the relationships include person was committee member of conference, paper was cited in paper, paper was published in conference, person was author of paper, and person was co-author with person. | 0.500648 |
12. A processor-based method Of determining whether a keyword made up of characters is present in a bitmap input image containing words, the words being considered to extend horizontally, the method comprising the steps of: providing a set of previously trained single-character HMMs, each single-character HMM having a number of possible contexts, depending on whether the character has an ascender or a descender; concatenating those single-character HMMs that correspond to the characters in the keyword so as to provide a keyword HMM, the context of a given single-character HMM used to create the keyword HMM being determined on the basis of whether the keyword contains characters having ascenders or descenders; providing a non-keyword HMM; constructing a network that includes a first path passing through the keyword HMM and a second path passing through the non-keyword HMM but not passing through the keyword HMM; locating a portion of the input image potentially containing a word; providing an array of pixel values, referred to as a potential keyword, representing the portion of the input image; generating a set of features based on the potential keyword, the set of features providing shape information regarding the word potentially contained in the portion of the input image; the set of features being generated at a plurality of uniformly spaced horizontal locations, thereby avoiding segmentation of the potential keyword in a manner that depends on values of the pixels in the potential keyword; applying the set of features to the HMM network; finding a path through the network that maximizes the probability of the set of features as applied to the network; and determining whether the path that maximizes the probability passes through the keyword HMM so as to provide an indication whether the potential keyword is the keyword. | 12. A processor-based method Of determining whether a keyword made up of characters is present in a bitmap input image containing words, the words being considered to extend horizontally, the method comprising the steps of: providing a set of previously trained single-character HMMs, each single-character HMM having a number of possible contexts, depending on whether the character has an ascender or a descender; concatenating those single-character HMMs that correspond to the characters in the keyword so as to provide a keyword HMM, the context of a given single-character HMM used to create the keyword HMM being determined on the basis of whether the keyword contains characters having ascenders or descenders; providing a non-keyword HMM; constructing a network that includes a first path passing through the keyword HMM and a second path passing through the non-keyword HMM but not passing through the keyword HMM; locating a portion of the input image potentially containing a word; providing an array of pixel values, referred to as a potential keyword, representing the portion of the input image; generating a set of features based on the potential keyword, the set of features providing shape information regarding the word potentially contained in the portion of the input image; the set of features being generated at a plurality of uniformly spaced horizontal locations, thereby avoiding segmentation of the potential keyword in a manner that depends on values of the pixels in the potential keyword; applying the set of features to the HMM network; finding a path through the network that maximizes the probability of the set of features as applied to the network; and determining whether the path that maximizes the probability passes through the keyword HMM so as to provide an indication whether the potential keyword is the keyword. 15. The method of claim 12 wherein the step of locating includes performing at least one morphological operation on the input image. | 0.706709 |
10. A parsing method, comprising: employing at least one processor configured to execute computer-executable instructions stored in memory to perform the following acts: parsing an input stream with one or more immutable parser configurations including an immutable stack and immutable lookahead buffer; and producing an immutable parse tree as a function of the parsing. | 10. A parsing method, comprising: employing at least one processor configured to execute computer-executable instructions stored in memory to perform the following acts: parsing an input stream with one or more immutable parser configurations including an immutable stack and immutable lookahead buffer; and producing an immutable parse tree as a function of the parsing. 11. The method of claim 10 further comprising deferring computation of input elements from the lookahead buffer until needed. | 0.736148 |
1. A communication device comprising: a language input device configured to detect a first language signal associated with a first language; and a recognition and interpretation engine coupled with the language input device and configured to: obtain the first language signal from the language input device; generate a first recognition result set from the first language signal according to at least one of a grammar and statistical language model of the first language, said language model comprising a mobile interference model; generate an improved recognition result set from the first recognition result set by rescoring the first recognition result set according to a domain-specific language model; generate at least one interpretation result from the improved recognition results set; map the at least one interpretation result to a second language representation of a second language; and cause an output device to present an output interpretation according to the second language derived from the second language representation. | 1. A communication device comprising: a language input device configured to detect a first language signal associated with a first language; and a recognition and interpretation engine coupled with the language input device and configured to: obtain the first language signal from the language input device; generate a first recognition result set from the first language signal according to at least one of a grammar and statistical language model of the first language, said language model comprising a mobile interference model; generate an improved recognition result set from the first recognition result set by rescoring the first recognition result set according to a domain-specific language model; generate at least one interpretation result from the improved recognition results set; map the at least one interpretation result to a second language representation of a second language; and cause an output device to present an output interpretation according to the second language derived from the second language representation. 22. The device of claim 1 , wherein the second language representation comprises an language independent interlingua. | 0.713592 |
1. An enterprise administration system comprising: a user interface module that uses a hardware processor for entering administration query terms or selecting a predetermined script of administration query terms; a knowledge base that stores system information; a meta information module that uses the system information to store entity-objective indexes that comprise meta information for at least one entity, wherein an entity comprises one or more of a logical device and a physical device; and a workflow mapping module that maps the administration query terms to system information extraction tasks to extract relevant entities and objectives and applies a rule to the extracted entities and objectives for presenting the extracted entities and objectives in a ranked order, wherein the workflow mapping module further creates an abstract dependency tree for logical and physical entities that are relevant to the administration query terms, and applies a degraded recipe on each of the entities in the abstract dependency tree. | 1. An enterprise administration system comprising: a user interface module that uses a hardware processor for entering administration query terms or selecting a predetermined script of administration query terms; a knowledge base that stores system information; a meta information module that uses the system information to store entity-objective indexes that comprise meta information for at least one entity, wherein an entity comprises one or more of a logical device and a physical device; and a workflow mapping module that maps the administration query terms to system information extraction tasks to extract relevant entities and objectives and applies a rule to the extracted entities and objectives for presenting the extracted entities and objectives in a ranked order, wherein the workflow mapping module further creates an abstract dependency tree for logical and physical entities that are relevant to the administration query terms, and applies a degraded recipe on each of the entities in the abstract dependency tree. 6. The system of claim 1 , wherein the entered administration query terms are input in a natural language format. | 0.59182 |
1. A method of operating a digital content acquisition device, comprising: a user selects a first annotation stored in the acquisition device that identifies some aspect of at least a first content item to be captured, capture at least the first content item and one or more subsequently captured content items in the acquisition device, associate, within the acquisition device and without user intervention, the first annotation with the first content item, automatically associate, within the acquisition device and without user intervention, the first annotation with any other of the subsequently captured content items until a second annotation stored within the acquisition device that identifies some aspect of at least a second content item to be captured is selected by the user, capture the second content item in the acquisition device, thereafter associate, within the acquisition device and without user intervention, the second annotation with at least the second content item, store data of the captured content items along with the associated first and second annotations and record linking references of the associated annotations into headers of the captured content items; when the acquisition device is turned on, determine whether the acquisition device had been turned off for more than a predetermined time period before the acquisition device being turned on; and if the acquisition device had been turned off for more than the predetermined time period before the acquisition device being turned on, automatically generate an alert of whether to associate a previous annotation with a next content item to be captured, wherein the previous annotation is associated with a last content item captured in the acquisition device before the acquisition device was turned off. | 1. A method of operating a digital content acquisition device, comprising: a user selects a first annotation stored in the acquisition device that identifies some aspect of at least a first content item to be captured, capture at least the first content item and one or more subsequently captured content items in the acquisition device, associate, within the acquisition device and without user intervention, the first annotation with the first content item, automatically associate, within the acquisition device and without user intervention, the first annotation with any other of the subsequently captured content items until a second annotation stored within the acquisition device that identifies some aspect of at least a second content item to be captured is selected by the user, capture the second content item in the acquisition device, thereafter associate, within the acquisition device and without user intervention, the second annotation with at least the second content item, store data of the captured content items along with the associated first and second annotations and record linking references of the associated annotations into headers of the captured content items; when the acquisition device is turned on, determine whether the acquisition device had been turned off for more than a predetermined time period before the acquisition device being turned on; and if the acquisition device had been turned off for more than the predetermined time period before the acquisition device being turned on, automatically generate an alert of whether to associate a previous annotation with a next content item to be captured, wherein the previous annotation is associated with a last content item captured in the acquisition device before the acquisition device was turned off. 8. The method of claim 1 , wherein the first and second annotations are audio annotations entered into the acquisition device by a user through a microphone built into the acquisition device. | 0.575964 |
7. The method of claim 1 , wherein the spoken query is a spoken command. | 7. The method of claim 1 , wherein the spoken query is a spoken command. 8. The method of claim 7 , wherein the spoken command is made distinguishable from other vocalizations of a presenter by way of a speech control initiation. | 0.929973 |
5. The apparatus of claim 1 wherein the control output is further a control command enabling control of the at least one host computing device, and the controller further configured to provide control instructions to the display, the microphone, and the speaker in a format for interacting in a visual and audio manner in response to the control commands, the format being associated with an avatar. | 5. The apparatus of claim 1 wherein the control output is further a control command enabling control of the at least one host computing device, and the controller further configured to provide control instructions to the display, the microphone, and the speaker in a format for interacting in a visual and audio manner in response to the control commands, the format being associated with an avatar. 16. The apparatus of claim 5 wherein the wireless interface is further configured to remotely access program instructions for interacting with at least one of a wearer, a remote device associated with the wearer, or a remote device not associated with the wearer. | 0.902037 |
1. A system for retrieving data from a plurality of data sources, said system comprising: a first data source for storing first data; a second data source for storing second data; and a server computing device in communication with the first data source and the second data source, the server computing device programmed to: receive a query execution request comprising a query definition reference and a query parameter definition, wherein the query definition reference corresponds to a query definition that includes a first query block and a second query block; create a first executable query based on the first query block and the query parameter definition; create a second executable query based on the second query block and the query parameter definition; determine an amount of data each of the first executable query and the second executable query are known to access; assign a priority level to each of the first executable query and the second executable query based on the determined amount of data each of the first executable query and the second executable query are known to access; and concurrently execute the first executable query at the first data source to create first query results and the second executable query at the second data source to create second query results based on the assigned priority level of the first executable query and the second executable query. | 1. A system for retrieving data from a plurality of data sources, said system comprising: a first data source for storing first data; a second data source for storing second data; and a server computing device in communication with the first data source and the second data source, the server computing device programmed to: receive a query execution request comprising a query definition reference and a query parameter definition, wherein the query definition reference corresponds to a query definition that includes a first query block and a second query block; create a first executable query based on the first query block and the query parameter definition; create a second executable query based on the second query block and the query parameter definition; determine an amount of data each of the first executable query and the second executable query are known to access; assign a priority level to each of the first executable query and the second executable query based on the determined amount of data each of the first executable query and the second executable query are known to access; and concurrently execute the first executable query at the first data source to create first query results and the second executable query at the second data source to create second query results based on the assigned priority level of the first executable query and the second executable query. 8. The system of claim 1 , wherein said server computing device is further programmed to: assign the first executable query to a first query execution queue having a first weight; assign the second executable query to a second query execution queue having a second weight that is less than the first weight; and execute the first executable query prior to executing the second executable query based on the first weight and the second weight. | 0.660805 |
3. The invention of claim 1 wherein the storage means includes a rotatable carousel for holding the printing members. | 3. The invention of claim 1 wherein the storage means includes a rotatable carousel for holding the printing members. 7. The invention of claim 3 further including an outer housing wherein the rotatable carousel is mounted within the housing and beneath the carriage means. | 0.954874 |
9. A storage medium encoded with instructions, wherein the instructions when executed comprise: determining a plurality of frame scores for each of a plurality of respective frames, wherein the plurality of respective frames, when displayed, form animated graphic images, and wherein the determining the plurality of frame scores further comprises determining the plurality of frame scores to be a plurality of probabilities that the plurality of respective frames will be displayed based on at least one embedded link between two of the plurality of frames, wherein the determining the plurality of frame scores based on at least one embedded link further comprises reducing the frame scores for a subset of the plurality of frames that is skipped by the embedded link; determining a plurality of frame weights for a term in each of the plurality of frames, wherein the plurality of frame weights comprise scores of prominence of the term in the plurality of frames; determining a plurality of effect bonuses for the term in each of the plurality of frames; and determining a term score for the term based on the plurality of frame scores, the plurality of frame weights, and the plurality of effect bonuses, wherein the determining the term score for the term further comprises assigning the term score for the term to be a summation of the plurality of frame scores multiplied by a sum of the plurality of frame weights and the plurality of effect bonuses; and displaying pages that contain the frames containing the term in an order based on the term score in response to a search request. | 9. A storage medium encoded with instructions, wherein the instructions when executed comprise: determining a plurality of frame scores for each of a plurality of respective frames, wherein the plurality of respective frames, when displayed, form animated graphic images, and wherein the determining the plurality of frame scores further comprises determining the plurality of frame scores to be a plurality of probabilities that the plurality of respective frames will be displayed based on at least one embedded link between two of the plurality of frames, wherein the determining the plurality of frame scores based on at least one embedded link further comprises reducing the frame scores for a subset of the plurality of frames that is skipped by the embedded link; determining a plurality of frame weights for a term in each of the plurality of frames, wherein the plurality of frame weights comprise scores of prominence of the term in the plurality of frames; determining a plurality of effect bonuses for the term in each of the plurality of frames; and determining a term score for the term based on the plurality of frame scores, the plurality of frame weights, and the plurality of effect bonuses, wherein the determining the term score for the term further comprises assigning the term score for the term to be a summation of the plurality of frame scores multiplied by a sum of the plurality of frame weights and the plurality of effect bonuses; and displaying pages that contain the frames containing the term in an order based on the term score in response to a search request. 11. The storage medium of claim 9 , wherein the determining the plurality of frame weights further comprises: determining the plurality of frame weights based on an attribute selected from a group consisting of a font size of the term, a font style of the term, a color of the term, occlusion of the term, and a location of the term. | 0.606464 |
16. The method of claim 14 , further comprising: displaying the first sub key button together with information about the first word on the display unit. | 16. The method of claim 14 , further comprising: displaying the first sub key button together with information about the first word on the display unit. 20. The method of claim 16 , further comprising: displaying the first and second alphabet characters in the text window as a first style; and displaying the rest of the alphabet characters in the text window as a second style different from the first style. | 0.911017 |
9. A computer-readable medium having computer-executable instructions for performing a method for utilizing historical query information to estimate a static execution time of database query: receiving a database query; accessing a prediction of query runtime tree built from historical query information; and processing said database query through said prediction of query runtime tree to estimate a static execution runtime of said database query based upon historical information pertaining to historical database queries similar to said database query, said processing comprising traversing said prediction of query runtime tree on the basis of at least one query feature associated with said database query, said traversing comprising determining a time range estimate of said static execution time based upon a similarity of said at least one query feature to a historical query feature shared by a grouping of historical database queries stored in an element of said prediction runtime query tree. | 9. A computer-readable medium having computer-executable instructions for performing a method for utilizing historical query information to estimate a static execution time of database query: receiving a database query; accessing a prediction of query runtime tree built from historical query information; and processing said database query through said prediction of query runtime tree to estimate a static execution runtime of said database query based upon historical information pertaining to historical database queries similar to said database query, said processing comprising traversing said prediction of query runtime tree on the basis of at least one query feature associated with said database query, said traversing comprising determining a time range estimate of said static execution time based upon a similarity of said at least one query feature to a historical query feature shared by a grouping of historical database queries stored in an element of said prediction runtime query tree. 10. The computer-readable medium of claim 9 , wherein said accessing a prediction of query runtime tree comprises: accessing an initial node of a binary decision tree, said initial node corresponding to an overall range of historical execution times associated with plurality of historical database queries of said historical information. | 0.531493 |
1. A method of processing a data source query, the method comprising: determining, by one or more processors of a computer server, a load factor for a data source; receiving the data source query at a query assistant being executed by the one or more processors; calculating, by the one or more processors, a complexity of the data source query; adjusting, by the one or more processors, the calculated complexity by the load factor; simplifying, by the one or more processors, the data source query by removing one or more first query elements from the data source query to form one or more abbreviated queries in response to determining that the adjusted complexity is above a threshold; forming, by the one or more processors, a query plan where the first query elements are designated for processing outside the data source; and performing, by the one or more processors, the query plan by sending the one or more abbreviated queries to the data source and processing the first query elements outside the data source. | 1. A method of processing a data source query, the method comprising: determining, by one or more processors of a computer server, a load factor for a data source; receiving the data source query at a query assistant being executed by the one or more processors; calculating, by the one or more processors, a complexity of the data source query; adjusting, by the one or more processors, the calculated complexity by the load factor; simplifying, by the one or more processors, the data source query by removing one or more first query elements from the data source query to form one or more abbreviated queries in response to determining that the adjusted complexity is above a threshold; forming, by the one or more processors, a query plan where the first query elements are designated for processing outside the data source; and performing, by the one or more processors, the query plan by sending the one or more abbreviated queries to the data source and processing the first query elements outside the data source. 7. The method of claim 1 wherein processing the first query elements outside the data source comprises processing the first query elements using a federated query engine. | 0.641516 |
42. The method of claim 39 wherein a template is derived from processing said content of prior stories to identify entities and text descriptors of a state of said first event, and said template is used during step (b) to compute said future content. | 42. The method of claim 39 wherein a template is derived from processing said content of prior stories to identify entities and text descriptors of a state of said first event, and said template is used during step (b) to compute said future content. 44. The method of claim 42 wherein said future content is computed by generating content for alternative future states of said first event. | 0.902086 |
7. A non-transitory computer readable storage medium having instructions that, when executed by a processing device, cause the processing device to perform operations comprising: updating a set of training documents based on a selected portion of a training document of the set to obtain an updated set of training documents; searching content within other training documents in the updated set using a machine learning engine based on the selected portion and variations of the selected portion; determining a probability measure of the content; and classifying a second training document containing the content based on the probability measure. | 7. A non-transitory computer readable storage medium having instructions that, when executed by a processing device, cause the processing device to perform operations comprising: updating a set of training documents based on a selected portion of a training document of the set to obtain an updated set of training documents; searching content within other training documents in the updated set using a machine learning engine based on the selected portion and variations of the selected portion; determining a probability measure of the content; and classifying a second training document containing the content based on the probability measure. 12. The non-transitory computer readable storage medium of claim 7 , further comprising: identifying one or more exemplar documents used by a predictive coding system to classify a prediction document in the updated set of training documents; and identifying a region of the prediction document used by the predictive coding system to determine the classification for the prediction document in the updated set of training documents. | 0.5 |
15. A tangible machine readable memory storing instructions that when executed by a processor configure the processor for: accessing data from a tangible machine readable medium representative of a model of a process, the model being in a format of a Business Process Modeling Notation (BPMN) choreography process that defines expected behavior among participating entities; identifying, from the model of the process, a set of participating entities; identifying a set of choreography tasks conducted between the set of participating entities; and for at least one choreography task in the set of choreography tasks: identifying an initiating participating entity and a corresponding participating entity for the choreography task; generating data indicating a trust relationship between the initiating participating entity and the corresponding participating entity based on the choreography task; storing data in a tangible computer readable medium indicating the trust relationship between the corresponding participating entity and the initiating participating entity; and accessing the data indicating the trust relationship to establish a security framework across a first enterprise domain of the initiating participating entity and a second enterprise domain of the corresponding participating entity. | 15. A tangible machine readable memory storing instructions that when executed by a processor configure the processor for: accessing data from a tangible machine readable medium representative of a model of a process, the model being in a format of a Business Process Modeling Notation (BPMN) choreography process that defines expected behavior among participating entities; identifying, from the model of the process, a set of participating entities; identifying a set of choreography tasks conducted between the set of participating entities; and for at least one choreography task in the set of choreography tasks: identifying an initiating participating entity and a corresponding participating entity for the choreography task; generating data indicating a trust relationship between the initiating participating entity and the corresponding participating entity based on the choreography task; storing data in a tangible computer readable medium indicating the trust relationship between the corresponding participating entity and the initiating participating entity; and accessing the data indicating the trust relationship to establish a security framework across a first enterprise domain of the initiating participating entity and a second enterprise domain of the corresponding participating entity. 18. The tangible machine readable memory of claim 15 , wherein identifying the set of choreography tasks comprises identifying a choreography task declaration in an XML formatted file representing the model of the process, and wherein identifying the set of participating entities comprises identifying a plurality of instances of a participant reference tags. | 0.536086 |
8. The computer-implemented method of claim 1 further comprising: generating, for each word in a list of words to be recognized, an acoustic word model, the generating comprising generating a grouping of subword units representing a pronunciation of the word to be recognized using the single pronunciation estimator. | 8. The computer-implemented method of claim 1 further comprising: generating, for each word in a list of words to be recognized, an acoustic word model, the generating comprising generating a grouping of subword units representing a pronunciation of the word to be recognized using the single pronunciation estimator. 9. The computer-implemented method of claim 8 , wherein the grouping of subword units is a linear sequence of subword units. | 0.894261 |
1. A process for a framework architecture for client systems, comprising the steps of: providing a server proxy client; said server proxy client receiving a client information request from a client system; said server proxy client determining the proper server to service said client request; sending said client request to said proper server; receiving said proper server's response to said client request; and wherein said server proxy client acts as a proxy client for said client system, performing the bulk of data processing for said client system; wherein said server proxy client updates said client system with raw data, presentation, and logic components using a universal data format, the raw data component comprising data retrieved from a server by said server proxy client in response to a client request; wherein said server proxy client, upon receipt of a request for specific up to date presentation components from a client system, checks if the client system's original presentation components and/or executable bytecodes have expired; wherein said server proxy client separates raw data and presentation components of said response and places said data into said universal data format, wherein said raw data and said presentation components are sent independently by said server proxy client to said client system; wherein said server proxy client receives presentation and logic component updates for said client system; and wherein said presentation component updates are for a specific client device type; wherein said logic component updates comprise updates to a common code base that is shared between different client device types, and which enables said server proxy client to control a feature set of said client system independently of an implementation supplied by native client code and without modifying said native client code; and wherein said client system reuses at least a portion of said raw data component for other display purposes; said method further comprising the step of: said client system maintaining state information. | 1. A process for a framework architecture for client systems, comprising the steps of: providing a server proxy client; said server proxy client receiving a client information request from a client system; said server proxy client determining the proper server to service said client request; sending said client request to said proper server; receiving said proper server's response to said client request; and wherein said server proxy client acts as a proxy client for said client system, performing the bulk of data processing for said client system; wherein said server proxy client updates said client system with raw data, presentation, and logic components using a universal data format, the raw data component comprising data retrieved from a server by said server proxy client in response to a client request; wherein said server proxy client, upon receipt of a request for specific up to date presentation components from a client system, checks if the client system's original presentation components and/or executable bytecodes have expired; wherein said server proxy client separates raw data and presentation components of said response and places said data into said universal data format, wherein said raw data and said presentation components are sent independently by said server proxy client to said client system; wherein said server proxy client receives presentation and logic component updates for said client system; and wherein said presentation component updates are for a specific client device type; wherein said logic component updates comprise updates to a common code base that is shared between different client device types, and which enables said server proxy client to control a feature set of said client system independently of an implementation supplied by native client code and without modifying said native client code; and wherein said client system reuses at least a portion of said raw data component for other display purposes; said method further comprising the step of: said client system maintaining state information. 13. The process of claim 1 , wherein said client system registers all presentation objects used by said client system. | 0.586264 |
7. The method as claimed in claim 2 , wherein quantifying the visual properties comprises quantifying areas of the image. | 7. The method as claimed in claim 2 , wherein quantifying the visual properties comprises quantifying areas of the image. 8. The method as claimed in claim 7 , wherein the numeric scale for area is logarithmic. | 0.916038 |
14. A non-transitory computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by a computer, cause the computer to: receive weather information and parsing the weather information into weather components; associating a threshold with each weather component; determining a relevance code for each of a plurality of predetermined phases of flight according to the threshold of each weather component, wherein weather components during any particular phase of flight have different relevance codes; determine a target phase of flight of the plurality of predetermined phases of flight associated with an aircraft; determining a relevance for each weather component based on the corresponding relevance code and at least one performance criteria associated with the aircraft during the target phase of flight; determine a notification method according to the relevance of weather information; and provide a notification associated with the weather information according to the notification method. | 14. A non-transitory computer-readable storage medium having computer-executable instructions stored thereupon which, when executed by a computer, cause the computer to: receive weather information and parsing the weather information into weather components; associating a threshold with each weather component; determining a relevance code for each of a plurality of predetermined phases of flight according to the threshold of each weather component, wherein weather components during any particular phase of flight have different relevance codes; determine a target phase of flight of the plurality of predetermined phases of flight associated with an aircraft; determining a relevance for each weather component based on the corresponding relevance code and at least one performance criteria associated with the aircraft during the target phase of flight; determine a notification method according to the relevance of weather information; and provide a notification associated with the weather information according to the notification method. 15. The non-transitory computer-readable storage medium of claim 14 , wherein causing the computer to retrieve the relevance code corresponding to the weather component of the weather information according to the target phase of flight comprises causing the computer to retrieve the relevance code associated with the target phase of flight according to the threshold of the weather component, the threshold selected according to the weather information, and wherein the relevance code comprises a multi-letter code, each letter associated with a flight segment of a planned flight. | 0.559697 |
3. The apparatus of claim 1 , wherein the at least one processor is further configured to perform: receiving the phrase information from the intended business client, wherein the phrase information includes a first answer to a first question; determining whether the intended business client is valid before accepting the phrase information; and in response to the determining, storing the phrase information in the at least one data storage device. | 3. The apparatus of claim 1 , wherein the at least one processor is further configured to perform: receiving the phrase information from the intended business client, wherein the phrase information includes a first answer to a first question; determining whether the intended business client is valid before accepting the phrase information; and in response to the determining, storing the phrase information in the at least one data storage device. 4. The apparatus of claim 3 , wherein the at least one processor is further configured to perform: repeating the receiving, the determining, and the storing for a second question and a second answer configured by the intended business client. | 0.890036 |
13. A system comprising: a core server computer executing at least one software module comprising: code capable of understanding the format of data provided by a transformation tool; code to convert the data provided by a transformation tool to a data format that maps to a data capture schema, the data capture schema comprising a set of tables to store a copy of unstructured data and attributes of the unstructured data; code to send the copy of the unstructured data to one or more transformation tools; code to parse, via a natural-language processing transformation tool, the copy of the unstructured data to extract sentences from the copy of the unstructured data and then further extract from the extracted sentences sentence-level natural-language processed entities, wherein the sentence-level natural-language processed entities are at least noun phrases; code to extract, via a linguistic processing transformation tool, sentence-level linguistically-processed relationships, wherein the sentence-level linguistically-processed relationships comprise associations between the sentence-level natural-language processed entities; code to send the sentence-level natural-language processed entities and the sentence-level linguistically-processed relationships from the one or more transformation tools to a categorization tool; wherein the categorization tool determines categorization data elements present in each extracted sentence, wherein the categorization data elements are based on the sentence-level natural-language processed entities and the sentence-level linguistically-processed relationships, and are placed within predetermined categories, and a confidence level for each categorization data element, wherein the confidence level for each categorization data element combines one or more data points linked to the sentence-level natural-language processed entities and the sentence-level linguistically-processed relationships to create a statistically-oriented calculation of confidence assigned to the categorization data element; code to write the categorization data elements from the categorization tool and the sentence-level natural-language processed entities and the sentence-level linguistically-processed relationships from the one or more transformation tools in a structured database schema; code to output the confidence level for at least one of the categorization data elements for use in structured data tools; wherein each of a plurality of source documents are assigned a unique key that identifies an individual source document throughout a software system allowing (i) cross-analysis, (ii) linking of results for further analysis, (iii) drill-down from analytical reports back to the source document or (iv) drill-down from analytical reports back to transformation information stored in the data capture schema; and wherein the one or more data points are selected from the group consisting of: confidence score of value provided by the one or more transformation tools, number of relationships found in the source of unstructured data compared to the size of the source of unstructured data, average number of relationships per kilobyte for relationships of the same type as a selected relationship, number of entities found to be associated with a relationship compared to an average number of entities for relationships in a same hierarchy, number of times similar relationships have been found in the past, number of entities that are grouped together to form a master entity, a number of times an entity occurred in the source of unstructured data compared to the average number of occurrences for entities in the same hierarchy, weighted confidences based on hierarchy of a relationship or entity, measures of data extraction confidence integrated with the system via an analysis schema, measures based on a fullness of a relationship's attributes, measures based on the confluence of a same finding by multiple transformation tools, measures based on the source of the unstructured data, and combinations thereof. | 13. A system comprising: a core server computer executing at least one software module comprising: code capable of understanding the format of data provided by a transformation tool; code to convert the data provided by a transformation tool to a data format that maps to a data capture schema, the data capture schema comprising a set of tables to store a copy of unstructured data and attributes of the unstructured data; code to send the copy of the unstructured data to one or more transformation tools; code to parse, via a natural-language processing transformation tool, the copy of the unstructured data to extract sentences from the copy of the unstructured data and then further extract from the extracted sentences sentence-level natural-language processed entities, wherein the sentence-level natural-language processed entities are at least noun phrases; code to extract, via a linguistic processing transformation tool, sentence-level linguistically-processed relationships, wherein the sentence-level linguistically-processed relationships comprise associations between the sentence-level natural-language processed entities; code to send the sentence-level natural-language processed entities and the sentence-level linguistically-processed relationships from the one or more transformation tools to a categorization tool; wherein the categorization tool determines categorization data elements present in each extracted sentence, wherein the categorization data elements are based on the sentence-level natural-language processed entities and the sentence-level linguistically-processed relationships, and are placed within predetermined categories, and a confidence level for each categorization data element, wherein the confidence level for each categorization data element combines one or more data points linked to the sentence-level natural-language processed entities and the sentence-level linguistically-processed relationships to create a statistically-oriented calculation of confidence assigned to the categorization data element; code to write the categorization data elements from the categorization tool and the sentence-level natural-language processed entities and the sentence-level linguistically-processed relationships from the one or more transformation tools in a structured database schema; code to output the confidence level for at least one of the categorization data elements for use in structured data tools; wherein each of a plurality of source documents are assigned a unique key that identifies an individual source document throughout a software system allowing (i) cross-analysis, (ii) linking of results for further analysis, (iii) drill-down from analytical reports back to the source document or (iv) drill-down from analytical reports back to transformation information stored in the data capture schema; and wherein the one or more data points are selected from the group consisting of: confidence score of value provided by the one or more transformation tools, number of relationships found in the source of unstructured data compared to the size of the source of unstructured data, average number of relationships per kilobyte for relationships of the same type as a selected relationship, number of entities found to be associated with a relationship compared to an average number of entities for relationships in a same hierarchy, number of times similar relationships have been found in the past, number of entities that are grouped together to form a master entity, a number of times an entity occurred in the source of unstructured data compared to the average number of occurrences for entities in the same hierarchy, weighted confidences based on hierarchy of a relationship or entity, measures of data extraction confidence integrated with the system via an analysis schema, measures based on a fullness of a relationship's attributes, measures based on the confluence of a same finding by multiple transformation tools, measures based on the source of the unstructured data, and combinations thereof. 14. The system of claim 13 , wherein the one or more transformation tools comprise: (i) entity, concept and relationship tagging and extraction tools, (ii) data matching tools or, (iii) custom transformation tools. | 0.54151 |
8. The method of claim 1 , further comprising applying an algorithm for weighing the terms with which to update the interest profile. | 8. The method of claim 1 , further comprising applying an algorithm for weighing the terms with which to update the interest profile. 9. The method of claim 8 , wherein the most relevant terms appear first in the interest profile. | 0.972326 |
3. The apparatus of claim 2 , wherein the color information correction module comprises: a preference color input module which inputs a preference color to be corrected among preference colors constituting the input image; and a color component correction module which corrects a color component of the input preference color. | 3. The apparatus of claim 2 , wherein the color information correction module comprises: a preference color input module which inputs a preference color to be corrected among preference colors constituting the input image; and a color component correction module which corrects a color component of the input preference color. 5. The apparatus of claim 3 , wherein the color component is one of lightness, chroma, and hue. | 0.837573 |
9. A method according to claim 3 and including automatically machine-selecting search words from each document to be used in locating the document from mass storage. | 9. A method according to claim 3 and including automatically machine-selecting search words from each document to be used in locating the document from mass storage. 11. A method according to claim 9 and further comprising forming a logo table of stored patterns of images of logo designs identifying sending organizations together with information in code form about the sender employing each such design, when a document having a design is scanned, conducting a pattern search of the stored patterns of images in the logo table to seek a match between the scanned design and a stored image, when a pattern match is found, retrieving and correlating with the identification of the document the identifying organization information associated with the matched pattern from the logo table, and when a match is not found, flagging the document for addition of the design and identifying company information to the logo table. | 0.609912 |
4. The method of claim 1 , where the distilled expression comprises an array of coefficients. | 4. The method of claim 1 , where the distilled expression comprises an array of coefficients. 7. The method of claim 4 , where a position of a coefficient in the array conveys a separate meaning from a value of the coefficient. | 0.947719 |
1. A method comprising: receiving a plurality of data items imported into a social-networking system by a first user of the social-networking system, the plurality of data items being related to an entity; accessing, by one or more processors associated with one or more computer servers associated with the social-networking system, one or more data stores storing a social graph of the social-networking system, the social graph comprising a plurality of nodes and a plurality of edges between nodes, the nodes comprising user nodes corresponding to users of the social-networking system and concept nodes corresponding to concepts; identifying, by the one or more processors, one or more nodes of the social graph that likely match the entity; determining, by the one or more processors, a confidence score for each of the one or more of the identified nodes, the confidence score indicating a relative likelihood that the identified node matches the entity, wherein the confidence score is based in part on an interaction between the entity and a test message sent to the entity; and updating, by the one or more processors, at least one of the identified nodes with at least one of the data items. | 1. A method comprising: receiving a plurality of data items imported into a social-networking system by a first user of the social-networking system, the plurality of data items being related to an entity; accessing, by one or more processors associated with one or more computer servers associated with the social-networking system, one or more data stores storing a social graph of the social-networking system, the social graph comprising a plurality of nodes and a plurality of edges between nodes, the nodes comprising user nodes corresponding to users of the social-networking system and concept nodes corresponding to concepts; identifying, by the one or more processors, one or more nodes of the social graph that likely match the entity; determining, by the one or more processors, a confidence score for each of the one or more of the identified nodes, the confidence score indicating a relative likelihood that the identified node matches the entity, wherein the confidence score is based in part on an interaction between the entity and a test message sent to the entity; and updating, by the one or more processors, at least one of the identified nodes with at least one of the data items. 7. The method of claim 1 , wherein the identifying one or more nodes of the social graph that likely match the entity further comprises: comparing respective name text strings of the nodes to a name text string of the entity based on a Levenshtein distance algorithm. | 0.65534 |
7. A method residing in a nor-transitory computer-readable medium and executed by a machine, the method comprising: parsing, by the machine, a repository for strings and files a base language, the base language is a native language for the strings that are to be matched to within a master language data structure; inserting, by the machine, unique entries for each unique string and each unique file in the master language data structure and within the base language, each unique entry identified by a numeric value and an identifying string and at least one of a different language including a specific dialect for a given language and the unique entries providing version control; partially housing, by the machine, the master language data structure in memory of the machine; requesting, by the machine, translations for each unique entry for different supported languages, each translation requested is for a particular one of the different supported languages; receiving, by the machine, a translation for each requested translation; and linking, by the machine, the translations to their corresponding unique entry within the master language data structure, and particular translations are supplied to requestors when particular strings in the base language are provided by the requestors and those particular strings are used to find matches in the master language data structure to particular entries for those particular strings in the base language for purposes of returning to the requestors the particular translations, the requestors are automated software resources. | 7. A method residing in a nor-transitory computer-readable medium and executed by a machine, the method comprising: parsing, by the machine, a repository for strings and files a base language, the base language is a native language for the strings that are to be matched to within a master language data structure; inserting, by the machine, unique entries for each unique string and each unique file in the master language data structure and within the base language, each unique entry identified by a numeric value and an identifying string and at least one of a different language including a specific dialect for a given language and the unique entries providing version control; partially housing, by the machine, the master language data structure in memory of the machine; requesting, by the machine, translations for each unique entry for different supported languages, each translation requested is for a particular one of the different supported languages; receiving, by the machine, a translation for each requested translation; and linking, by the machine, the translations to their corresponding unique entry within the master language data structure, and particular translations are supplied to requestors when particular strings in the base language are provided by the requestors and those particular strings are used to find matches in the master language data structure to particular entries for those particular strings in the base language for purposes of returning to the requestors the particular translations, the requestors are automated software resources. 9. The method of claim 7 , wherein requesting further includes requesting a number of the translations from automated language conversion services and requesting other ones of the translations from manual language conversion services. | 0.513584 |
7. A device comprising: a computer configured to: generate a description of a character symbol from a binarized image; compare a template for the character symbol with the description of the character symbol based on a reference description, wherein the template comprises a grid of cells, a set of local features which may be present in the grid of cells, the reference description specifying which member of the set of local features should be present or absent in the grid of cells, and a threshold of an accepted deviation with the description of the character symbol; assign a penalty value to the description of the character symbol via a cost function when a discrepancy exists based on the comparing; select the template as a match candidate for the character symbol when the penalty value is below the threshold; recognize the character symbol based on the selecting. | 7. A device comprising: a computer configured to: generate a description of a character symbol from a binarized image; compare a template for the character symbol with the description of the character symbol based on a reference description, wherein the template comprises a grid of cells, a set of local features which may be present in the grid of cells, the reference description specifying which member of the set of local features should be present or absent in the grid of cells, and a threshold of an accepted deviation with the description of the character symbol; assign a penalty value to the description of the character symbol via a cost function when a discrepancy exists based on the comparing; select the template as a match candidate for the character symbol when the penalty value is below the threshold; recognize the character symbol based on the selecting. 8. The device of claim 7 , wherein a ratio of a number of cells by height and width in the grid of cells substantially corresponds to a ratio of a recognizable font of the character symbol. | 0.907136 |
1. A method for launching a target application based on characteristics of a string of characters in a source application, said method comprising: identifying, by a computer processor, predefined data type previously associated with a regular expression matching the string; said processor identifying the target application previously associated with a combination of the identified data type and the source application; and said processor launching the target application with the string as a parameter, wherein said identifying the predefined data type comprises: determining that a first row of a parser table comprises a first regular expression formulating the string, wherein parser table comprises rows which are ordered from a more general regular expression to a more specific regular expression; setting the first regular expression as the regular expression matching the string; resetting the regular expression with a second regular expression upon determining that the second regular expression of a next row of the parser table formulates the string more specifically than the first regular expression; and selecting the predefined data type in the row of the regular expression as the predefined data type of the string, upon performing said resetting for all rows of the parser table. | 1. A method for launching a target application based on characteristics of a string of characters in a source application, said method comprising: identifying, by a computer processor, predefined data type previously associated with a regular expression matching the string; said processor identifying the target application previously associated with a combination of the identified data type and the source application; and said processor launching the target application with the string as a parameter, wherein said identifying the predefined data type comprises: determining that a first row of a parser table comprises a first regular expression formulating the string, wherein parser table comprises rows which are ordered from a more general regular expression to a more specific regular expression; setting the first regular expression as the regular expression matching the string; resetting the regular expression with a second regular expression upon determining that the second regular expression of a next row of the parser table formulates the string more specifically than the first regular expression; and selecting the predefined data type in the row of the regular expression as the predefined data type of the string, upon performing said resetting for all rows of the parser table. 2. The method of claim 1 , wherein at least one regular expression including the regular expression collectively formulates a set of strings including the string, wherein the at least one regular expression is predefined by use of alphanumeric characters, symbols, and operations pursuant to a regular expression syntax, wherein the regular expression and the predefined data type is in a row of at least one row in the parser table, wherein each row comprises a respective regular expression and a respective data type associated with the respective regular expression, and wherein the parser table is indexed by a respective regular expression of the at least one row. | 0.580655 |
1. A method of searching for Personal Information Management information of a handheld electronic device, comprising: accepting input of at least one search criteria; accepting input of a representation of a plurality of components of the handheld electronic device including Personal Information Management information to be searched; accepting input to select at least two of the plurality of components; conducting a search of the components based upon the at least one search criteria and the selected at least two of the plurality of components; determining at least one search result from the search; displaying the at least one search result; employing as the components a plurality of different applications; employing as the at least one search result a plurality of search results; displaying the search results on a search results screen; displaying each of the search results including a plurality of alpha or alphanumeric characters; for each item of the search results associated with a different application, displaying and providing for each item at least one user interaction available from the different application, and performing one of the at least one user interaction directly from the search results displayed, without opening the different application, the at least one user interaction being selected from a group including directly editing the item, directly forwarding a message, replying to a message, directly e-mailing an e-mail address and directly calling a phone number. | 1. A method of searching for Personal Information Management information of a handheld electronic device, comprising: accepting input of at least one search criteria; accepting input of a representation of a plurality of components of the handheld electronic device including Personal Information Management information to be searched; accepting input to select at least two of the plurality of components; conducting a search of the components based upon the at least one search criteria and the selected at least two of the plurality of components; determining at least one search result from the search; displaying the at least one search result; employing as the components a plurality of different applications; employing as the at least one search result a plurality of search results; displaying the search results on a search results screen; displaying each of the search results including a plurality of alpha or alphanumeric characters; for each item of the search results associated with a different application, displaying and providing for each item at least one user interaction available from the different application, and performing one of the at least one user interaction directly from the search results displayed, without opening the different application, the at least one user interaction being selected from a group including directly editing the item, directly forwarding a message, replying to a message, directly e-mailing an e-mail address and directly calling a phone number. 17. The method of claim 1 further comprising displaying with the at least one search result a completed status of the search and a total count of matches therefor. | 0.688921 |
4. A text compression dictionary generation apparatus, comprising: a calculation unit for calculating, with respect to a target compression rate, a frequency guideline for each character string having a length of at least two characters, required to occur in the text to meet said target compression rate, a sequential character string cutout unit for cutting out a character string from the text having a length of at least two characters which occurs at a frequency matching the corresponding frequency guideline of a character string length, together with the actual frequency in a descending order of the product of the character string length and actual frequency to generate a first static dictionary, while simultaneously generating a group of remaining text not cut out and not matching said frequency guideline, and for finding a symbol having an efficiency indicating function value independent of the character string length, an extraction unit to count the frequency for each character of one character string length from the group of remaining text to generate a second static dictionary, and a dictionary build up unit for adding the second static dictionary to the first static dictionary to generate an eventual static dictionary. | 4. A text compression dictionary generation apparatus, comprising: a calculation unit for calculating, with respect to a target compression rate, a frequency guideline for each character string having a length of at least two characters, required to occur in the text to meet said target compression rate, a sequential character string cutout unit for cutting out a character string from the text having a length of at least two characters which occurs at a frequency matching the corresponding frequency guideline of a character string length, together with the actual frequency in a descending order of the product of the character string length and actual frequency to generate a first static dictionary, while simultaneously generating a group of remaining text not cut out and not matching said frequency guideline, and for finding a symbol having an efficiency indicating function value independent of the character string length, an extraction unit to count the frequency for each character of one character string length from the group of remaining text to generate a second static dictionary, and a dictionary build up unit for adding the second static dictionary to the first static dictionary to generate an eventual static dictionary. 5. The text compression dictionary generation apparatus according to claim 4, further comprising a character string cutout unit for decomposing an original character string in said eventual static dictionary into a plurality of other character strings including the longest character string, and deleting the original character string that is decomposed, and for increasing the actual frequency of the plurality of other character strings by the frequency of the deleted original character string. | 0.5 |
24. The PI platform of claim 14 , wherein executing the component modules and behavior bundles further comprises saving the entity events in a master event queue; subscribing one or more event consumers to process the entity events, where each of the event consumers comprises: an event selector that selects relevant entity events from the master event queue for storage in an event sub-queue; and an event processor that processes the selected entity events in the event sub-queue by calling a behavior execution engine to execute a set of the behavior bundles, wherein a number of event processor that are used may be scaled based on the domain. | 24. The PI platform of claim 14 , wherein executing the component modules and behavior bundles further comprises saving the entity events in a master event queue; subscribing one or more event consumers to process the entity events, where each of the event consumers comprises: an event selector that selects relevant entity events from the master event queue for storage in an event sub-queue; and an event processor that processes the selected entity events in the event sub-queue by calling a behavior execution engine to execute a set of the behavior bundles, wherein a number of event processor that are used may be scaled based on the domain. 25. The PI platform of claim 24 , further comprising: utilizing a processing order for the event consumers, wherein first and second type of event consumers responsible for generating data graph and time-series metrics operate independently, but processing by a third type of event consumers responsible for generating data entity scores is dependent on the first type of event consumers. | 0.809465 |
1. A method of creating a ranked join index for ordered data entries, comprising: determining, via a processor, a dominating set of said ordered data entries; mapping said dominating set of said ordered data entries according to rank attributes; determining a separating vector for each set of adjacent mapped data entries; and ordering said data entries according to a separating point associated with each of said separating vectors. | 1. A method of creating a ranked join index for ordered data entries, comprising: determining, via a processor, a dominating set of said ordered data entries; mapping said dominating set of said ordered data entries according to rank attributes; determining a separating vector for each set of adjacent mapped data entries; and ordering said data entries according to a separating point associated with each of said separating vectors. 7. The method of claim 1 , wherein performance guarantees are provided for an amount of time said index requires for resolving user queries. | 0.77165 |
1. A method of detecting pre-determined phrases to determine compliance quality, comprising: storing a plurality of pre-determined phrases in association with a precursor event; receiving an audible input, from communication devices of a caller and an agent, in a communication over a communications network; determining, by a processor of a computer facilitating the communication, an occurrence of the precursor event based on the communication; determining, by the processor, whether a pre-determined phrase of the plurality of pre-determined phrases associated with the precursor event is present in the audible input received; and determining, by the processor, a compliance rating of the agent, based on a presence of the pre-determined phrase associated with the precursor event in the communication, for evaluating the agent. | 1. A method of detecting pre-determined phrases to determine compliance quality, comprising: storing a plurality of pre-determined phrases in association with a precursor event; receiving an audible input, from communication devices of a caller and an agent, in a communication over a communications network; determining, by a processor of a computer facilitating the communication, an occurrence of the precursor event based on the communication; determining, by the processor, whether a pre-determined phrase of the plurality of pre-determined phrases associated with the precursor event is present in the audible input received; and determining, by the processor, a compliance rating of the agent, based on a presence of the pre-determined phrase associated with the precursor event in the communication, for evaluating the agent. 4. The method of claim 1 , wherein the audible input received is transcribed. | 0.665865 |
8. The method according to claim 7 further comprising obtaining financial data requested from the network. | 8. The method according to claim 7 further comprising obtaining financial data requested from the network. 9. The method according to claim 8 wherein access to financial data is controlled through a user's log-in for the computer network. | 0.956522 |
13. A computer storage medium storing a particular data structure comprising: a scope element that contains criteria for determining a plurality of objects the particular data structure applies to for controlling what users may access the plurality of objects, wherein the criteria of the scope element defines a portion of a directory hierarchy indicating that the particular data structure provides access rights for a plurality of file objects located under the portion of the directory hierarchy; and one or more rule elements that define access rights for accessing the plurality of file objects, including: a first rule element that contains (1) first user rules that define a first set of one or more users to whom the first rule element applies and who may access the plurality of file objects, including a first rule that defines the first set of one or more users as users that have been authenticated, and (2) first access rules that define what access rights the first set of one or more users are granted for accessing any one of the plurality of file objects; and a second rule element that contains (1) second user rules that define a second set of one or more users to whom the second rule element applies and who may also access the plurality of file objects, and (2) second access rules that define what different access rights the second set of one or more users are granted for accessing any one of the plurality of file objects, the computer storage medium further storing computer-executable instructions that, when executed by at least one processor of a computer system, implement a method, comprising: an act of the computer system receiving a request from a user to access the one of the plurality of file objects, the user included in at least the first set of one or more users; an act of the computer system determining that the particular data structure controls what users may access the plurality of file objects, as defined by the criteria of the scope element of the particular data structure; an act of the computer system determining that the user is included in the first set of one or more users and that the user has been authenticated, as defined by the first user rules of the first rule element of the particular data structure; and an act of the computer system granting the user access to the one of the plurality of file objects, as defined by the first access rules of the first rule element of the particular data structure. | 13. A computer storage medium storing a particular data structure comprising: a scope element that contains criteria for determining a plurality of objects the particular data structure applies to for controlling what users may access the plurality of objects, wherein the criteria of the scope element defines a portion of a directory hierarchy indicating that the particular data structure provides access rights for a plurality of file objects located under the portion of the directory hierarchy; and one or more rule elements that define access rights for accessing the plurality of file objects, including: a first rule element that contains (1) first user rules that define a first set of one or more users to whom the first rule element applies and who may access the plurality of file objects, including a first rule that defines the first set of one or more users as users that have been authenticated, and (2) first access rules that define what access rights the first set of one or more users are granted for accessing any one of the plurality of file objects; and a second rule element that contains (1) second user rules that define a second set of one or more users to whom the second rule element applies and who may also access the plurality of file objects, and (2) second access rules that define what different access rights the second set of one or more users are granted for accessing any one of the plurality of file objects, the computer storage medium further storing computer-executable instructions that, when executed by at least one processor of a computer system, implement a method, comprising: an act of the computer system receiving a request from a user to access the one of the plurality of file objects, the user included in at least the first set of one or more users; an act of the computer system determining that the particular data structure controls what users may access the plurality of file objects, as defined by the criteria of the scope element of the particular data structure; an act of the computer system determining that the user is included in the first set of one or more users and that the user has been authenticated, as defined by the first user rules of the first rule element of the particular data structure; and an act of the computer system granting the user access to the one of the plurality of file objects, as defined by the first access rules of the first rule element of the particular data structure. 15. The computer storage medium of claim 13 , wherein the particular data structure further comprises: one or more security elements that define authentication measures to be applied when a user attempts to modify the particular data structure. | 0.54422 |
1. A computer-implemented method for identifying one or more target entities, the method comprising: receiving, by a computer, an input data set, wherein the input data set includes a plurality of tokens that reflect the one or more target entities; determining, by the computer, which of the tokens are labels; identifying, by the computer, one or more candidate entities that are related to each of the labels, wherein individual ones of the candidate entities are associated with a number of candidates; assigning, by the computer, a weight to each candidate entity of a label based on each candidate entity's associated number of candidates, wherein the weight that is assigned to a particular one of the candidate entities is related to an inverse of the number of candidates associated with the particular candidate entity; ranking, by the computer the candidate entities of the label according to the assigned weights; and outputting, by the computer, one of the plurality of candidate entities for the label that has been assigned a highest weight value. | 1. A computer-implemented method for identifying one or more target entities, the method comprising: receiving, by a computer, an input data set, wherein the input data set includes a plurality of tokens that reflect the one or more target entities; determining, by the computer, which of the tokens are labels; identifying, by the computer, one or more candidate entities that are related to each of the labels, wherein individual ones of the candidate entities are associated with a number of candidates; assigning, by the computer, a weight to each candidate entity of a label based on each candidate entity's associated number of candidates, wherein the weight that is assigned to a particular one of the candidate entities is related to an inverse of the number of candidates associated with the particular candidate entity; ranking, by the computer the candidate entities of the label according to the assigned weights; and outputting, by the computer, one of the plurality of candidate entities for the label that has been assigned a highest weight value. 7. The method of claim 1 , further comprising: determining one or more related candidate entities that are related to each of the candidate entities. | 0.569636 |
1. A method for displaying an input string of character codes as a sequence of glyphs, comprising: generating an ordered list of instructions using syntax-directed translation, the generating comprising: formulating context-free grammar rules comprising mathematical representations of rules governing structural patterns of grammar; and analyzing the input string using the context-free grammar rules to generate the ordered list of instructions; executing the ordered list of instructions to generate a sequence of glyph indices; and displaying a sequence of glyphs corresponding to the sequence of glyph indices, where at least some of at least one of the generating, formulating, analyzing, executing and displaying is performed using a computer or processor. | 1. A method for displaying an input string of character codes as a sequence of glyphs, comprising: generating an ordered list of instructions using syntax-directed translation, the generating comprising: formulating context-free grammar rules comprising mathematical representations of rules governing structural patterns of grammar; and analyzing the input string using the context-free grammar rules to generate the ordered list of instructions; executing the ordered list of instructions to generate a sequence of glyph indices; and displaying a sequence of glyphs corresponding to the sequence of glyph indices, where at least some of at least one of the generating, formulating, analyzing, executing and displaying is performed using a computer or processor. 12. The method of claim 1 , wherein the ordered list of instructions is executed using a runtime library of one or more commands to direct a formation of the sequence of glyphs, a stacking engine for queuing data, a font, a library implementing the OpenType font standard specification or combinations thereof. | 0.5 |
13. One or more non-transitory computer-readable storage media storing sequences of instructions that, when executed by one or more computing devices, cause: receiving a first query comprising an outer query that: includes one or more set operators; instantiates a particular data object using a first name; references a first instance of the particular data object using said first name; wherein at least a particular set operator of the one or more set operators includes a particular subquery that: instantiates the particular data object using a second name; references a second instance of the particular data object using said second name; based at least in part on the first query, transforming the first query to a second query that does not contain at least the particular subquery or the particular set operator; wherein the second query comprises an added predicate that is based at least in part on the particular subquery; wherein the added predicate references the first instance of the particular data object using said first name without referencing the second instance of the particular data object using said second name; and wherein the second query is semantically equivalent to the first query; generating an execution plan for executing the second query; causing execution of the second query instead of the first query based on the execution plan for executing the second query. | 13. One or more non-transitory computer-readable storage media storing sequences of instructions that, when executed by one or more computing devices, cause: receiving a first query comprising an outer query that: includes one or more set operators; instantiates a particular data object using a first name; references a first instance of the particular data object using said first name; wherein at least a particular set operator of the one or more set operators includes a particular subquery that: instantiates the particular data object using a second name; references a second instance of the particular data object using said second name; based at least in part on the first query, transforming the first query to a second query that does not contain at least the particular subquery or the particular set operator; wherein the second query comprises an added predicate that is based at least in part on the particular subquery; wherein the added predicate references the first instance of the particular data object using said first name without referencing the second instance of the particular data object using said second name; and wherein the second query is semantically equivalent to the first query; generating an execution plan for executing the second query; causing execution of the second query instead of the first query based on the execution plan for executing the second query. 23. The one or more non-transitory computer-readable storage media of claim 13 , wherein the sequences of instructions include instructions that, when executed by said one or more computing devices, cause preserving logical relationships between multiple eliminated subqueries, by adding logical operators between multiple added predicates that have been generated based on the multiple eliminated subqueries. | 0.632404 |
19. A system for static detection and categorization of information-flow downgraders, comprising: a program storage device configured to store a program, the program storage device further configured to work in conjunction with a processor to execute program instructions to detect and categorize information-flow downgraders in the program; a static analysis framework configured to analyze an application program and to perform a static string assignment on the application program to transform program variables to yield a single assignment for each variable in an instruction set, the framework configured to translate the instruction set to production rules with string operations and generate a context-free grammar from the production rules to identify a finite set of strings; and a comparison module configured to detect and categorize the finite set of strings by comparing the finite set of strings against one or more function specifications to identify an information-flow downgrader function, wherein the information-flow downgrader function downgrades input by endorsing integrity and declassifying confidentiality of the input to enable high information to flow to low program points. | 19. A system for static detection and categorization of information-flow downgraders, comprising: a program storage device configured to store a program, the program storage device further configured to work in conjunction with a processor to execute program instructions to detect and categorize information-flow downgraders in the program; a static analysis framework configured to analyze an application program and to perform a static string assignment on the application program to transform program variables to yield a single assignment for each variable in an instruction set, the framework configured to translate the instruction set to production rules with string operations and generate a context-free grammar from the production rules to identify a finite set of strings; and a comparison module configured to detect and categorize the finite set of strings by comparing the finite set of strings against one or more function specifications to identify an information-flow downgrader function, wherein the information-flow downgrader function downgrades input by endorsing integrity and declassifying confidentiality of the input to enable high information to flow to low program points. 21. The system as recited in claim 19 , wherein the one or more functions include a security-sensitive function in the program. | 0.549767 |
1. A computer readable medium for managing electronic information, comprising: a plurality of predefined portions of text-based data with at least one of said plurality of predefined portions of text-based data being stored; at least one modified predefined portion of text-based data, said at least one modified predefined portion of text-based data being created based at least in part on modifications to at least one of said plurality of predefined portions of text-based data; and said at least one modified predefined portion of text-based data being stored; a plurality of links comprising at least one of code or a markup language, at least one of said plurality of predefined portions of said text-based data and said at least one modified predefined portion of text-based data being associated with at least one of said plurality of links; and a plurality of attributes for organizing at least one of said plurality of predefined portions of text-based data and said at least one modified predefined portion of text-based data, at least one of said plurality of attributes defining a point in a multidimensional space. | 1. A computer readable medium for managing electronic information, comprising: a plurality of predefined portions of text-based data with at least one of said plurality of predefined portions of text-based data being stored; at least one modified predefined portion of text-based data, said at least one modified predefined portion of text-based data being created based at least in part on modifications to at least one of said plurality of predefined portions of text-based data; and said at least one modified predefined portion of text-based data being stored; a plurality of links comprising at least one of code or a markup language, at least one of said plurality of predefined portions of said text-based data and said at least one modified predefined portion of text-based data being associated with at least one of said plurality of links; and a plurality of attributes for organizing at least one of said plurality of predefined portions of text-based data and said at least one modified predefined portion of text-based data, at least one of said plurality of attributes defining a point in a multidimensional space. 9. The computer readable medium according to claim 1 , wherein at least one of said plurality of links comprises an identification code for a corresponding one of said plurality of predefined portions of text-based data. | 0.675466 |
8. An apparatus comprising: one or more processors; and logic encoded in one or more tangible media for execution by the one or more processors and when executed operable to: receive input from a user defining a classification; determine a sample set of unstructured data based on the classification defined by the user; analyze the sample set of unstructured data to determine a classification mapping that maps attributes of the sample set of unstructured data to class labels for the classification; index attributes of a set of data objects in a second set of unstructured data; map one or more data objects in the set of data objects to the class label based on the classification mapping that maps indexed attributes of the one or more data objects to the class label; receive an ad-hoc query from the one or more users; provide the results from the relevant unstructured data based on the classification mapping of the indexed attributes of the one or more data objects and the query; determine feedback based on the user's response to an interaction with results determined using the class label, wherein the feedback comprises explicit feedback received from one or more users who are viewing results determined using the classification mapping, and the explicit feedback comprises an indication that a result is misclassified in the classification; and adapt the classification mapping based on an analysis of the misclassified result received as feedback by adjusting the sample set used to determine the classification mapping to the class label. | 8. An apparatus comprising: one or more processors; and logic encoded in one or more tangible media for execution by the one or more processors and when executed operable to: receive input from a user defining a classification; determine a sample set of unstructured data based on the classification defined by the user; analyze the sample set of unstructured data to determine a classification mapping that maps attributes of the sample set of unstructured data to class labels for the classification; index attributes of a set of data objects in a second set of unstructured data; map one or more data objects in the set of data objects to the class label based on the classification mapping that maps indexed attributes of the one or more data objects to the class label; receive an ad-hoc query from the one or more users; provide the results from the relevant unstructured data based on the classification mapping of the indexed attributes of the one or more data objects and the query; determine feedback based on the user's response to an interaction with results determined using the class label, wherein the feedback comprises explicit feedback received from one or more users who are viewing results determined using the classification mapping, and the explicit feedback comprises an indication that a result is misclassified in the classification; and adapt the classification mapping based on an analysis of the misclassified result received as feedback by adjusting the sample set used to determine the classification mapping to the class label. 13. The apparatus of claim 8 , wherein logic operable to adapt the classification comprises logic operable to: add a data object to the sample set; and adapt the classification mapping based on the addition of the data object to the sample set. | 0.572959 |
1. An electronic language interpreter device wherein a first word represented in a first language is entered to obtain a translated word in a second language equivalent to the first word, comprising: input means for entering the first word; memory means for storing a plurality of second words in the first language; access means responsive to the first word entered by said input means for addressing said memory means for retrieving the second words; similarity detection means responsive to said access means for detecting similarity between letters of the first word and letters of the second words; means responsive to said similarity detection means for displaying a translated word corresponding to a determined one of the second words when the determined second word is the same as the first word; and means responsive to said similarity detection means for displaying a selected one of the second words which is most similar to the first word when none of the second words are the same as the first word. | 1. An electronic language interpreter device wherein a first word represented in a first language is entered to obtain a translated word in a second language equivalent to the first word, comprising: input means for entering the first word; memory means for storing a plurality of second words in the first language; access means responsive to the first word entered by said input means for addressing said memory means for retrieving the second words; similarity detection means responsive to said access means for detecting similarity between letters of the first word and letters of the second words; means responsive to said similarity detection means for displaying a translated word corresponding to a determined one of the second words when the determined second word is the same as the first word; and means responsive to said similarity detection means for displaying a selected one of the second words which is most similar to the first word when none of the second words are the same as the first word. 3. The device of claim 1, wherein said similarity detection means comprises means for counting the number of letters of the second words which are detected to be equivalent to letters of the first word, and control means responsive to said counting means for advancing the address in said memory means addressed by said access means whereby a next second word is retrieved from said memory means when no previously retrieved second word is found to be the same as the first word and for enabling display of the second word most similar to the first word when no second word in said memory means is the same as the first word. | 0.5 |
1. A computer program product for determining a deadlock condition in a circuit, the computer program product comprising a non-transitory computer-readable storage medium containing computer program code for: receiving a circuit design corresponding to the circuit, the circuit design comprising multiple subsystems that includes a plurality of ports; receiving a transaction definition associated with at least one of the plurality of ports; generating a deadlock property based on the transaction definition; analyzing data flow through the circuit design based on the deadlock property; generating a helper assertion capturing how the data flows through the circuit design, based on analysis from the analyzing step; and checking for an absence of the deadlock condition within the circuit based on the helper assertion. | 1. A computer program product for determining a deadlock condition in a circuit, the computer program product comprising a non-transitory computer-readable storage medium containing computer program code for: receiving a circuit design corresponding to the circuit, the circuit design comprising multiple subsystems that includes a plurality of ports; receiving a transaction definition associated with at least one of the plurality of ports; generating a deadlock property based on the transaction definition; analyzing data flow through the circuit design based on the deadlock property; generating a helper assertion capturing how the data flows through the circuit design, based on analysis from the analyzing step; and checking for an absence of the deadlock condition within the circuit based on the helper assertion. 4. The computer program product of claim 1 , wherein the deadlock property captures a maximum latency between a first transaction entering a first port and a second transaction leaving a second port. | 0.664971 |
4. The standard model creating apparatus according to claim 1 , further comprising: a specification information creating unit configured to create the specification information, wherein said standard model structure determining unit is configured to determine the structure of the standard model based on the created specification information. | 4. The standard model creating apparatus according to claim 1 , further comprising: a specification information creating unit configured to create the specification information, wherein said standard model structure determining unit is configured to determine the structure of the standard model based on the created specification information. 5. The standard model creating apparatus according to claim 4 , wherein said specification information creating unit is configured to create the specification information with an Ni number of the Gaussian distributions when an instruction that the electronic apparatus is to perform quick speech recognition is obtained from the user, and to create the specification information with an N2 (>N1) number of the Gaussian distributions when an instruction that the electronic apparatus is to perform precise speech recognition is obtained from the user, and said standard model structure determining unit is configured to determine the number of the Gaussian mixture distributions according to the specification information created by said specification information creating unit. | 0.897307 |
1. A method for synthesis of simulation models using functional operators, the method performed by a data processing system and comprising: parsing a functional model; receiving a functional operator for a function within a simulation component of the functional model; receiving a structural template of the functional operator from a functional operator structural template library; mapping a plurality of functions according to the structural template of the functional operator to update the simulation component; and generating a simulation model with the updated simulation component, wherein the functional operator comprises a functional operator type and a functional operator parameter, wherein mapping at least one of the plurality of functions comprises either: simulating an amount of the functions equal to the functional operator parameter mapped using the structural template for a series functional operator, based on the functional operator type of the functional operator received being a series functional operator; or simulating an amount of the functions equal to the functional operator parameter mapped using the structural template for a parallel functional operator, based on the functional operator type of the functional operator received being a parallel functional operator. | 1. A method for synthesis of simulation models using functional operators, the method performed by a data processing system and comprising: parsing a functional model; receiving a functional operator for a function within a simulation component of the functional model; receiving a structural template of the functional operator from a functional operator structural template library; mapping a plurality of functions according to the structural template of the functional operator to update the simulation component; and generating a simulation model with the updated simulation component, wherein the functional operator comprises a functional operator type and a functional operator parameter, wherein mapping at least one of the plurality of functions comprises either: simulating an amount of the functions equal to the functional operator parameter mapped using the structural template for a series functional operator, based on the functional operator type of the functional operator received being a series functional operator; or simulating an amount of the functions equal to the functional operator parameter mapped using the structural template for a parallel functional operator, based on the functional operator type of the functional operator received being a parallel functional operator. 6. The method of claim 1 , wherein mapping the plurality of functions comprises: simulating the function mapped using the structural template for a continuous functional operator, based on the functional operator type of the functional operator received being a continuous functional operator. | 0.649103 |
1. A method comprising: identifying, by a social networking system, a target user of the social networking system as being engaged in malicious activity performed on the social networking system; identifying, by the social networking system, an object maintained by the social networking system associated with the malicious activity; identifying, by the social networking system, objects connected to the target user through the social networking system and disabled by the social networking system; retrieving, by the social networking system, information describing a type of remedial action taken by the social networking system to disable one or more of the identified objects connected to the target user; calculating, by a computer processor of the social networking system, a disabled connectivity score for the target user based at least in part on the retrieved information, the disabled connectivity score indicating a relationship between the target user and the identified objects that were disabled by the social networking system; and performing, by the social networking system, an action affecting the object associated with the malicious activity based on the calculated disabled connectivity score. | 1. A method comprising: identifying, by a social networking system, a target user of the social networking system as being engaged in malicious activity performed on the social networking system; identifying, by the social networking system, an object maintained by the social networking system associated with the malicious activity; identifying, by the social networking system, objects connected to the target user through the social networking system and disabled by the social networking system; retrieving, by the social networking system, information describing a type of remedial action taken by the social networking system to disable one or more of the identified objects connected to the target user; calculating, by a computer processor of the social networking system, a disabled connectivity score for the target user based at least in part on the retrieved information, the disabled connectivity score indicating a relationship between the target user and the identified objects that were disabled by the social networking system; and performing, by the social networking system, an action affecting the object associated with the malicious activity based on the calculated disabled connectivity score. 7. The method of claim 1 , wherein the action comprises disabling the identified object. | 0.685642 |
9. A computer implemented system for processing data, the system comprising: a processor for parsing one or more documents to identify at least one term based on at least one rule; a module for identifying content for the at least one term, wherein at least a portion of the identified content is stored in a database; and an interface for displaying the identified content based upon a user interaction with at least a portion of the one or more documents; wherein one or more data objects associated with the database are received by one or more remote computers for providing a representation of at least a portion of the database at the one or more remote computers and for linking the identified content with the at least one term. | 9. A computer implemented system for processing data, the system comprising: a processor for parsing one or more documents to identify at least one term based on at least one rule; a module for identifying content for the at least one term, wherein at least a portion of the identified content is stored in a database; and an interface for displaying the identified content based upon a user interaction with at least a portion of the one or more documents; wherein one or more data objects associated with the database are received by one or more remote computers for providing a representation of at least a portion of the database at the one or more remote computers and for linking the identified content with the at least one term. 12. The system of claim 9 , wherein the one or more data objects comprise a template object for identifying at least one rule for processing a source page. | 0.615854 |
1. A method for playing prompts during execution of a call flow of a network application, comprising the steps of: storing a plurality of subsets of prompt definitions associated with a particular language, each subset containing prompt definitions for prompts to be played during the call low, one of said subsets being designated as a base subset; designating, at a point in the call flow, one of said subsets of prompt definitions, other than the base subset, as an alternate subset; and thereafter, in response to a request to play a particular prompt, first searching the alternate subset to determine whether it contains a prompt definition for the requested prompt, and if so, playing the prompt according to the prompt definition in the alternate subset, but if the alternate subset does not contain a prompt definition for the requested prompt, then searching the base subset for a prompt definition for the requested prompt and playing the prompt according to the prompt definition in the base subset. | 1. A method for playing prompts during execution of a call flow of a network application, comprising the steps of: storing a plurality of subsets of prompt definitions associated with a particular language, each subset containing prompt definitions for prompts to be played during the call low, one of said subsets being designated as a base subset; designating, at a point in the call flow, one of said subsets of prompt definitions, other than the base subset, as an alternate subset; and thereafter, in response to a request to play a particular prompt, first searching the alternate subset to determine whether it contains a prompt definition for the requested prompt, and if so, playing the prompt according to the prompt definition in the alternate subset, but if the alternate subset does not contain a prompt definition for the requested prompt, then searching the base subset for a prompt definition for the requested prompt and playing the prompt according to the prompt definition in the base subset. 2. The method recited in claim 1 wherein at least one of the subsets contains prompt definitions for prompts to be played during only a part of the call flow. | 0.645538 |
23. A non-transitory computer readable storage medium having stored therein instructions, which when executed by a computer system cause the computer system to: receive one or more search keywords from a user; select a plurality of candidate document identifiers in accordance with the one or more search keywords, each candidate document identifier corresponding to a respective document at a respective data source; for a respective candidate document identifier of the plurality of candidate document identifiers: retrieve a document corresponding to the respective candidate document identifier from a data source, wherein the document has a structure type; convert the document into a node stream, wherein the document conversion is initiated immediately after retrieving a predefined portion of the document; generate a customized data model for the document using the node stream in accordance with the structure type of the document; identify one or more candidate chunks within the customized data model in accordance with a set of heuristic rules associated with the structure type; and select one or more chunks of the candidate chunks that satisfy the one or more search keywords; and provide at least one of the selected one or more chunks for display to the user. | 23. A non-transitory computer readable storage medium having stored therein instructions, which when executed by a computer system cause the computer system to: receive one or more search keywords from a user; select a plurality of candidate document identifiers in accordance with the one or more search keywords, each candidate document identifier corresponding to a respective document at a respective data source; for a respective candidate document identifier of the plurality of candidate document identifiers: retrieve a document corresponding to the respective candidate document identifier from a data source, wherein the document has a structure type; convert the document into a node stream, wherein the document conversion is initiated immediately after retrieving a predefined portion of the document; generate a customized data model for the document using the node stream in accordance with the structure type of the document; identify one or more candidate chunks within the customized data model in accordance with a set of heuristic rules associated with the structure type; and select one or more chunks of the candidate chunks that satisfy the one or more search keywords; and provide at least one of the selected one or more chunks for display to the user. 25. The computer readable storage medium of claim 23 , wherein the structure type is one selected from the group consisting of structured, semi-structured, and unstructured. | 0.518454 |
4. A computer implemented method for managing taxonomies comprising: retrieving a first taxonomy comprising at least one first category and one or more second taxonomies, at least one second category being associated with at least one of the one or more second taxonomies; analyzing a set of content profiles for content of the first taxonomy using evidence terms from content items; generating, using a computer processor, a category profile for the at least one first category of the first taxonomy based at least in part on the analysis of the set of content profiles for content of the first taxonomy; and creating a new taxonomy by merging the first taxonomy with the second taxonomy based on a comparison of a first category profile of the at least one first category with a second category profile of the at least one second category, wherein the comparing comprises applying a comparator function that identifies a match when a comparison between category profiles is above a threshold value, wherein the first taxonomy, the one or more second taxonomies, and the new taxonomy each comprise a controlled vocabulary organized hierarchically to represent relationships between terms in the controlled vocabulary, and wherein categories of the first taxonomy, the one or more second taxonomies, and the new taxonomy each comprise at least one labeled vocabulary term, wherein the creation of the new taxonomy comprises a taxonomy workflow process including review and approval of a plurality of tasks in a specified order. | 4. A computer implemented method for managing taxonomies comprising: retrieving a first taxonomy comprising at least one first category and one or more second taxonomies, at least one second category being associated with at least one of the one or more second taxonomies; analyzing a set of content profiles for content of the first taxonomy using evidence terms from content items; generating, using a computer processor, a category profile for the at least one first category of the first taxonomy based at least in part on the analysis of the set of content profiles for content of the first taxonomy; and creating a new taxonomy by merging the first taxonomy with the second taxonomy based on a comparison of a first category profile of the at least one first category with a second category profile of the at least one second category, wherein the comparing comprises applying a comparator function that identifies a match when a comparison between category profiles is above a threshold value, wherein the first taxonomy, the one or more second taxonomies, and the new taxonomy each comprise a controlled vocabulary organized hierarchically to represent relationships between terms in the controlled vocabulary, and wherein categories of the first taxonomy, the one or more second taxonomies, and the new taxonomy each comprise at least one labeled vocabulary term, wherein the creation of the new taxonomy comprises a taxonomy workflow process including review and approval of a plurality of tasks in a specified order. 7. The method of claim 4 , where in the event that the comparison is above the threshold, further comprising: adding the at least one first category to the new taxonomy; and creating an association between the at least one first category and the at least one second category. | 0.539794 |
7. The computer-readable medium of claim 1 , wherein the method further comprises: identifying one or more URLs from at least a portion of the search results for the at least one search macro; and calculating a score for at least one URL for the at least one search macro. | 7. The computer-readable medium of claim 1 , wherein the method further comprises: identifying one or more URLs from at least a portion of the search results for the at least one search macro; and calculating a score for at least one URL for the at least one search macro. 8. The computer-readable medium of claim 7 , wherein the method further comprises identifying one or more URLs from at least a portion of the search results for the search query; and wherein comparing at least a portion of the search results for the search query against at least a portion of the search results for the at least one search macro to determine relevance of the at least one search macro for the search query comprises comparing at least one URL from the at least a portion of the search results for the search query against the score for the at least one URL for the at least one search macro. | 0.737838 |
12. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving a glyph outline for a glyph to be rendered, the glyph to be rendered being associated with a character of a particular font and at a specified scaled size, the glyph to be rendered having one or more horizontal stems; identifying a darkening amount to be applied to the one or more horizontal stems of the glyph; modifying hints of the one or more horizontal stems of the glyph outline using the identified darkening amount to modify the glyph outline, wherein the modifying includes increasing a spacing between edges of each horizontal stem by twice the darkening amount identified for the respective horizontal stem; and rasterizing the glyph using the modified glyph outline. | 12. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving a glyph outline for a glyph to be rendered, the glyph to be rendered being associated with a character of a particular font and at a specified scaled size, the glyph to be rendered having one or more horizontal stems; identifying a darkening amount to be applied to the one or more horizontal stems of the glyph; modifying hints of the one or more horizontal stems of the glyph outline using the identified darkening amount to modify the glyph outline, wherein the modifying includes increasing a spacing between edges of each horizontal stem by twice the darkening amount identified for the respective horizontal stem; and rasterizing the glyph using the modified glyph outline. 20. The computer storage medium of claim 12 , where modifying the horizontal stems is performed in a font design space prior to rasterization of the glyph. | 0.624804 |
5. Recordable media having computer instructions for carrying out a method for delivering targeted web advertising to users via a network capable of annotating a data object, the recordable media comprising: computer program code for accessing a data object with a selectable view-thru option; computer program code for displaying a visible portion of the data object as a display image; computer program code for making alterations to the data object, wherein at least one alteration includes a rating of the data object; computer program code for storing and caching the data object and the alterations in a database, the data object and the alterations comprising database inputs; computer program code for searching and organizing the database inputs; computer program code for displaying a result to the user without migrating to another display image wherein the result displayed includes an advertisement. | 5. Recordable media having computer instructions for carrying out a method for delivering targeted web advertising to users via a network capable of annotating a data object, the recordable media comprising: computer program code for accessing a data object with a selectable view-thru option; computer program code for displaying a visible portion of the data object as a display image; computer program code for making alterations to the data object, wherein at least one alteration includes a rating of the data object; computer program code for storing and caching the data object and the alterations in a database, the data object and the alterations comprising database inputs; computer program code for searching and organizing the database inputs; computer program code for displaying a result to the user without migrating to another display image wherein the result displayed includes an advertisement. 6. The recordable media of claim 5 , wherein the data object is web page. | 0.560694 |
9. A system for processing XML documents, comprising: processing resources including at least one processor, a memory, and a non-transitory computer readable storage medium; wherein the processing resources are configured to: parse an XML document into a plurality of constituent nodes, the XML document including a plurality of Document Object Model (DOM) objects representable in accordance with an object model; store the parsed constituent nodes and associated metadata in a plurality of partitions, wherein a first node of the parsed constituent nodes and associated metadata is stored in a first partition of the plurality of partitions and a second node of the parsed constituent nodes and associated metadata is stored in a second partition of the plurality of partitions, and each said partition having an associated commit level that initially is set to 0; store, for each said partition, an identifier thereof in a partition table list, the identifier(s) in the partition table list collectively identifying the working contents of the XML document, the partition table list initially being designated as a current partition table list and initially being designated as having a current commit level of 0; in response to a request for an atomic update to the XML document: push onto a stack, configured to hold one or more previous partition table lists, a copy of the current partition table list; increment the current commit level; determine whether a given partition's contents are changed as a result of the atomic update and whether the commit level associated with the given partition does not match the current commit level; and when a given partition's contents are changed as a result of the atomic update and the commit level associated with the given partition does not match the current commit level, copy the given partition's contents to create a new partition with the changed contents and replace the identifier for the given partition in the current partition table list with an identifier for the new partition; and in response to an atomic update being completed: pop from the stack the uppermost partition table list, the popped partition table list being a candidate partition table list; determine partitions in the current partition table list that have associated commit levels that match the current commit level into the candidate partition table list; copy identifiers for any partitions in the current partition table list that have associated commit levels that match the current commit level into the candidate partition table list; replace the current partition table list with the candidate list; and decrement the current commit level. | 9. A system for processing XML documents, comprising: processing resources including at least one processor, a memory, and a non-transitory computer readable storage medium; wherein the processing resources are configured to: parse an XML document into a plurality of constituent nodes, the XML document including a plurality of Document Object Model (DOM) objects representable in accordance with an object model; store the parsed constituent nodes and associated metadata in a plurality of partitions, wherein a first node of the parsed constituent nodes and associated metadata is stored in a first partition of the plurality of partitions and a second node of the parsed constituent nodes and associated metadata is stored in a second partition of the plurality of partitions, and each said partition having an associated commit level that initially is set to 0; store, for each said partition, an identifier thereof in a partition table list, the identifier(s) in the partition table list collectively identifying the working contents of the XML document, the partition table list initially being designated as a current partition table list and initially being designated as having a current commit level of 0; in response to a request for an atomic update to the XML document: push onto a stack, configured to hold one or more previous partition table lists, a copy of the current partition table list; increment the current commit level; determine whether a given partition's contents are changed as a result of the atomic update and whether the commit level associated with the given partition does not match the current commit level; and when a given partition's contents are changed as a result of the atomic update and the commit level associated with the given partition does not match the current commit level, copy the given partition's contents to create a new partition with the changed contents and replace the identifier for the given partition in the current partition table list with an identifier for the new partition; and in response to an atomic update being completed: pop from the stack the uppermost partition table list, the popped partition table list being a candidate partition table list; determine partitions in the current partition table list that have associated commit levels that match the current commit level into the candidate partition table list; copy identifiers for any partitions in the current partition table list that have associated commit levels that match the current commit level into the candidate partition table list; replace the current partition table list with the candidate list; and decrement the current commit level. 22. The system of claim 9 , wherein the processing resources are configured to move the partitions through a caching storage hierarchy of the processing resources without adjusting or encoding memory references therein. | 0.579149 |
21. A system, comprising: one or more processors; and a computer-readable storage device coupled to the one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for providing an explanatory electronic document, the operations comprising: receiving, by the one or more processors, input from a user, the input comprising data that is at least partially representative of a subject; performing, by the one or more processors, semantic context association based on the user input, one or more computer-readable ontologies, and a computer-readable knowledge graph to provide a target subject profile, the target subject profile comprising two or more associations describing the subject at respective degrees of specificity, at least one association comprising concepts from the knowledge graph that are more general than respective entities provided in the input; providing, by the one or more processors, a set of peer user profiles based on a user profile and a superset of peer user profiles using semantic user profile association between the user profile and each peer user profile in the superset of peer user profiles; retrieving, by the one or more processors, one or more peer subject profiles from computer-readable memory, each peer subject profile being associated with a peer user profile in the set of peer user profiles, and comprising one or more associations, each association describing a past subject experienced by a peer user; filtering, by the one or more processors, at least one association from a peer subject profile based on a comparison with a respective association in the target subject profile and data provided in a knowledge graph; providing, by the one or more processors, at least one explanatory text string associated with the subject based on at least one remaining association in the peer subject profile; and providing, by the one or more processors, the explanatory electronic document comprising the at least one explanatory text string. | 21. A system, comprising: one or more processors; and a computer-readable storage device coupled to the one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for providing an explanatory electronic document, the operations comprising: receiving, by the one or more processors, input from a user, the input comprising data that is at least partially representative of a subject; performing, by the one or more processors, semantic context association based on the user input, one or more computer-readable ontologies, and a computer-readable knowledge graph to provide a target subject profile, the target subject profile comprising two or more associations describing the subject at respective degrees of specificity, at least one association comprising concepts from the knowledge graph that are more general than respective entities provided in the input; providing, by the one or more processors, a set of peer user profiles based on a user profile and a superset of peer user profiles using semantic user profile association between the user profile and each peer user profile in the superset of peer user profiles; retrieving, by the one or more processors, one or more peer subject profiles from computer-readable memory, each peer subject profile being associated with a peer user profile in the set of peer user profiles, and comprising one or more associations, each association describing a past subject experienced by a peer user; filtering, by the one or more processors, at least one association from a peer subject profile based on a comparison with a respective association in the target subject profile and data provided in a knowledge graph; providing, by the one or more processors, at least one explanatory text string associated with the subject based on at least one remaining association in the peer subject profile; and providing, by the one or more processors, the explanatory electronic document comprising the at least one explanatory text string. 24. The system of claim 21 , wherein providing the at least one explanatory text string comprises determining that a subject associated with the at least one remaining association is of the same type and of a different value than a respective subject of a peer subject profile, and in response, retrieving the at least one explanatory text string from computer-readable memory. | 0.5 |
1. A computer-implemented method for determining a set of legal documents to present to a user for acceptance as part of a transaction, the method comprising: receiving, using one or more computing systems, informational data describing a transaction; identifying, using the one or more computing systems, a set of hierarchical electronic documents pertinent to the transaction based at least in part on the received informational data, the set including a root electronic document and one or more dependency electronic documents of the root electronic document, the root electronic document specifying a transaction identifier of the transaction and metadata identifying the one or more dependency electronic documents; selecting, using the one or more computing systems, a subset of electronic documents from the set of hierarchical electronic documents based at least in part on data describing electronic documents that a user involved in the transaction has previously accepted; identifying, using the one or more computing systems, from the selected subset of electronic documents, a current version of an electronic document that has not been accepted by the user; determining, using the one or more computing systems, whether acceptance of the current version is not required responsive to the user having accepted a prior version of the electronic document; responsive to determining that acceptance of the current version is not required and that the user has accepted the prior version, removing, using the one or more computing systems, the current version of the electronic document from the selected subset of electronic documents; and outputting, using the one or more computing systems, informational data pertaining to the selected subset of electronic documents for presenting the selected subset of electronic documents to the user involved in the transaction for acceptance as part of the transaction. | 1. A computer-implemented method for determining a set of legal documents to present to a user for acceptance as part of a transaction, the method comprising: receiving, using one or more computing systems, informational data describing a transaction; identifying, using the one or more computing systems, a set of hierarchical electronic documents pertinent to the transaction based at least in part on the received informational data, the set including a root electronic document and one or more dependency electronic documents of the root electronic document, the root electronic document specifying a transaction identifier of the transaction and metadata identifying the one or more dependency electronic documents; selecting, using the one or more computing systems, a subset of electronic documents from the set of hierarchical electronic documents based at least in part on data describing electronic documents that a user involved in the transaction has previously accepted; identifying, using the one or more computing systems, from the selected subset of electronic documents, a current version of an electronic document that has not been accepted by the user; determining, using the one or more computing systems, whether acceptance of the current version is not required responsive to the user having accepted a prior version of the electronic document; responsive to determining that acceptance of the current version is not required and that the user has accepted the prior version, removing, using the one or more computing systems, the current version of the electronic document from the selected subset of electronic documents; and outputting, using the one or more computing systems, informational data pertaining to the selected subset of electronic documents for presenting the selected subset of electronic documents to the user involved in the transaction for acceptance as part of the transaction. 3. The method of claim 1 , wherein selecting the subset of electronic documents comprises: selecting, from the set of hierarchical electronic documents, electronic documents that have not been previously accepted by the user. | 0.519202 |
19. A computer program product for instructing a processor to provide mail and calendaring data to an application, said computer program product comprising: a computer readable medium; first program instruction means for retrieving fields in an extended markup language, of a document having a section, in a mailfile stored on a server, in response to a request from an application running on a user workstation; second program instruction means for inserting at said server, a URL into said document to retrieve said section of said document; third program instruction means for retrieving at said server, said section from said mailfile in a second markup language; fourth program instruction means for removing at said server, said URL from the retrieved document and creating an object having said section expanded in the retrieved document; and fifth program instruction means for sending said object to said application; and wherein all said program instruction means are recorded on said medium. | 19. A computer program product for instructing a processor to provide mail and calendaring data to an application, said computer program product comprising: a computer readable medium; first program instruction means for retrieving fields in an extended markup language, of a document having a section, in a mailfile stored on a server, in response to a request from an application running on a user workstation; second program instruction means for inserting at said server, a URL into said document to retrieve said section of said document; third program instruction means for retrieving at said server, said section from said mailfile in a second markup language; fourth program instruction means for removing at said server, said URL from the retrieved document and creating an object having said section expanded in the retrieved document; and fifth program instruction means for sending said object to said application; and wherein all said program instruction means are recorded on said medium. 20. The computer program product of claim 19 , wherein said extended markup language is XML. | 0.5 |
1. A method to record handwriting activity, comprising: registering electromyography (EMG) signals from one or more muscles at selected locations proximate the hand during handwriting activity; wherein the EMG signals are full-wave rectified and band-pass filtered in the range of 0.2-20 HZ; correlating the EMG signals with hand movement activity; processing and storing said EMG signals in a memory for the purposes of handwriting recording; analyzing said EMG signals and providing an output in a digital format; and generating and providing an output of a correlation between the hand movements during handwriting and the EMG signals; wherein one or more EMG sensor electrodes are configured to be disposed on a user's hand; wherein the EMG sensors are dry sensors; wherein the EMG signals are sampled at a number of time lags with temporary time spacing between samples from several hand muscles and in different combinations; wherein a pattern recognition algorithm consisting of a mathematical algorithm is trained to reconstruct handwriting patterns from the EMG signals; wherein the mathematical algorithm is expressed by the equation V(t)=b+Σ r=m n w (τ) n ( t +τ) +ε( t ); wherein n ( t +τ) is a vector of input EMG signals at time t and time lag τ; V is the parameter of interest at time t; w(τ)is a vector of weights for each input at time lag τ; b is the y-intercept; ε( t ) is the residual error; wherein the equation is solved using linear least square regression; and wherein the algorithm is trained by adiusting the parameters of the equation until handwriting patterns are reconstructed from the EMG signals. | 1. A method to record handwriting activity, comprising: registering electromyography (EMG) signals from one or more muscles at selected locations proximate the hand during handwriting activity; wherein the EMG signals are full-wave rectified and band-pass filtered in the range of 0.2-20 HZ; correlating the EMG signals with hand movement activity; processing and storing said EMG signals in a memory for the purposes of handwriting recording; analyzing said EMG signals and providing an output in a digital format; and generating and providing an output of a correlation between the hand movements during handwriting and the EMG signals; wherein one or more EMG sensor electrodes are configured to be disposed on a user's hand; wherein the EMG sensors are dry sensors; wherein the EMG signals are sampled at a number of time lags with temporary time spacing between samples from several hand muscles and in different combinations; wherein a pattern recognition algorithm consisting of a mathematical algorithm is trained to reconstruct handwriting patterns from the EMG signals; wherein the mathematical algorithm is expressed by the equation V(t)=b+Σ r=m n w (τ) n ( t +τ) +ε( t ); wherein n ( t +τ) is a vector of input EMG signals at time t and time lag τ; V is the parameter of interest at time t; w(τ)is a vector of weights for each input at time lag τ; b is the y-intercept; ε( t ) is the residual error; wherein the equation is solved using linear least square regression; and wherein the algorithm is trained by adiusting the parameters of the equation until handwriting patterns are reconstructed from the EMG signals. 2. Non-transitory-machine readable digital media including instructions for the steps as set forth in claim 1 . | 0.603267 |
6. A system for retrieving information from an information source, the information source being periodically updated with current information, over a network, by speech commands received from a particular user of a plurality of users provided by the particular user via an electronic-communication device, and wherein each of the plurality of users has a respective electronic-communication device, said system comprising: (a) a speech-recognition engine including a processor and coupled to a media server, the speech-recognition engine adapted to receive a speech command from each of the plurality of users provided via the respective electronic-communication device, the media server configured to identify and access the information source via the network, the speech-recognition engine adapted to select speech-recognition grammar established to correspond to the speech commands received from the plurality of users and assigned to a desired search; (b) the media server further configured to select at least one information-source-retrieval instruction corresponding to the speech-recognition grammar established for a particular speech command, the at least one appropriate information-source-retrieval instruction stored in a database associated with the media server and adapted to retrieve information; (c) a web-browsing server coupled to the media server and adapted to access a portion of the information source to retrieve information of interest requested by the particular user, by using a processor of the web-browsing server, which processor (i) performs an instruction that requests information from an identified webpage, and (ii) utilizes a content extractor within the web-browsing server to separate a portion of the information from other information, the information derived from only a portion of a webpage containing information of interest to a particular user, wherein the content extractor uses a content-descriptor file containing a description of the portion of information and wherein the content-descriptor file indicates a location of the portion of the information within the information source, and selecting, by the web-browsing server, the information of interest from the information source and retrieving only the portion of the information of interest requested by the particular user according to the at least one information-source-retrieval instruction; and (d) a speech-synthesis engine including a processor and coupled to the media server, the speech-synthesis engine adapted to convert the information retrieved from the information source into an audio message and transmit the audio message by the electronic-communication device of the particular user requesting information of interest to the particular user. | 6. A system for retrieving information from an information source, the information source being periodically updated with current information, over a network, by speech commands received from a particular user of a plurality of users provided by the particular user via an electronic-communication device, and wherein each of the plurality of users has a respective electronic-communication device, said system comprising: (a) a speech-recognition engine including a processor and coupled to a media server, the speech-recognition engine adapted to receive a speech command from each of the plurality of users provided via the respective electronic-communication device, the media server configured to identify and access the information source via the network, the speech-recognition engine adapted to select speech-recognition grammar established to correspond to the speech commands received from the plurality of users and assigned to a desired search; (b) the media server further configured to select at least one information-source-retrieval instruction corresponding to the speech-recognition grammar established for a particular speech command, the at least one appropriate information-source-retrieval instruction stored in a database associated with the media server and adapted to retrieve information; (c) a web-browsing server coupled to the media server and adapted to access a portion of the information source to retrieve information of interest requested by the particular user, by using a processor of the web-browsing server, which processor (i) performs an instruction that requests information from an identified webpage, and (ii) utilizes a content extractor within the web-browsing server to separate a portion of the information from other information, the information derived from only a portion of a webpage containing information of interest to a particular user, wherein the content extractor uses a content-descriptor file containing a description of the portion of information and wherein the content-descriptor file indicates a location of the portion of the information within the information source, and selecting, by the web-browsing server, the information of interest from the information source and retrieving only the portion of the information of interest requested by the particular user according to the at least one information-source-retrieval instruction; and (d) a speech-synthesis engine including a processor and coupled to the media server, the speech-synthesis engine adapted to convert the information retrieved from the information source into an audio message and transmit the audio message by the electronic-communication device of the particular user requesting information of interest to the particular user. 10. The method of claim 6 , further comprising: clipping engine adapted to generate the content-descriptor file, by which, an instruction is used by the web-browsing server to request information from the identified website and the information is displayed on the respective electronic-communication device, wherein the information is only the portion of the webpage containing information of interest to the particular user. | 0.517131 |
1. A method for gesture recognition, comprising: a) receiving sample motion data from one or more sensors associated with a control device wherein the motion data is related to movement of the control device; b) computing an energy value from the motion data and a baseline value for the motion data; c) updating the baseline value based on the energy value if the energy value is less than a calm energy threshold; d) adjusting the sample motion data based on the updated baseline value; e) calculating a local variance of the sample motion data over a predetermined number of local variance samples; f) beginning recording one or more values of the sample motion data for a gesture if the local variance scalar value is greater than a threshold for beginning recording; g) calculating an average local variance scalar value using the one or more values of the sample motion data for a gesture; and h) stopping the recording of the one or more values of the sample motion data for a gesture if the local variance scalar value is less than a threshold for stopping recording. | 1. A method for gesture recognition, comprising: a) receiving sample motion data from one or more sensors associated with a control device wherein the motion data is related to movement of the control device; b) computing an energy value from the motion data and a baseline value for the motion data; c) updating the baseline value based on the energy value if the energy value is less than a calm energy threshold; d) adjusting the sample motion data based on the updated baseline value; e) calculating a local variance of the sample motion data over a predetermined number of local variance samples; f) beginning recording one or more values of the sample motion data for a gesture if the local variance scalar value is greater than a threshold for beginning recording; g) calculating an average local variance scalar value using the one or more values of the sample motion data for a gesture; and h) stopping the recording of the one or more values of the sample motion data for a gesture if the local variance scalar value is less than a threshold for stopping recording. 2. The method of claim 1 , further comprising: i) computing a total variance for sample values in the gesture; j) calculating a figure of merit using the sample values in the gesture and sample values in one or more catalog gesture, wherein the figure of merit is a measure of how well the gesture matched the catalog gesture; k) determining whether an input gesture matches one of the one or more catalog gesture based on the figure of merit; and l) taking action if the input gesture matches the one of the one or more catalog gesture. | 0.53307 |
1. A method performed by a computing device to display an output comprising an image generated based on an input of a selected text from sources, wherein the sources comprise at least one of books, newspapers, songs, letters, documents, speeches or any written item, the method comprising; selecting, by the computing device, a source from among the sources; selecting, by the computing device, the text from among the selected source; defining, by the computing device, expectations for the image; building, by the computing device, a transformed text from the selected text; dividing, by the computing device, the transformed text into slides of text; generating, by the computing device, man objects for respective slides of text, each of the main objects being a graphical element that represents the respective slides of text; defining, by the computing device, a shape and properties of respective main objects; defining, by the computing device, mathematical functions for relating the properties of the respective main objects to the respective slides of text; obtaining, by the computing device, numerical values for the respective slides of text based on the mathematical functions and the properties of the respective main objects, wherein the obtained numerical values include magnitude of the respective slides of text and an angle of the respective slides of text; building, by the computing device, scripts for generating the image, based on the shape of the respective main objects and the numerical values for the respective slides of text; generating, by the computing device, the image on a polar coordinate system in accordance with the scripts; displaying, by the computing device, the image generated; displaying, by the computing device, the output that comprises the image generated upon the defined expectations for the generated image being fulfilled; and when the defined expectations are not fulfilled, performing, by the computing device, interactive processes until the defined expectations for the generated images are fulfilled. | 1. A method performed by a computing device to display an output comprising an image generated based on an input of a selected text from sources, wherein the sources comprise at least one of books, newspapers, songs, letters, documents, speeches or any written item, the method comprising; selecting, by the computing device, a source from among the sources; selecting, by the computing device, the text from among the selected source; defining, by the computing device, expectations for the image; building, by the computing device, a transformed text from the selected text; dividing, by the computing device, the transformed text into slides of text; generating, by the computing device, man objects for respective slides of text, each of the main objects being a graphical element that represents the respective slides of text; defining, by the computing device, a shape and properties of respective main objects; defining, by the computing device, mathematical functions for relating the properties of the respective main objects to the respective slides of text; obtaining, by the computing device, numerical values for the respective slides of text based on the mathematical functions and the properties of the respective main objects, wherein the obtained numerical values include magnitude of the respective slides of text and an angle of the respective slides of text; building, by the computing device, scripts for generating the image, based on the shape of the respective main objects and the numerical values for the respective slides of text; generating, by the computing device, the image on a polar coordinate system in accordance with the scripts; displaying, by the computing device, the image generated; displaying, by the computing device, the output that comprises the image generated upon the defined expectations for the generated image being fulfilled; and when the defined expectations are not fulfilled, performing, by the computing device, interactive processes until the defined expectations for the generated images are fulfilled. 6. The method of claim 1 , wherein the shape of the respective main objects includes a point, a line, a circle, a square, a sphere; wherein the shape of the respective main objects is the line and the mathematical functions includes: defining a first point of the respective main objects as coordinate (0,0), defining magnitude of the respective main objects based on logarithm, and defining a delta as an angular distance between the respective main objects to evaluate an angle of the respective main objects on the polar coordinate system; and wherein the obtaining numerical values for the respective slides of text includes determining the magnitude of the respective main objects as the magnitude of the respective slides of text, and determining the evaluated angle of the respective main objects as the angle of the respective slides of text. | 0.640928 |
6. A system, comprising a processor executing instructions causing a server computer to: receive, from a user interface element displayed on an electronic form, at least one keyword describing a web page; transmit, to an application programming interface (API) operated by a search engine, a request comprising the at least one keyword; receive, from the API in response to the request, a plurality of searched strings related to the at least one keyword, and for each one of the plurality of searched strings: a usage metric defining a number of times each of the plurality of searched strings appeared in a search performed by the search engine during a time interval; and a competition metric based on a total number of websites optimized for the search engine and including each of the plurality of searched strings; calculate a recommendation score for each of the plurality of searched strings; generate a notification to be displayed on a client computer, the notification recommending that the user create an optimized content for the web page comprising the one of the plurality of searched string associated with a highest recommendation score; identify, within the content of the selected web page, a plurality of words; generate a running count of each of the plurality of words; determine a percentage of each of the plurality of words as compared to the total number of words within the content; assign an optimal keyword density within the content; display a content color or graphic indicating if the percentage of each of the plurality of words is greater or less than the optimal keyword density; and transmit the notification to a client computer for display on a user interface. | 6. A system, comprising a processor executing instructions causing a server computer to: receive, from a user interface element displayed on an electronic form, at least one keyword describing a web page; transmit, to an application programming interface (API) operated by a search engine, a request comprising the at least one keyword; receive, from the API in response to the request, a plurality of searched strings related to the at least one keyword, and for each one of the plurality of searched strings: a usage metric defining a number of times each of the plurality of searched strings appeared in a search performed by the search engine during a time interval; and a competition metric based on a total number of websites optimized for the search engine and including each of the plurality of searched strings; calculate a recommendation score for each of the plurality of searched strings; generate a notification to be displayed on a client computer, the notification recommending that the user create an optimized content for the web page comprising the one of the plurality of searched string associated with a highest recommendation score; identify, within the content of the selected web page, a plurality of words; generate a running count of each of the plurality of words; determine a percentage of each of the plurality of words as compared to the total number of words within the content; assign an optimal keyword density within the content; display a content color or graphic indicating if the percentage of each of the plurality of words is greater or less than the optimal keyword density; and transmit the notification to a client computer for display on a user interface. 11. The system of claim 6 , wherein the instructions cause the server computer to: receive, from the electronic form, a uniform resource locator (URL) for at least one web page; identify, within the content of the at least one web page, a plurality of words; determine a total number of each of the plurality of words; display, on a user interface on the client computer, a list of each of the plurality of words, ranked according to a highest total number. | 0.759201 |
1. A computer-implemented method to allow sellers to provide pricing information to a user based on a stored collection of item information associated with the user, the method comprising: item information for a user, wherein each of the collections of item information has an associated topic and includes a plurality of purchasable items; determining whether the user has elected to make at least one of the collections of item information available to affiliated sellers; when the user has elected to make a collection of item information available to affiliated sellers: allowing affiliated sellers to access information about purchasable items in the collection of item information associated with the user; receiving pricing information associated with accessed information about purchasable items from the affiliated sellers, the pricing information comprising an offer to supply a purchasable item at a particular price; providing to the user at least some of the received pricing information for purchasable items in the collection of item information; receiving, from the user, a selection of an affiliated seller from which to purchase a selected item; and transmitting the purchase selection to the affiliated seller selected by the user to allow the affiliated seller to fulfill the purchase selection. | 1. A computer-implemented method to allow sellers to provide pricing information to a user based on a stored collection of item information associated with the user, the method comprising: item information for a user, wherein each of the collections of item information has an associated topic and includes a plurality of purchasable items; determining whether the user has elected to make at least one of the collections of item information available to affiliated sellers; when the user has elected to make a collection of item information available to affiliated sellers: allowing affiliated sellers to access information about purchasable items in the collection of item information associated with the user; receiving pricing information associated with accessed information about purchasable items from the affiliated sellers, the pricing information comprising an offer to supply a purchasable item at a particular price; providing to the user at least some of the received pricing information for purchasable items in the collection of item information; receiving, from the user, a selection of an affiliated seller from which to purchase a selected item; and transmitting the purchase selection to the affiliated seller selected by the user to allow the affiliated seller to fulfill the purchase selection. 3. The method of claim 1 , wherein the purchasable items in the collection of item information include products and services. | 0.573019 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.