Dynamic Flow Nodes for Customizable Software Application Logic
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional software applications with hard-coded flow sequences and navigation algorithms are inefficient, difficult to modify, and consume unnecessary computational resources, especially in providing customizable user experiences, due to complex inter-dependencies and large numbers of interview screens.
Innovation Solution
Implement software applications with dynamic conditions and actions, where flow nodes are independently executed and can be added, removed, or reordered without altering the final result, using self-contained modules with runtime evaluations and actions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If hard-coded flow sequences and navigation algorithms are used, then software structure is fixed and predictable, but computational resources are wasted traversing irrelevant nodes and modifications become difficult
Solution Approach 1:
The patent implements dynamic flow nodes that can be executed in any order without hard-coded sequences. Each flow node contains dynamic conditions and actions that are evaluated at runtime, allowing the software to adapt its execution path based on actual data rather than following a predetermined hierarchical structure. This eliminates the waste of traversing irrelevant nodes while maintaining flexibility for modifications.
Solution Approach 2:
The patent divides the software into independent, self-contained flow nodes that can be executed autonomously. Each flow node is a discrete unit with its own conditions and actions, breaking the monolithic hard-coded structure into modular segments. This segmentation allows the system to execute only relevant nodes without traversing the entire hierarchical structure, improving computational efficiency.
2Adaptability or versatility
If large numbers of interview screens are stored in a repository to provide customization, then user experience can be personalized, but computational resources increase due to traversing through many screens
Solution Approach 1:
The patent executes only the necessary flow nodes required to achieve the current objective rather than traversing through all available interview screens in the repository. By dynamically evaluating conditions and executing partial sets of relevant nodes, the system provides customization without the computational overhead of processing excessive screens.
Solution Approach 2:
The patent pre-defines flow nodes with their conditions and actions stored in a repository, but these nodes remain inactive until dynamically selected and executed based on runtime needs. This preliminary preparation allows for quick assembly of relevant customization paths without having to traverse or load entire screen repositories during execution.
3Stability of the object's composition
If flow nodes are interconnected with dependencies in a hard-coded structure, then logical flow is maintained, but adding, removing, or reordering nodes requires breaking and re-establishing edges
Solution Approach 1:
The patent implements dynamic flow nodes that execute based on runtime conditions rather than fixed hard-coded connections. Each node independently evaluates its own conditions and determines execution order, eliminating the need for manual edge management. This dynamic approach maintains logical flow stability through consistent condition evaluation while enabling easy modification of the node set without restructuring connections.
4Ease of operation
If hierarchical traversal is used to navigate flow sequences, then structured access is achieved, but irrelevant nodes and objects are processed consuming unnecessary resources
Solution Approach 1:
The patent performs partial traversal by dynamically selecting and executing only the relevant flow nodes needed for the current task. Instead of systematically navigating through entire hierarchical structures, the system evaluates conditions and executes partial sets of nodes, maintaining navigation capability while eliminating waste from processing irrelevant objects.
Data Source
Figure 1A
Figure 1B
Figure 1C
AI summary
Disclosed are techniques for implementing software products or services with dynamic conditions and dynamic actions. These techniques identify a plurality of flow nodes for a software application. One or more dynamic conditions may be identified or determined for the plurality of flow nodes; and one or more dynamic actions may be identified or determined for the one or more dynamic conditions. A dynamic flow may be determined with the plurality of flow nodes, the one or more dynamic conditions, and the one or more dynamic actions, without hard coded inter- dependency between two or more flow nodes of the plurality of flow nodes.