Data Sorting TRIZ Cases
- Anti-theft retail merchandise hook with radio transmission
See how a display hook uses its wire as an antenna to transmit theft alerts wirelessly, deterri
- Sensor Data Sorting Verification for Autonomous Vehicle Integrity
Invariant checks verify sorted sensor data by space and time, preserving integrity without costly element-by-element comparison.
- AI Accelerator Activation Sparsity for Sparse Neural Network Throughput
Top-K activation sparsity cuts inactive tensor values, easing neural network compute and power bottlenecks in training and inference.
- Image Transfer History for Consistent Retransmission Sorting
Stored transfer history preserves the original sorting destination after failed image transfer, preventing misclassification during retransmission.
- Vector Memory Array Sorting With Bitonic Compare-and-Swap
Bitonic compare-and-swap vectors make memory array sorting deterministic on RISC-V vector hardware, cutting time versus quicksort.
- Offline Tree Data Preparation for Bulk Insert Bottlenecks
Pre-sorting and resorting bulk data into a tabular tree structure cuts insertion time, processing load, and network traffic.
- In-Place Sample Sorting With Bucket Redistribution and Small-Cache Fit
Bucket counting and staged redistribution cut memory use and cache traffic in in-place sorting on small-L2 architectures.