SYSTEM AND METHOD FOR ENABLING APPLICATION DISCOVERY BY AUTOMATION NEEDS

• US 20160219086A9
• Filed: 06/24/2013
• Published: 07/28/2016
• Est. Priority Date: 05/26/2010
• Status: Active Grant

• Current Assignee: Automation Anywhere, Inc.
• Original Assignee: Automation Anywhere, Inc.
• Inventors: Shukla, Mihir
• Granted Patent: US 9,462,042 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: H04L 65/403 Arrangements for multi-party communication, e.g. for conferences data switching systems for conference H04L12/18; arrangements for connecting several subscribers to a common circuit, i.e. affording conference facilities H04M3/56; television conferencing systems H04N7/15
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46

Abstract

This invention generally relates to a process, system and computer code for identifying one or more data relationships that exist between and utilized by one or more applications; determining for each data relationship a respective rank based on specific data that associates the two or more user applications; finding applications based on the degree a respective rank has to one or more user applications; categorizing each relationship based on a criteria of the interaction; creating an application wall containing status updates and links to and from other applications related to the one of the one or more user applications; constructing a automation map from the links between the one or more user applications and other applications.

Claims

1. A computer method for displaying information comprising the steps of:

identifying one or more data relationships that exist between and utilized by one or more applications;

determining for each data relationship a respective rank based on specific data that associates the two or more user applications;

finding applications based on the degree a respective rank has to one or more user applications;

categorizing each relationship based on a criteria of the interaction;

creating an application wall containing status updates and links to and from other applications related to the one of the one or more user applications;

constructing a automation map from the links between the one or more user applications and other applications.

2. The computer method as in claim 1 further including searching the automation map for parameters that relate the one or more user applications and other applications.

3. The computer method as in claim 1 further including displaying a categorization of the plurality of relations from the links between the one or more user applications and other applications according to the criteria.

4. The computer method as in claim 1 further including displaying each categorization of the plurality of relations based on the links between the one or more user applications and other applications, as a respective bar that is representative of the number of occurrences of the specific data item contained therein.

5. The computer method as in claim 1 further including coloring each link in the automation map according to common structural characteristics.

6. A computer method for generating an input content for an application or a form resident on a first computer from content existing in the same computer or in a remote computer comprising the steps of:

extracting data from a first application;

saving source field data to a process repository;

transforming and transferring data to a second application;

saving target field metadata to a process repository until all metadata has been saved;

updating the second application network database, said update including;

reading source application, target application, source fields, target fields, and if a first application is linked to a second application then updating an application link with a new set of data fields, and calculating an application cohesion rank.

7. The computer method as in claim 6 including recording a process that extracts the data from the first application;

saves source field data to a process repository;

transforms and transfers data to a second application;

saves target field metadata to a process repository until all metadata has been saved; and

updates the second application network database.

8. The computer method as in claim 7 including capturing one or more user generated events, capturing one or more process contexts, computing an automation map, identifying one or more data source events, identifying one or more data input events, classifying applications as one of intermediate, producer or consumer, updating the automation map, pre-calculating edge weights, and computing an APP cohesion index for all application pairs.

9. The computer method as in claim 6 including playing back a process that extracts the data from the first application;

saves source field data to a process repository;

transforms and transfers data to a second application;

saves target field metadata to a process repository until all metadata has been saved; and

updates the second application network database.

10. The computer method as in claim 6 including classifying said first and second applications as one of producers, consumers, or orchestrators;

recalculating the ranks.

11. A non-transitory computer-readable medium having stored thereon computer-readable instructions for displaying information comprising:

identifying one or more data relationships that exist between and utilized by one or more applications;

determining for each data relationship a respective rank based on specific data that associates the two or more user applications;

finding applications based on the degree a respective rank has to one or more user applications;

categorizing each relationship based on a criteria of the interaction;

creating an application wall containing status updates and links to and from other applications related to the one of the one or more user applications;

constructing a automation map from the links between the one or more user applications and other applications.

12. The non-transitory computer-readable medium in claim 11 further including stored thereon computer-readable instructions for searching the automation map for parameters that relate the one or more user applications and other applications.

13. The non-transitory computer-readable medium in claim 11 further including stored thereon computer-readable instructions for displaying a categorization of the plurality of relations from the links between the one or more user applications and other applications according to the criteria.

14. The non-transitory computer-readable medium in claim 11 further including stored thereon computer-readable instructions for displaying each categorization of the plurality of relations based on the links between the one or more user applications and other applications, as a respective bar that is representative of the number of occurrences of the specific data item contained therein.

15. The non-transitory computer-readable medium in claim 11 further including stored thereon computer-readable instructions for coloring each link in the automation map according to common structural characteristics.

16. A non-transitory computer-readable medium having stored thereon computer-readable instructions for displaying information comprising:

extracting data from a first application;

saving source field data to a process repository;

transforming and transferring data to a second application;

saving target field metadata to a process repository until all metadata has been saved;

updating the second application network database, said update including;

reading source application, target application, source fields, target fields, and if a first application is linked to a second application then updating an application link with a new set of data fields, and calculating an application cohesion rank.