mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Industry and field operations
enterprise-asset-management
EAM/CMMS
IBM Maximo, SAP PM, IFS
System
Techniques · 15
Primitives · 58
enterprise-asset-manage…
Durable workflow execution
distributed · medium: Ordinary code made crash-proof by logging every side-effect result and replaying the code from that log; activities run at least once, workflow logic must be deterministic.
›
Offline mutation queue
distributed · medium: Apply actions locally at once and queue them durably; on reconnect replay the queue idempotently, then re-apply unconfirmed ones on the server state.
›
Fault tree analysis
embedded · medium: Write the unwanted top event as AND/OR logic over component failures, reduce it to minimal cut sets, then compute its probability and each failure's share.
›
Inventory reservation
finance · medium: Reserving stock with TTL holds, release on timeout and no overselling under contention
Inventory policies safety stock
optimization · medium: (s,S), base-stock, EOQ and newsvendor policies with safety stock from demand uncertainty
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.
›
Remaining useful life estimation
statistics · medium: Degradation and survival models predicting time to failure from condition data
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.
›
Croston method
statistics · low: Forecasting intermittent demand by separately smoothing demand sizes and intervals (Croston, SBA, TSB)
Calendar date arithmetic
systems · low: Civil dates, time zones (tzdb), DST gaps, month-end anchoring and duration math
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
Linear referencing
geometry · low: Locate events and attributes along a route by measure (distance from start) and project points onto routes, with calibration points
Mqtt protocol
networking · low: MQTT pub/sub: topics, QoS 0/1/2, retained messages, sessions and keepalive
Closure table
storage · low: Storing trees and hierarchies in relational tables (closure table, materialized path) for fast subtree queries
Business day calendars
systems · low: Holiday calendars, business-day adjustment rules (following, modified following) and settlement cycles
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.
›
Record replay
distributed · low: Record every nondeterministic input (time, randomness, I/O, model and tool outputs, per-tick player input) and re-execute deterministically for debugging, replays and state rebuild
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.
›
Hierarchical timing wheel
systems · low: Timers bucketed by expiry into wheels of slots, coarser wheels for far deadlines: O(1) insert and cancel for millions of timeouts.
›
Idempotency keys
finance · low: Client-chosen unique key per logical operation, stored with a request fingerprint and the final response, so retries replay the first result instead of acting twice.
›
Exponential backoff with jitter
systems · low: Retry after delays that grow geometrically and are randomized, so failed clients spread out instead of hammering a recovering service in synchronized waves.
›
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.
›
+ 8 more techniques
+ 42 more primitives
System
Techniques · 15
Primitives · 58
enterprise-asset-manage…
Durable workflow execution
distributed · medium: Ordinary code made crash-proof by logging every side-effect result and replaying the code from that log; activities run at least once, workflow logic must be deterministic.
›
Offline mutation queue
distributed · medium: Apply actions locally at once and queue them durably; on reconnect replay the queue idempotently, then re-apply unconfirmed ones on the server state.
›
Fault tree analysis
embedded · medium: Write the unwanted top event as AND/OR logic over component failures, reduce it to minimal cut sets, then compute its probability and each failure's share.
›
Inventory reservation
finance · medium: Reserving stock with TTL holds, release on timeout and no overselling under contention
Inventory policies safety stock
optimization · medium: (s,S), base-stock, EOQ and newsvendor policies with safety stock from demand uncertainty
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.
›
Remaining useful life estimation
statistics · medium: Degradation and survival models predicting time to failure from condition data
Weibull reliability analysis
statistics · medium: Fit Weibull shape and scale to failure and right-censored times (MLE or rank regression) to get hazard rate, MTBF and B10 life
Event condition action rules
systems · medium: Event-condition-action rule engines for automations, edit checks and alerts
Recurrence rule expansion
systems · medium: Expand an RFC 5545 RRULE lazily, in local wall-clock time, into concrete instants; store the rule, materialise only a bounded horizon.
›
Durable job queue
distributed · medium: Persisted tasks that workers lease for a visibility timeout, ack on success and retry with backoff; at-least-once execution that survives worker and queue crashes.
›
Sequential monte carlo
numerics · medium: Particle filters and SMC samplers with resampling for sequential Bayesian inference
Vibration spectral analysis
signal-processing · medium: FFT spectra, envelope demodulation and order tracking to find bearing and gear faults
Time-series forecasting (baselines,…
statistics · medium: The end-to-end recipe: fix horizon and uncertainty, beat naive baselines, choose a model family, and validate with rolling-origin backtests and scale-free metrics.
›
Arima
statistics · medium: ARIMA/SARIMA forecasting: differencing, AR and MA terms, order selection, maximum-likelihood fit
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.
›
Croston method
statistics · low: Forecasting intermittent demand by separately smoothing demand sizes and intervals (Croston, SBA, TSB)
Calendar date arithmetic
systems · low: Civil dates, time zones (tzdb), DST gaps, month-end anchoring and duration math
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
Linear referencing
geometry · low: Locate events and attributes along a route by measure (distance from start) and project points onto routes, with calibration points
Mqtt protocol
networking · low: MQTT pub/sub: topics, QoS 0/1/2, retained messages, sessions and keepalive
Closure table
storage · low: Storing trees and hierarchies in relational tables (closure table, materialized path) for fast subtree queries
Business day calendars
systems · low: Holiday calendars, business-day adjustment rules (following, modified following) and settlement cycles
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.
›
Record replay
distributed · low: Record every nondeterministic input (time, randomness, I/O, model and tool outputs, per-tick player input) and re-execute deterministically for debugging, replays and state rebuild
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.
›
Hierarchical timing wheel
systems · low: Timers bucketed by expiry into wheels of slots, coarser wheels for far deadlines: O(1) insert and cancel for millions of timeouts.
›
Idempotency keys
finance · low: Client-chosen unique key per logical operation, stored with a request fingerprint and the final response, so retries replay the first result instead of acting twice.
›
Exponential backoff with jitter
systems · low: Retry after delays that grow geometrically and are randomized, so failed clients spread out instead of hammering a recovering service in synchronized waves.
›
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.
›
Binary decision diagrams
optimization · low: A reduced ordered BDD stores a Boolean function as a shared DAG that is unique per variable order, so equivalence is one integer compare and counting is one pass.
›
Conditional writes
distributed · low: Put-if-absent / if-match compare-and-swap on objects or keys as a commit primitive
Monte Carlo integration
numerics · low: Estimate an expectation by averaging random samples; error falls as σ/√N in any dimension, and variance reduction (antithetic, control variates, importance sampling) shrinks σ.
›
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.
›
Digital signatures (Ed25519)
security · low: Small, fast, deterministic public-key signatures that prove who produced a message; the default for tokens, releases and protocols.
›
Trusted timestamping
security · low: RFC 3161 time-stamp tokens: a TSA signs a hash with time, proving data existed then
Recurrent networks
machine-learning · low: GRU and LSTM cells for streaming sequence models
Recursive-descent parsing
compilers · low: Hand-written top-down parser with one function per grammar rule; simple, fast, with full control over error messages and recovery.
›
Publish subscribe event bus
systems · low: In-process or on-box topic bus decoupling producers and consumers with bounded queues
Icalendar format
storage · low: ICalendar (RFC 5545) objects, VTIMEZONE and iTIP scheduling messages
Dead-letter queue
distributed · low: A side queue for messages that keep failing: after N delivery attempts or a permanent error, park them with the reason so the main queue keeps moving.
›
Leases
distributed · low: A lock that expires on its own: bounded-time ownership that survives crashes and partitions, given bounded clock drift and fencing tokens on writes.
›
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.
›
Alias method sampling
numerics · low: Vose alias tables: O(1) sampling from a discrete distribution after O(n) setup
Importance sampling
numerics · low: Sample from a proposal distribution and reweight to cut Monte Carlo variance
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
Fast Fourier transform
numerics · low: Computes the DFT in O(n log n) by recursively splitting into even and odd halves; the basis of fast convolution and spectral methods.
›
IIR and FIR filters
signal-processing · low: Two ways to shape a sampled signal's spectrum: FIR (finite taps, always stable, exact linear phase) or IIR (feedback, a few coefficients, cheap but phase-distorting).
›
Peak detection
signal-processing · low: Robust peak and event detection in noisy signals with adaptive thresholds and refractory periods
Short-time Fourier transform and sp…
signal-processing · low: Slide a window over a signal and FFT each frame to get a time-frequency picture; the front end of audio ML, vibration and radar analysis.
›
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.
›
STL decomposition (seasonal-trend w…
statistics · low: Split a series into trend, seasonal and remainder with iterated loess smoothing; the seasonal shape may drift and robust weights keep outliers out of it.
›
Time-series cross-validation (rolli…
statistics · low: Estimate forecast error by repeatedly training on the past and testing on the next h steps, moving the origin forward; never trains on the future.
›
Finite differences
numerics · low: Replace derivatives with weighted differences of grid values; simple stencils plus a stability condition (CFL) turn PDEs like heat, advection and waves into array loops.
›
L-BFGS
numerics · low: Quasi-Newton minimizer that approximates the inverse Hessian from the last m gradient differences via the two-loop recursion; O(m·n) memory and work per step.
›
Kalman filter
robotics · low: Optimal recursive estimator for a linear system with Gaussian noise: fuses a motion model with noisy measurements into a state estimate plus its covariance.
›
Fencing tokens
distributed · low: A number that grows with every lock grant and is checked by the protected resource, so a paused ex-holder's late write is rejected.
›
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.
›
Evaluation metrics
machine-learning · low: Precision, recall, ROC AUC, average precision, log loss, NDCG and pass@k computed correctly, plus paired confidence intervals for comparing models.
›
Loss functions
machine-learning · low: The scalar a model minimizes: cross-entropy for classes and tokens, MSE or Huber for values, each with a stable form and simple gradient.
›
Rejection sampling
ml-training · low: Best-of-n and filtered sampling: generate many candidates, keep those passing a verifier or reward threshold
Explicit Euler
numerics · low: Step an ODE forward by its current slope, y += h·f(t, y); first-order, one evaluation per step, the baseline every other integrator is measured against.
›
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.
›
Thomas tridiagonal solver
numerics · low: O(n) tridiagonal linear solve used in implicit finite-difference and spline schemes
Cryptographic hashes (SHA-2, BLAKE3)
security · low: Collision-resistant fingerprints of data; SHA-256 for interoperability, BLAKE3 for speed, HMAC/HKDF for keyed uses.
›
Biquad filters
signal-processing · low: Second-order IIR sections (RBJ cookbook): low/high pass, peaking EQ; stable cascades
Bootstrap confidence intervals
statistics · low: Resampling-based confidence intervals for arbitrary statistics
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.
›
Slab allocator
systems · low: Pre-carve pages into equal-size slots per size class with an in-place free list: O(1) alloc and free, no external fragmentation, cache-warm reuse.
›
Copy for AI
Similar systems
Share the most building blocks with this one.
aircraft-mro
41 %
ivd-analyzer
18 %
construction-project-management
17 %
mes
17 %
insurance-policy-admin
15 %