SearcharxivSearch

arXiv subjects

Deepak Singh

Publications and source records attributed to Deepak Singh.

At least 19 recordsLinked to original sources

Beyond the QBER Threshold: A Temporal QBER Based Machine Learning Framework for Multi Attack Detection in BB84 QKD

Conventional BB84 Quantum Key Distribution (QKD) systems rely on a fixed 11% Quantum Bit Error Rate (QBER) threshold to detect eavesdropping. However, stealthy attacks can remain below this threshold while still compromising channel security. This paper proposes a temporal QBER based machine learning framework for detecting and classifying eavesdropping attacks in BB84 QKD systems. Rather than relying on average session level QBER, the framework extracts 63 physics-informed temporal features capturing burst behavior, temporal instability, basis dependent asymmetry, and QBER loss interactions. Random Forest, XGBoost, and Support Vector Machine with a Radial Basis Function kernel (SVM-RBF) classifiers are evaluated on seven eavesdropping attacks and a normal channel scenario under noisy and lossy conditions. Averaged over ten independent runs, XGBoost achieves the best performance with 88.01% (0.47%) accuracy and a macro F1 score of 0.8803, while SVM-RBF performs comparably, confirming the robustness of the proposed features. Evaluated as a binary attack-versus-normal detector for comparison with conventional monitoring, a fixed 11% QBER threshold achieves only 25.82% accuracy with a False Negative Rate (FNR) of 0.8477, whereas the proposed framework reduces the FNR to 0.0198, substantially improving detection of stealthy attacks that evade threshold-based monitoring. SHapley Additive exPlanations based (SHAP) explainability shows that physics-informed temporal and channel derived features are highly discriminative for identifying eavesdropping strategies. These results demonstrate that temporal QBER driven machine learning provides an accurate, explainable, and practical framework for multi attack security monitoring in BB84 QKD systems.

cs.CR

Predicting Acceptance and Review Effort in Human and Agent Pull Requests

Pull requests (PRs) are a central mechanism for reviewing and integrating code changes in modern software repositories. As AI coding agents begin to submit more code changes alongside human developers, maintainers face a new challenge: deciding which PRs are likely to be accepted and which ones may require substantial review effort. This paper studies whether such outcomes can be estimated at the time a PR is opened, before reviewer discussion, CI feedback, or merge decisions are available. Using the AIDev dataset, we construct a leakage-aware prediction pipeline for human- and agent-authored PRs. The feature set is limited to submission-time information, including PR text characteristics, metadata, repository context, temporal signals, and lightweight diff statistics. We evaluate classical machine-learning models, including Logistic Regression, Random Forests, Gradient Boosting, Extra Trees, and MLPs, across pooled, human-only, agent-only, and balanced contributor views. Our results show that acceptance prediction is feasible from early signals: tree-based models achieve F1 scores above 0.95, with textual clarity and metadata among the most influential predictors. Review-effort prediction is more difficult. Comment counts and time-to-merge are only modestly explained by submission-time features, suggesting that reviewer availability, project workflow, and team-specific review practices play a major role. These findings indicate that early PR models can support triage and reviewer prioritization, but should be used as advisory tools rather than automated decision-makers.

cs.SE

Multi-Granular Attention-Driven Reinforcement Learning Framework for Web Intelligent Enhancement Systems

From the past few years, web intelligent enhancement systems increasingly rely on heterogeneous and dynamic web data to deliver personalized, context-aware services. However, traditional machine learning, deep learning, and reinforcement learning models often struggle with semantic understanding, adaptability, and scalability in continuously evolving web environments. In this research, a Multi-Granular Attention-based Reinforcement Web Intelligent Enhancement System (MGAR-WIES) is proposed to address the challenges by integrating semantic graph modeling, attention mechanisms, and adaptive reinforcement learning. Initially, heterogeneous web data comprising structured, semi-structured and unstructured sources are collected and preprocessed for generating unified feature representations. These representations are transformed into a dynamic semantic graph, where entities and their relationships are modeled by using graph embeddings enhanced by attention mechanisms for capturing both local relevance and global contextual dependencies. Subsequently, an adaptive multi-agent reinforcement learning strategy leverages the attention-aware semantic states to optimize personalized web actions like content recommendation, navigation optimization, and service adaptation. Finally, the continuous online feedback is further integrated to update graph representations and learning policies in real time by ensuring sustained adaptability and performance. The proposed MGAR-WIES acheived better results in terms of accuracy (80%) when compared with existing approaches.

cs.LG

NightSight: Passive Computation for Navigation in Dark Using Events

Small aerial robots are particularly well-suited for search and rescue in confined and hazardous environments due to their agility, low cost, and ability to traverse through cluttered spaces that are inaccessible to larger platforms. However, enabling autonomous navigation in complete darkness remains a significant challenge, because small aerial robots cannot easily accommodate perception systems that demand substantial payload, power, or computation. In this work, we present a lightweight perception approach that combines a monocular event camera, a coded aperture lens, and an infrared dot projector to enable navigation in such conditions. The projected pattern, when imaged through the coded aperture, produces depth dependent blur signatures that implicitly encode scene geometry. We train a convolutional neural network to decode these signatures into dense depth maps using only synthetic data generated from a simple planar wall setup. Despite this minimal training regime, the model generalizes zero-shot to complex real-world scenes. Our system operates in real time at 20 Hz on a NVIDIA Jetson Orin Nano, demonstrating suitability for resource-constrained platforms. We further analyze the impact of different coded aperture designs on depth estimation performance. Our approach gives high accuracy (l1 error 7.0cm) upto 2.5m range (2.80% error). These results highlight the potential of combining structured illumination, coded optics, and event-based sensing for enabling robust perception and navigation in complete darkness.

cs.RO

AsterNav: Autonomous Aerial Robot Navigation In Darkness Using Passive Computation

Autonomous aerial navigation in absolute darkness is crucial for post-disaster search and rescue operations, which often occur from disaster-zone power outages. Yet, due to resource constraints, tiny aerial robots, perfectly suited for these operations, are unable to navigate in the darkness to find survivors safely. In this paper, we present an autonomous aerial robot for navigation in the dark by combining an Infra-Red (IR) monocular camera with a large-aperture coded lens and structured light without external infrastructure like GPS or motion-capture. Our approach obtains depth-dependent defocus cues (each structured light point appears as a pattern that is depth dependent), which acts as a strong prior for our AsterNet deep depth estimation model. The model is trained in simulation by generating data using a simple optical model and transfers directly to the real world without any fine-tuning or retraining. AsterNet runs onboard the robot at 20 Hz on an NVIDIA Jetson Orin$^\text{TM}$ Nano. Furthermore, our network is robust to changes in the structured light pattern and relative placement of the pattern emitter and IR camera, leading to simplified and cost-effective construction. We successfully evaluate and demonstrate our proposed depth navigation approach AsterNav using depth from AsterNet in many real-world experiments using only onboard sensing and computation, including dark matte obstacles and thin ropes (diameter 6.25mm), achieving an overall success rate of 95.5% with unknown object shapes, locations and materials. To the best of our knowledge, this is the first work on monocular, structured-light-based quadrotor navigation in absolute darkness.

cs.RO

Probing the intermediate state of type-I superconductor SnAs using Muon Spin Spectroscopy

Superconductivity with non-trivial band topology provides a novel platform for exploring topological superconductivity and its quantum applications. A detailed microscopic understanding of the superconducting ground state in such materials is crucial. Here, we report the results of a muon spin rotation/relaxation study ($\mu$SR) of the topologically non-trivial superconductor SnAs, which exhibits superconductivity below 3.74(1) \si{K}. Zero-field (ZF) $\mu$SR data reveal that this system is a time-reversal invariant superconductor, and systematic transverse-field (TF) $\mu$SR measurements unveil the type-I nature of the SnAs superconductor. We have established the superconducting phase diagram to understand the intermediate state of type-I superconductors. Moreover, ab \textit{initio} band structure and phonon calculations are performed, which correlate with the experimental characterization.

cond-mat.supr-con

The Marine Debris Forward-Looking Sonar Datasets

Sonar sensing is fundamental for underwater robotics, but limited by capabilities of AI systems, which need large training datasets. Public data in sonar modalities is lacking. This paper presents the Marine Debris Forward-Looking Sonar datasets, with three different settings (watertank, turntable, flooded quarry) increasing dataset diversity and multiple computer vision tasks: object classification, object detection, semantic segmentation, patch matching, and unsupervised learning. We provide full dataset description, basic analysis and initial results for some tasks. We expect the research community will benefit from this dataset, which is publicly available at https://doi.org/10.5281/zenodo.15101686

cs.CV

Sparse Distributed Memory is a Continual Learner

Continual learning is a problem for artificial neural networks that their biological counterparts are adept at solving. Building on work using Sparse Distributed Memory (SDM) to connect a core neural circuit with the powerful Transformer model, we create a modified Multi-Layered Perceptron (MLP) that is a strong continual learner. We find that every component of our MLP variant translated from biology is necessary for continual learning. Our solution is also free from any memory replay or task information, and introduces novel methods to train sparse networks that may be broadly applicable.

cs.NE

Doping control of magnetism and emergent electromagnetic induction in high-temperature helimagnets

Ac current-driven motions of spiral spin textures can give rise to emergent electric fields acting on conduction electrons. This in turn leads to the emergent electromagnetic induction effect which may realize quantum inductor elements of micrometer size. ${\rm YMn}_{6}{\rm Sn}_{6}$ is a helimagnet with a short helical period (2-3 nm) that shows this type of emergent inductance beyond room temperature. To identify the optimized materials conditions for ${\rm YMn}_{6}{\rm Sn}_{6}$-type room-temperature emergent inductors, we have investigated emergent electromagnetic inductance (EEMI) as the magnetism is modified through systematic partial substitution of Y by Tb. By small angle neutron scattering and inductance measurements, we have revealed that the pinning effect on the spin-helix translational mode by Tb doping selectively and largely suppresses the negative component of EEMI, while sustaining the positive inductance arising from the spin tilting mode. We also find that in addition to the spin helix, even the spin-collinear antiferromagnetic structure can host the positive EEMI due to thermally enhanced spin fluctuations. The present study highlights the facile control of both the magnitude and sign of EEMI beyond room temperature, and thus suggests a route to expand the range of emergent inductor candidate materials.

cond-mat.str-el

A secure deterministic remote state preparation via a seven-qubit entangled channel of an arbitrary two-qubit state under the impact of quantum noise

As one of the most prominent subfields of quantum communication research, remote state preparation (RSP) plays a crucial role in quantum networks. Here we present a deterministic remote state preparation scheme to prepare an arbitrary two-qubit state via a seven-qubit entangled channel created from Borras \emph{et al.} state. Quantum noises are inherent to each and every protocol for quantum communication that is currently in use, putting the integrity of quantum communication systems and their dependability at risk. The initial state of the system was a pure quantum state, but as soon as there was any noise injected into the system, it transitioned into a mixed state. In this article, we discuss the six different types of noise models namely bit-flip noise, phase-flip noise, bit-phase-flip noise, amplitude damping, phase damping and depolarizing noise. The impact these noises had on the entangled channel may be seen by analysing the density matrices that have been altered as a result of the noise. For the purpose of analysing the impact of noise on the scheme, the fidelity between the original quantum state and the remotely prepared state has been assessed and graphically represented. In addition, a comprehensive security analysis is performed, demonstrating that the suggested protocol is safe against internal and external attacks.

quant-ph

Role of Dy on the magnetic properties of orthorhombic DyFeO3

Orthoferrites are a class of magnetic materials with a magnetic ordering temperature above 600 K, predominant G-type antiferromagnetic ordering of the Fe-spin system and, depending on the rare-earth ion, a spin reorientation of the Fe spin taking place at lower temperatures. DyFeO3 is of particular interest since the spin reorientation is classified as a Morin transition with the transition temperature depending strongly on the Dy-Fe interaction. Here, we report a detailed study of the magnetic and structural properties of microcrystalline DyFeO3 powder and bulk single crystal using neutron diffraction and magnetometry between 1.5 and 450 K. We find that, while the magnetic properties of the single crystal are largely as expected, the powder shows strongly modified magnetic properties, including a modified spin reorientation and a smaller Dy-Fe interaction energy of the order of 10 {\mu}eV. Subtle structural differences between powder and single crystal show that they belong to distinct magnetic space groups. In addition, the Dy ordering at 2 K in the powder is incommensurate, with a modulation vector of 0.0173(5) c*, corresponding to a periodicity of ~58 unit cells.

cond-mat.str-el

CCO-VOXEL: Chance Constrained Optimization over Uncertain Voxel-Grid Representation for Safe Trajectory Planning

We present CCO-VOXEL: the very first chance-constrained optimization (CCO) algorithm that can compute trajectory plans with probabilistic safety guarantees in real-time directly on the voxel-grid representation of the world. CCO-VOXEL maps the distribution over the distance to the closest obstacle to a distribution over collision-constraint violation and computes an optimal trajectory that minimizes the violation probability. Importantly, unlike existing works, we never assume the nature of the sensor uncertainty or the probability distribution of the resulting collision-constraint violations. We leverage the notion of Hilbert Space embedding of distributions and Maximum Mean Discrepancy (MMD) to compute a tractable surrogate for the original chance-constrained optimization problem and employ a combination of A* based graph-search and Cross-Entropy Method for obtaining its minimum. We show tangible performance gain in terms of collision avoidance and trajectory smoothness as a consequence of our probabilistic formulation vis a vis state-of-the-art planning methods that do not account for such nonparametric noise. Finally, we also show how a combination of low-dimensional feature embedding and pre-caching of Kernel Matrices of MMD allows us to achieve real-time performance in simulations as well as in implementations on on-board commodity hardware that controls the quadrotor flight

cs.RO

The Marine Debris Dataset for Forward-Looking Sonar Semantic Segmentation

Accurate detection and segmentation of marine debris is important for keeping the water bodies clean. This paper presents a novel dataset for marine debris segmentation collected using a Forward Looking Sonar (FLS). The dataset consists of 1868 FLS images captured using ARIS Explorer 3000 sensor. The objects used to produce this dataset contain typical house-hold marine debris and distractor marine objects (tires, hooks, valves,etc), divided in 11 classes plus a background class. Performance of state of the art semantic segmentation architectures with a variety of encoders have been analyzed on this dataset and presented as baseline results. Since the images are grayscale, no pretrained weights have been used. Comparisons are made using Intersection over Union (IoU). The best performing model is Unet with ResNet34 backbone at 0.7481 mIoU. The dataset is available at https://github.com/mvaldenegro/marine-debris-fls-datasets/

cs.CV

Complexity analysis of quantum teleportation via different entangled channels in the presence of noise

Quantum communication is one of the hot topics in quantum computing, where teleportation of a quantum state has a slight edge and gained significant attention from researchers. A large number of teleportation schemes have already been introduced so far. Here, we compare the teleportation of a single qubit message among different entangled channels such as the two-qubit Bell channel, three-qubit GHZ channel, two- and three-qubit cluster states, the highly entangled five-qubit Brown \emph{et al.} state and the six-qubit Borras \emph{et al.} state. We calculate and compare the quantum costs in each of the cases. Furthermore, we study the effects of six noise models, namely bit-flip noise, phase-flip noise, bit-phase flip noise, amplitude damping, phase damping and the depolarizing error that may affect the communication channel used for the teleportation. An investigation on the variation of the initial state's fidelity with respect to the teleported state in the presence of the noise model is performed. A visual representation of the variation of fidelity for various values of the noise parameter $\eta$ is done through a graph plot. It is observed that as the value of noise parameter in the range $\eta \in [0,0.5]$, the fidelity decreases in all the entangled channels under all the noise models. After that, in the Bell channel, GHZ channel and three-qubit cluster state channel, the fidelity shows an upward trend under all the noise models. However, in the other three channels, the fidelity substantially decreases in the case of amplitude damping, phase damping and depolarizing noise, and even it reaches zero for $\eta = 1$ in Brown \emph{et al.} and Borras \emph{et al.} channels.

quant-ph

Q-matrix Unaware Double JPEG Detection using DCT-Domain Deep BiLSTM Network

The double JPEG compression detection has received much attention in recent years due to its applicability as a forensic tool for the most widely used JPEG file format. Existing state-of-the-art CNN-based methods either use histograms of all the frequencies or rely on heuristics to select histograms of specific low frequencies to classify single and double compressed images. However, even amidst lower frequencies of double compressed images/patches, histograms of all the frequencies do not have distinguishable features to separate them from single compressed images. This paper directly extracts the quantized DCT coefficients from the JPEG images without decompressing them in the pixel domain, obtains all AC frequencies' histograms, uses a module based on $1\times 1$ depth-wise convolutions to learn the inherent relation between each histogram and corresponding q-factor, and utilizes a tailor-made BiLSTM network for selectively encoding these feature vector sequences. The proposed system outperforms several baseline methods on a relatively large and diverse publicly available dataset of single and double compressed patches. Another essential aspect of any single vs. double JPEG compression detection system is handling the scenario where test patches are compressed with entirely different quantization matrices (Q-matrices) than those used while training; different camera manufacturers and image processing software generally utilize their customized quantization matrices. A set of extensive experiments shows that the proposed system trained on a single dataset generalizes well on other datasets compressed with completely unseen quantization matrices and outperforms the state-of-the-art methods in both seen and unseen quantization matrices scenarios.

eess.IV

Multi-Objective Evolutionary approach for the Performance Improvement of Learners using Ensembling Feature selection and Discretization Technique on Medical data

Biomedical data is filled with continuous real values; these values in the feature set tend to create problems like underfitting, the curse of dimensionality and increase in misclassification rate because of higher variance. In response, pre-processing techniques on dataset minimizes the side effects and have shown success in maintaining the adequate accuracy. Feature selection and discretization are the two necessary preprocessing steps that were effectively employed to handle the data redundancies in the biomedical data. However, in the previous works, the absence of unified effort by integrating feature selection and discretization together in solving the data redundancy problem leads to the disjoint and fragmented field. This paper proposes a novel multi-objective based dimensionality reduction framework, which incorporates both discretization and feature reduction as an ensemble model for performing feature selection and discretization. Selection of optimal features and the categorization of discretized and non-discretized features from the feature subset is governed by the multi-objective genetic algorithm (NSGA-II). The two objective, minimizing the error rate during the feature selection and maximizing the information gain while discretization is considered as fitness criteria.

cs.AI

Block-level Double JPEG Compression Detection for Image Forgery Localization

Forged images have a ubiquitous presence in today's world due to ease of availability of image manipulation tools. In this letter, we propose a deep learning-based novel approach which utilizes the inherent relationship between DCT coefficient histograms and corresponding quantization step sizes to distinguish between original and forged regions in a JPEG image, based on the detection of single and double compressed blocks, without fully decompressing the JPEG image. We consider a diverse set of 1,120 quantization matrices collected in a recent study as compared to standard 100 quantization matrices for training, testing, and creating realistic forgeries. In particular, we carefully design the input to DenseNet with a specific combination of quantization step sizes and the respective histograms for a JPEG block. Using this input to learn the compression artifacts produces state-of-the-art results for the detection of single and double compressed blocks of sizes $256 \times 256$ and gives better results for smaller blocks of sizes $128 \times 128$ and $64 \times 64$. Consequently, improved forgery localization performances are obtained on realistic forged images. Also, in the case of test blocks compressed with completely different quantization matrices as compared to matrices used in training, the proposed method outperforms the current state-of-the-art.

eess.IV

Superconductivity in a new hexagonal high entropy alloy

High entropy alloys (HEAs) are the new class of materials with an attractive combination of tunable mechanical and physicochemical properties. They crystallize mainly in cubic structures, however, for practical applications, HEAs with hexagonal close-packed (hcp) structure are highly desirable in connection to their in general high hardness. Herein, we report the synthesis, structure and detailed superconducting properties of Re$_{0.56}$Nb$_{0.11}$Ti$_{0.11}$Zr$_{0.11}$Hf$_{0.11}$-the first hexagonal superconducting high entropy alloy (HEA) composed of five randomly distributed transition-metals. Combination of room temperature precession electron diffraction, precession electron diffraction tomography and powder X-ray diffraction is utilized to determine the room temperature crystal structure. Transport, magnetic and heat capacity measurements show that the material is a type-II superconductor with the bulk superconducting transition at $T_{c}$ = 4.4 K, lower critical field $H_{c1}$(0) = 2.3 mT and upper critical field $H_{c2}$(0) = 3.6 T. Low-temperature specific heat measurement indicates that Re$_{0.56}$Nb$_{0.11}$Ti$_{0.11}$Zr$_{0.11}$Hf$_{0.11}$ is a phonon-mediated superconductor in the weak electron-phonon coupling limit with a normalized specific heat jump $\frac{ΔC_{el}}{γ_{n}T_{c}}$ = 1.32. Further, hexagonal to cubic structural transition is observed by lowering the valence electron counts and $T_{c}$ follows crystalline-like behaviour.

cond-mat.supr-con