Objective Tree Subset Replacement for Crowdsourcing Adaptability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Crowdsourcing systems face inefficiencies and delays when objectives change, requiring restarts and re-expenditure of computational resources to repeat processes, leading to increased costs and resource usage.
Innovation Solution
A system that modifies a corresponding subset of a graph when a node's objective changes, including connected nodes and their relationships, by replacing nodes with new ones that have satisfiable definitions, reducing the need to assess all indirectly connected nodes and minimizing computational resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If crowdsourcing systems restart and repeat all processes when objectives change, then objectives can be modified, but computational resources are re-expend and processing time increases
Solution Approach 1:
The patent segments the graph into subsets based on node relationships (directly connected vs. indirectly connected nodes). When an objective changes, only the relevant subset containing directly connected nodes is reassessed and modified, while indirectly connected nodes are preserved. This segmentation allows selective updates rather than complete system restarts, reducing computational resource consumption while maintaining adaptability to objective changes.
2Adaptability or versatility
If crowdsourcing systems restart and repeat all processes when objectives change, then objectives can be modified, but processing time increases
Solution Approach 1:
The system divides the graph processing into segments based on node connectivity. Only the subset containing directly connected nodes undergoes reassessment and modification when objectives change, while indirectly connected nodes are excluded from reprocessing. This segmentation dramatically reduces processing time by avoiding unnecessary repetition of processes for nodes that remain valid, while still enabling timely adaptation to objective changes.
3Reliability
If all indirectly connected nodes are assessed when a node objective changes, then completeness is maintained, but computational resources are wasted
Solution Approach 1:
The patent applies local quality by differentiating between directly connected nodes (which require reassessment due to potential objective conflicts) and indirectly connected nodes (which can be preserved). The system selectively applies assessment resources to only those nodes with direct relationships to the modified node, ensuring reliability for critical nodes while avoiding wasteful expenditure on nodes that maintain their validity through indirect connections.
4Reliability
If connected nodes with unsatisfiable definitions are modified, then objective compatibility is ensured, but graph modification complexity increases
Solution Approach 1:
The system segments the graph modification process into two distinct phases: (1) identification and modification of directly connected nodes with unsatisfiable definitions to ensure objective compatibility, and (2) preservation of indirectly connected nodes. This segmented approach ensures reliability by thoroughly checking compatibility for critical connected nodes while simplifying the overall modification process by excluding unnecessary nodes, thereby managing complexity effectively.
Data Source
AI summary
In some embodiments, a hierarchical tree may include nodes that each indicates an objective, and each non-root node of the nodes indicates an objective supporting an objective of at least one node with which the non-root node has a direct relationship. Based on a modification to an objective of a given node of the tree, a determination of whether at least one child node of the given node indicates an unsatisfiable objective (e.g., no longer suitably supporting the given node's objective). For a child node of the given node determined to indicate an unsatisfiable objective, a corresponding subset of the tree may be replaced with replacement nodes that each indicates a satisfiable objective (e.g., suitably supporting the given node's objective), where the corresponding subset includes (i) the child node and (ii) descendant nodes of the child node.