Other Databases Indexing TRIZ Cases
- Parameter Optimization Using Genetic Algorithms and Pareto Fronts
Pareto-front analysis replaces manual trial and error, helping planners select parameter configurations across multiple objectives.
- Intent-Graph Network Query Mechanism for Cross-Database Retrieval
An intent graph selects relevant network devices and joins datastore data, reducing coding effort and speeding issue diagnosis.
- Graph-Based Node Selection for Efficient Data Labelling
A joint graph learning architecture selects uncertain data nodes for expert review, improving labels while reducing retraining costs.
- Maximum-Flow Media Recommendation Calibration for Minority Interests
This case uses network graphs and maximum flow to balance media relevance with a user's full interest distribution.
- Encrypted Data Search with Segmented Tables and Position Vectors
This case uses segmented lookup tables and position vectors to reduce comparisons when searching homomorphically encrypted data.
- Causality Search With Bootstrap Graph Aggregation and Edge Selection
Multiple sampled datasets yield probability-based causal edges, improving graph reliability while reducing manual selection burden.
- Causality Search Reliability Through Resampled Graph Selection
Multiple sampled datasets and frequency-based edge selection improve causal graph reliability while reducing user burden.
- Distributed Tensor Computation Layouts for Lower Communication Overhead
Compiler-managed tensor layouts and segmentation distribute work across devices while balancing computation time and communication overhead.
- Neural Graph-Based Alert Representations for Related Event Analysis
A neural network turns machine-data alerts into graph representations, linking related events for faster, more focused analysis.
- Bidirectional Query Encoding for Missing Knowledge Graph Entities
Segmented paths and independent positional encoding help transformers answer complex graph queries with multiple missing entities.
- Dynamic VPN Address Allocation for Conflict-Free Private Routing
This case allocates available private addresses during VPN setup to prevent routing conflicts across simultaneous secure connections.
- Single Identifier Platform Using Graph-Based Entity Clustering
A scoring model and graph clustering process resolves incomplete records and assigns unique identifiers to entity data.
- Bloom Filter Lookup Structures for Memory-Efficient Multi-Token Search
Hash-based bit vectors accelerate sequential token matching while reducing lookup memory and helping detect sensitive data in real time.
- Code-Independent Graph Execution Through Data-Driven Nodes
This case uses interconnected nodes to drive execution, reducing external code dependencies and supporting portable runtime graph changes.
- Supply Chain Graph Model Generation for Adaptive Relationship Queries
Supply chain records are parsed, resolved, and mapped to graph nodes and edges for adaptable queries and pattern discovery.
- Customer Access Graphs for Self-Service Cloud Resource Permissions
A manager-editable access graph enables granular cloud resource permissions without host personnel handling every change.