SearcharxivSearch

arXiv subjects

Saksham Sharma

Publications and source records attributed to Saksham Sharma.

16 recordsLinked to original sources

In-medium properties of $D$ and $D^*$ mesons in magnetized isospin asymmetric nuclear matter

We investigate the impact of an external magnetic field on the in-medium properties of pseudoscalar ($D^0,D^+,D_s$) and vector ($D^{0*},D^{+*},D_{s}^{*}$) mesons in isospin asymmetric nuclear matter at finite temperature using a hybrid theoretical framework combining the chiral SU(3) quark mean-field (CQMF) model and the light-front quark model (LFQM). The medium-modified constituent quark masses, obtained from the CQMF model by including the magnetized Dirac sea contribution and anomalous magnetic moments of nucleons, are used as input to the LFQM calculations of meson masses, weak decay constants, and leading-twist distribution amplitudes. We further incorporate the Landau quantization of the charged mesons restricted to the lowest Landau level, while magnetic field induced pseudoscalar-vector mixing is taken into account for each $D$-$D^{*}$ doublet. We find that the external magnetic field enhances the effective masses and decay constants of both pseudoscalar and vector $D$ mesons by magnetic catalysis, while increasing baryon density generally induces an attractive mass shift and suppresses the decay constant and distribution amplitudes. The Landau level contribution further enhances the effective masses of the charged mesons, whereas the pseudoscalar-vector mixing produces a level repulsion, shifting the vector meson masses upward and the pseudoscalar meson masses downward. The interplay between magnetic field and density effects gives rise to a nontrivial medium behavior of heavy-light meson properties, with isospin asymmetry further inducing a small but systematic mass splitting across all the meson states considered. These results provide useful insights into heavy-flavor dynamics in strongly interacting matter and are relevant to ongoing and future studies at FAIR, NICA, and J-PARC.

hep-ph

Topological Online Learning for Displacement-based Formation Control

This paper addresses the problem of robust formation control by introducing Topological Online Learning for Displacement-based (TOLD) formation control, a real-time edge-level adaptation framework. Unlike conventional node-level robust controllers that regulate individual robot inputs without modifying the interaction topology, TOLD updates the interaction topology weights online to directly minimize formation distortion. Two strategies are proposed under the TOLD formation control framework: Online Gradient Flow (OGF) with unconstrained weights and Online Exponential Gradient Flow (OExpGF) with non-negative convex weights. Theoretical analysis establishes that, for single-integrator agents over directed graphs, OExpGF guarantees asymptotic consensus, while OGF ensures bounded formation distortion. Simulations with twelve robots under intermittent disturbances show 1.2%-33.14% median cumulative Root Mean Distortion Error reduction when augmenting TOLD with node-level controllers. Hardware experiments with Crazyflie 2.0 quadrotors demonstrate over 62% (OGF) and 31.4% (OExpGF) reduction in median formation distortion compared to fixed-weight consensus.

cs.RO

AI for Sustainable Data Protection and Fair Algorithmic Management in Environmental Regulation

Integration of AI into environmental regulation represents a significant advancement in data management. It offers promising results in both data protection plus algorithmic fairness. This research addresses the critical need for sustainable data protection in the era of ever evolving cyber threats. Traditional encryption methods face limitations in handling the dynamic nature of environmental data. This necessitates the exploration of advanced cryptographic techniques. The objective of this study is to evaluate how AI can enhance these techniques to ensure robust data protection while facilitating fair algorithmic management. The methodology involves a comprehensive review of current advancements in AI-enhanced homomorphic encryption (HE) and multi-party computation (MPC). It is coupled with an analysis of how these techniques can be applied to environmental data regulation. Key findings indicate that AI-driven dynamic key management, adaptive encryption schemes, and optimized computational efficiency in HE, alongside AI-enhanced protocol optimization and fault mitigation in MPC, significantly improve the security of environmental data processing. These findings highlight a crucial research gap in the intersection of AI, cyber laws, and environmental regulation, particularly in terms of addressing algorithmic bias, transparency, and accountability. The implications of this research underscore the need for stricter cyber laws. Also, the development of comprehensive regulations to safeguard sensitive environmental data. Future efforts should focus on refining AI systems to balance security with privacy and ensuring that regulatory frameworks can adapt to technological advancements. This study provides a foundation for future research aimed at achieving secure sustainable environmental data management through AI innovations.

cs.CY

Advances in Prebiotic Chemistry: the potential of Analog Computing and Navier-Stokes Nernst-Planck (NPNS) Modeling in Organic Electronics Technologies (OECTs)

In this article, we attempt to make a conceptual bridge between the research in biology, pre-biotic chemistry, biomimetics, and the tools used in organic bioelectronics in terms of materials and devices. The goal is discussing how materials and devices of organic bioelectronics can be exploited and used at the interface with biology, but also how, and at what extent, they can be adapted to mimicking nature-inspired properties, herein including unconventional computing strategies. The idea is to provide new hints and solid hypotheses for designing niche experiments that could benefit from a proper interaction, even at a basic communicative level, between materials science and biotechnology. The finale long-term vision goal being the vision of collecting experimental data that may help to made a step forward toward the implementation of the transition from inanimate objects to animated beings. The mathematical model canonically considered in this work is the Navier-Stokes-Nernst-Planck (NPNS) Model which is often used to model a charged continuum system such as the organic electrochemical transistors.

physics.flu-dyn

Graph-based Complexity and Computational Capabilites of Proteinoid Spike Systems

Proteinoids, as soft matter fluidic systems, are computational substrates that have been recently proposed for their analog computing capabilities. Such systems exhibit oscillatory electrical activity because of cationic and anionic exchange inside and outside such gels. It has also been recently shown that this (analog) electrical activity, when sampled at fixed time intervals, can be used to reveal their underlying information-theoretic, computational code. This code, for instance, can be expressed in the (digital) language of Boolean gates and QR codes. Though, this might seem as a good evidence that proteinoid substrates have computing abilities when subjected to analog-to-digital transition, the leap from their underlying computational code to computing abilities is not well demonstrated. In this work, we analyse the electrical activity patterns of proteinoid substrates using computational methods including deep ReLU networks. Our findings suggest intriguing parallels between these patterns and certain computational frameworks, hinting at the possibility that such chemical systems might possess inherent information-processing and computational capabilities. To demonstrate the computational ability, we construct a prediction algorithm which acts as a binary classification model and extract 16-dimensional vector data from the proteinoid spike, in order to perform predictions with 70.41% accuracy. This model in its core has a unique transformation modality, inspired from number-theoretic sieve theory, and is combination of two functions: spiral sampling F1 and significant digit extraction F2 functions. The complexity of the transformed data is measured using eight distinct metrics, and effectively, using a single meta-metric.

physics.flu-dyn

IRisPath: Enhancing Costmap for Off-Road Navigation with Robust IR-RGB Fusion for Improved Day and Night Traversability

Autonomous off-road navigation is required for applications in agriculture, construction, search and rescue and defence. Traditional on-road autonomous methods struggle with dynamic terrains, leading to poor vehicle control in off-road conditions. Recent deep-learning models have used perception sensors along with kinesthetic feedback for navigation on such terrains. However, this approach has out-of-domain uncertainty. Factors like change in time of day and weather impacts the performance of the model. We propose a multi modal fusion network "IRisPath" capable of using Thermal and RGB images to provide robustness against dynamic weather and light conditions. To aid further works in this domain, we also open-source a day-night dataset with Thermal and RGB images along with pseudo-labels for traversability. In order to co-register for fusion model we also develop a novel method for targetless extrinsic calibration of Thermal, LiDAR and RGB cameras with translation accuracy of +/-1.7cm and rotation accuracy of +/-0.827degrees.

cs.RO

Information-theoretic language of proteinoid gels: Boolean gates and QR codes

With an aim to build analog computers out of soft matter fluidic systems in future, this work attempts to invent a new information-theoretic language, in the form of two-dimensional Quick Response (QR) codes. This language is, effectively, a digital representation of the analog signals shown by the proteinoids. We use two different experimental techniques: (i) a voltage-sensitive dye and (ii) a pair of differential electrodes, to record the analog signals. The analog signals are digitally approximatied (synthesised) by sampling the analog signals into a series of discrete values, which are then converted into binary representations. We have shown the AND-OR-NOT-XOR-NOR-NAND-XNOR gate representation of the digitally sampled signal of proteinoids. Additional encoding schemes are applied to convert the binary code identified above to a two-dimensional QR code. As a result, the QR code becomes a digital, unique marker of a given proteinoid network. We show that it is possible to retrieve the analog signal from the QR code by scanning the QR code using a mobile phone. Our work shows that soft matter fluidic systems, such as proteinoids, can have a fundamental informatiom-theoretic language, unique to their internal information transmission properties (electrical activity in this case) - such a language can be made universal and accessible to everyone using 2D QR codes, which can digitally encode their internal properties and give an option to recover the original signal when required. On a more fundamental note, this study identifies the techniques of approximating continuum properties of soft matter fluidic systems using a series representation of gates and QR codes, which are a piece-wise digital representation, and thus one step closer to programming the fluids using information-theoretic methods, as suggested almost a decade ago by Tao's fluid program.

cs.ET

Proof of Aperiodicity of hat tile using the Golden Ratio

The Einstein tile is a novel type of non-periodic tile that can cover the plane without repeating itself. It has a simple shape that resembles a fedora. This research paper unveils the aperiodicity of the newly discovered Einstein tile using the golden ratio, marking a paradigm shift in the field of geometric tiling. This Through rigorous analysis, mathematical modeling, and computational simulations, we provide compelling evidence that the Einstein tile defies conventional periodicity, lacking any repeating pattern or translational symmetry. The unique properties of the Einstein tile open up new avenues for exploring aperiodic tiling systems and their implications in various scientific and technological domains. From cryptography to materials science, the aperiodicity of the Einstein tile presents exciting opportunities for advancements in diverse fields, expanding our understanding of tiling theory and inspiring future explorations into aperiodic structures.

math.GM

On morphological and functional complexity of proteinoid microspheres

Proteinoids are solidified gels made from poly(amino acids) based polymers that exhibit oscillatory electrical activity. It has been proposed that proteinoids are capable of performing analog computing as their electrical activity can be converted into a series of Boolean gates. The current article focuses on decrypting the morphological and functional complexity of the ensembles of proteinoid microspheres prepared in the laboratory. We identify two different protocols (one with and one without SEM) to prepare and visualize proteinoid microspheres. To quantify the complexity of proteinoid ensembles, we measure nine complexity metrics (to name a few: average degrees $\textrm{Deg}_{av}$, maximum number of independent cycles $u$, average connections per node $\textrm{Conn}_{av}$, resistance $\textrm{res}_{\textrm{eff}}$, percolation threshold $\textrm{perc}_{\textrm{t}}$) which shine light on the morphological, functional complexity of the proteinoids, and the information transmission that happens across the undirected graph abstraction of the proteinoid microspheres ensembles. We identify the complexity metrics that can distinguish two different protocols of preparation and also the most dense, complex, and less power consuming proteinoid network among all tested. With this work, we hope to provide a complexity toolkit for hardware designers of analog computers to design their systems with the right set of complexity ingredients guided one-to-one by the protocol chosen at the first place. On a more fundamental note, this study also sets forth the need to treat gels, microspheres, and fluidic systems as fundamentally information-theoretic in nature, rather than continuum mechanical, a perspective emerging out from recent program by Tao to treat fluids as potentially Turing-complete and thus, programmable.

physics.flu-dyn

Origin of filaments in finite-time in Newtonian and non-Newtonian thin-films

The sticky fluids found in pitcher plant leaf vessels can leave fractal-like filaments behind when dewetting from a substrate. To understand the origin of these filaments, we investigate the dynamics of a retreating thin-film of aqueous polyethylene oxide (PEO) solutions which partially wet polydimethyl siloxane (PDMS) substrates. Under certain conditions the retreating film generates regularly-spaced liquid filaments. The early-stage thin-film dynamics of dewetting are investigated to identify a theoretical criterion for liquid filament formation. Starting with a linear stability analysis of a Newtonian or simple non-Newtonian (power-law) thin-film, a critical film thickness is identified which depends on the Hamaker constant for the fluid-substrate pair and the surface tension of the fluid. When the measured film thickness is smaller than this value, the film is unstable and forms filaments as a result of van der Waals forces dominating its behaviour. This critical film-height is compared with experimental measurements of film thickness obtained for receding films of Newtonian (glycerol-water mixtures) and non-Newtonian (PEO) solutions generated on substrates inclined at angles 0 $^{\circ}$, 30 $^{\circ}$, and 60 $^{\circ}$ to the vertical. The observations of filament and its absence show good agreement with the theory. The evolution of the thin-film shape is modelled numerically to show that the formation of filaments arises because the thin-film equation features a singular solution after a finite-time, hence termed a "finite-time singularity".

cond-mat.soft

A review on the protocols for the synthesis of proteinoids

Protocells are a type of synthetic cells, which, if engineered to have properties similar to a natural cell, can have immense applications in synthetic biology and bioengineering communities. Proteinoids are one of the leading contenders for protocells discovered by Sidney H. Fox in 1950s as the protein-like molecules which are made out of amino acids. Proteinoids, if made in a right way, can show electrical excitability patterns on its surface with inflow and outflow of acidic and basic ions giving rise to a oscillatory charge behaviour similar to a neuronal spiking potential. The right protocol for the preparation of proteinoids can be hard to find, given that the literature for proteinoid is widely distributed across different scientific subdisciplines - origin of life, synthetic cell engineering, application of proteinoid NPs etc. This review attempts to enlist most of the relevant protocols published in the literature, each catering to different application, whether motivated by fundamental sciences or basic sciences perspective. The article also suggests the best set of protocol that could be followed by the readers to synthesise proteinoid powder as a potential experimental system for proto-cognitive, cosmetic, biomedical, or synthetic biology applications. An overarching picture of proteinoid as a potential system to study the chemical evolution during the transition from abiotic to prebiotic life, in the history of Earth, is also presented in the end.

physics.flu-dyn

A complexity perspective on fluid mechanics

This article attempts to use the ideas from the field of complexity sciences to revisit the classical field of fluid mechanics. For almost a century, the mathematical self-consistency of Navier-Stokes equations has remained elusive to the community of functional analysts, who posed the Navier-Stokes problem as one of the seven millennium problems in the dawn of 21st century. This article attempts to trace back the historical developments of fluid mechanics as a discipline and explain the consequences of not rationalising one of the commonly agreed upon tenets - continuum hypothesis - in the community. The article argues that 'fluids' can be treated as 'emergent' in nature, in that the atoms and molecules in the nanometre length scale can likely be correlated with the continuum physics at the microscale. If this is the case, then one might start trying to find a theoretical framework that models the emergence of fluids from atoms, effectively solving the multi-scale problem using a single abstract framework. Cantor set with layers $N$ (N can have up to two orders of magnitude) is presented as a potential contender (analytical framework) for connecting the energy in molecular level $C_{1}$ at length scale $l_{cut}$ to the energy at continuum level $C_N$ with length scale $L$. Apart from fluid mechanics, Cantor set is shown to represent the conceptual understanding of VLSI hardware design ($N=5$). Apart from Cantor set, an experimental technique of architecting metafluids is also shown to solve emergence experimentally (i.e. connect physics at specific lower scales to higher scales).

physics.flu-dyn

From Navier-Stokes millennium-prize problem to soft matter computing

Clay Mathematical Institute, in the year 2000, formulated a list of seven unsolved mathematical problems which might influence and direct the course of the research in the 21st century. Navier-Stokes regularity problem is one of the seven problems and has not been solved till date. These equations govern the motion of the viscous fluids, such as liquids, gases, gels, polymers. The present article is a spotlight on the NSE problem: a review of the past and current efforts to solve it, and our changing perspectives and understanding of these equations. The major debate is to either prove that the solutions to Navier-Stokes equations (NSE) are smooth or to prove that the solutions reach singularity at a finite-time (blowup); given some initial conditions. While in the past, the focus was on finding bounds for the smooth solutions, recently, there has been growing interest in finding solutions that blowup. The current article places the Turing-completeness of Euler equations (a subclass of NSE) into the centre-stage, by discussing the recent developments that are pointing towards that the idea that the fluid equations should be viewed as a 'computer program'. Given this is the case, the article then argues to see 'continuum fluid' from a complexity notion, and thus, as a Turing machine. This notion connects the discipline of fluid mechanics to disciplines like, 'neuromorphic computing, reservoir computing' and potentially leading to emerging new discipline, "soft matter complexity, computing, and learning", each of which has been discussed in brief.

math.AP

Natural oscillations of a sessile drop: Inviscid theory

We present a fully analytical solution for the natural oscillation of an inviscid sessile drop of arbitrary contact angle on a horizontal plate for the case for the case of low Bond number, when surface tension dominates gravity. The governing equations are expressed in terms of the toroidal coordinate system which yields solutions involving hypergeometric functions. Resonant frequencies are identified for zonal, sectoral and tesseral vibration modes. The predictions show good agreement with experimental data reported in the literature, with better agreement than the model of \citeauthor{bostwick} (\textit{J. Fluid Mech.}, vol. 760, 2014, 5-38), particularly for flatter drops (lower contact angle) and higher modes of vibration. The impact of viscous dissipation is discussed briefly.

physics.flu-dyn

TipsC: Tips and Corrections for programming MOOCs

With the widespread adoption of MOOCs in academic institutions, it has become imperative to come up with better techniques to solve the tutoring and grading problems posed by programming courses. Programming being the new 'writing', it becomes a challenge to ensure that a large section of the society is exposed to programming. Due to the gradient in learning abilities of students, the course instructor must ensure that everyone can cope up with the material, and receive adequate help in completing assignments while learning along the way. We introduce TipsC for this task. By analyzing a large number of correct submissions, TipsC can search for correct codes resembling a given incorrect solution. Without revealing the actual code, TipsC then suggests changes in the incorrect code to help the student fix logical runtime errors. In addition, this also serves as a cluster visualization tool for the instructor, revealing different patterns in user submissions. We evaluated the effectiveness of TipsC's clustering algorithm on data collected from previous offerings of an introductory programming course conducted at IIT Kanpur where the grades were given by human TAs. The results show the weighted average variance of marks for clusters when similar submissions are grouped together is 47% less compared to the case when all programs are grouped together.

cs.AI

Sound Mixed-Precision Optimization with Rewriting

Finite-precision arithmetic computations face an inherent tradeoff between accuracy and efficiency. The points in this tradeoff space are determined, among other factors, by different data types but also evaluation orders. To put it simply, the shorter a precision's bit-length, the larger the roundoff error will be, but the faster the program will run. Similarly, the fewer arithmetic operations the program performs, the faster it will run; however, the effect on the roundoff error is less clear-cut. Manually optimizing the efficiency of finite-precision programs while ensuring that results remain accurate enough is challenging. The unintuitive and discrete nature of finite-precision makes estimation of roundoff errors difficult; furthermore the space of possible data types and evaluation orders is prohibitively large. We present the first fully automated and sound technique and tool for optimizing the performance of floating-point and fixed-point arithmetic kernels. Our technique combines rewriting and mixed-precision tuning. Rewriting searches through different evaluation orders to find one which minimizes the roundoff error at no additional runtime cost. Mixed-precision tuning assigns different finite precisions to different variables and operations and thus provides finer-grained control than uniform precision. We show that when these two techniques are designed and applied together, they can provide higher performance improvements than each alone.

cs.PL