mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Energy, industry and public infrastructure
mes
manufacturing execution system
Siemens Opcenter
System
Techniques · 10
Primitives · 28
mes
Bill of materials explosion
optimization · medium: MRP netting: explode BOMs level by level with lead-time offsetting into planned orders
Constraint propagation (constraint…
optimization · medium: Variables with finite domains, propagators that prune impossible values to a fixpoint, and backtracking search with trail undo between decisions.
›
Job-shop scheduling
optimization · medium: Model jobs as chains of operations, resource order as a choice of arc directions, and minimise the longest path; build with dispatching rules, improve by swapping critical neighbours or solve with CP.
›
Tamper-evident audit log
security · medium: An append-only log whose Merkle root, signed per batch, lets anyone verify an entry is present and history was never rewritten, with log-size proofs.
›
Control charts (Shewhart, CUSUM, EW…
statistics · medium: Estimate normal behaviour from healthy data, then signal when values leave limits (Shewhart) or small deviations add up (CUSUM, EWMA); tune by average run length.
›
MVCC
storage · medium: Keep timestamped versions of each row so readers see a consistent snapshot without blocking writers; the default concurrency control in modern databases.
›
Critical path analysis
graphs · medium: Longest dependency chain in a DAG of timed spans or build actions
Digital signatures (Ed25519)
security · low: Small, fast, deterministic public-key signatures that prove who produced a message; the default for tokens, releases and protocols.
›
BFS and DFS
graphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.
›
Swinging door compression
compression · low: Deadband and swinging-door trending compression for process historians
Barcode symbologies
data-structures · low: Encode/decode 1D and 2D barcodes (Code 128, DataMatrix, QR) with their error correction
Opc ua
embedded · low: OPC UA industrial protocol: address space, subscriptions and monitored items, security modes
Event sourcing
finance · low: Persist state changes as an append-only stream of immutable events per entity; current state is a fold over them, guarded by expected-version appends.
›
Optimistic concurrency control
storage · low: Run transactions without locks, record what they read, and validate at commit that nothing changed; fastest when conflicts are rare.
›
Write-ahead log
storage · low: Append each change to a checksummed sequential log and fsync it before touching data pages; the basis of crash durability in nearly every database.
›
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Topological sort
graphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.
›
Hash aggregation
storage · low: GROUP BY via hash tables with partitioning and spill to disk
Calendar date arithmetic
systems · low: Civil dates, time zones (tzdb), DST gaps, month-end anchoring and duration math
Interval arithmetic
numerics · low: Rigorous bounds with outward rounding; root isolation and robust geometric tests
Two watched literals
optimization · low: Unit propagation for SAT that watches just two literals per clause, so backtracking costs nothing and long clauses are rarely touched.
›
Journaled state revert
storage · low: Undo journal of state writes enabling nested checkpoints and cheap revert
Interval tree
data-structures · low: Index of ranges that answers "which intervals overlap this point or range?" in O(log n + k); static sorted-array form is the compact, cache-friendly choice.
›
+ 3 more techniques
+ 12 more primitives
System
Techniques · 10
Primitives · 28
mes
Bill of materials explosion
optimization · medium: MRP netting: explode BOMs level by level with lead-time offsetting into planned orders
Constraint propagation (constraint…
optimization · medium: Variables with finite domains, propagators that prune impossible values to a fixpoint, and backtracking search with trail undo between decisions.
›
Job-shop scheduling
optimization · medium: Model jobs as chains of operations, resource order as a choice of arc directions, and minimise the longest path; build with dispatching rules, improve by swapping critical neighbours or solve with CP.
›
Tamper-evident audit log
security · medium: An append-only log whose Merkle root, signed per batch, lets anyone verify an entry is present and history was never rewritten, with log-size proofs.
›
Control charts (Shewhart, CUSUM, EW…
statistics · medium: Estimate normal behaviour from healthy data, then signal when values leave limits (Shewhart) or small deviations add up (CUSUM, EWMA); tune by average run length.
›
MVCC
storage · medium: Keep timestamped versions of each row so readers see a consistent snapshot without blocking writers; the default concurrency control in modern databases.
›
Critical path analysis
graphs · medium: Longest dependency chain in a DAG of timed spans or build actions
Large neighbourhood search (ruin an…
optimization · medium: Repeatedly remove a chunk of a solution and rebuild it with a heuristic or exact solver; learn which operator pairs pay off.
›
Simulated annealing
optimization · medium: Stochastic local search with a cooling schedule for combinatorial optimization
Local search 2opt or opt
optimization · medium: 2-opt, Or-opt, relocate and swap neighborhoods with fast delta evaluation for routes
Digital signatures (Ed25519)
security · low: Small, fast, deterministic public-key signatures that prove who produced a message; the default for tokens, releases and protocols.
›
BFS and DFS
graphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.
›
Swinging door compression
compression · low: Deadband and swinging-door trending compression for process historians
Barcode symbologies
data-structures · low: Encode/decode 1D and 2D barcodes (Code 128, DataMatrix, QR) with their error correction
Opc ua
embedded · low: OPC UA industrial protocol: address space, subscriptions and monitored items, security modes
Event sourcing
finance · low: Persist state changes as an append-only stream of immutable events per entity; current state is a fold over them, guarded by expected-version appends.
›
Optimistic concurrency control
storage · low: Run transactions without locks, record what they read, and validate at commit that nothing changed; fastest when conflicts are rare.
›
Write-ahead log
storage · low: Append each change to a checksummed sequential log and fsync it before touching data pages; the basis of crash durability in nearly every database.
›
Hierarchical state machine
systems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.
›
Topological sort
graphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.
›
Hash aggregation
storage · low: GROUP BY via hash tables with partitioning and spill to disk
Calendar date arithmetic
systems · low: Civil dates, time zones (tzdb), DST gaps, month-end anchoring and duration math
Interval arithmetic
numerics · low: Rigorous bounds with outward rounding; root isolation and robust geometric tests
Two watched literals
optimization · low: Unit propagation for SAT that watches just two literals per clause, so backtracking costs nothing and long clauses are rarely touched.
›
Journaled state revert
storage · low: Undo journal of state writes enabling nested checkpoints and cheap revert
Interval tree
data-structures · low: Index of ranges that answers "which intervals overlap this point or range?" in O(log n + k); static sorted-array form is the compact, cache-friendly choice.
›
Merkle tree
data-structures · low: Hash tree for verifying and diffing large datasets with logarithmic proofs
Segmented log
distributed · low: Split an append-only log into files named by their first offset, write only the newest, and find any record by binary search plus a sparse index.
›
Trusted timestamping
security · low: RFC 3161 time-stamp tokens: a TSA signs a hash with time, proving data existed then
Exponential smoothing (ETS, Holt-Wi…
statistics · low: Forecast by keeping a few running states (level, trend, seasonal) updated by a fraction of each forecast error; O(1) memory per series and a strong baseline.
›
Robust statistics
statistics · low: Location and scale estimates (median, MAD, trimmed mean, Huber M-estimator) that stay correct when a minority of the data is garbage.
›
Sliding-window counters
systems · low: Count events in the last W seconds with a ring of sub-bucket counters; the two-bucket weighted estimate gives rate limits in 16 bytes per key.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
k-d tree
geometry · low: A binary tree that splits k-dimensional points by one coordinate per level, giving fast nearest-neighbour and box queries on static low-dimensional data.
›
CRC32C checksums
hardware-os · low: The Castagnoli CRC-32 with dedicated instructions on x86 (SSE4.2) and ARMv8. It is the standard fast integrity check for storage blocks, logs and network frames.
›
fsync, O_DSYNC and O_DIRECT
hardware-os · low: What fsync, fdatasync, O_DSYNC, O_DIRECT and F_FULLFSYNC really guarantee on Linux and macOS, and the exact call sequences for crash-safe files.
›
SIMD programming
hardware-os · low: Process 4-16 lanes per instruction with AVX2, AVX-512 or NEON via Rust std::arch, with runtime dispatch and a portable fallback.
›
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
fab-mes
55 %
lims
30 %
drug-serialization
18 %
enterprise-asset-management
17 %
ivd-analyzer
17 %