Faruk Alpay

This work examines exact-content binding, authorization freshness and checkpoint recovery in Lightcap's publication enforcement mechanism, and transfers retrieval models from ArguAna to SciFact and NFCorpus, and diagnostic decision rules from Thunderbird to BGL, distinguishing probability calibration from ranking changes.

Conductance-repair evidence graphs can boost security retrieval recall from 0.017 to 0.069, revealing the hidden potential of deterministic graph-flow methods in operational triage.

Resolver-induced selection can significantly skew the adoption of interface variants, but existing metrics often fail to capture this complexity.

Large GPU workloads can leave a lingering cache state that dramatically impacts CPU performance, but a simple recovery mechanism can alleviate this issue.

Visual naturalness predicts transfer accuracy in image encodings, but it doesn’t cause it—local structure is the real game changer.

L2 cache latency in NVIDIA L40 GPUs varies significantly across streaming multiprocessors, revealing a hidden layer of performance optimization potential.

A budgeted evidence selection approach reveals that naive evaluation methods can inflate vulnerability recall metrics by over 8 times, challenging traditional assessment practices.

Auditors can now verify dynamic ordered sets with constant memory while achieving perfect reliability in honest executions, even against untrusted maintainers.