System and method for enabling application discovery by automation needs

• US 9,462,042 B2
• Filed: 06/24/2013
• Issued: 10/04/2016
• Est. Priority Date: 05/26/2010
• Status: Active Grant

• Current Assignee: Automation Anywhere, Inc.
• Original Assignee: Tethys Solutions, LLC
• Inventors: Shukla, Mihir, Gunapu, Sridhar
• Primary Examiner(s): Pan, Yongjia
• Application Number:
  US13/925,522
• Publication Number:
  US 20140380192A1
• Time in Patent Office: 1,198 Days
• Field of Search: None
• 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 comprising the steps of:

executing one or more programs resident at one of a local or remote computer site, said programs instantiating a task to be run at various times or repetitively at one of the local or remote computer site;

identifying one or more data relationships that exist between and utilized by one or more applications at one of the local or remote computer site;

determining for each data relationship a respective rank associated with the one or more applications;

launching a portable unit containing an execution file that directs it to find all applications with fields that are related to the relationships;

retrieving at any site located, the relationships based on the degree the respective rank, based on an outlink/inlink ratio, has to the one or more applications, wherein the outlink/inlink includes a number of fields an application consumes or produces;

categorizing each relationship based on a criteria of the interaction;

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

constructing an automation map from the links between the one or more applications.

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

3. The computer method as in claim 1 further including displaying a categorization of the plurality of relationships from the links between the one or more 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 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. The computer method as in claim 1, the number of fields between two applications reflects an impedance.

7. A non-transitory computer-readable medium having store thereon computer-readable instructions for:

executing one or more programs on one or more programs on one or more local or remote computers, said programs identifying one or more data relationships that exist between and utilized by one or more applications resident on one or more local or remote computers;

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

launching a portable unit containing an execution file that directs it to find all applications with fields that are related to the requirements;

retrieving at any site located, the same requirements based on the degree a respective rank, based on an outlink/inlink ratio, has to one or more user applications, wherein the outlink/inlink includes a number of fields an application consumes or produces;

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 an automation map from the links between the one or more user applications and other applications.

8. The non-transitory computer-readable medium in claim 7 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.

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

10. The non-transitory computer-readable medium in claim 7 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 applications and other applications, as a respective bar that is representative of the number of occurrences of the specific data item contained therein.

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