Searcharxiv⌕ Search

arXiv subjects

Kyandoghere Kyamakya

Publications and source records attributed to Kyandoghere Kyamakya.

13 recordsLinked to original sources

Polynomial Quantum Recurrent Channels for Matrix Inverse Actions: Deferred-Reset Dynamics and Chebyshev Filtering

We develop completely positive, trace-preserving polynomial recurrent channels for quantum solution-state preparation and derive fixed-point and time-varying tracking bounds. Across 2,880 synthetic configurations, resident Chebyshev recurrence improves accuracy-passing snapshot counts in 608 cases, ties in 2,271, and loses in one. A separate 360-scenario cost study shows that fresh recurrence is cheaper in all 184 jointly feasible scenarios (median resident-to-fresh cost ratio: 3.12), while resident recurrence uniquely satisfies accuracy requirements in 74 cases. At a logical noise rate of $10^-4$, neither recurrent method qualifies. Based on exact reduced-density simulations and assumed cost models, our results demonstrate conditional tracking advantages but no general end-to-end speedup or total-cost benefit.

quant-ph↗

FAROS: Forecast-Aware Risk-Informed Online Reinforcement Learning for Proactive O-RAN Slicing

Proactive Open Radio Access Network (O-RAN) slicing requires decisions before an approaching quality-of-service (QoS) loss becomes difficult to reverse. We present FAROS, a Forecast-Aware Risk-Informed O-RAN Slicing framework that combines an eight-step QoS forecast, training-only PCMCI+-supported temporal risk, Multi-Agent Proximal Policy Optimization (MAPPO) under centralized training and decentralized execution (CTDE), symbolic feasibility constraints, and reliability-aware Top-K arbitration. MAPPO supplies the actor proposal, while A5v2 checks admissibility and one-step utility before execution. Evaluation uses ten validation-selected frozen checkpoints, 500 matched start indices per seed under the risky-start protocol, and 150,000 agent-level decisions. FAROS obtains mean reward 0.2778 and ten-step recovery 90.56% across ten seeds. A fixed model-matched diagnostic rule reaches reward 0.3015 and recovery 97.57% under the same transition-reward contract, so we make no superiority claim over direct threshold logic. A same-actor M4 shield control also reaches zero risky-state prohibited actions. In the M5 trace, A5v2 changes 22.61% of actor proposals and reduces the predicate-defined prohibited-action rate from 16.79% at proposal time to zero at execution; this property is enforced by the arbiter rather than learned by MAPPO. Independent ns-3 experiments test the six-action interface at packet level and remain separate from end-to-end FAROS claims.

cs.NI↗

EARS-Info: Information-Aware Event-Driven Reallocation for Multi-Robot Exploration

We introduce EARS-Info, an information-aware extension of Event-Driven Ant Reallocation Search for multi-robot exploration on OpenStreetMap-derived grids. It combines marginal sensing gain, feasible relocation, return-aware routing, sensing reservations, and cached shortest paths. Across 168,000 episodes comparing 30 implementations on eight city maps, EARS-Info achieves the highest mean operational score in every evaluation panel. With eight robots and 3% communication dropout, it improves the score over EARS-Safe by 5.43%, increases weighted discovery from 88.88% to 98.46%, and reduces mean energy use by 2.62%. Score differences are positive in all eight cities ($p=0.0078125$; descriptive 95% city-bootstrap interval $[0.0159,0.0694]$), with no simulated incidents across 5,600 EARS-Info episodes. These results support the complete controller; individual component advantages remain uncertain. Generalization is limited by reused geography, one training replicate, coarse maps, and adapted comparison methods.

cs.RO↗

SwarmReconGuard: Black-Box Detection of Distributed Collective Reconnaissance by Individually Benign-Looking Agent Populations

Autonomous and agentic clients can distribute reconnaissance across many identities so that each request remains valid, low-rate, and benign-looking while the population collectively acquires broad system knowledge. We formalize this threat as Distributed Collective Reconnaissance (DCR) and present SwarmReconGuard, a reproducible black-box benchmark in which the defender observes only service-boundary telemetry. The Docker-isolated study evaluates 11 benign and attack behaviors across 10-10,000 virtual identities, comprising 440 test runs and 3,666,300 requests, with complete telemetry integrity. We compare semantic, Gaussian, conditional, graph, kernel, hybrid, and CUSUM-based detectors. Gaussian likelihood-ratio detection achieves 100$\%$ detection with 0$\%$ observed false positives on known attacks but only 3$\%$ on unseen policies. CUSUM yields 36.1$\%$ overall detection at 1.25$\%$ false positives, while hybrid CUSUM reaches 85.7$\%$ detection with 0$\%$ observed false positives at 10,000 identities. Results expose a major policy-generalization gap and motivate exposure-aware, scale-aware defenses.

cs.CR↗

VeriWeave Govern: Evidence-Gated Deterministic Runtime Governance for Enterprise AI Agents

Enterprise artificial-intelligence agents increasingly call tools, modify infrastructure, and process protected data, creating a need to separate action generation from action authorization. This article presents VeriWeave Govern, a deterministic runtime governance layer that evaluates structured agent actions against versioned policies, validates typed evidence, applies fixed deny > review > allow precedence, routes consequential actions to accountable human review, and records replayable tamper-evident audit state. GovernBench evaluates the design over 30 independent seeds and 60,000 oracle-labelled cases spanning five enterprise domains, adversarial evidence, out-of-distribution actions, and temporal policy evolution. VeriWeave achieves 0.9888 mean accuracy, 0.9836 macro-F1, zero observed aggregate false allows, and zero observed Governance Attack Success Rate on the evaluated cases. Six ablations show that evidence gating, deny precedence, out-of-distribution fail-safe behavior, human review, contradiction handling, and temporal replay contribute complementary safety. The deployed API additionally passes 12/12 end-to-end scenarios and a 40,040-request concurrency matrix with zero failures. A separate 150-case EU/Austria regulation-grounded evaluation uses frozen predictions and two independent blinded human annotators, who agree on all decisions. On this set, deterministic engines remain conservative, while a Gemma 4 31B comparator aligns more closely with the human consensus. The results expose a measurable safety--utility trade-off and motivate evidence-aware, replayable governance as an independent control plane for enterprise agent execution.

cs.AI↗

CRASM-Gate: Deterministic-First Constraint- and Role-Aware Semantic Mapping with Selective Model Assistance Across Heterogeneous Industrial Standards

Industrial standards often encode the same engineering concept through incompatible hierarchies, identifiers, roles, and structural constraints, so the nearest lexical or embedding match can still be technically inadmissible. This article presents CRASM, a deterministic constraint- and role-aware semantic mapping method, and CRASM-Gate, its selectively model-assisted extension. The framework separates standard-specific canonicalization, bounded retrieval, deterministic rules, destination-versus-origin role interpretation, semantic and structural ranking, ambiguity refusal, and target validation. CRASM-Gate adds a confidence/disagreement gate that may invoke a candidate-constrained large language model, while final authority remains with deterministic validation. A controlled artifact covers six directed industrial-standard pairs, three difficulty levels, and ten configurations, yielding 14,400 sample-level decisions. With a fixed local model endpoint, CRASM-Gate reaches mean F1 0.9938 and an implemented structural-validity rate of 1.0000; deterministic CRASM reaches 0.9931 without generative-model calls; and the model-only baseline reaches 0.5347. Relative to the model-only baseline, CRASM reduces top-1 errors from 670 to 10 while exhibiting 0.0688 s/sample rather than 24.5263 s/sample observed latency. CRASM-Gate improves CRASM by one additional correct decision out of 1,440, with observed latency increasing to 15.7666 s/sample. The results support a deterministic-first interoperability architecture in which model assistance is optional, measurable, candidate-bounded, and unable to bypass structural validation.

cs.AI↗

EA-Ops: Git-Native Architecture as Code for Continuous Enterprise Architecture Governance

Enterprise architecture (EA) repositories frequently separate architecture models from the engineering workflow used to change software and infrastructure. This article presents EA-Ops, an open-source Git-native Enterprise Architecture-as-Code framework that represents architecture facts as YAML, validates typed relationships against an ArchiMate 3.2 profile, enforces organization-specific governance rules, performs graph-based change-impact analysis, and publishes human-facing reports and a static interactive portal from the same reviewed source. We evaluate EA-Ops with a reproducible GitHub Actions harness. Eight independently injected structural, semantic, and governance fault classes were executed across 30 trials each; all 240 trials matched ground truth exactly, with precision, recall, and $F_1$ of 1.000. Scalability experiments with 30 measured repetitions reached 50,000 objects and 100,000 relationships: median validation time was 52.582~s, median impact traversal was 627.000~ms, and peak resident-set size was 919.2~MB. A ten-scenario Metroville digital-permit reference architecture produced exact validation outcomes and exact impact-set agreement with an independent breadth-first-search oracle in every scenario. The configured 100,000-object end-to-end benchmark generated its model successfully but exceeded the 180-minute CI budget during the performance stage; no timing result is extrapolated. At 50,000 objects, Markdown report generation rather than semantic validation is the dominant scaling bottleneck. The results support Git-native continuous governance as a practical EA operating model at tens-of-thousands-of-object scale while defining clear limits and optimization targets for larger repositories.

cs.SE↗

Policy-as-Skill: Governed LLM Decision Support with Evidence, Deterministic Control, and Audit

Organizations increasingly use LLMs for policy, compliance, risk, and operational decision support, requiring evidence validation, review routing, version control, and auditability. We introduce Policy-as-Skill (PaS), a modular runtime that packages these functions as executable, versioned policy capabilities. Thirteen methods are evaluated with a fixed Gemma4 backend on 600 development tasks. PaS+Audit achieves 53.8% exact accuracy, macro-F1 0.346, review F1 0.854, citation precision 1.000, policy-reference recall 0.984, and audit completeness 1.000, outperforming LLM+RAG on most governance and review metrics. Deterministic control raises aggregate accuracy to 61.2% but is strongly task dependent, supporting selective rather than universal rule-based intervention.

cs.AI↗

TinyCeNN-LM: Quality-Gated Conversion of Pretrained Attention with CeNN-Inspired Cellular-Recurrent Layers

Replacing attention in a pretrained language model is a compatibility problem: a plausible substitute may alter representations expected by later layers. TinyCeNN-LM introduces a \emph{quality-gated post-training conversion} framework using CeNN-inspired cellular-recurrent layers with bounded local processing, compact recurrent memory, routing, fusion, and accept-or-rollback validation. Three implementations are studied: Integrated Memory, MemoryFusion, and PDelta3-GDN2-CLVR+Local32. Strict PDelta3 conversion accepts a layer only when representation and NLL criteria pass fixed thresholds. On SmolLM2-135M, layers 0-2 are accepted with cumulative $Δ\mathrm{NLL}=+0.01209$, while layer 3 is rejected despite acceptable NLL because representation fidelity fails. On Qwen3.5-0.8B, full-attention layers 3, 7, and 11 are accepted with final $Δ\mathrm{NLL}=+0.02073$. Integrated Memory keeps perplexity within $-0.07\%$ to $+0.93\%$ while reducing total cache by up to $6.01\%$. A sampled 200-item downstream sanity check gives $28.5\%$--$32.0\%$ overall accuracy for converted Qwen releases. The results support conservative, quality-gated structural conversion rather than universal attention replacement or speedup.

cs.AI↗

$PG-NODE^{TB}$: Physics-Guided Neural Ordinary Differential Equations for Tuberculosis Transmission Dynamics

Tuberculosis (TB) remains a leading global infectious disease, causing approximately 1.3 million deaths and 10.6 million new infections annually. Classical compartmental ODE models are the standard epidemiological tool for TB, yet their fixed-parameter structure cannot adapt to time-varying dynamics, unmodeled effects, or heterogeneous real-world data. This paper presents a methodological framework and proof-of-concept for applying Physics-Guided Neural Ordinary Differential Equations (PG-NODE) to TB transmission modeling within a SLIR (Susceptible, Latent, Infectious, Recovered) compartmental framework. We perform a rigorous mathematical analysis of the SLIR model, including derivation of the basic reproduction number $\mathcal{R}_0$, equilibrium analysis, and normalized sensitivity indices. We then reformulate the SLIR system as a PG-NODE, preserving compartmental conservation laws and biological constraints while enabling neural network components to learn unknown or time-varying rate functions from data. Three simulation scenarios illustrate the framework's intended capabilities: (i) adaptive tracking of time-varying transmission rates, (ii) correcting for unmodeled treatment and relapse dynamics with 27\% lower RMSE than the classical SLIR, and (iii) comparative forecasting of competing intervention policies over a 20-year horizon. Simulation results indicate that PG-NODE has strong potential for improving predictive accuracy while maintaining epidemiological interpretability; full adjoint-based training on real WHO surveillance data is identified as the key next step for empirical validation.

math.DS↗

Amplitude of Random Telegraph Noise in Junctionless FinFET with Different Channel Shape

The influence of the channel shape in a junctionless silicon-on-insulator finned field-effect transistor (JL SOI FinFET) on the amplitude of random telegraph noise (RTN) induced by single interface trapped charge has been simulated for the transistors with rectangular, trapezoidal, and triangular fin cross sections. The simulation of the RTN amplitude distribution along the channel induced by a single charge trapped at interface defect located at the fin top and at sidewall of JL SOI FinFETs with channels of different shapes is considered. It is established that at trapping the single charge at sidewall surface of the channel, the lowest RTN amplitude is seen for the triangular cross-section and the highest for the rectangular and trapezoidal cross-sections. At the single charge trapping at the top surface of the channel, the RTN amplitude is higher for the rectangle than for the trapezoidal cross-section.

cond-mat.mes-hall↗

Modelling DDoS Attacks in IoT Networks using Machine Learning

In current Internet-of-Things (IoT) deployments, a mix of traditional IP networking and IoT specific protocols, both relying on the TCP protocol, can be used to transport data from a source to a destination. Therefore, TCP-specific attacks, such as the Distributed Denial of Service (DDoS) using the TCP SYN attack, are one of the most plausible tools that attackers can use on Cyber-Physical Systems (CPS). This may be done by launching an attack from its IoT subsystem, here referred to as the "CPS-IoT", with potential propagation to the different servers located in both fog and the cloud infrastructures of the CPS. This study compares the effectiveness of supervised, unsupervised, and semi-supervised machine learning algorithms for detecting DDoS attacks in CPS-IoT, particularly during data transmission to and from the physical space to the cyber space via the Internet. The algorithms considered are broadly grouped into two: i) Detection algorithms, which include Logistic Regression (LGR), K-Means, and Artificial Neural Networks (ANN). We also looked into the effectiveness of semi-supervised hybrid learning models, which use unsupervised K-Means to label data, then feed the output to a supervised learning model for attack detection. ii.) Prediction algorithms - LGR, Kernel Ridge Regression (KRR) and Support Vector Regression (SVR), which were used to predict imminent attacks. Experimental tests were carried out and obtained results showed that the hybrid model was able to achieve 100% accuracy with zero false positives; while all the prediction models were able to achieve over 94% attack prediction accuracy.

cs.DC↗

A Differential Cryptanalysis of Yen-Chen-Wu Multimedia Cryptography System (MCS)

At ISCAS'2005, Yen et al. presented a new chaos-based cryptosystem for multimedia transmission named "Multimedia Cryptography System" (MCS). No cryptanalytic results have been reported so far. This paper presents a differential attack to break MCS, which requires only seven chosen plaintexts. The complexity of the attack is O(N), where $N$ is the size of plaintext. Experimental results are also given to show the real performance of the proposed attack.

cs.CR↗