mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Transport, logistics and mobility
container-terminal
container terminal operating system
Navis
System
Techniques · 16
Primitives · 31
container-terminal
Assignment problem (Hungarian / Jon…
graphs · medium: Optimal one-to-one matching of rows to columns in O(n³) by growing a matching along shortest augmenting paths over dual potentials.
›
Optical character recognition (text…
machine-learning · medium: Find text lines in an image, read each crop with a CTC or attention model, then correct with a lexicon and score confidence for review routing.
›
Discrete event simulation
numerics · medium: Simulation driven by a time-ordered event queue with deterministic, reproducible replay
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.
›
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.
›
Mixed-integer programming (branch a…
optimization · medium: Solves LPs with integer variables by solving the LP relaxation, branching on a fractional variable, and pruning subtrees whose LP bound cannot beat the incumbent.
›
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.
›
Bin packing
optimization · low: Pack items of given sizes into the fewest fixed-capacity bins; sort descending, then first-fit, gives at most 11/9 of optimal and runs in O(n log n).
›
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.
›
Deadlock detection
storage · low: Find transactions waiting on each other in a cycle (wait-for graph), abort one, or order lock requests so no cycle can form.
›
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.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
Dijkstra's algorithm
graphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.
›
Connectionist temporal classificati…
machine-learning · low: Alignment-free sequence loss that sums the probability of every frame-to-label alignment with a blank symbol, using a dynamic program.
›
Document image preprocessing
machine-learning · low: Turn a scan or phone photo into an upright, evenly lit, binarised or normalised grey page so layout analysis and OCR read it reliably.
›
Convolutional networks
ml-training · low: Layers that slide a small shared kernel over a grid, giving translation equivariance and few parameters; still the most compute-efficient choice for many vision tasks.
›
Transformer block
ml-training · low: The decoder-only pre-norm block (attention plus MLP on a residual stream) behind every modern LLM, with exact shapes, parameter, FLOP and KV-cache counts.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
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.
›
+ 9 more techniques
+ 15 more primitives
System
Techniques · 16
Primitives · 31
container-terminal
Assignment problem (Hungarian / Jon…
graphs · medium: Optimal one-to-one matching of rows to columns in O(n³) by growing a matching along shortest augmenting paths over dual potentials.
›
Optical character recognition (text…
machine-learning · medium: Find text lines in an image, read each crop with a CTC or attention model, then correct with a lexicon and score confidence for review routing.
›
Discrete event simulation
numerics · medium: Simulation driven by a time-ordered event queue with deterministic, reproducible replay
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.
›
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.
›
Mixed-integer programming (branch a…
optimization · medium: Solves LPs with integer variables by solving the LP relaxation, branching on a fractional variable, and pruning subtrees whose LP bound cannot beat the incumbent.
›
Simulated annealing
optimization · medium: Stochastic local search with a cooling schedule for combinatorial optimization
Multi agent path finding
robotics · medium: Conflict-based search for collision-free paths of many robots on a grid
Multilateration tdoa
signal-processing · medium: Locate a transmitter from time differences of arrival at synchronized receivers
Critical path analysis
graphs · medium: Longest dependency chain in a DAG of timed spans or build actions
Levenberg marquardt
numerics · medium: Damped Gauss-Newton nonlinear least squares for model calibration
Cutting planes
optimization · medium: Valid inequalities added to an LP relaxation to cut off its fractional optimum without removing any integer point; the engine of branch-and-cut MIP solvers.
›
Local search 2opt or opt
optimization · medium: 2-opt, Or-opt, relocate and swap neighborhoods with fast delta evaluation for routes
Presolve reductions
optimization · medium: Cheap, provably safe reductions run before the solver (fix variables, drop rows, tighten bounds and coefficients) so LP and MIP solves start from a smaller, tighter model.
›
Fft convolution
signal-processing · medium: Overlap-add and uniformly partitioned convolution for long FIR filters and reverb
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.
›
Bin packing
optimization · low: Pack items of given sizes into the fewest fixed-capacity bins; sort descending, then first-fit, gives at most 11/9 of optimal and runs in O(n log n).
›
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.
›
Deadlock detection
storage · low: Find transactions waiting on each other in a cycle (wait-for graph), abort one, or order lock requests so no cycle can form.
›
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.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
Dijkstra's algorithm
graphs · low: Single-source shortest paths with non-negative edge weights by settling vertices in order of distance with a priority queue.
›
Connectionist temporal classificati…
machine-learning · low: Alignment-free sequence loss that sums the probability of every frame-to-label alignment with a blank symbol, using a dynamic program.
›
Document image preprocessing
machine-learning · low: Turn a scan or phone photo into an upright, evenly lit, binarised or normalised grey page so layout analysis and OCR read it reliably.
›
Convolutional networks
ml-training · low: Layers that slide a small shared kernel over a grid, giving translation equivariance and few parameters; still the most compute-efficient choice for many vision tasks.
›
Transformer block
ml-training · low: The decoder-only pre-norm block (attention plus MLP on a residual stream) behind every modern LLM, with exact shapes, parameter, FLOP and KV-cache counts.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
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.
›
Simplex method
optimization · low: Solves linear programs by walking along the edges of the feasible polytope from vertex to vertex, one basis swap (pivot) at a time; the workhorse behind MIP solvers.
›
A* search
graphs · low: Dijkstra ordered by cost-so-far plus an admissible estimate of the remaining cost; optimal paths while exploring far fewer nodes toward the goal.
›
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.
›
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.
›
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.
›
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.
›
LU and Cholesky factorization
numerics · low: Factor A = PLU (any square matrix, partial pivoting) or A = LLᵀ (SPD) once in O(n³), then solve each right-hand side in O(n²).
›
Floating-point error
numerics · low: How IEEE 754 rounding error accumulates and how to contain it: compensated (Kahan/Neumaier) and pairwise summation, error-free transformations with FMA, ULP comparisons.
›
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.
›
Fast hash functions
data-structures · low: Non-cryptographic hashes built from 64×64→128-bit multiplies and xor-shifts; pick by key size, trust level and whether the hash is persisted.
›
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.
›
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.
›
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.
›
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.
›
Thomas tridiagonal solver
numerics · low: O(n) tridiagonal linear solve used in implicit finite-difference and spline schemes
Copy for AI
Similar systems
Share the most building blocks with this one.
hospital-scheduling
26 %
warehouse-management
19 %
fab-mes
19 %
vehicle-routing
16 %
asrs
16 %