Md. Amir Khusru Akhtar

Exact Certificate-Aware Nonpreemptive Scheduling with General Availability Calendars and Additive-Frequency Bounds

Nonpreemptive scheduling under fragmented availability is governed by contiguous feasible intervals rather than total available time. We study rational single-machine calendars with arbitrary downtime and the arithmetic subclass defined by the three coupled frequencies a, b, a +...

Sharp Safe-Time Measures for Additive Frequency Triples: Sixteen Certified Sharp Bounds and Rational Threshold Geometry

For positive integers a, b, we study the measure Fᵟ(a, b) of times t ∈ [0, 1] for which ‖at‖, ‖bt‖, and ‖(a + b)t‖ are at least δ. We certify sixteen sharp inequalities F₁⁄q(a, b) ≥ (q − 3)(q − 4)/[q(q − 1)] for integers 5 ≤ q ≤ 20, including F₁⁄₁₆(a, b) ≥ 13/20. The proof combin...

Evidence in Networked Metaverse Systems: Comparability, Reproducibility, and Deployment

Metaverse research now spans immersive networking, edge computing, digital twins, semantic communication, artificial intelligence, security, interoperability, sustainability, and deployment. The field is technically rich, yet apparently similar results are frequently produced und...

The Decision Architecture of Supply Chain Management: Separating Decisions, Solutions, Evidence, and Context

Supply-chain management (SCM) research is analytically rich but representationally fragmented: studies are often identified by technology, method, industry, objective, or risk domain even when these descriptors refer to different aspects of the underlying managerial decision. Thi...

The Decision Architecture of Supply Chain Management: Separating Decisions, Solutions, Evidence, and Context

Supply-chain management (SCM) research is analytically rich but representationally fragmented: studies are often identified by technology, method, industry, objective, or risk domain even when these descriptors refer to different aspects of the underlying managerial decision. Thi...

Repair Complexity in Fully Dynamic Maximal Matching: Discovery–Propagation Tradeoffs, Conditional Hardness, and Reproducible Real-Data Evidence

Fully dynamic maximal matching is conventionally analyzed through update time, yet the loss of a matched edge exposes a more fundamental question: what information must be preserved, propagated, or rediscovered before maximality can be restored? We develop a repair-centered frame...

When Aggregate Boolean Invariants Stop Determining Structure: A Minimal PN-Equivalence Failure and an Infinite Collision Family

A Boolean function can be described by several mathematically meaningful invariants, including Hamming weight, deterministic decision-tree depth, certificate complexity, sensitivity, influence, algebraic degree, and Fourier-level energy. We investigate whether a heterogeneous col...

Answer-Frontier Data Structures: Maintaining Nearest Alternative Answers Under Dynamic Updates

Most data structures are designed around one operational question: what is the answer now? In a dynamic system, however, an equally important question is how close that answer is to changing, which alternative would appear first, and what smallest admissible intervention would re...

Power-Sum Deformation and Information-Dissipation Complexity: Sharp Low-Level Transition Theory and Four-Level Bounds

A power-sum deformation of a finite probability vector traces a one-parameter path through Rényi entropy, escort distributions and the cumulants of information content. We use this path to ask a structural question that is not visible from entropy values alone: how many times can...

Generation Before Acquisition: Decision-Relative Capability Transitions in Costly Information Systems

A system can spend more on measurement without becoming able to answer a decision that its current observational repertoire cannot resolve. We develop a decision-relative framework that separates the cost of generating measurement capability from the cost of acquiring evidence wi...

Compressing Exponential Weights for Online Logistic Regression: Exact Identities, Update-Closed Surrogates, and a Geometric Bottleneck

Near-optimal regret for online logistic regression is known, yet the most direct exponential-weights (EW) predictors remain computationally expensive precisely in the regimes where their statistical guarantees are most attractive. We ask a narrower question than whether logarithm...

Safe Separability under Revocable Authority: Destructive Evidence Coupling, Branch-Conditioned Adaptivity, and a Fixed-Parameter Behavioral Kernel

Evidence gathering is usually treated as epistemically helpful: each observation reduces uncertainty, and planning decides which observation to obtain next. That intuition breaks when obtaining evidence can also destroy the authority needed to obtain later evidence. We study this...

High Confidence Is Not Decision Maturity: Detecting Premature Financial Decisions Before Evidence Reverses Them

Financial fraud systems are usually judged by how accurately they classify a transaction, yet operational decisions are often made before all relevant evidence is available. A model can therefore be highly confident and still be premature. We develop Financial Decision Maturity (...

Minimum Necessary Intervention: Constraint-Based Adaptive Assistance with Intervention Debt and Recovery-Aware Withdrawal

Artificial intelligence can improve task completion, yet stronger assistance can also reduce opportunities for independent recovery. We present Minimum Necessary Intervention (MNI), a control framework that treats assistance as a graded resource rather than a binary feature. MNI...

Minimum Necessary Intervention: Constraint-Based Adaptive Assistance with Intervention Debt and Recovery-Aware Withdrawal

Artificial intelligence can improve task completion, yet stronger assistance can also reduce opportunities for independent recovery. We present Minimum Necessary Intervention (MNI), a control framework that treats assistance as a graded resource rather than a binary feature. MNI...

PAVR: Personalized Adaptive Virtual Reality for Early Cybersickness Prevention with Minimal Experience Disruption

Cybersickness remains a practical barrier to sustained virtual-reality use because mitigation often begins only after discomfort is reported, while aggressive countermeasures can themselves degrade presence and task performance. This paper presents PAVR, a closed-loop adaptive vi...

PAVR: Personalized Adaptive Virtual Reality for Early Cybersickness Prevention with Minimal Experience Disruption

Cybersickness remains a practical barrier to sustained virtual-reality use because mitigation often begins only after discomfort is reported, while aggressive countermeasures can themselves degrade presence and task performance. This paper presents PAVR, a closed-loop adaptive vi...

Generative Calculus II: Capability Attribution Under Augmentation

Modern AI capability is increasingly a property of an augmented system rather than a frozen model: test-time computation, retrieved evidence, tools, memory, interfaces, and control rules can all change what is feasible. Generative Calculus II (GC-II) asks where such gains come fr...

Physical Distinction Theory: From Resource-Bounded Discrimination to Quantum Geometry, Open-System Dynamics, and Thermodynamic Monotones

Physics ordinarily begins by specifying states, observables, fields, Hilbert spaces, or spacetime and then asks what can be observed. Physical Distinction Theory (PDT) reverses that order and starts from a finite-resource operational question: which physical alternatives can actu...

Evidence-preserving temporal geography and a village-level Census backbone for Jharkhand, India

Village-level research in India is constrained by a subtle infrastructure problem: authoritative datasets often describe the same named places through different identifiers, administrative hierarchies, time points, and publication systems. We present the Jharkhand Life Atlas (JLA...