Abstract: A technique to automatically identify controls of a software application is disclosed. Attributes of a software application are monitored. The attributes may include control type attributes. The controls are identified by determining a hierarchy of parent controls and children controls. A directed graph may be generated, based on the monitored control attributes, and used to identify the controls. The identified controls may be used for robotic process automation of the software application.

Abstract: The invention provides, in some aspects, methods of optimizing an app for execution on a client device by identifying components of the app used in such execution by a user having a designated role who accesses the app for download via a designated portal. A component can be, for example, a source code file or portion thereof, including, for example, a portion defining a widget or other user interface element. For each component, the method (i) identifies source code files on which execution of that component depends, e.g., in connection with execution of the particular app by the particular user, and (ii) generates a dependency-ordered stack of the source code files for that component. In further accord with those aspects of the invention, the method combines the dependency-ordered stacks into a single such stack and transfers the source code in an order specified by that stack to the client device for loading and execution.

Abstract: The present disclosure describes systems and apparatuses for connecting graphical shapes. A client digital data processor receives selection events. Each selection event tracks one or more input locations. The client digital data processor identifies a source and target graphical shape based at least on the received selection events. The client digital data processor determines a source and target connection point for a connector based at least on the source and target graphical shapes. The client digital data processor determines a length for the connector based at least on the source and target connection points. The client digital data processor generates and displays the connector based at least on the source and target connection points and the length. The present disclosure also describes methods for operating a client digital data processor as described above, and a computer-readable medium storing a program having instructions for so operating a client digital data processor.

Abstract: The invention provides, in some aspects, a computer-implemented method for enabling enhanced functionality in a software application. The method includes executing, on a computer, an enhancement engine that is communicatively coupled to a rules base (or other store that contains rules) and/or a rules engine that executes rules (e.g., from the rules base). The enhancement engine receives a request to enable enhanced functionality in an application that is defined, at least in part, by a plurality of such rules, where the request specifies a selected rule in the application for such enhancement. The enhancement engine identifies (or ascertains) a new rule at least partially providing the enhanced functionality and (i) updates the rules base (or other store) to include the new rule along with the others that define at least a portion of the application and/or (ii) effects execution by the rules engine of the new rule along with those others.

Abstract: The present systems and methods allow for rapid processing of large volumes of events. A producer node in a cluster determines a sharding key for a received event from an event stream. The producer node uses a sharding map to correlate the sharding key for the event with a producer channel, and provides the event to a producer event buffer associated with the producer channel. The producer event buffer transmits the event to a corresponding consumer event buffer associated with a consumer channel on a consumer node. The event processing leverages a paired relationship between producer channels on the producer node and consumer channels on the consumer node, so as to generate enhanced throughput. The event processing also supports dynamic rebalancing of the system in response to adding or removing producer or consumer nodes, or adding or removing producer or consumer channels to or from producer or consumer nodes.

Abstract: Described are techniques for processing an instance of a data structure. A request to process an instance of a data structure at a first point in time is received. At least one of the data elements in the data structure is a dynamic data element that uses an association specifying how to access data for the dynamic data element in accordance with criteria evaluated using a current context determined at a point in time. In response to receiving the request, first processing is performed including determining whether the dynamic data element is referenced at the first point in time, and, if so, evaluating the criteria using a current context determined at the first point in time, and retrieving data for the dynamic data element in accordance with a current context determined at the first point in time.

Abstract: Described herein is a system comprising an App Generator (application generator) comprising executable program instructions that define one or more constraints. The one or more constraints embody one or more rules for converting an information structure into one or more components of a software application. The system also includes a digital data processor executing said executable program instructions to: i. provide a user interface; ii. accept input data that defines the information structure; and iii. apply the one or more constraints to said input data to generate the one or more components of the software application.

Abstract: The invention provides, in one aspect, a method of finding a rule in a rules base that includes a plurality of rule entries, each having a rule and an associated objective and one or more associated circumstances. A rule finder accesses the rules base in response to a request, with a specified objective and with specified circumstances, by searching the rules base for a matching entry. Where the search fails, the rule finder searches one or more translation tables for entries having first circumstances matching those specified in the request that resulted in the failure. If found, the rule finder repeats the search of the rules base with the specified objective and with a second (or “map-to”) circumstances from matching entries in the translation tables. The rule finder can return, e.g., to an application program that issued the request, a rule found during that repeat search of the rules base.

Abstract: The present invention provides methods and systems for integrating a procedural computational model with a declarative computational model. For example, in one aspect, the present invention provides a method for integrating a plurality of procedural instructions in a procedural computational system with a plurality of declarative rules in a declarative computational system. In such a method, for each of the procedural instructions operating on one or more variables, a hash table indexed by variable names is utilized to determine whether any of these variables participate in at least one of the declarative rules. Upon execution of a procedural instruction that changes a variable participating in a declarative rule, other variables associated with the rule are updated so as to maintain a relationship imposed by the rule among the variables. The updating of the other variables is performed prior to execution of other procedural instructions.

Abstract: The invention provides, in some aspects, systems for proactive management of development and performance of a software application based on monitoring it (and/or one or more of its components) during the course of development or execution. Those systems signal alerts upon determining that actual or expected usage of the application (or its components) by users of like classes (or roles) is anticipated to, or does, exceed quotas, when the application is placed in production mode.

Abstract: The invention provides, in one aspect, a user interface method that includes processing one or more BPM or other rules with a rules engine executing on a server digital data processor. The rules engine generates, for presentation on a client device, a user interface having one or more display, input or other elements specified by those rules. Related aspects of the invention provide methods as described above in which the rules engine generates the user interface dynamically, e.g., selecting and/or configuring the elements that make up that interface concurrently with the client-server session during which the interface (e.g., web page or other user interface paradigm) is requested by, transmitted to, and/or presented by the client device. Further aspects of the invention provide such a method, where the rules engine generates the interface, e.g., web page, with embedded BPM or other rules that are executed by the client device and that support automated decision-making, e.g.

Abstract: Methods and apparatus for service-level based and/or skills-based assignment of a work item to one (or more) of a plurality of resources based on fitness, for example, of skills required by the former to those provided by the latter. Assignment takes into account the level of stress on the work item and/or resources, such that the number of resources fit for assignment varies as the level of stress varies. Systems according to the invention can be used, by way of example, to route a call or other request made by a customer to a service center. The requirements for processing the call (determined, for example, by an incoming call operator) are matched against the skill sets of available customer service agents, taking call and/or resource stress levels into account. For example, some implementations may match an incoming call having a low stress factor (e.g.

Abstract: A method of automated workflow processing includes transforming an object, A1, which is of class X, into an object which is of class Y. The method includes the steps of separating existing data elements of A1 from the object itself, generating new data elements corresponding to class Y, inserting the new data elements into object A1, and computing values for the new data elements, possibly based on values of the old data elements. Other objects that referred to A1 before the transformation continue to do so afterwards. Values of data elements prior to transformation can be preserved, e.g., to facilitate review, to facilitate further transformation, and/or to facilitate back transformation.