SearcharxivSearch

arXiv subjects

Ankit Kumar

Publications and source records attributed to Ankit Kumar.

At least 91 records · Page 5Linked to original sources

Identifying Feedforward and Feedback Controllable Subspaces of Neural Population Dynamics

There is overwhelming evidence that cognition, perception, and action rely on feedback control. However, if and how neural population dynamics are amenable to different control strategies is poorly understood, in large part because machine learning methods to directly assess controllability in neural population dynamics are lacking. To address this gap, we developed a novel dimensionality reduction method, Feedback Controllability Components Analysis (FCCA), that identifies subspaces of linear dynamical systems that are most feedback controllable based on a new measure of feedback controllability. We further show that PCA identifies subspaces of linear dynamical systems that maximize a measure of feedforward controllability. As such, FCCA and PCA are data-driven methods to identify subspaces of neural population data (approximated as linear dynamical systems) that are most feedback and feedforward controllable respectively, and are thus natural contrasts for hypothesis testing. We developed new theory that proves that non-normality of underlying dynamics determines the divergence between FCCA and PCA solutions, and confirmed this in numerical simulations. Applying FCCA to diverse neural population recordings, we find that feedback controllable dynamics are geometrically distinct from PCA subspaces and are better predictors of animal behavior. Our methods provide a novel approach towards analyzing neural population dynamics from a control theoretic perspective, and indicate that feedback controllable subspaces are important for behavior.

q-bio.NC

Constraining gravitational wave velocities using gravitational and electromagnetic wave observations of white dwarf binaries

Although the general theory of relativity (GR) predicts that gravitational waves (GWs) have exactly the same propagation velocity as electromagnetic (EM) waves, many theories of gravity beyond GR expect otherwise. Accurate measurement of the difference in their propagation speed, or a tight constraint on it, could be crucial to validate or put limits on theories beyond GR. The proposed future space-borne GW detectors are poised to detect a substantial number of Galactic white dwarf binaries (GWDBs), which emit the GW as semi-monochromatic signals. Concurrently, these GWDBs can also be identified as optical variable sources. Here we proposed that allocating a GWDB's optical light curve and contemporaneous GW signal can be used to trace the difference between the velocity of GW and EM waves. Simulating GW and EM wave data from 14 verification binaries (VBs), our method constrains propagation-originated phase differences, limiting the discrepancy between the speed of light ($c$) and GW ($c_{GW}$). Through the utilization of LISA's design sensitivity and the current precision in optical observation on GWDB, our study reveals that a four-year observation of the 14 recognized VBs results in a joint constraint that confines $Δc/c$ ($Δc = c_{\mathrm{GW}} - c$) to the range of $-2.1\times10^{-12}$ and $4.8\times10^{-12}$. Additionally, by incorporating this constraint on $c_{\mathrm{GW}}$, we are able to establish boundaries for the mass of the graviton, limiting it to $m_{\mathrm{g}}\le3\times10^{-23}\,e\mathrm{V}/c^{2}$, and for the parameter associated with local Lorentz violation, $\bar{s}_{00}$, constrained within the range of $-3.4\times10^{-11}\le\bar{s}_{00}\le1.5\times10^{-11}$.

gr-qc

Central limit theorem and moderate deviation principle for the stochastic generalized Burgers-Huxley equation with multiplicative noise

In this work, we investigate the Central Limit Theorem (CLT) and Moderate Deviation Principle (MDP) for the stochastic generalized Burgers-Huxley (SGBH) equation with multiplicative Gaussian noise. The SGBH equation is a diffusion-convection-reaction type equation which consists a nonlinearity of polynomial order, and we take into account of an infinite-dimensional noise having a coefficient that has linear growth. We first prove the CLT which allows us to establish the convergence of the distribution of the solution to a re-scaled SGBH equation to a desired distribution function. Furthermore, we extend our asymptotic analysis by investigating the MDP for the SGBH equation. Using the weak convergence method, we establish the MDP and derive the corresponding rate function.

math.PR

MHD activity induced coherent mode excitation in the edge plasma region of ADITYA-U Tokamak

In this paper, we report the excitation of coherent density and potential fluctuations induced by magnetohydrodynamic (MHD) activity in the edge plasma region of ADITYA-U Tokamak. When the amplitude of the MHD mode, mainly the m/n = 2/1, increases beyond a threshold value of 0.3-0.4 %, coherent oscillations in the density and potential fluctuations are observed having the same frequency as that of the MHD mode. The mode numbers of these MHD induced density and potential fluctuations are obtained by Langmuir probes placed at different radial, poloidal, and toroidal locations in the edge plasma region. Detailed analyses of these Langmuir probe measurements reveal that the coherent mode in edge potential fluctuation has a mode structure of m/n = 2/1 whereas the edge density fluctuation has an m/n = 1/1 structure. It is further observed that beyond the threshold, the coupled power fraction scales almost linearly with the magnitude of magnetic fluctuations. Furthermore, the rise rates of the coupled power fraction for coherent modes in density and potential fluctuations are also found to be dependent on the growth rate of magnetic fluctuations. The disparate mode structures of the excited modes in density and plasma potential fluctuations suggest that the underlying mechanism for their existence is most likely due to the excitation of the global high-frequency branch of zonal flows occurring through the coupling of even harmonics of potential to the odd harmonics of pressure due to 1/R dependence of the toroidal magnetic field.

physics.plasm-ph

FGA: Fourier-Guided Attention Network for Crowd Count Estimation

Crowd counting is gaining societal relevance, particularly in domains of Urban Planning, Crowd Management, and Public Safety. This paper introduces Fourier-guided attention (FGA), a novel attention mechanism for crowd count estimation designed to address the inefficient full-scale global pattern capture in existing works on convolution-based attention networks. FGA efficiently captures multi-scale information, including full-scale global patterns, by utilizing Fast-Fourier Transformations (FFT) along with spatial attention for global features and convolutions with channel-wise attention for semi-global and local features. The architecture of FGA involves a dual-path approach: (1) a path for processing full-scale global features through FFT, allowing for efficient extraction of information in the frequency domain, and (2) a path for processing remaining feature maps for semi-global and local features using traditional convolutions and channel-wise attention. This dual-path architecture enables FGA to seamlessly integrate frequency and spatial information, enhancing its ability to capture diverse crowd patterns. We apply FGA in the last layers of two popular crowd-counting works, CSRNet and CANNet, to evaluate the module's performance on benchmark datasets such as ShanghaiTech-A, ShanghaiTech-B, UCF-CC-50, and JHU++ crowd. The experiments demonstrate a notable improvement across all datasets based on Mean-Squared-Error (MSE) and Mean-Absolute-Error (MAE) metrics, showing comparable performance to recent state-of-the-art methods. Additionally, we illustrate the interpretability using qualitative analysis, leveraging Grad-CAM heatmaps, to show the effectiveness of FGA in capturing crowd patterns.

cs.CV

Myriad of Terahertz Magnons with All-Optical Magnetoelectric Functionality for Efficient Spin-Wave Computing in Honeycomb Magnet Co4Ta2O9

Terahertz (THz) magnonics represent the notion of mathematical algebraic operations of magnons such as addition and subtraction in THz regime which is an emergent dissipationless ultrafast alternative to existing data processing technologies. Spin waves on antiferromagnets with a twist in spin order host such magnons in THz regime, which possess advantage of higher processing speeds, additional polarization degree of freedom and longer propagation lengths compared to that of gigahertz magnons in ferromagnets. While interaction among THz magnons is the crux of algebra operations, it requires magnetic orders with closely spaced magnon modes for easier experimental realization of their interactions. Herein, rich wealth of magnons spanning a narrow energy range of 0.4 to 10 meV is unraveled in Co4Ta2O9 using magneto-THz spectroscopy. Rare multitude of ten excitation modes, either of magnons or hybrid magnon-phonon modes is presented. Among other attributes, spin lattice interaction suggests a correlation among spin and local lattice distortion, magnetostriction, and magnetic exchange interaction signifying a THz magnetoelectric effect. This unification of structural, magnetic and dielectric facets, and their magnetic field control in a narrow spectrum unwinds the mechanism underneath the system's complexity while the manifestation of multitude of spin excitation modes is a potential source to design multiple channels in spin-wave computing based devices.

cond-mat.mtrl-sci

Entanglement Dynamics in Quantum Continuous-Variable States

Due to the weakness of gravitational coupling, all quantum experiments up to date in which gravity plays a role utilized the field of the Earth. Since this field undergoes practically undetectable back-action from quantum particles, it effectively admits a classical description as a fixed background Newtonian field or spacetime. This argument strongly motivates theoretical and experimental research towards a demonstration of gravitation between two quantum masses, as this is one of the most straightforward scenarios where quantum features of gravity could be observed. Several proposals studied the possibility of generating entanglement between two massive objects. Along the same lines, with a particular focus on gravity, this thesis introduces general tools to tackle interaction-mediated entanglement and applies them to two particles prepared in continuous-variable states.

quant-ph

Probing Modified Gravity with Entanglement of Microspheres

While a wide variety of astrophysical and cosmological phenomena suggest the presence of Dark Matter, all evidence remains via its gravitational effect on the known matter. As such, it is conceivable that this evidence could be explained by a modification to gravitation and/or concepts of inertia. Various formulations of modified gravity exist, each giving rise to several non-canonical outcomes. This motivates us to propose an experiment searching for departures from (quantum) Newtonian predictions in a bipartite setting with gravitational accelerations $\lesssim 10^{-10}$ m/s$^2$, i.e., where the effective force needs to be stronger than Newtonian to account for the Dark Matter effects. Since quantum particles naturally source weak gravitation, their non-relativistic dynamics offers opportunities to test this small acceleration regime. We show that two nearby mesoscopic quantum masses accumulate significantly larger entanglement in modified gravity models, such as the Modified Newtonian Dynamics. Our calculations include Casimir-Polder forces as well as tidal effects next to the surface of the earth, and confirm that entanglement is observable within the limits imposed by environmental decoherence. We demonstrate how the temperature can be fine-tuned such that modified gravity is certified simply by witnessing the entanglement generated from uncorrelated thermal states, eliminating the need for precise noise characterization. Overall, the required parameters could be realized in a tabletop experiment.

gr-qc

Wong-Zakai approximation for a class of SPDEs with fully local monotone coefficients and its application

In this article, we establish the \textsl{Wong-Zakai approximation} result for a class of stochastic partial differential equations (SPDEs) with fully local monotone coefficients perturbed by a multiplicative Wiener noise. This class of SPDEs encompasses various fluid dynamic models and also includes quasi-linear SPDEs, the convection-diffusion equation, the Cahn-Hilliard equation, and the two-dimensional liquid crystal model. It has been established that the class of SPDEs in question is well-posed, however, the existence of a unique solution to the associated approximating system cannot be inferred from the solvability of the original system. We employ a Faedo-Galerkin approximation method, compactness arguments, and Prokhorov's and Skorokhod's representation theorems to ensure the existence of a \textsl{probabilistically weak solution} for the approximating system. Furthermore, we also demonstrate that the solution is pathwise unique. Moreover, the classical Yamada-Watanabe theorem allows us to conclude the existence of a \textsl{probabilistically strong solution} (analytically weak solution) for the approximating system. Subsequently, we establish the Wong-Zakai approximation result for a class of SPDEs with fully local monotone coefficients. We utilize the Wong-Zakai approximation to establish the topological support of the distribution of solutions to the SPDEs with fully local monotone coefficients. Finally, we explore the physically relevant stochastic fluid dynamics models that are covered by this work's functional framework.

math.PR

Existence and uniqueness of weak solutions for the generalized stochastic Navier-Stokes-Voigt equations

In this work, we consider the incompressible generalized Navier-Stokes-Voigt equations in a bounded domain $\mathcal{O}\subset\mathbb{R}^d$, $d\geq 2$, driven by a multiplicative Gaussian noise. The considered momentum equation is given by: \begin{align*} \mathrm{d}\left(\boldsymbol{u} - κΔ\boldsymbol{u}\right) = \left[\boldsymbol{f} +\operatorname{div} \left(-π\mathbf{I}+ν|\mathbf{D}(\boldsymbol{u})|^{p-2}\mathbf{D}(\boldsymbol{u})-\boldsymbol{u}\otimes \boldsymbol{u}\right)\right]\mathrm{d} t + Φ(\boldsymbol{u})\mathrm{d} \mathrm{W}(t). \end{align*} In the case of $d=2,3$, $\boldsymbol{u}$ accounts for the velocity field, $π$ is the pressure, $\boldsymbol{f}$ is a body force and the final term stay for the stochastic forces. Here, $κ$ and $ν$ are given positive constants that account for the kinematic viscosity and relaxation time, and the power-law index $p$ is another constant (assumed $p>1$) that characterizes the flow. We use the usual notation $\mathbf{I}$ for the unit tensor and $\mathbf{D}(\boldsymbol{u}):=\frac{1}{2}\left(\nabla \boldsymbol{u} + (\nabla \boldsymbol{u})^{\top}\right)$ for the symmetric part of velocity gradient. For $p\in\big(\frac{2d}{d+2},\infty\big)$, we first prove the existence of a martingale solution. Then we show the pathwise uniqueness of solutions. We employ the classical Yamada-Watanabe theorem to ensure the existence of a unique probabilistic strong solution.Then we show the pathwise uniqueness of solutions. We employ the classical Yamada-Watanabe theorem to ensure the existence of a unique probabilistic strong solution.

math.PR

From Text to Transformation: A Comprehensive Review of Large Language Models' Versatility

This groundbreaking study explores the expanse of Large Language Models (LLMs), such as Generative Pre-Trained Transformer (GPT) and Bidirectional Encoder Representations from Transformers (BERT) across varied domains ranging from technology, finance, healthcare to education. Despite their established prowess in Natural Language Processing (NLP), these LLMs have not been systematically examined for their impact on domains such as fitness, and holistic well-being, urban planning, climate modelling as well as disaster management. This review paper, in addition to furnishing a comprehensive analysis of the vast expanse and extent of LLMs' utility in diverse domains, recognizes the research gaps and realms where the potential of LLMs is yet to be harnessed. This study uncovers innovative ways in which LLMs can leave a mark in the fields like fitness and wellbeing, urban planning, climate modelling and disaster response which could inspire future researches and applications in the said avenues.

cs.CL

A Lightweight Feature Fusion Architecture For Resource-Constrained Crowd Counting

Crowd counting finds direct applications in real-world situations, making computational efficiency and performance crucial. However, most of the previous methods rely on a heavy backbone and a complex downstream architecture that restricts the deployment. To address this challenge and enhance the versatility of crowd-counting models, we introduce two lightweight models. These models maintain the same downstream architecture while incorporating two distinct backbones: MobileNet and MobileViT. We leverage Adjacent Feature Fusion to extract diverse scale features from a Pre-Trained Model (PTM) and subsequently combine these features seamlessly. This approach empowers our models to achieve improved performance while maintaining a compact and efficient design. With the comparison of our proposed models with previously available state-of-the-art (SOTA) methods on ShanghaiTech-A ShanghaiTech-B and UCF-CC-50 dataset, it achieves comparable results while being the most computationally efficient model. Finally, we present a comparative study, an extensive ablation study, along with pruning to show the effectiveness of our models.

cs.CV

Impact of Urban Street Geometry on the Detection Probability of Automotive Radars

Prior works have analyzed the performance of millimeter wave automotive radars in the presence of diverse clutter and interference scenarios using stochastic geometry tools instead of more time-consuming measurement studies or system-level simulations. In these works, the distributions of radars or discrete clutter scatterers were modeled as Poisson point processes in the Euclidean space. However, since most automotive radars are likely to be mounted on vehicles and road infrastructure, road geometries are an important factor that must be considered. Instead of considering each road geometry as an individual case for study, in this work, we model each case as a specific instance of an underlying Poisson line process and further model the distribution of vehicles on the road as a Poisson point process - forming a Poisson line Cox process. Then, through the use of stochastic geometry tools, we estimate the average number of interfering radars for specific road and vehicular densities and the effect of radar parameters such as noise and beamwidth on the radar detection metrics. The numerical results are validated with Monte Carlo simulations.

cs.IT

From Simulations to Reality: Enhancing Multi-Robot Exploration for Urban Search and Rescue

In this study, we present a novel hybrid algorithm, combining Levy Flight (LF) and Particle Swarm Optimization (PSO) (LF-PSO), tailored for efficient multi-robot exploration in unknown environments with limited communication and no global positioning information. The research addresses the growing interest in employing multiple autonomous robots for exploration tasks, particularly in scenarios such as Urban Search and Rescue (USAR) operations. Multiple robots offer advantages like increased task coverage, robustness, flexibility, and scalability. However, existing approaches often make assumptions such as search area, robot positioning, communication restrictions, and target information that may not hold in real-world situations. The hybrid algorithm leverages LF, known for its effectiveness in large space exploration with sparse targets, and incorporates inter-robot repulsion as a social component through PSO. This combination enhances area exploration efficiency. We redefine the local best and global best positions to suit scenarios without continuous target information. Experimental simulations in a controlled environment demonstrate the algorithm's effectiveness, showcasing improved area coverage compared to traditional methods. In the process of refining our approach and testing it in complex, obstacle-rich environments, the presented work holds promise for enhancing multi-robot exploration in scenarios with limited information and communication capabilities.

cs.NE

Production cross-sections and Radiative Decay widths of Heavy Quarkonia in magnetized matter

We study the production cross-sections and radiative decay widths of heavy quarkonia (charmonia and bottomonia) in magnetized nuclear matter. The production cross-sections of the $ψ(3770)$ and $Υ(4S)$, from the $D\bar D$ and $B\bar B$ scatterings respectively, are studied from the medium modifications of the masses and partial decay widths to open charm (bottom) mesons, of these heavy flavor mesons. Within a chiral effective model, the masses of the vector and pseudoscalar charmonium (bottomonium) states are calculated from the medium modification of a dilaton field, $χ$, which mimics the gluon condensates of QCD. In the presence of a magnetic field, there is mixing of the pseudoscalar (P) meson and the longitudinal component of the vector (V) meson (PV mixing), which leads to appreciable modifications of their masses. The radiative decay widths of the vector (V) heavy quarkonia to the pseudoscalar (P) mesons ($J/ψ\rightarrow η_c(1S) γ$, $ψ(2S)\rightarrow η_c(2S) γ$ and $ψ(1D)\rightarrow η_c(2S) γ$ for the charm sector and $Υ(NS)\rightarrow η_b(NS)γ$, $N$=1,2,3,4, for the bottom sector) in the magnetized asymmetric nuclear matter are also investigated in the present work. The difference in the mass of the transverse component from the longitudinal component of the vector meson, arising due to PV mixing, is observed as a double peak structure in the invariant mass spectrum of the production cross-section of $ψ(3770)$. The modifications of the production cross-sections as well as the radiative decay widths of the heavy quarkonia in the magnetized matter should have observable consequences on the production of these heavy flavour mesons resulting from ultra-relativistic peripheral heavy ion collision experiments, where the created magnetic field can be extremely large.

hep-ph

Formal Model-Driven Analysis of Resilience of GossipSub to Attacks from Misbehaving Peers

GossipSub is a new peer-to-peer communication protocol designed to counter attacks from misbehaving peers by controlling what information is sent and to whom, via a score function computed by each peer that captures positive and negative behaviors of its neighbors. The score function depends on several parameters (weights, caps, thresholds) that can be configured by applications using GossipSub. The specification for GossipSub is written in English and its resilience to attacks from misbehaving peers is supported empirically by emulation testing using an implementation in Golang. In this work we take a foundational approach to understanding the resilience of GossipSub to attacks from misbehaving peers. We build the first formal model of GossipSub, using the ACL2s theorem prover. Our model is officially endorsed by the GossipSub developers. It can simulate GossipSub networks of arbitrary size and topology, with arbitrarily configured peers, and can be used to prove and disprove theorems about the protocol. We formalize fundamental security properties stating that the score function is fair, penalizes bad behavior, and rewards good behavior. We prove that the score function is always fair, but can be configured in ways that either penalize good behavior or ignore bad behavior. Using our model, we run GossipSub with the specific configurations for two popular real-world applications: the FileCoin and Eth2.0 blockchains. We show that all properties hold for FileCoin. However, given any Eth2.0 network (of any topology and size) with any number of potentially misbehaving peers, we can synthesize attacks where these peers are able to continuously misbehave by never forwarding topic messages, while maintaining positive scores so that they are never pruned from the network by GossipSub.

cs.CR

Verification of GossipSub in ACL2s

GossipSub is a popular new peer-to-peer network protocol designed to disseminate messages quickly and efficiently by allowing peers to forward the full content of messages only to a dynamically selected subset of their neighboring peers (mesh neighbors) while gossiping about messages they have seen with the rest. Peers decide which of their neighbors to graft or prune from their mesh locally and periodically using a score for each neighbor. Scores are calculated using a score function that depends on mesh-specific parameters, weights and counters relating to a peer's performance in the network. Since a GossipSub network's performance ultimately depends on the performance of its peers, an important question arises: Is the score calculation mechanism effective in weeding out non-performing or even intentionally misbehaving peers from meshes? We answered this question in the negative in our companion paper by reasoning about GossipSub using our formal, official and executable ACL2s model. Based on our findings, we synthesized and simulated attacks against GossipSub which were confirmed by the developers of GossipSub, FileCoin, and Eth2.0, and publicly disclosed in MITRE CVE-2022-47547. In this paper, we present a detailed description of our model. We discuss design decisions, security properties of GossipSub, reasoning about the security properties in context of our model, attack generation and lessons we learnt when writing it.

cs.LO

Proving Calculational Proofs Correct

Teaching proofs is a crucial component of any undergraduate-level program that covers formal reasoning. We have developed a calculational reasoning format and refined it over several years of teaching a freshman-level course, "Logic and Computation", to thousands of undergraduate students. In our companion paper, we presented our calculational proof format, gave an overview of the calculational proof checker (CPC) tool that we developed to help users write and validate proofs, described some of the technical and implementation details of CPC and provided several publicly available proofs written using our format. In this paper, we dive deeper into the implementation details of CPC, highlighting how proof validation works, which helps us argue that our proof checking process is sound.

cs.LO