20,046 results on '"Kulkarni, P."'
Search Results
2. From Bits to Qubits: Challenges in Classical-Quantum Integration
- Author
-
Kulkarni, Sudhanshu Pravin, Huang, Daniel E., and Bethel, E. Wes
- Subjects
Computer Science - Emerging Technologies ,Quantum Physics - Abstract
While quantum computing holds immense potential for tackling previously intractable problems, its current practicality remains limited. A critical aspect of realizing quantum utility is the ability to efficiently interface with data from the classical world. This research focuses on the crucial phase of quantum encoding, which enables the transformation of classical information into quantum states for processing within quantum systems. We focus on three prominent encoding models: Phase Encoding, Qubit Lattice, and Flexible Representation of Quantum Images (FRQI) for cost and efficiency analysis. The aim of quantifying their different characteristics is to analyze their impact on quantum processing workflows. This comparative analysis offers valuable insights into their limitations and potential to accelerate the development of practical quantum computing solutions., Comment: 11 Pages, 13 Figures, In press: 31st IEEE International Conference on High Performance Computing, Data, and Analytics (HiPC) - 2024
- Published
- 2025
3. The BTSbot-nearby discovery of SN 2024jlf: rapid, autonomous follow-up probes interaction in an 18.5 Mpc Type IIP supernova
- Author
-
Rehemtulla, Nabeel, Jacobson-Galán, W. V., Singh, Avinash, Miller, Adam A., Kilpatrick, Charles D., Hinds, K-Ryan, Liu, Chang, Schulze, Steve, Sollerman, Jesper, Laz, Theophile Jegou du, Ahumada, Tomás, Auchettl, Katie, Brennan, S. J., Coughlin, Michael W., Fremling, Christoffer, Gangopadhyay, Anjasha, Perley, Daniel A., Prusinski, Nikolaus Z., Purdum, Josiah, Qin, Yu-Jing, Romagnoli, Sara, Shi, Jennifer, Wise, Jacob L., Chen, Tracy X., Groom, Steven L., Jones, David O., Kasliwal, Mansi M., Smith, Roger, Sravan, Niharika, and Kulkarni, Shrinivas R.
- Subjects
Astrophysics - High Energy Astrophysical Phenomena - Abstract
We present observations of the Type IIP supernova (SN) 2024jlf, including spectroscopy beginning just 0.7 days ($\sim$17 hours) after first light. Rapid follow-up was enabled by the new $\texttt{BTSbot-nearby}$ program, which involves autonomously triggering target-of-opportunity requests for new transients in Zwicky Transient Facility data that are coincident with nearby ($D<60$ Mpc) galaxies and identified by the $\texttt{BTSbot}$ machine learning model. Early photometry and non-detections shortly prior to first light show that SN 2024jlf initially brightened by $>$4 mag/day, quicker than $\sim$90% of Type II SNe. Early spectra reveal weak flash ionization features: narrow, short-lived ($1.3 < \tau ~\mathrm{[d]} < 1.8$) emission lines of H$\alpha$, He II, and C IV. Assuming a wind velocity of $v_w=50$ km s$^{-1}$, these properties indicate that the red supergiant progenitor exhibited enhanced mass-loss in the last year before explosion. We constrain the mass-loss rate to $10^{-4} < \dot{M}~\mathrm{[M_\odot~yr^{-1}]} < 10^{-3}$ by matching observations to model grids from two independent radiative hydrodynamics codes. $\texttt{BTSbot-nearby}$ automation minimizes spectroscopic follow-up latency, enabling the observation of ephemeral early-time phenomena exhibited by transients., Comment: 23 pages, 9 figures
- Published
- 2025
4. Deceptive Sequential Decision-Making via Regularized Policy Optimization
- Author
-
Kim, Yerin, Benvenuti, Alexander, Chen, Bo, Karabag, Mustafa, Kulkarni, Abhishek, Bastian, Nathaniel D., Topcu, Ufuk, and Hale, Matthew
- Subjects
Computer Science - Machine Learning ,Mathematics - Optimization and Control - Abstract
Autonomous systems are increasingly expected to operate in the presence of adversaries, though an adversary may infer sensitive information simply by observing a system, without even needing to interact with it. Therefore, in this work we present a deceptive decision-making framework that not only conceals sensitive information, but in fact actively misleads adversaries about it. We model autonomous systems as Markov decision processes, and we consider adversaries that attempt to infer their reward functions using inverse reinforcement learning. To counter such efforts, we present two regularization strategies for policy synthesis problems that actively deceive an adversary about a system's underlying rewards. The first form of deception is ``diversionary'', and it leads an adversary to draw any false conclusion about what the system's reward function is. The second form of deception is ``targeted'', and it leads an adversary to draw a specific false conclusion about what the system's reward function is. We then show how each form of deception can be implemented in policy optimization problems, and we analytically bound the loss in total accumulated reward that is induced by deception. Next, we evaluate these developments in a multi-agent sequential decision-making problem with one real agent and multiple decoys. We show that diversionary deception can cause the adversary to believe that the most important agent is the least important, while attaining a total accumulated reward that is $98.83\%$ of its optimal, non-deceptive value. Similarly, we show that targeted deception can make any decoy appear to be the most important agent, while still attaining a total accumulated reward that is $99.25\%$ of its optimal, non-deceptive value., Comment: 21 pages, 5 figures
- Published
- 2025
5. Dynamic Coalitions in Games on Graphs with Preferences over Temporal Goals
- Author
-
Yilmaz, A. Kaan Ata, Kulkarni, Abhishek, and Topcu, Ufuk
- Subjects
Computer Science - Computer Science and Game Theory - Abstract
In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies that jointly determine which coalitions should form and the actions coalition members should choose to satisfy their preferences in a subclass of deterministic multiplayer games on graphs. In these games, a leader decides the coalition during each round and the players not in the coalition follow their admissible strategies. Our contributions are threefold. First, we extend the concept of admissibility to games on graphs with preferences and characterize it using maximal sure winning, a concept originally defined for adversarial two-player games with preferences. Second, we define a value function that assigns a vector to each state, identifying which player has a maximal sure winning strategy for certain subset of objectives. Finally, we present a polynomial-time algorithm to synthesize admissible strategies for all players based on this value function and prove their existence in all games within the chosen subclass. We illustrate the benefits of dynamic coalitions over fixed ones in a blocks-world domain. Interestingly, our experiment reveals that aligned preferences do not always encourage cooperation, while conflicting preferences do not always lead to adversarial behavior., Comment: 9 pages, 3 figures
- Published
- 2025
6. DebiasPI: Inference-time Debiasing by Prompt Iteration of a Text-to-Image Generative Model
- Author
-
Bonna, Sarah, Huang, Yu-Cheng, Novozhilova, Ekaterina, Paik, Sejin, Shan, Zhengyang, Feng, Michelle Yilin, Gao, Ge, Tayal, Yonish, Kulkarni, Rushil, Yu, Jialin, Divekar, Nupur, Ghadiyaram, Deepti, Wijaya, Derry, and Betke, Margrit
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence ,Computer Science - Graphics ,Computer Science - Human-Computer Interaction ,Computer Science - Machine Learning - Abstract
Ethical intervention prompting has emerged as a tool to counter demographic biases of text-to-image generative AI models. Existing solutions either require to retrain the model or struggle to generate images that reflect desired distributions on gender and race. We propose an inference-time process called DebiasPI for Debiasing-by-Prompt-Iteration that provides prompt intervention by enabling the user to control the distributions of individuals' demographic attributes in image generation. DebiasPI keeps track of which attributes have been generated either by probing the internal state of the model or by using external attribute classifiers. Its control loop guides the text-to-image model to select not yet sufficiently represented attributes, With DebiasPI, we were able to create images with equal representations of race and gender that visualize challenging concepts of news headlines. We also experimented with the attributes age, body type, profession, and skin tone, and measured how attributes change when our intervention prompt targets the distribution of an unrelated attribute type. We found, for example, if the text-to-image model is asked to balance racial representation, gender representation improves but the skin tone becomes less diverse. Attempts to cover a wide range of skin colors with various intervention prompts showed that the model struggles to generate the palest skin tones. We conducted various ablation studies, in which we removed DebiasPI's attribute control, that reveal the model's propensity to generate young, male characters. It sometimes visualized career success by generating two-panel images with a pre-success dark-skinned person becoming light-skinned with success, or switching gender from pre-success female to post-success male, thus further motivating ethical intervention prompting with DebiasPI., Comment: This work was presented at The European Conference on Computer Vision (ECCV) 2024 Workshop "Fairness and ethics towards transparent AI: facing the chalLEnge through model Debiasing" (FAILED), Milano, Italy, on September 29, 2024, https://failed-workshop-eccv-2024.github.io
- Published
- 2025
7. Graph of Attacks with Pruning: Optimizing Stealthy Jailbreak Prompt Generation for Enhanced LLM Content Moderation
- Author
-
Schwartz, Daniel, Bespalov, Dmitriy, Wang, Zhe, Kulkarni, Ninad, and Qi, Yanjun
- Subjects
Computer Science - Cryptography and Security ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
We present a modular pipeline that automates the generation of stealthy jailbreak prompts derived from high-level content policies, enhancing LLM content moderation. First, we address query inefficiency and jailbreak strength by developing Graph of Attacks with Pruning (GAP), a method that utilizes strategies from prior jailbreaks, resulting in 92% attack success rate on GPT-3.5 using only 54% of the queries of the prior algorithm. Second, we address the cold-start issue by automatically generating seed prompts from the high-level policy using LLMs. Finally, we demonstrate the utility of these generated jailbreak prompts of improving content moderation by fine-tuning PromptGuard, a model trained to detect jailbreaks, increasing its accuracy on the Toxic-Chat dataset from 5.1% to 93.89%., Comment: 15 pages, 7 figures
- Published
- 2025
8. When Everyday Devices Become Weapons: A Closer Look at the Pager and Walkie-talkie Attacks
- Author
-
Sarker, Pantha Protim, Das, Upoma, Varshney, Nitin, Shi, Shang, Kulkarni, Akshay, Farahmandi, Farimah, and Tehranipoor, Mark
- Subjects
Computer Science - Cryptography and Security - Abstract
Battery-powered technologies like pagers and walkie-talkies have long been integral to civilian and military operations. However, the potential for such everyday devices to be weaponized has largely been underestimated in the realm of cybersecurity. In September 2024, Lebanon experienced a series of unprecedented, coordinated explosions triggered through compromised pagers and walkie-talkies, creating a new category of attack in the domain of cyber-physical warfare. This attack not only disrupted critical communication networks but also resulted in injuries, loss of life, and exposed significant national security vulnerabilities, prompting governments and organizations worldwide to reevaluate their cybersecurity frameworks. This article provides an in-depth investigation into the infamous Pager and Walkie-Talkie attacks, analyzing both technical and non-technical dimensions. Furthermore, the study extends its scope to explore vulnerabilities in other battery-powered infrastructures, such as battery management systems, highlighting their potential exploitation. Existing prevention and detection techniques are reviewed, with an emphasis on their limitations and the challenges they face in addressing emerging threats. Finally, the article discusses emerging methodologies, particularly focusing on the role of physical inspection, as a critical component of future security measures. This research aims to provide actionable insights to bolster the resilience of cyber-physical systems in an increasingly interconnected world., Comment: 18 pages, 10 figures
- Published
- 2025
9. Explainable Machine Learning: An Illustration of Kolmogorov-Arnold Network Model for Airfoil Lift Prediction
- Author
-
Kulkarni, Sudhanva
- Subjects
Computer Science - Machine Learning - Abstract
Data science has emerged as fourth paradigm of scientific exploration. However many machine learning models operate as black boxes offering limited insight into the reasoning behind their predictions. This lack of transparency is one of the drawbacks to generate new knowledge from data. Recently Kolmogorov-Arnold Network or KAN has been proposed as an alternative model which embeds explainable AI. This study demonstrates the potential of KAN for new scientific exploration. KAN along with five other popular supervised machine learning models are applied to the well-known problem of airfoil lift prediction in aerospace engineering. Standard data generated from an earlier study on 2900 different airfoils is used. KAN performed the best with an R2 score of 96.17 percent on the test data, surpassing both the baseline model and Multi Layer Perceptron. Explainability of KAN is shown by pruning and symbolizing the model resulting in an equation for coefficient of lift in terms of input variables. The explainable information retrieved from KAN model is found to be consistent with the known physics of lift generation by airfoil thus demonstrating its potential to aid in scientific exploration., Comment: 3 pages, 2 tables, 3 figures
- Published
- 2025
10. Privacy-aware Nash Equilibrium Synthesis with Partially Ordered LTL$_f$ Objectives
- Author
-
Probine, Caleb, Kulkarni, Abhishek, and Topcu, Ufuk
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Logic in Computer Science - Abstract
Nash equilibrium is a fundamental solution concept for modeling the behavior of self-interested agents. We develop an algorithm to synthesize pure Nash equilibria in two-player deterministic games on graphs where players have partial preferences over objectives expressed with linear temporal logic over finite traces. Previous approaches for Nash equilibrium synthesis assume that players' preferences are common knowledge. Instead, we allow players' preferences to remain private but enable communication between players. The algorithm we design synthesizes Nash equilibria for a complete-information game, but synthesizes these equilibria in an incomplete-information setting where players' preferences are private. The algorithm is privacy-aware, as instead of requiring that players share private preferences, the algorithm reduces the information sharing to a query interface. Through this interface, players exchange information about states in the game from which they can enforce a more desirable outcome. We prove the algorithm's completeness by showing that it either returns an equilibrium or certifies that one does not exist. We then demonstrate, via numerical examples, the existence of games where the queries the players exchange are insufficient to reconstruct players' preferences, highlighting the privacy-aware nature of the algorithm we propose., Comment: 13 pages, 6 figures
- Published
- 2025
11. Sequential Decision Making in Stochastic Games with Incomplete Preferences over Temporal Objectives
- Author
-
Kulkarni, Abhishek Ninad, Fu, Jie, and Topcu, Ufuk
- Subjects
Computer Science - Computer Science and Game Theory ,Computer Science - Formal Languages and Automata Theory - Abstract
Ensuring that AI systems make strategic decisions aligned with the specified preferences in adversarial sequential interactions is a critical challenge for developing trustworthy AI systems, especially when the environment is stochastic and players' incomplete preferences leave some outcomes unranked. We study the problem of synthesizing preference-satisfying strategies in two-player stochastic games on graphs where players have opposite (possibly incomplete) preferences over a set of temporal goals. We represent these goals using linear temporal logic over finite traces (LTLf), which enables modeling the nuances of human preferences where temporal goals need not be mutually exclusive and comparison between some goals may be unspecified. We introduce a solution concept of non-dominated almost-sure winning, which guarantees to achieve a most preferred outcome aligned with specified preferences while maintaining robustness against the adversarial behaviors of the opponent. Our results show that strategy profiles based on this concept are Nash equilibria in the game where players are risk-averse, thus providing a practical framework for evaluating and ensuring stable, preference-aligned outcomes in the game. Using a drone delivery example, we demonstrate that our contributions offer valuable insights not only for synthesizing rational behavior under incomplete preferences but also for designing games that motivate the desired behavior from the players in adversarial conditions., Comment: 9 pages, 3 figures, accepted at AAAI 2025 (AI alignment track)
- Published
- 2025
12. Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback?
- Author
-
Sullivan, James, Haiman, Zoltan, Kulkarni, Mihir, and Visbal, Eli
- Subjects
Astrophysics - Astrophysics of Galaxies ,Astrophysics - Cosmology and Nongalactic Astrophysics - Abstract
Population III stars are possible precursors to early massive and supermassive black holes (BHs). The presence of soft UV Lyman Werner (LW) background radiation can suppress Population III star formation in minihalos and allow them to form in pristine atomic cooling halos. In the absence of molecular hydrogen ($\rm H_2$) cooling, atomic-cooling halos enable rapid collapse with suppressed fragmentation. High background LW fluxes from preceding star-formation have been proposed to dissociate $\rm H_2$. This flux can be supplemented by LW radiation from one or more Population III star(s) in the same halo, reducing the necessary background level. Here we consider atomic-cooling halos in which multiple protostellar cores form close to one another nearly simultaneously. We assess whether the first star's LW radiation can dissociate nearby $\rm H_2$, enabling the prompt formation of a second, supermassive star (SMS) from warm, atomically-cooled gas. We use a set of hydrodynamical simulations with the code ENZO, with identical LW backgrounds centered on a halo with two adjacent collapsing gas clumps. When an additional large local LW flux is introduced, we observe immediate reductions in both the accretion rates and the stellar masses that form within these clumps. While the LW flux reduces the $\text{H}_2$ fraction and increases the gas temperature, the halo core's potential well is too shallow to promptly heat the gas to $\gtrsim$ 1000 K and increase the accretion rate onto the second protostar. We conclude that internal LW feedback inside atomic-cooling halos is unlikely to facilitate the formation of SMSs or massive BH seeds., Comment: 19 pages, 21 figures, and 1 table
- Published
- 2025
13. Quantum trajectories and Page-curve entanglement dynamics
- Author
-
Ganguly, Katha, Gopalakrishnan, Preethi, Naik, Atharva, Agarwalla, Bijay Kumar, and Kulkarni, Manas
- Subjects
Condensed Matter - Statistical Mechanics ,Condensed Matter - Mesoscale and Nanoscale Physics ,Condensed Matter - Quantum Gases ,High Energy Physics - Theory ,Quantum Physics - Abstract
We consider time dynamics of entanglement entropy between a filled fermionic system and an empty reservoir. We consider scenarios (i) where the system is subjected to a dephasing mechanism and the reservoir is clean, thereby emulating expansion of effectively interacting fermions in vacuum, and (ii) where both the system and the reservoir are subjected to dephasing and thereby enabling us to address how the entanglement between the part of the effectively interacting system and its complement evolves in time. We consider two different kinds of quantum trajectory approaches, namely stochastic unitary unraveling and quantum state diffusion. For both protocols, we observe and characterize the full Page curve-like dynamics for the entanglement entropy. Depending on the protocol and the setup, we observe very distinct characteristics of the Page curve and the associated Page time and Page value. We also compute the number of fermions leaking to the reservoir and the associated current and shed light on their plausible connections with entanglement entropy. Our findings are expected to hold for a wide variety of generic interacting quantum systems., Comment: 18 pages, 8 figures (including supplementary material)
- Published
- 2025
14. Unsupervised Rhythm and Voice Conversion of Dysarthric to Healthy Speech for ASR
- Author
-
Hajal, Karl El, Hermann, Enno, Kulkarni, Ajinkya, and -Doss, Mathew Magimai.
- Subjects
Electrical Engineering and Systems Science - Audio and Speech Processing ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning ,Computer Science - Sound - Abstract
Automatic speech recognition (ASR) systems are well known to perform poorly on dysarthric speech. Previous works have addressed this by speaking rate modification to reduce the mismatch with typical speech. Unfortunately, these approaches rely on transcribed speech data to estimate speaking rates and phoneme durations, which might not be available for unseen speakers. Therefore, we combine unsupervised rhythm and voice conversion methods based on self-supervised speech representations to map dysarthric to typical speech. We evaluate the outputs with a large ASR model pre-trained on healthy speech without further fine-tuning and find that the proposed rhythm conversion especially improves performance for speakers of the Torgo corpus with more severe cases of dysarthria. Code and audio samples are available at https://idiap.github.io/RnV ., Comment: Accepted at ICASSP 2025 Satellite Workshop: Workshop on Speech Pathology Analysis and DEtection (SPADE)
- Published
- 2025
15. Automatically Detecting Heterogeneous Bugs in High-Performance Computing Scientific Software
- Author
-
Davis, Matthew, Kulkarni, Aakash, Chen, Ziyan, Qiao, Yunhan, Terrazas, Christopher, and Motwani, Manish
- Subjects
Computer Science - Software Engineering - Abstract
Scientific advancements rely on high-performance computing (HPC) applications that model real-world phenomena through simulations. These applications process vast amounts of data on specialized accelerators (eg., GPUs) using special libraries. Heterogeneous bugs occur in these applications when managing data movement across different platforms, such as CPUs and GPUs, leading to divergent behavior when using heterogeneous platforms compared to using only CPUs. Existing software testing techniques often fail to detect such bugs because either they do not account for platform-specific characteristics or target specific platforms. To address this problem, we present HeteroBugDetect, an automated approach to detect platform-dependent heterogeneous bugs in HPC scientific applications. HeteroBugDetect combines natural-language processing, off-target testing, custom fuzzing, and differential testing to provide an end-to-end solution for detecting platform-specific bugs in scientific applications. We evaluate HeteroBugDetect on LAMMPS, a molecular dynamics simulator, where it detected multiple heterogeneous bugs, enhancing its reliability across diverse HPC environments.
- Published
- 2025
16. On Round Surgery Diagrams For 3-Manifolds
- Author
-
Deep, Prerak and Kulkarni, Dheeraj
- Subjects
Mathematics - Geometric Topology ,57K30 (Primary) 57R65 (Secondary) - Abstract
We introduce the notion of round surgery diagrams in $S^3$ for representing 3-manifolds similar to Dehn surgery diagrams. We give a correspondence between a certain class of round surgery diagrams and Dehn surgery diagrams for 3-manifolds. As a consequence, we recover Asimov's result, stating that any closed connected oriented 3-manifold can be obtained by a round surgery on a framed link in $S^3$. There may be more than one round surgery diagram giving rise to the same 3-manifold. Thus, it is natural to ask whether there is a version of Kirby Calculus for round surgery diagrams, similar to the case of Dehn surgery diagrams with integral framings. In this direction, we define four types of moves on round surgery diagrams such that any two round surgery diagrams corresponding to the same 3-manifold can be obtained one from another by a finite sequence of these moves, thereby establishing a version of Kirby Calculus. As an application, we prove the existence of taut foliations, hence the existence of tight contact structures on 3-manifolds obtained by round 1-surgery on fibred links with two components on $S^3$., Comment: 33 pages, 32 figures
- Published
- 2025
17. Average-Reward Reinforcement Learning with Entropy Regularization
- Author
-
Adamczyk, Jacob, Makarenko, Volodymyr, Tiomkin, Stas, and Kulkarni, Rahul V.
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
The average-reward formulation of reinforcement learning (RL) has drawn increased interest in recent years due to its ability to solve temporally-extended problems without discounting. Independently, RL algorithms have benefited from entropy-regularization: an approach used to make the optimal policy stochastic, thereby more robust to noise. Despite the distinct benefits of the two approaches, the combination of entropy regularization with an average-reward objective is not well-studied in the literature and there has been limited development of algorithms for this setting. To address this gap in the field, we develop algorithms for solving entropy-regularized average-reward RL problems with function approximation. We experimentally validate our method, comparing it with existing algorithms on standard benchmarks for RL., Comment: Accepted at the AAAI-25 Eighth Workshop on Bridging the Gap Between AI Planning and Reinforcement Learning (PRL)
- Published
- 2025
18. EVAL: EigenVector-based Average-reward Learning
- Author
-
Adamczyk, Jacob, Makarenko, Volodymyr, Tiomkin, Stas, and Kulkarni, Rahul V.
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
In reinforcement learning, two objective functions have been developed extensively in the literature: discounted and averaged rewards. The generalization to an entropy-regularized setting has led to improved robustness and exploration for both of these objectives. Recently, the entropy-regularized average-reward problem was addressed using tools from large deviation theory in the tabular setting. This method has the advantage of linearity, providing access to both the optimal policy and average reward-rate through properties of a single matrix. In this paper, we extend that framework to more general settings by developing approaches based on function approximation by neural networks. This formulation reveals new theoretical insights into the relationship between different objectives used in RL. Additionally, we combine our algorithm with a posterior policy iteration scheme, showing how our approach can also solve the average-reward RL problem without entropy-regularization. Using classic control benchmarks, we experimentally find that our method compares favorably with other algorithms in terms of stability and rate of convergence., Comment: Accepted at the AAAI-25 8th Workshop on Generalization in Planning. arXiv admin note: text overlap with arXiv:2501.09080
- Published
- 2025
19. Hierarchical Repository-Level Code Summarization for Business Applications Using Local LLMs
- Author
-
Dhulshette, Nilesh, Shah, Sapan, and Kulkarni, Vinay
- Subjects
Computer Science - Software Engineering ,Computer Science - Artificial Intelligence - Abstract
In large-scale software development, understanding the functionality and intent behind complex codebases is critical for effective development and maintenance. While code summarization has been widely studied, existing methods primarily focus on smaller code units, such as functions, and struggle with larger code artifacts like files and packages. Additionally, current summarization models tend to emphasize low-level implementation details, often overlooking the domain and business context that are crucial for real-world applications. This paper proposes a two-step hierarchical approach for repository-level code summarization, tailored to business applications. First, smaller code units such as functions and variables are identified using syntax analysis and summarized with local LLMs. These summaries are then aggregated to generate higher-level file and package summaries. To ensure the summaries are grounded in business context, we design custom prompts that capture the intended purpose of code artifacts based on the domain and problem context of the business application. We evaluate our approach on a business support system (BSS) for the telecommunications domain, showing that syntax analysis-based hierarchical summarization improves coverage, while business-context grounding enhances the relevance of the generated summaries., Comment: To appear at LLM4Code@ICSE 2025
- Published
- 2025
20. DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
- Author
-
Chee, Jerry, Backurs, Arturs, Heck, Rainie, Zhang, Li, Kulkarni, Janardhan, Rothvoss, Thomas, and Gopi, Sivakanth
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Data Structures and Algorithms - Abstract
Quantizing the weights of a neural network has two steps: (1) Finding a good low bit-complexity representation for weights (which we call the quantization grid) and (2) Rounding the original weights to values in the quantization grid. In this paper, we study the problem of rounding optimally given any quantization grid. The simplest and most commonly used way to round is Round-to-Nearest (RTN). By rounding in a data-dependent way instead, one can improve the quality of the quantized model significantly. We study the rounding problem from the lens of \emph{discrepancy theory}, which studies how well we can round a continuous solution to a discrete solution without affecting solution quality too much. We prove that given $m=\mathrm{poly}(1/\epsilon)$ samples from the data distribution, we can round all but $O(m)$ model weights such that the expected approximation error of the quantized model on the true data distribution is $\le \epsilon$ as long as the space of gradients of the original model is approximately low rank (which we empirically validate). Our proof, which is algorithmic, inspired a simple and practical rounding algorithm called \emph{DiscQuant}. In our experiments, we demonstrate that DiscQuant significantly improves over the prior state-of-the-art rounding method called GPTQ and the baseline RTN over a range of benchmarks on Phi3mini-3.8B and Llama3.1-8B. For example, rounding Phi3mini-3.8B to a fixed quantization grid with 3.25 bits per parameter using DiscQuant gets 64\% accuracy on the GSM8k dataset, whereas GPTQ achieves 54\% and RTN achieves 31\% (the original model achieves 84\%). We make our code available at https://github.com/jerry-chee/DiscQuant.
- Published
- 2025
21. Enhanced Rooftop Solar Panel Detection by Efficiently Aggregating Local Features
- Author
-
Kurte, Kuldeep and Kulkarni, Kedar
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
In this paper, we present an enhanced Convolutional Neural Network (CNN)-based rooftop solar photovoltaic (PV) panel detection approach using satellite images. We propose to use pre-trained CNN-based model to extract the local convolutional features of rooftops. These local features are then combined using the Vectors of Locally Aggregated Descriptors (VLAD) technique to obtain rooftop-level global features, which are then used to train traditional Machine Learning (ML) models to identify rooftop images that do and do not contain PV panels. On the dataset used in this study, the proposed approach achieved rooftop-PV classification scores exceeding the predefined threshold of 0.9 across all three cities for each of the feature extractor networks evaluated. Moreover, we propose a 3-phase approach to enable efficient utilization of the previously trained models on a new city or region with limited labelled data. We illustrate the effectiveness of this 3-phase approach for multi-city rooftop-PV detection task., Comment: Accepted at CODS-COMAD 2024, December, 2024, Jodhpur, India (https://cods-comad.in/accepted-papers.php)
- Published
- 2025
22. Multi-Wavelength Analysis of AT 2023sva: a Luminous Orphan Afterglow With Evidence for a Structured Jet
- Author
-
Srinivasaragavan, Gokul P., Perley, Daniel A., Ho, Anna Y. Q., O'Connor, Brendan, Postigo, Antonio de Ugarte, Sarin, Nikhil, Cenko, S. Bradley, Sollerman, Jesper, Rhodes, Lauren, Green, David A., Svinkin, Dmitry S., Bhalerao, Varun, Waratkar, Gaurav, Nayana, A. J., Chandra, Poonam, Miller, M. Coleman, Malesani, Daniele B., Ryan, Geoffrey, Srijan, Suryansh, Bellm, Eric C., Burns, Eric, Titterington, David J., Stone, Maria B., Purdum, Josiah, Ahumada, Tomás, Anupama, G. C., Barway, Sudhanshu, Coughlin, Michael W., Drake, Andrew, Fender, Rob, Fernández, José F. AgüÍ, Frederiks, Dmitry D., Geier, Stefan, Graham, Matthew J., Kasliwal, Mansi M., Kulkarni, S. R., Kumar, Harsh, Li, Maggie L., Laher, Russ R., Lysenko, Alexandra L., Parwani, Gopal, Perley, Richard A., Ridnaia, Anna V., Salgundi, Anirudh, Smith, Roger, Sravan, Niharika, Swain, Vishwajeet, Thöne, Christina C., Tsvetkova, Anastasia E., Ulanov, Mikhail V., Vail, Jada, Wise, Jacob L., and Wold, Avery
- Subjects
Astrophysics - High Energy Astrophysical Phenomena - Abstract
We present multi-wavelength analysis of ZTF23abelseb (AT 2023sva), an optically discovered fast-fading ($\Delta m_r = 2.2$ mag in $\Delta t = 0.74 $ days), luminous ($M_r \sim -30.0$ mag) and red ($g-r = 0.50$ mag) transient at $z = 2.28$ with accompanying luminous radio emission. AT 2023sva does not possess a $\gamma$-ray burst (GRB) counterpart to an isotropic equivalent energy limit of $E_{\rm{\gamma, \, iso}} < 1.6 \times 10^{52}$ erg, determined through searching $\gamma$-ray satellite archives between the last non-detection and first detection, making it the sixth example of an optically-discovered afterglow with a redshift measurement and no detected GRB counterpart. We analyze AT 2023sva's optical, radio, and X-ray observations to characterize the source. From radio analyses, we find the clear presence of strong interstellar scintillation (ISS) 72 days after the initial explosion, allowing us to place constraints on the source's angular size and bulk Lorentz factor. When comparing the source sizes derived from ISS of orphan events to those of the classical GRB population, we find orphan events have statistically smaller source sizes. We also utilize Bayesian techniques to model the multi-wavelength afterglow. Within this framework, we find evidence that AT 2023sva possesses a shallow power-law structured jet viewed slightly off-axis ($\theta_{\rm{v}} = 0.07 \pm 0.02$) just outside of the jet's core opening angle ($\theta_{\rm{c}} = 0.06 \pm 0.02$). We determine this is likely the reason for the lack of a detected GRB counterpart, but also investigate other scenarios. AT 2023sva's evidence for possessing a structured jet stresses the importance of broadening orphan afterglow search strategies to a diverse range of GRB jet angular energy profiles, to maximize the return of future optical surveys., Comment: 22 pages, 14 Figures, Submitted to MNRAS
- Published
- 2025
23. The Solar Ultraviolet Imaging Telescope on board Aditya-L1
- Author
-
Tripathi, Durgesh, Ramaprakash, A. N., Padinhatteeri, Sreejith, Sarkar, Janmejoy, Burse, Mahesh, Tyagi, Anurag, Kesharwani, Ravi, Sinha, Sakya, Joshi, Bhushan, Deogaonkar, Rushikesh, Roy, Soumya, Nived, V. N., Gopalakrishnan, Rahul, Kulkarni, Akshay, Khan, Aafaque, Ghosh, Avyarthana, Rajarshi, Chaitanya, Modi, Deepa, Kumar, Ghanshyam, Yadav, Reena, Varma, Manoj, Bayanna, Raja, Chordia, Pravin, Karmakar, Mintu, Abraham, Linn, Adithya, H. N., Adoni, Abhijit, Ahmed, Gazi A., Banerjee, Dipankar, Ram, Bhargava, Bhandare, Rani, Chatterjee, Subhamoy, Chillal, Kalpesh, Dey, Arjun, Gandorfer, Achim, Gowda, Girish, Haridas, T. R., Jain, Anand, James, Melvin, Jayakumar, R. P., Justin, Evangeline Leeja, K., Nagaraju, Kathait, Deepak, Khodade, Pravin, Kiran, Mandeep, Kohok, Abhay, Krivova, Natalie, Kumar, Nishank, Mehandiratta, Nidhi, Mestry, Vilas, Motamarri, Srikanth, Mustafa, Sajjade F., Nandy, Dibyendu, Narendra, S., Navle, Sonal, Parate, Nashiket, Pillai, Anju M, Punnadi, Sujit, Rajendra, A., Ravi, A., Raha, Bijoy, Sankarasubramanian, K., Sarvar, Ghulam, Shaji, Nigar, Sharma, Nidhi, Singh, Aditya, Singh, Shivam, Solanki, Sami K., Subramanian, Vivek, T, Rethika, T, Srikanth, Thatimattala, Satyannarayana, Tota, Hari Krishna, TS, Vishnu, Unnikrishnan, Amrita, Vadodariya, Kaushal, Veeresha, D. R., and Venkateswaran, R.
- Subjects
Astrophysics - Solar and Stellar Astrophysics ,Astrophysics - Instrumentation and Methods for Astrophysics - Abstract
The Solar Ultraviolet Imaging Telescope (SUIT) is an instrument on the Aditya-L1 mission of the Indian Space Research Organization (ISRO) launched on September 02, 2023. SUIT continuously provides, near-simultaneous full-disk and region-of-interest images of the Sun, slicing through the photosphere and chromosphere and covering a field of view up to 1.5 solar radii. For this purpose, SUIT uses 11 filters tuned at different wavelengths in the 200{--}400~nm range, including the Mg~{\sc ii} h~and~k and Ca~{\sc ii}~H spectral lines. The observations made by SUIT help us understand the magnetic coupling of the lower and middle solar atmosphere. In addition, for the first time, it allows the measurements of spatially resolved solar broad-band radiation in the near and mid ultraviolet, which will help constrain the variability of the solar ultraviolet irradiance in a wavelength range that is central for the chemistry of the Earth's atmosphere. This paper discusses the details of the instrument and data products., Comment: 37 pages, Accepted for Publication in Solar Physics
- Published
- 2025
24. Search for continuous gravitational waves from known pulsars in the first part of the fourth LIGO-Virgo-KAGRA observing run
- Author
-
The LIGO Scientific Collaboration, the Virgo Collaboration, the KAGRA Collaboration, Abac, A. G., Abbott, R., Abouelfettouh, I., Acernese, F., Ackley, K., Adhicary, S., Adhikari, N., Adhikari, R. X., Adkins, V. K., Agarwal, D., Agathos, M., Abchouyeh, M. Aghaei, Aguiar, O. D., Aguilar, I., Aiello, L., Ain, A., Ajith, P., Akutsu, T., Albanesi, S., Alfaidi, R. A., Al-Jodah, A., Alléné, C., Allocca, A., Al-Shammari, S., Altin, P. A., Alvarez-Lopez, S., Amato, A., Amez-Droz, L., Amorosi, A., Amra, C., Ananyeva, A., Anderson, S. B., Anderson, W. G., Andia, M., Ando, M., Andrade, T., Andres, N., Andrés-Carcasona, M., Andrić, T., Anglin, J., Ansoldi, S., Antelis, J. M., Antier, S., Aoumi, M., Appavuravther, E. Z., Appert, S., Apple, S. K., Arai, K., Araya, A., Araya, M. C., Areeda, J. S., Argianas, L., Aritomi, N., Armato, F., Arnaud, N., Arogeti, M., Aronson, S. M., Ashton, G., Aso, Y., Assiduo, M., Melo, S. Assis de Souza, Aston, S. M., Astone, P., Attadio, F., Aubin, F., AultONeal, K., Avallone, G., Babak, S., Badaracco, F., Badger, C., Bae, S., Bagnasco, S., Bagui, E., Baier, J. G., Baiotti, L., Bajpai, R., Baka, T., Ball, M., Ballardin, G., Ballmer, S. W., Banagiri, S., Banerjee, B., Bankar, D., Baral, P., Barayoga, J. C., Barish, B. C., Barker, D., Barneo, P., Barone, F., Barr, B., Barsotti, L., Barsuglia, M., Barta, D., Bartoletti, A. M., Barton, M. A., Bartos, I., Basak, S., Basalaev, A., Bassiri, R., Basti, A., Bates, D. E., Bawaj, M., Baxi, P., Bayley, J. C., Baylor, A. C., Baynard II, P. A., Bazzan, M., Bedakihale, V. M., Beirnaert, F., Bejger, M., Belardinelli, D., Bell, A. S., Benedetto, V., Benoit, W., Bentley, J. D., Yaala, M. Ben, Bera, S., Berbel, M., Bergamin, F., Berger, B. K., Bernuzzi, S., Beroiz, M., Bersanetti, D., Bertolini, A., Betzwieser, J., Beveridge, D., Bevins, N., Bhandare, R., Bhardwaj, U., Bhatt, R., Bhattacharjee, D., Bhaumik, S., Bhowmick, S., Bianchi, A., Bilenko, I. A., Billingsley, G., Binetti, A., Bini, S., Birnholtz, O., Biscoveanu, S., Bisht, A., Bitossi, M., Bizouard, M. -A., Blackburn, J. K., Blagg, L. A., Blair, C. D., Blair, D. G., Bobba, F., Bode, N., Boileau, G., Boldrini, M., Bolingbroke, G. N., Bolliand, A., Bonavena, L. D., Bondarescu, R., Bondu, F., Bonilla, E., Bonilla, M. S., Bonino, A., Bonnand, R., Booker, P., Borchers, A., Boschi, V., Bose, S., Bossilkov, V., Boudart, V., Boudon, A., Bozzi, A., Bradaschia, C., Brady, P. R., Braglia, M., Branch, A., Branchesi, M., Brandt, J., Braun, I., Breschi, M., Briant, T., Brillet, A., Brinkmann, M., Brockill, P., Brockmueller, E., Brooks, A. F., Brown, B. C., Brown, D. D., Brozzetti, M. L., Brunett, S., Bruno, G., Bruntz, R., Bryant, J., Bucci, F., Buchanan, J., Bulashenko, O., Bulik, T., Bulten, H. J., Buonanno, A., Burtnyk, K., Buscicchio, R., Buskulic, D., Buy, C., Byer, R. L., Davies, G. S. Cabourn, Cabras, G., Cabrita, R., Cáceres-Barbosa, V., Cadonati, L., Cagnoli, G., Cahillane, C., Bustillo, J. Calderón, Callister, T. A., Calloni, E., Camp, J. B., Canepa, M., Santoro, G. Caneva, Cannon, K. C., Cao, H., Capistran, L. A., Capocasa, E., Capote, E., Carapella, G., Carbognani, F., Carlassara, M., Carlin, J. B., Carpinelli, M., Carrillo, G., Carter, J. J., Carullo, G., Diaz, J. Casanueva, Casentini, C., Castro-Lucas, S. Y., Caudill, S., Cavaglià, M., Cavalieri, R., Cella, G., Cerdá-Durán, P., Cesarini, E., Chaibi, W., Chakraborty, P., Subrahmanya, S. Chalathadka, Chan, J. C. L., Chan, M., Chandra, K., Chang, R. -J., Chao, S., Charlton, E. L., Charlton, P., Chassande-Mottin, E., Chatterjee, C., Chatterjee, Debarati, Chatterjee, Deep, Chaturvedi, M., Chaty, S., Chen, A., Chen, A. H. -Y., Chen, D., Chen, H., Chen, H. Y., Chen, J., Chen, K. H., Chen, Y., Chen, Yanbei, Chen, Yitian, Cheng, H. P., Chessa, P., Cheung, H. T., Cheung, S. Y., Chiadini, F., Chiarini, G., Chierici, R., Chincarini, A., Chiofalo, M. L., Chiummo, A., Chou, C., Choudhary, S., Christensen, N., Chua, S. S. Y., Chugh, P., Ciani, G., Ciecielag, P., Cieślar, M., Cifaldi, M., Ciolfi, R., Clara, F., Clark, J. A., Clarke, J., Clarke, T. A., Clearwater, P., Clesse, S., Coccia, E., Codazzo, E., Cohadon, P. -F., Colace, S., Colleoni, M., Collette, C. G., Collins, J., Colloms, S., Colombo, A., Colpi, M., Compton, C. M., Connolly, G., Conti, L., Corbitt, T. R., Cordero-Carrión, I., Corezzi, S., Cornish, N. J., Corsi, A., Cortese, S., Costa, C. A., Cottingham, R., Coughlin, M. W., Couineaux, A., Coulon, J. -P., Countryman, S. T., Coupechoux, J. -F., Couvares, P., Coward, D. M., Cowart, M. J., Coyne, R., Craig, K., Creed, R., Creighton, J. D. E., Creighton, T. D., Cremonese, P., Criswell, A. W., Crockett-Gray, J. C. G., Crook, S., Crouch, R., Csizmazia, J., Cudell, J. R., Cullen, T. J., Cumming, A., Cuoco, E., Cusinato, M., Dabadie, P., Canton, T. Dal, Dall'Osso, S., Pra, S. Dal, Dálya, G., D'Angelo, B., Danilishin, S., D'Antonio, S., Danzmann, K., Darroch, K. E., Dartez, L. P., Dasgupta, A., Datta, S., Dattilo, V., Daumas, A., Davari, N., Dave, I., Davenport, A., Davier, M., Davies, T. F., Davis, D., Davis, L., Davis, M. C., Davis, P. J., Dax, M., De Bolle, J., Deenadayalan, M., Degallaix, J., De Laurentis, M., Deléglise, S., De Lillo, F., Dell'Aquila, D., Del Pozzo, W., De Marco, F., De Matteis, F., D'Emilio, V., Demos, N., Dent, T., Depasse, A., DePergola, N., De Pietri, R., De Rosa, R., De Rossi, C., DeSalvo, R., De Simone, R., Dhani, A., Diab, R., Díaz, M. C., Di Cesare, M., Dideron, G., Didio, N. A., Dietrich, T., Di Fiore, L., Di Fronzo, C., Di Giovanni, M., Di Girolamo, T., Diksha, D., Di Michele, A., Ding, J., Di Pace, S., Di Palma, I., Di Renzo, F., Divyajyoti, Dmitriev, A., Doctor, Z., Dohmen, E., Doleva, P. P., Dominguez, D., D'Onofrio, L., Donovan, F., Dooley, K. L., Dooney, T., Doravari, S., Dorosh, O., Drago, M., Driggers, J. C., Ducoin, J. -G., Dunn, L., Dupletsa, U., D'Urso, D., Duval, H., Duverne, P. -A., Dwyer, S. E., Eassa, C., Ebersold, M., Eckhardt, T., Eddolls, G., Edelman, B., Edo, T. B., Edy, O., Effler, A., Eichholz, J., Einsle, H., Eisenmann, M., Eisenstein, R. A., Ejlli, A., Eleveld, R. M., Emma, M., Endo, K., Engl, A. J., Enloe, E., Errico, L., Essick, R. C., Estellés, H., Estevez, D., Etzel, T., Evans, M., Evstafyeva, T., Ewing, B. E., Ezquiaga, J. M., Fabrizi, F., Faedi, F., Fafone, V., Fairhurst, S., Farah, A. M., Farr, B., Farr, W. M., Favaro, G., Favata, M., Fays, M., Fazio, M., Feicht, J., Fejer, M. M., Felicetti, R., Fenyvesi, E., Ferguson, D. L., Ferraiuolo, S., Ferrante, I., Ferreira, T. A., Fidecaro, F., Figura, P., Fiori, A., Fiori, I., Fishbach, M., Fisher, R. P., Fittipaldi, R., Fiumara, V., Flaminio, R., Fleischer, S. M., Fleming, L. S., Floden, E., Foley, E. M., Fong, H., Font, J. A., Fornal, B., Forsyth, P. W. F., Franceschetti, K., Franchini, N., Frasca, S., Frasconi, F., Mascioli, A. Frattale, Frei, Z., Freise, A., Freitas, O., Frey, R., Frischhertz, W., Fritschel, P., Frolov, V. V., Fronzé, G. G., Fuentes-Garcia, M., Fujii, S., Fujimori, T., Fulda, P., Fyffe, M., Gadre, B., Gair, J. R., Galaudage, S., Galdi, V., Gallagher, H., Gallardo, S., Gallego, B., Gamba, R., Gamboa, A., Ganapathy, D., Ganguly, A., Garaventa, B., García-Bellido, J., Núñez, C. García, García-Quirós, C., Gardner, J. W., Gardner, K. A., Gargiulo, J., Garron, A., Garufi, F., Gasbarra, C., Gateley, B., Gayathri, V., Gemme, G., Gennai, A., Gennari, V., George, J., George, R., Gerberding, O., Gergely, L., Ghosh, Archisman, Ghosh, Sayantan, Ghosh, Shaon, Ghosh, Shrobana, Ghosh, Suprovo, Ghosh, Tathagata, Giacoppo, L., Giaime, J. A., Giardina, K. D., Gibson, D. R., Gibson, D. T., Gier, C., Giri, P., Gissi, F., Gkaitatzis, S., Glanzer, J., Glotin, F., Godfrey, J., Godwin, P., Goebbels, N. L., Goetz, E., Golomb, J., Lopez, S. Gomez, Goncharov, B., Gong, Y., González, G., Goodarzi, P., Goode, S., Goodwin-Jones, A. W., Gosselin, M., Göttel, A. S., Gouaty, R., Gould, D. W., Govorkova, K., Goyal, S., Grace, B., Grado, A., Graham, V., Granados, A. E., Granata, M., Granata, V., Gras, S., Grassia, P., Gray, A., Gray, C., Gray, R., Greco, G., Green, A. C., Green, S. M., Green, S. R., Gretarsson, A. M., Gretarsson, E. M., Griffith, D., Griffiths, W. L., Griggs, H. L., Grignani, G., Grimaldi, A., Grimaud, C., Grote, H., Guerra, D., Guetta, D., Guidi, G. M., Guimaraes, A. R., Gulati, H. K., Gulminelli, F., Gunny, A. M., Guo, H., Guo, W., Guo, Y., Gupta, Anchal, Gupta, Anuradha, Gupta, Ish, Gupta, N. C., Gupta, P., Gupta, S. K., Gupta, T., Gupte, N., Gurs, J., Gutierrez, N., Guzman, F., H, H. -Y., Haba, D., Haberland, M., Haino, S., Hall, E. D., Hamilton, E. Z., Hammond, G., Han, W. -B., Haney, M., Hanks, J., Hanna, C., Hannam, M. D., Hannuksela, O. A., Hanselman, A. G., Hansen, H., Hanson, J., Harada, R., Hardison, A. R., Haris, K., Harmark, T., Harms, J., Harry, G. M., Harry, I. W., Hart, J., Haskell, B., Haster, C. -J., Hathaway, J. S., Haughian, K., Hayakawa, H., Hayama, K., Hayes, R., Heffernan, A., Heidmann, A., Heintze, M. C., Heinze, J., Heinzel, J., Heitmann, H., Hellman, F., Hello, P., Helmling-Cornell, A. F., Hemming, G., Henderson-Sapir, O., Hendry, M., Heng, I. S., Hennes, E., Henshaw, C., Hertog, T., Heurs, M., Hewitt, A. L., Heyns, J., Higginbotham, S., Hild, S., Hill, S., Himemoto, Y., Hirata, N., Hirose, C., Ho, W. C. G., Hoang, S., Hochheim, S., Hofman, D., Holland, N. A., Holley-Bockelmann, K., Holmes, Z. J., Holz, D. E., Honet, L., Hong, C., Hornung, J., Hoshino, S., Hough, J., Hourihane, S., Howell, E. J., Hoy, C. G., Hrishikesh, C. A., Hsieh, H. -F., Hsiung, C., Hsu, H. C., Hsu, W. -F., Hu, P., Hu, Q., Huang, H. Y., Huang, Y. -J., Huddart, A. D., Hughey, B., Hui, D. C. Y., Hui, V., Husa, S., Huxford, R., Huynh-Dinh, T., Iampieri, L., Iandolo, G. A., Ianni, M., Iess, A., Imafuku, H., Inayoshi, K., Inoue, Y., Iorio, G., Iqbal, M. H., Irwin, J., Ishikawa, R., Isi, M., Ismail, M. A., Itoh, Y., Iwanaga, H., Iwaya, M., Iyer, B. R., JaberianHamedan, V., Jacquet, C., Jacquet, P. -E., Jadhav, S. J., Jadhav, S. P., Jain, T., James, A. L., James, P. A., Jamshidi, R., Janquart, J., Janssens, K., Janthalur, N. N., Jaraba, S., Jaranowski, P., Jaume, R., Javed, W., Jennings, A., Jia, W., Jiang, J., Jin, H., Kubisz, J., Johanson, C., Johns, G. R., Johnson, N. A., Johnston, M. C., Johnston, R., Johny, N., Jones, D. H., Jones, D. I., Jones, R., Jose, S., Joshi, P., Ju, L., Jung, K., Junker, J., Juste, V., Kajita, T., Kaku, I., Kalaghatgi, C., Kalogera, V., Kamiizumi, M., Kanda, N., Kandhasamy, S., Kang, G., Kanner, J. B., Kapadia, S. J., Kapasi, D. P., Karat, S., Karathanasis, C., Kashyap, R., Kasprzack, M., Kastaun, W., Kato, T., Katsavounidis, E., Katzman, W., Kaushik, R., Kawabe, K., Kawamoto, R., Kazemi, A., Keitel, D., Kelley-Derzon, J., Kennington, J., Kesharwani, R., Key, J. S., Khadela, R., Khadka, S., Khalili, F. Y., Khan, F., Khan, I., Khanam, T., Khursheed, M., Khusid, N. M., Kiendrebeogo, W., Kijbunchoo, N., Kim, C., Kim, J. C., Kim, K., Kim, M. H., Kim, S., Kim, Y. -M., Kimball, C., Kinley-Hanlon, M., Kinnear, M., Kissel, J. S., Klimenko, S., Knee, A. M., Knust, N., Kobayashi, K., Koch, P., Koehlenbeck, S. M., Koekoek, G., Kohri, K., Kokeyama, K., Koley, S., Kolitsidou, P., Kolstein, M., Komori, K., Kong, A. K. H., Kontos, A., Korobko, M., Kossak, R. V., Kou, X., Koushik, A., Kouvatsos, N., Kovalam, M., Kozak, D. B., Kranzhoff, S. L., Kringel, V., Krishnendu, N. V., Królak, A., Kruska, K., Kuehn, G., Kuijer, P., Kulkarni, S., Ramamohan, A. Kulur, Kumar, A., Kumar, Praveen, Kumar, Prayush, Kumar, Rahul, Kumar, Rakesh, Kume, J., Kuns, K., Kuntimaddi, N., Kuroyanagi, S., Kurth, N. J., Kuwahara, S., Kwak, K., Kwan, K., Kwok, J., Lacaille, G., Lagabbe, P., Laghi, D., Lai, S., Laity, A. H., Lakkis, M. H., Lalande, E., Lalleman, M., Lalremruati, P. C., Landry, M., Lane, B. B., Lang, R. N., Lange, J., Lantz, B., La Rana, A., La Rosa, I., Lartaux-Vollard, A., Lasky, P. D., Lawrence, J., Lawrence, M. N., Laxen, M., Lazzarini, A., Lazzaro, C., Leaci, P., Lecoeuche, Y. K., Lee, H. M., Lee, H. W., Lee, K., Lee, R. -K., Lee, R., Lee, S., Lee, Y., Legred, I. N., Lehmann, J., Lehner, L., Jean, M. Le, Lemaître, A., Lenti, M., Leonardi, M., Lequime, M., Leroy, N., Lesovsky, M., Letendre, N., Lethuillier, M., Levin, S. E., Levin, Y., Leyde, K., Li, A. K. Y., Li, K. L., Li, T. G. F., Li, X., Li, Z., Lihos, A., Lin, C-Y., Lin, C. -Y., Lin, E. T., Lin, F., Lin, H., Lin, L. C. -C., Lin, Y. -C., Linde, F., Linker, S. D., Littenberg, T. B., Liu, A., Liu, G. C., Liu, Jian, Villarreal, F. Llamas, Llobera-Querol, J., Lo, R. K. L., Locquet, J. -P., London, L. T., Longo, A., Lopez, D., Portilla, M. Lopez, Lorenzini, M., Lorenzo-Medina, A., Loriette, V., Lormand, M., Losurdo, G., Lott IV, T. P., Lough, J. D., Loughlin, H. A., Lousto, C. O., Lowry, M. J., Lu, N., Lück, H., Lumaca, D., Lundgren, A. P., Lussier, A. W., Ma, L. -T., Ma, S., Ma'arif, M., Macas, R., Macedo, A., MacInnis, M., Maciy, R. R., Macleod, D. M., MacMillan, I. A. O., Macquet, A., Macri, D., Maeda, K., Maenaut, S., Hernandez, I. Magaña, Magare, S. S., Magazzù, C., Magee, R. M., Maggio, E., Maggiore, R., Magnozzi, M., Mahesh, M., Mahesh, S., Maini, M., Majhi, S., Majorana, E., Makarem, C. N., Makelele, E., Malaquias-Reis, J. A., Mali, U., Maliakal, S., Malik, A., Man, N., Mandic, V., Mangano, V., Mannix, B., Mansell, G. L., Mansingh, G., Manske, M., Mantovani, M., Mapelli, M., Marchesoni, F., Pina, D. Marín, Marion, F., Márka, S., Márka, Z., Markosyan, A. S., Markowitz, A., Maros, E., Marsat, S., Martelli, F., Martin, I. W., Martin, R. M., Martinez, B. B., Martinez, M., Martinez, V., Martini, A., Martinovic, K., Martins, J. C., Martynov, D. V., Marx, E. J., Massaro, L., Masserot, A., Masso-Reid, M., Mastrodicasa, M., Mastrogiovanni, S., Matcovich, T., Matiushechkina, M., Matsuyama, M., Mavalvala, N., Maxwell, N., McCarrol, G., McCarthy, R., McClelland, D. E., McCormick, S., McCuller, L., McEachin, S., McElhenny, C., McGhee, G. I., McGinn, J., McGowan, K. B. M., McIver, J., McLeod, A., McRae, T., Meacher, D., Meijer, Q., Melatos, A., Mellaerts, S., Menendez-Vazquez, A., Menoni, C. S., Mera, F., Mercer, R. A., Mereni, L., Merfeld, K., Merilh, E. L., Mérou, J. R., Merritt, J. D., Merzougui, M., Messenger, C., Messick, C., Metzler, Z., Meyer-Conde, M., Meylahn, F., Mhaske, A., Miani, A., Miao, H., Michaloliakos, I., Michel, C., Michimura, Y., Middleton, H., Miller, A. L., Miller, S., Millhouse, M., Milotti, E., Milotti, V., Minenkov, Y., Mio, N., Mir, Ll. M., Mirasola, L., Miravet-Tenés, M., Miritescu, C. -A., Mishra, A. K., Mishra, A., Mishra, C., Mishra, T., Mitchell, A. L., Mitchell, J. G., Mitra, S., Mitrofanov, V. P., Mittleman, R., Miyakawa, O., Miyamoto, S., Miyoki, S., Mo, G., Mobilia, L., Mohapatra, S. R. P., Mohite, S. R., Molina-Ruiz, M., Mondal, C., Mondin, M., Montani, M., Moore, C. J., Moraru, D., More, A., More, S., Moreno, G., Morgan, C., Morisaki, S., Moriwaki, Y., Morras, G., Moscatello, A., Mourier, P., Mours, B., Mow-Lowry, C. M., Muciaccia, F., Mukherjee, Arunava, Mukherjee, D., Mukherjee, Samanwaya, Mukherjee, Soma, Mukherjee, Subroto, Mukherjee, Suvodip, Mukund, N., Mullavey, A., Munch, J., Mundi, J., Mungioli, C. L., Oberg, W. R. Munn, Murakami, Y., Murakoshi, M., Murray, P. G., Muusse, S., Nabari, D., Nadji, S. L., Nagar, A., Nagarajan, N., Nagler, K. N., Nakagaki, K., Nakamura, K., Nakano, H., Nakano, M., Nandi, D., Napolano, V., Narayan, P., Nardecchia, I., Narikawa, T., Narola, H., Naticchioni, L., Nayak, R. K., Neilson, J., Nelson, A., Nelson, T. J. N., Nery, M., Neunzert, A., Ng, S., Quynh, L. Nguyen, Nichols, S. A., Nielsen, A. B., Nieradka, G., Niko, A., Nishino, Y., Nishizawa, A., Nissanke, S., Nitoglia, E., Niu, W., Nocera, F., Norman, M., North, C., Novak, J., Siles, J. F. Nuño, Nuttall, L. K., Obayashi, K., Oberling, J., O'Dell, J., Oertel, M., Offermans, A., Oganesyan, G., Oh, J. J., Oh, K., O'Hanlon, T., Ohashi, M., Ohkawa, M., Ohme, F., Oliveira, A. S., Oliveri, R., O'Neal, B., Oohara, K., O'Reilly, B., Ormsby, N. D., Orselli, M., O'Shaughnessy, R., O'Shea, S., Oshima, Y., Oshino, S., Ossokine, S., Osthelder, C., Ota, I., Ottaway, D. J., Ouzriat, A., Overmier, H., Owen, B. J., Pace, A. E., Pagano, R., Page, M. A., Pai, A., Pal, A., Pal, S., Palaia, M. A., Pálfi, M., Palma, P. P., Palomba, C., Palud, P., Pan, H., Pan, J., Pan, K. C., Panai, R., Panda, P. K., Pandey, S., Panebianco, L., Pang, P. T. H., Pannarale, F., Pannone, K. A., Pant, B. C., Panther, F. H., Paoletti, F., Paolone, A., Papalexakis, E. E., Papalini, L., Papigkiotis, G., Paquis, A., Parisi, A., Park, B. -J., Park, J., Parker, W., Pascale, G., Pascucci, D., Pasqualetti, A., Passaquieti, R., Passenger, L., Passuello, D., Patane, O., Pathak, D., Pathak, M., Patra, A., Patricelli, B., Patron, A. S., Paul, K., Paul, S., Payne, E., Pearce, T., Pedraza, M., Pegna, R., Pele, A., Arellano, F. E. Peña, Penn, S., Penuliar, M. D., Perego, A., Pereira, Z., Perez, J. J., Périgois, C., Perna, G., Perreca, A., Perret, J., Perriès, S., Perry, J. W., Pesios, D., Petracca, S., Petrillo, C., Pfeiffer, H. P., Pham, H., Pham, K. A., Phukon, K. S., Phurailatpam, H., Piarulli, M., Piccari, L., Piccinni, O. J., Pichot, M., Piendibene, M., Piergiovanni, F., Pierini, L., Pierra, G., Pierro, V., Pietrzak, M., Pillas, M., Pilo, F., Pinard, L., Pinto, I. M., Pinto, M., Piotrzkowski, B. J., Pirello, M., Pitkin, M. D., Placidi, A., Placidi, E., Planas, M. L., Plastino, W., Poggiani, R., Polini, E., Pompili, L., Poon, J., Porcelli, E., Porter, E. K., Posnansky, C., Poulton, R., Powell, J., Pracchia, M., Pradhan, B. K., Pradier, T., Prajapati, A. K., Prasai, K., Prasanna, R., Prasia, P., Pratten, G., Principe, G., Principe, M., Prodi, G. A., Prokhorov, L., Prosposito, P., Puecher, A., Pullin, J., Punturo, M., Puppo, P., Pürrer, M., Qi, H., Qin, J., Quéméner, G., Quetschke, V., Quigley, C., Quinonez, P. J., Raab, F. J., Raabith, S. S., Raaijmakers, G., Raja, S., Rajan, C., Rajbhandari, B., Ramirez, K. E., Vidal, F. A. Ramis, Ramos-Buades, A., Rana, D., Ranjan, S., Ransom, K., Rapagnani, P., Ratto, B., Rawat, S., Ray, A., Raymond, V., Razzano, M., Read, J., Payo, M. Recaman, Regimbau, T., Rei, L., Reid, S., Reitze, D. H., Relton, P., Renzini, A. I., Rettegno, P., Revenu, B., Reyes, R., Rezaei, A. S., Ricci, F., Ricci, M., Ricciardone, A., Richardson, J. W., Richardson, M., Rijal, A., Riles, K., Riley, H. K., Rinaldi, S., Rittmeyer, J., Robertson, C., Robinet, F., Robinson, M., Rocchi, A., Rolland, L., Rollins, J. G., Romano, A. E., Romano, R., Romero, A., Romero-Shaw, I. M., Romie, J. H., Ronchini, S., Roocke, T. J., Rosa, L., Rosauer, T. J., Rose, C. A., Rosińska, D., Ross, M. P., Rossello, M., Rowan, S., Roy, S. K., Roy, S., Rozza, D., Ruggi, P., Ruhama, N., Morales, E. Ruiz, Ruiz-Rocha, K., Sachdev, S., Sadecki, T., Sadiq, J., Saffarieh, P., Sah, M. R., Saha, S. S., Saha, S., Sainrat, T., Menon, S. Sajith, Sakai, K., Sakellariadou, M., Sakon, S., Salafia, O. S., Salces-Carcoba, F., Salconi, L., Saleem, M., Salemi, F., Sallé, M., Salvador, S., Sanchez, A., Sanchez, E. J., Sanchez, J. H., Sanchez, L. E., Sanchis-Gual, N., Sanders, J. R., Sänger, E. M., Santoliquido, F., Saravanan, T. R., Sarin, N., Sasaoka, S., Sasli, A., Sassi, P., Sassolas, B., Satari, H., Sato, R., Sato, Y., Sauter, O., Savage, R. L., Sawada, T., Sawant, H. L., Sayah, S., Scacco, V., Schaetzl, D., Scheel, M., Schiebelbein, A., Schiworski, M. G., Schmidt, P., Schmidt, S., Schnabel, R., Schneewind, M., Schofield, R. M. S., Schouteden, K., Schulte, B. W., Schutz, B. F., Schwartz, E., Scialpi, M., Scott, J., Scott, S. M., Seetharamu, T. C., Seglar-Arroyo, M., Sekiguchi, Y., Sellers, D., Sengupta, A. S., Sentenac, D., Seo, E. G., Seo, J. W., Sequino, V., Serra, M., Servignat, G., Sevrin, A., Shaffer, T., Shah, U. S., Shaikh, M. A., Shao, L., Sharma, A. K., Sharma, P., Sharma-Chaudhary, S., Shaw, M. R., Shawhan, P., Shcheblanov, N. S., Sheridan, E., Shikano, Y., Shikauchi, M., Shimode, K., Shinkai, H., Shiota, J., Shoemaker, D. H., Shoemaker, D. M., Short, R. W., ShyamSundar, S., Sider, A., Siegel, H., Sieniawska, M., Sigg, D., Silenzi, L., Simmonds, M., Singer, L. P., Singh, A., Singh, D., Singh, M. K., Singh, S., Singha, A., Sintes, A. M., Sipala, V., Skliris, V., Slagmolen, B. J. J., Slaven-Blair, T. J., Smetana, J., Smith, J. R., Smith, L., Smith, R. J. E., Smith, W. J., Soldateschi, J., Somiya, K., Song, I., Soni, K., Soni, S., Sordini, V., Sorrentino, F., Sorrentino, N., Sotani, H., Soulard, R., Southgate, A., Spagnuolo, V., Spencer, A. P., Spera, M., Spinicelli, P., Spoon, J. B., Sprague, C. A., Srivastava, A. K., Stachurski, F., Steer, D. A., Steinlechner, J., Steinlechner, S., Stergioulas, N., Stevens, P., StPierre, M., Stratta, G., Strong, M. D., Strunk, A., Sturani, R., Stuver, A. L., Suchenek, M., Sudhagar, S., Sueltmann, N., Suleiman, L., Sullivan, K. D., Sun, L., Sunil, S., Suresh, J., Sutton, P. J., Suzuki, T., Suzuki, Y., Swinkels, B. L., Syx, A., Szczepańczyk, M. J., Szewczyk, P., Tacca, M., Tagoshi, H., Tait, S. C., Takahashi, H., Takahashi, R., Takamori, A., Takase, T., Takatani, K., Takeda, H., Takeshita, K., Talbot, C., Tamaki, M., Tamanini, N., Tanabe, D., Tanaka, K., Tanaka, S. J., Tanaka, T., Tang, D., Tanioka, S., Tanner, D. B., Tao, L., Tapia, R. D., Martín, E. N. Tapia San, Tarafder, R., Taranto, C., Taruya, A., Tasson, J. D., Teloi, M., Tenorio, R., Themann, H., Theodoropoulos, A., Thirugnanasambandam, M. P., Thomas, L. M., Thomas, M., Thomas, P., Thompson, J. E., Thondapu, S. R., Thorne, K. A., Thrane, E., Tissino, J., Tiwari, A., Tiwari, P., Tiwari, S., Tiwari, V., Todd, M. R., Toivonen, A. M., Toland, K., Tolley, A. E., Tomaru, T., Tomita, K., Tomura, T., Tong-Yu, C., Toriyama, A., Toropov, N., Torres-Forné, A., Torrie, C. I., Toscani, M., Melo, I. Tosta e, Tournefier, E., Trapananti, A., Travasso, F., Traylor, G., Trevor, M., Tringali, M. C., Tripathee, A., Troian, G., Troiano, L., Trovato, A., Trozzo, L., Trudeau, R. J., Tsang, T. T. L., Tso, R., Tsuchida, S., Tsukada, L., Tsutsui, T., Turbang, K., Turconi, M., Turski, C., Ubach, H., Uchiyama, T., Udall, R. P., Uehara, T., Uematsu, M., Ueno, K., Ueno, S., Undheim, V., Ushiba, T., Vacatello, M., Vahlbruch, H., Vaidya, N., Vajente, G., Vajpeyi, A., Valdes, G., Valencia, J., Valentini, M., Vallejo-Peña, S. A., Vallero, S., Valsan, V., van Bakel, N., van Beuzekom, M., van Dael, M., Brand, J. F. J. van den, Broeck, C. Van Den, Vander-Hyde, D. C., van der Sluys, M., Van de Walle, A., van Dongen, J., Vandra, K., van Haevermaet, H., van Heijningen, J. V., Van Hove, P., VanKeuren, M., Vanosky, J., van Putten, M. H. P. M., van Ranst, Z., van Remortel, N., Vardaro, M., Vargas, A. F., Varghese, J. J., Varma, V., Vasúth, M., Vecchio, A., Vedovato, G., Veitch, J., Veitch, P. J., Venikoudis, S., Venneberg, J., Verdier, P., Verkindt, D., Verma, B., Verma, P., Verma, Y., Vermeulen, S. M., Vetrano, F., Veutro, A., Vibhute, A. M., Viceré, A., Vidyant, S., Viets, A. D., Vijaykumar, A., Vilkha, A., Villa-Ortega, V., Vincent, E. T., Vinet, J. -Y., Viret, S., Virtuoso, A., Vitale, S., Vives, A., Vocca, H., Voigt, D., von Reis, E. R. G., von Wrangel, J. S. A., Vyatchanin, S. P., Wade, L. E., Wade, M., Wagner, K. J., Wajid, A., Walker, M., Wallace, G. S., Wallace, L., Wang, H., Wang, J. Z., Wang, W. H., Wang, Z., Waratkar, G., Warner, J., Was, M., Washimi, T., Washington, N. Y., Watarai, D., Wayt, K. E., Weaver, B. R., Weaver, B., Weaving, C. R., Webster, S. A., Weinert, M., Weinstein, A. J., Weiss, R., Wellmann, F., Wen, L., Weßels, P., Wette, K., Whelan, J. T., Whiting, B. F., Whittle, C., Wildberger, J. B., Wilk, O. S., Wilken, D., Wilkin, A. T., Willadsen, D. J., Willetts, K., Williams, D., Williams, M. J., Williams, N. S., Willis, J. L., Willke, B., Wils, M., Winterflood, J., Wipf, C. C., Woan, G., Woehler, J., Wofford, J. K., Wolfe, N. E., Wong, H. T., Wong, H. W. Y., Wong, I. C. F., Wright, J. L., Wright, M., Wu, C., Wu, D. S., Wu, H., Wuchner, E., Wysocki, D. M., Xu, V. A., Xu, Y., Yadav, N., Yamamoto, H., Yamamoto, K., Yamamoto, T. S., Yamamoto, T., Yamamura, S., Yamazaki, R., Yan, S., Yan, T., Yang, F. W., Yang, F., Yang, K. Z., Yang, Y., Yarbrough, Z., Yasui, H., Yeh, S. -W., Yelikar, A. B., Yin, X., Yokoyama, J., Yokozawa, T., Yoo, J., Yu, H., Yuan, S., Yuzurihara, H., Zadrożny, A., Zanolin, M., Zeeshan, M., Zelenova, T., Zendri, J. -P., Zeoli, M., Zerrad, M., Zevin, M., Zhang, A. C., Zhang, L., Zhang, R., Zhang, T., Zhang, Y., Zhao, C., Zhao, Yue, Zhao, Yuhang, Zheng, Y., Zhong, H., Zhou, R., Zhu, X. -J., Zhu, Z. -H., Zimmerman, A. B., Zucker, M. E., Zweizig, J., Furlan, S. B. Araujo, Arzoumanian, Z., Basu, A., Cassity, A., Cognard, I., Crowter, K., del Palacio, S., Espinoza, C. M., Fonseca, E., Flynn, C. M. L., Gancio, G., Garcia, F., Gendreau, K. C., Good, D. C., Guillemot, L., Guillot, S., Keith, M. J., Kuiper, L., Lower, M. E., Lyne, A. G., McKee, J. W., Meyers, B. W., Palfreyman, J. L., Pearlman, A. B., Romero, G. E., Shannon, R. M., Shaw, B., Stairs, I. H., Stappers, B. W., Tan, C. M., Theureau, G., Thompson, M., Weltevrede, P., and Zubieta, E.
- Subjects
Astrophysics - High Energy Astrophysical Phenomena - Abstract
Continuous gravitational waves (CWs) emission from neutron stars carries information about their internal structure and equation of state, and it can provide tests of General Relativity. We present a search for CWs from a set of 45 known pulsars in the first part of the fourth LIGO--Virgo--KAGRA observing run, known as O4a. We conducted a targeted search for each pulsar using three independent analysis methods considering the single-harmonic and the dual-harmonic emission models. We find no evidence of a CW signal in O4a data for both models and set upper limits on the signal amplitude and on the ellipticity, which quantifies the asymmetry in the neutron star mass distribution. For the single-harmonic emission model, 29 targets have the upper limit on the amplitude below the theoretical spin-down limit. The lowest upper limit on the amplitude is $6.4\!\times\!10^{-27}$ for the young energetic pulsar J0537-6910, while the lowest constraint on the ellipticity is $8.8\!\times\!10^{-9}$ for the bright nearby millisecond pulsar J0437-4715. Additionally, for a subset of 16 targets we performed a narrowband search that is more robust regarding the emission model, with no evidence of a signal. We also found no evidence of non-standard polarizations as predicted by the Brans-Dicke theory., Comment: main paper: 12 pages, 6 figures, 4 tables
- Published
- 2025
25. A Link Between White Dwarf Pulsars and Polars: Multiwavelength Observations of the 9.36-Minute Period Variable Gaia22ayj
- Author
-
Rodriguez, Antonio C., El-Badry, Kareem, Hakala, Pasi, Rodríguez-Gil, Pablo, Bao, Tong, Galiullin, Ilkham, Kurlander, Jacob A., Law, Casey J., Pelisoli, Ingrid, Schreiber, Matthias R., Burdge, Kevin, Caiazzo, Ilaria, van Roestel, Jan, Szkody, Paula, Drake, Andrew J., Buckley, David A. H., Potter, Stephen B., Gaensicke, Boris, Mori, Kaya, Bellm, Eric C., Kulkarni, Shrinivas R., Prince, Thomas A., Graham, Matthew, Kasliwal, Mansi M., Rose, Sam, Sharma, Yashvi, Ahumada, Tomás, Anand, Shreya, Viitanen, Akke, Wold, Avery, Chen, Tracy X., Riddle, Reed, and Smith, Roger
- Subjects
Astrophysics - Solar and Stellar Astrophysics ,Astrophysics - High Energy Astrophysical Phenomena - Abstract
White dwarfs (WDs) are the most abundant compact objects, and recent surveys have suggested that over a third of WDs in accreting binaries host a strong (B $\gtrsim$ 1 MG) magnetic field. However, the origin and evolution of WD magnetism remain under debate. Two WD pulsars, AR Sco and J191213.72-441045.1 (J1912), have been found, which are non-accreting binaries hosting rapidly spinning (1.97-min and 5.30-min, respectively) magnetic WDs. The WD in AR Sco is slowing down on a $P/\dot{P}\approx 5.6\times 10^6$ yr timescale. It is believed they will eventually become polars, accreting systems in which a magnetic WD (B $\approx 10-240$ MG) accretes from a Roche lobe-filling donor spinning in sync with the orbit ($\gtrsim 78$ min). Here, we present multiwavelength data and analysis of Gaia22ayj, which outbursted in March 2022. We find that Gaia22ayj is a magnetic accreting WD that is rapidly spinning down ($P/\dot{P} = 6.1^{+0.3}_{-0.2}\times 10^6$ yr) like WD pulsars, but shows clear evidence of accretion, like polars. Strong linear polarization (40%) is detected in Gaia22ayj; such high levels have only been seen in the WD pulsar AR Sco and demonstrate the WD is magnetic. High speed photometry reveals a 9.36-min period accompanying a high amplitude ($\sim 2$ mag) modulation. We associate this with a WD spin or spin-orbit beat period, not an orbital period as was previously suggested. Fast (60-s) optical spectroscopy reveals a broad ``hump'', reminiscent of cyclotron emission in polars, between 4000-8000 Angstrom. We find an X-ray luminosity of $L_X = 2.7_{-0.8}^{+6.2}\times10^{32} \textrm{ erg s}^{-1}$ in the 0.3-8 keV energy range, while two VLA radio campaigns resulted in a non-detection with a $F_r < 15.8\mu\textrm{Jy}$ 3$ \sigma$ upper limit. The shared properties of both WD pulsars and polars suggest that Gaia22ayj is a missing link between the two classes of magnetic WD binaries., Comment: Submitted to PASP; comments welcome
- Published
- 2025
26. Bootstrapped Reward Shaping
- Author
-
Adamczyk, Jacob, Makarenko, Volodymyr, Tiomkin, Stas, and Kulkarni, Rahul V.
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
In reinforcement learning, especially in sparse-reward domains, many environment steps are required to observe reward information. In order to increase the frequency of such observations, "potential-based reward shaping" (PBRS) has been proposed as a method of providing a more dense reward signal while leaving the optimal policy invariant. However, the required "potential function" must be carefully designed with task-dependent knowledge to not deter training performance. In this work, we propose a "bootstrapped" method of reward shaping, termed BSRS, in which the agent's current estimate of the state-value function acts as the potential function for PBRS. We provide convergence proofs for the tabular setting, give insights into training dynamics for deep RL, and show that the proposed method improves training speed in the Atari suite., Comment: Accepted at AAAI-2025, Main Track
- Published
- 2025
27. Stable bi-frequency spinor modes as Dark Matter candidates
- Author
-
Comech, Andrew, Kulkarni, Niranjana, Boussaïd, Nabile, and Cuevas-Maraver, Jesús
- Subjects
Mathematics - Analysis of PDEs ,High Energy Physics - Theory ,Mathematical Physics ,Quantum Physics ,35B32, 35B35, 35C08, 35Q41, 37K40, 37N20, 65L07, 81Q05 - Abstract
We show that bi-frequency solitary waves are generically present in fermionic systems with scalar self-interaction, such as the Dirac--Klein--Gordon system and the Soler model. We develop the approach to stability properties of such waves and use the radial reduction to show that indeed the (linear) stability is available. We conjecture that stable bi-frequency modes serve as storages of the Dark Matter., Comment: 5 pages
- Published
- 2024
28. On spectral stability of one- and bi-frequency solitary waves in Soler model in (3+1)D
- Author
-
Boussaïd, Nabile, Comech, Andrew, and Kulkarni, Niranjana
- Subjects
Mathematics - Analysis of PDEs ,Mathematical Physics ,35B35, 35C08, 35Q41, 81Q05 - Abstract
For the nonlinear Dirac equation with scalar self-interaction (the Soler model) in three spatial dimensions, we consider the linearization at solitary wave solutions and find the invariant spaces which correspond to different spherical harmonics, thus achieving the radial reduction of the spectral stability analysis. We apply the same technique to the bi-frequency solitary waves (which are generically present in the Soler model) and show that they can also possess linear stability properties similar to those of one-frequency solitary waves., Comment: 23 pages. This work represents supplementary material for an analytical part of the article "Stable bi-frequency spinor modes as Dark Matter candidates"
- Published
- 2024
29. Control of spatiotemporal chaos by stochastic resetting
- Author
-
Aron, Camille and Kulkarni, Manas
- Subjects
Condensed Matter - Statistical Mechanics ,Nonlinear Sciences - Chaotic Dynamics - Abstract
We study how spatiotemporal chaos in dynamical systems can be controlled by stochastically returning them to their initial conditions. Focusing on discrete nonlinear maps, we analyze how key measures of chaos -- the Lyapunov exponent and butterfly velocity, which quantify sensitivity to initial perturbations and the ballistic spread of information, respectively -- are reduced by stochastic resetting. We identify a critical resetting rate that induces a dynamical phase transition, characterized by the simultaneous vanishing of the Lyapunov exponent and butterfly velocity, effectively arresting the spread of information. These theoretical predictions are validated and illustrated with numerical simulations of the celebrated logistic map and its lattice extension. Beyond discrete maps, our findings offer insights applicable to a broad class of extended classical interacting systems., Comment: (4+epsilon) pages + 7 pages of supplementary material
- Published
- 2024
30. Extended Near Horizon Symmetries of Extremal BTZ Black Holes in 3D Massive Gravity
- Author
-
Ballav, Debojyoti and Kulkarni, Shailesh
- Subjects
High Energy Physics - Theory - Abstract
We study the asymptotic symmetries of near-horizon extremal BTZ black holes in higher derivative theories of gravity, such as New Massive Gravity and Topological Massive Gravity. By employing a particular boundary condition and the regularization prescription proposed earlier for the Einstein gravity, we demonstrate the existence of two centrally extended Virasoro algebras. The central charges evaluated within this framework are in agreement with their corresponding expressions evaluated at the spatial infinity. We also discuss the robustness of the regularization procedure by relating asymptotic and near-horizon geometries., Comment: 1+23 pages, references added
- Published
- 2024
31. Asymptotically Optimal Appointment Scheduling in the Presence of Patient Unpunctuality
- Author
-
Lipscomb, Nikolai, Liu, Xin, and Kulkarni, Vidyadhar G.
- Subjects
Mathematics - Optimization and Control ,Mathematics - Probability - Abstract
We consider the optimal appointment scheduling problem that incorporates patients' unpunctual behavior, where the unpunctuality is assumed to be time dependent, but additive. Our goal is to develop an optimal scheduling method for a large patient system to maximize expected net revenue. Methods for deriving optimal appointment schedules for large-scale systems often run into computational bottlenecks due to mixed-integer programming or robust optimization formulations and computationally complex search methods. In this work, we model the system as a single-server queueing system, where patients arrive unpunctually and follow the FIFO service discipline to see the doctor (i.e., get into service). Using the heavy traffic fluid approximation, we develop a deterministic control problem, referred to as the fluid control problem (FCP), which serves as an asymptotic upper bound for the original queueing control problem (QCP). Using the optimal solution of the FCP, we establish an asymptotically optimal scheduling policy on a fluid scale. We further investigate the convergence rate of the QCP under the proposed policy. The FCP, due to the incorporation of unpunctuality, is difficult to solve analytically. We thus propose a time-discretized numerical scheme to approximately solve the FCP. The discretized FCP takes the form of a quadratic program with linear constraints. We examine the behavior of these schedules under different unpunctuality assumptions and test the performance of the schedules on real data in a simulation study. Interestingly, the optimal schedules can involve block booking of patients, even if the unpunctuality distributions are continuous.
- Published
- 2024
32. Active matter as the underpinning agency for extraordinary sensitivity of biological membranes to electric fields
- Author
-
Mathew, Anand and Kulkarni, Yashashree
- Subjects
Condensed Matter - Soft Condensed Matter ,Physics - Biological Physics - Abstract
Interaction of electric fields with biological cells is indispensable for many physiological processes. Thermal electrical noise in the cellular environment has long been considered as the minimum threshold for detection of electrical signals by cells. However, there is compelling experimental evidence that the minimum electric field sensed by certain cells and organisms is many orders of magnitude weaker than the thermal electrical noise limit estimated purely under equilibrium considerations. We resolve this discrepancy by proposing a non-equilibrium statistical mechanics model for active electromechanical membranes and hypothesize the role of activity in modulating the minimum electrical field that can be detected by a biological membrane. Active membranes contain proteins that use external energy sources to carry out specific functions and drive the membrane away from equilibrium. The central idea behind our model is that active mechanisms, attributed to different sources, endow the membrane with the ability to sense and respond to electric fields that are deemed undetectable based on equilibrium statistical mechanics. Our model for active membranes is capable of reproducing different experimental data available in the literature by varying the activity. Elucidating how active matter can modulate the sensitivity of cells to electric signals can open avenues for a deeper understanding of physiological and pathological processes.
- Published
- 2024
33. MetaScientist: A Human-AI Synergistic Framework for Automated Mechanical Metamaterial Design
- Author
-
Qi, Jingyuan, Jia, Zian, Liu, Minqian, Zhan, Wangzhi, Zhang, Junkai, Wen, Xiaofei, Gan, Jingru, Chen, Jianpeng, Liu, Qin, Ma, Mingyu Derek, Li, Bangzheng, Wang, Haohui, Kulkarni, Adithya, Chen, Muhao, Zhou, Dawei, Li, Ling, Wang, Wei, and Huang, Lifu
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Human-Computer Interaction - Abstract
The discovery of novel mechanical metamaterials, whose properties are dominated by their engineered structures rather than chemical composition, is a knowledge-intensive and resource-demanding process. To accelerate the design of novel metamaterials, we present MetaScientist, a human-in-the-loop system that integrates advanced AI capabilities with expert oversight with two primary phases: (1) hypothesis generation, where the system performs complex reasoning to generate novel and scientifically sound hypotheses, supported with domain-specific foundation models and inductive biases retrieved from existing literature; (2) 3D structure synthesis, where a 3D structure is synthesized with a novel 3D diffusion model based on the textual hypothesis and refined it with a LLM-based refinement model to achieve better structure properties. At each phase, domain experts iteratively validate the system outputs, and provide feedback and supplementary materials to ensure the alignment of the outputs with scientific principles and human preferences. Through extensive evaluation from human scientists, MetaScientist is able to deliver novel and valid mechanical metamaterial designs that have the potential to be highly impactful in the metamaterial field.
- Published
- 2024
34. Scalable and low-cost remote lab platforms: Teaching industrial robotics using open-source tools and understanding its social implications
- Author
-
Kumar, Amit, Jose, Jaison, Jain, Archit, Kulkarni, Siddharth, and Arya, Kavi
- Subjects
Computer Science - Robotics - Abstract
With recent advancements in industrial robots, educating students in new technologies and preparing them for the future is imperative. However, access to industrial robots for teaching poses challenges, such as the high cost of acquiring these robots, the safety of the operator and the robot, and complicated training material. This paper proposes two low-cost platforms built using open-source tools like Robot Operating System (ROS) and its latest version ROS 2 to help students learn and test algorithms on remotely connected industrial robots. Universal Robotics (UR5) arm and a custom mobile rover were deployed in different life-size testbeds, a greenhouse, and a warehouse to create an Autonomous Agricultural Harvester System (AAHS) and an Autonomous Warehouse Management System (AWMS). These platforms were deployed for a period of 7 months and were tested for their efficacy with 1,433 and 1,312 students, respectively. The hardware used in AAHS and AWMS was controlled remotely for 160 and 355 hours, respectively, by students over a period of 3 months., Comment: 14 pages. Accepted at Springer's 16th International Conference on Social Robotics + AI 2024
- Published
- 2024
35. Cyclotron emitting magnetic white dwarfs in post common envelope binaries discovered with the Zwicky Transient Facility
- Author
-
van Roestel, J., Rodriguez, A. C., Szkody, P., Brown, A. J., Caiazzo, I., Drake, A., El-Badry, K., Prince, T., Rich, R. M. R., Neill, J. D., Vanderbosch, Z., Bellm, E. C., Dekany, R., Feinstein, F., Graham, M., Groom, S. L., Helou, G., Kulkarni, S. R., Laz, T. du, Mahabal, A., Sharma, Y., Sollerman, J., and Wold, A.
- Subjects
Astrophysics - Solar and Stellar Astrophysics - Abstract
We present the discovery of 14 new (and recovery of 4 known) low accretion rate magnetic white dwarfs in post-common envelope binaries that emit strong cyclotron emission using the Zwicky Transient Facility (ZTF) light curves, doubling the known sample size. In addition, we discovered a candidate magnetic period bouncer and recovered three known ones. We confirmed the presence of cyclotron emission using low-resolution spectra in 19 objects. Using the ZTF light curves, follow-up spectra, and the spectral energy distribution, we measured the orbital period, magnetic field strength, and white dwarf temperature of each system. Although the phase-folded light curves have diverse shapes and show a much larger variability amplitude, we show that their intrinsic properties (e.g. period distribution, magnetic field strength) are similar to those of previously known systems. The diversity in light curve shapes can be explained by differences in the optical depth of the accretion spot and geometric differences, the inclination angle and the magnetic spot latitude. The evolutionary states of the longer period binaries are somewhat uncertain but are vary; we found systems consistent with being pre-polars, detached polars, or low-state polars. In addition, we discovered two new low-state polars that likely have brown dwarf companions and could be magnetic period bouncers.
- Published
- 2024
36. Spatial evolution of droplet size and velocity characteristics in a swirl spray
- Author
-
Vankeswaram, S. K., Kulkarni, V., and Deivandren, S.
- Subjects
Physics - Fluid Dynamics - Abstract
Spray drop size distribution generated by atomization of fuel influences several facets of a combustion process such as, fuel-air mixing, reaction kinetics and thrust generation. In a typical spray, the drop size distribution evolves spatially, varying significantly between the near and far regions of the spray. Studies so far have focused on either one of these regions and are unclear on the exact axial location of transition. In this work, we address this crucial gap by considering a swirl atomizer and measuring the droplet characteristics for different liquid flow conditions of the ensuing spray at various radial and axial locations. Our results reveal an axial variation in the scaled radial droplet velocity profiles, not followed by the radial drop size profiles, from which we demarcate the near region as the zone which extends to 2.0 to 2.5 times film breakup length. Beyond this distance, the drop size characteristics are influenced by external factors such as airflow and identified as the far region. Further, we locate the point of origin of the droplet high-velocity stream along the spray centreline to the end of film breakup of the spray. We also find that the global probability density functions for droplet size and velocity which show a bimodal behavior in the near-region and unimodal in the far-region being well represented by the double Gaussian and Gamma distributions, respectively. We further quantify our results by number and volume flux distributions, global mean drop sizes, drop size ($D_d$) axial velocity ($U_a$) correlations, axial velocity based on drop size classification and turbulent kinetic energy (TKE) to reveal the effect of drop inertia and air flow in determining the statistics in both the near and far regions. We anticipate the findings of this work will guide future investigations on combustion processes and combustor design based on spray characteristics.
- Published
- 2024
- Full Text
- View/download PDF
37. Prospects for Systematic Planetary Nebulae Detection with the Census of the Local Universe Narrowband Survey
- Author
-
Du, Rong, Cook, David O., Bhattacharjee, Soumyadeep, Kulkarni, Shrinivas R., Fremling, Christoffer, Kaplan, David L., Kasliwal, Mansi M., Laher, Russ R., Masci, Frank J., Shupe, David L., and Zhang, Chaoran
- Subjects
Astrophysics - Solar and Stellar Astrophysics ,Astrophysics - Astrophysics of Galaxies ,Astrophysics - Instrumentation and Methods for Astrophysics - Abstract
We investigate the efficacy of a systematic planetary nebula (PN) search in the Census of the Local Universe (CLU) narrowband (H$\alpha$) survey that covers a considerably larger sky region of above declination $-20^\circ$ than most previous surveys. Using PNe observed by the Isaac Newton Telescope Photometric H$\alpha$ Survey (IPHAS) as validation, we are able to visually recover 432 out of 441 cataloged PNe (98\%) within the CLU dataset, with 5 sources having unusable CLU images and 4 missed due to limitations of imaging quality. Moreover, the reference PNe are conventionally divided into three PN classes in decreasing order of identification confidence given their spectra and morphologies. We record consistently high recovery rate across all classes: 95\% of True, 71\% of Likely, and 81\% of Possible sources are readily recovered. To further demonstrate the ability of CLU to find new PNe, we undertake a preliminary search of compact PNe within a sub-region of the validation catalog, mainly utilizing the significance of narrow-band colors ($\Sigma$) as a metric for identification. In a $200\,\rm deg^2$ region, we search the CLU source catalog and find 31 PN candidates after automated and visual scrutiny, of which 12 are new sources not appearing in previous studies. As a demonstration of our ongoing follow-up campaign, we present medium-resolution optical spectra of six candidates and notice that four of them show emission signatures characteristic of confirmed PNe. As we refine our selection methods, CLU promises to provide a systematic catalog of PNe spanning $2/3$ of the sky., Comment: 40 pages, 12 figures, 3 tables; submitted to the Publications of the Astronomical Society of the Pacific
- Published
- 2024
38. CCSNscore: A multi-input deep learning tool for classification of core-collapse supernovae using SED-Machine spectra
- Author
-
Sharma, Yashvi, Mahabal, Ashish A., Sollerman, Jesper, Fremling, Christoffer, Kulkarni, S. R., Rehemtulla, Nabeel, Miller, Adam A., Aubert, Marie, Chen, Tracy X., Coughlin, Michael W., Graham, Matthew J., Hale, David, Kasliwal, Mansi M., Kim, Young-Lo, Neill, James D., Purdum, Josiah N., Rusholme, Ben, Singh, Avinash, and Sravan, Niharika
- Subjects
Astrophysics - Instrumentation and Methods for Astrophysics - Abstract
Supernovae (SNe) come in various flavors and are classified into different types based on emission and absorption lines in their spectra. SN candidates are now abundant with the advent of large systematic dynamic sky surveys like the Zwicky Transient Facility (ZTF), however, the identification bottleneck lies in their spectroscopic confirmation and classification. Fully robotic telescopes with dedicated spectrographs optimized for SN follow-up have eased the burden of data acquisition. However, the task of classifying the spectra still largely rests with the astronomers. Automating this classification step reduces human effort, and can make the SN type available sooner to the public. For this purpose, we have developed a deep-learning based program for classifying core-collapse supernovae (CCSNe) with ultra-low resolution spectra obtained with the SED-Machine IFU spectrograph on the Palomar 60-inch telescope. The program consists of hierarchical classification task layers, with each layer composed of multiple binary classifiers which are run in parallel to produce a reliable classification. The binary classifiers utilize RNN and CNN architecture and are designed to take multiple inputs, to supplement spectra with g- and r-band photometry from ZTF. On non-host-contaminated and good quality SEDM spectra ("gold" test set), CCSNscore is ~94% accurate (correct classifications) in distinguishing between hydrogen-rich (Type II) and hydrogen-poor (Type Ibc) CCSNe. With the help of light curve input, CCSNscore classifies ~83% of the gold set with high confidence (score >= 0.8 and score-error < 0.05), with ~98% accuracy., Comment: Submitted to PASP
- Published
- 2024
39. Prospects of a statistical detection of the 21-cm forest and its potential to constrain the thermal state of the neutral IGM during reionization
- Author
-
Šoltinský, Tomáš, Kulkarni, Girish, Tendulkar, Shriharsh P., and Bolton, James S.
- Subjects
Astrophysics - Cosmology and Nongalactic Astrophysics - Abstract
The 21-cm forest signal is a promising probe of the Epoch of Reionization complementary to other 21-cm line observables and Ly$\alpha$ forest signal. Prospects of detecting it have significantly improved in the last decade thanks to the discovery of more than 30 radio-loud quasars at these redshifts, upgrades to telescope facilities, and the notion that neutral hydrogen islands persist down to $z\lesssim 5.5$. We forward-model the 21-cm forest signal using semi-numerical simulations and incorporate various instrumental features to explore the potential of detecting the 21-cm forest at $z=6$, both directly and statistically, with the currently available (uGMRT) and forthcoming (SKA1-low) observatories. We show that it is possible to detect the 1D power spectrum of the 21-cm forest spectrum, especially at large scales of $k\lesssim8.5\,\rm MHz^{-1}$ with the $500\,\rm hr$ of the uGMRT time and $k\lesssim32.4\,\rm MHz^{-1}$ with the SKA1-low over $50\,\rm hr$ if the intergalactic medium (IGM) is $25\%$ neutral and these neutral hydrogen regions have a spin temperature of $\lesssim30\,\rm K$. On the other hand, we infer that a null-detection of the signal with such observations of 10 radio-loud sources at $z\approx6$ can be translated into constraints on the thermal and ionization state of the IGM which are tighter than the currently available measurements. Moreover, a null-detection of the 1D 21-cm forest power spectrum with only $50\,\rm hr$ of the uGMRT observations of 10 radio-loud sources can already be competitive with the Ly$\alpha$ forest and 21-cm tomographic observations in disfavouring models of significantly neutral and cold IGM at $z=6$., Comment: 15 pages, 16 figures. Accepted for publiction in MNRAS
- Published
- 2024
- Full Text
- View/download PDF
40. Four-fold Anisotropic Magnetoresistance in Antiferromagnetic Epitaxial Thin Films of MnPt$_{x}$Pd$_{1-x}$
- Author
-
Yadav, Shivesh, Verma, Mohit, Gupta, Shikhar Kumar, Paul, Debjoty, Kulkarni, Nilesh, Kashyap, Arti, and Chatterjee, Shouvik
- Subjects
Condensed Matter - Materials Science ,Condensed Matter - Mesoscale and Nanoscale Physics - Abstract
Antiferromagnets are emerging as promising alternatives to ferromagnets in spintronics applications. A key feature of antiferromagnets is their anisotropic magnetoresistance (AMR), which has the potential to serve as a sensitive marker for the antiferromagnetic order parameter. However, the underlying origins of this behavior remain poorly understood. In this study, we report the observation of AMR in epitaxial thin films of the collinear L1$_{0}$ antiferromagnet MnPt$_{x}$Pd$_{1-x}$. In thicker films, the AMR is dominated by a non-crystalline two-fold component. As the film thickness is reduced, however, a crystalline four-fold component emerges, accompanied by the appearance of uncompensated magnetic moment, which strongly modifies the magnetotransport properties in the thinner films. We demonstrate that interfacial interactions lead to a large density of states (DOS) at the Fermi level. This enhanced DOS, combined with disorder in thinner films, stabilizes the uncompensated moment and induces a four-fold modulation of the DOS as the Neel vector rotates, explaining the observed AMR behavior., Comment: 8 pages, 6 figures
- Published
- 2024
41. A Multi-Functional Web Tool for Comprehensive Threat Detection Through IP Address Analysis
- Author
-
Tanan, Cebajel, Kulkarni, Sameer G., Das, Tamal, and Hanawal, Manjesh K.
- Subjects
Computer Science - Cryptography and Security - Abstract
In recent years, the advances in digitalisation have also adversely contributed to the significant rise in cybercrimes. Hence, building the threat intelligence to shield against rising cybercrimes has become a fundamental requisite. Internet Protocol (IP) addresses play a crucial role in the threat intelligence and prevention of cyber crimes. However, we have noticed the lack of one-stop, free, and open-source tools that can analyse IP addresses. Hence, this work introduces a comprehensive web tool for advanced IP address characterisation. Our tool offers a wide range of features, including geolocation, blocklist check, VPN detection, proxy detection, bot detection, Tor detection, port scan, and accurate domain statistics that include the details about the name servers and registrar information. In addition, our tool calculates a confidence score based on a weighted sum of publicly accessible online results from different reliable sources to give users a dependable measure of accuracy. Further, to improve performance, our tool also incorporates a local database for caching the results, to enable fast content retrieval with minimal external Web API calls. Our tool supports domain names and IPv4 addresses, making it a multi-functional and powerful IP analyser tool for threat intelligence. Our tool is available at www.ipanalyzer.in, Comment: Presented at ICIE 2024
- Published
- 2024
42. Phaseformer: Phase-based Attention Mechanism for Underwater Image Restoration and Beyond
- Author
-
Khan, MD Raqib, Negi, Anshul, Kulkarni, Ashutosh, Phutke, Shruti S., Vipparthi, Santosh Kumar, and Murala, Subrahmanyam
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Electrical Engineering and Systems Science - Image and Video Processing - Abstract
Quality degradation is observed in underwater images due to the effects of light refraction and absorption by water, leading to issues like color cast, haziness, and limited visibility. This degradation negatively affects the performance of autonomous underwater vehicles used in marine applications. To address these challenges, we propose a lightweight phase-based transformer network with 1.77M parameters for underwater image restoration (UIR). Our approach focuses on effectively extracting non-contaminated features using a phase-based self-attention mechanism. We also introduce an optimized phase attention block to restore structural information by propagating prominent attentive features from the input. We evaluate our method on both synthetic (UIEB, UFO-120) and real-world (UIEB, U45, UCCS, SQUID) underwater image datasets. Additionally, we demonstrate its effectiveness for low-light image enhancement using the LOL dataset. Through extensive ablation studies and comparative analysis, it is clear that the proposed approach outperforms existing state-of-the-art (SOTA) methods., Comment: 8 pages, 8 figures, conference
- Published
- 2024
43. The MeerKAT Pulsar Timing Array: Maps of the gravitational-wave sky with the 4.5 year data release
- Author
-
Grunthal, Kathrin, Nathan, Rowina S., Thrane, Eric, Champion, David J., Miles, Matthew T., Shannon, Ryan M., Kulkarni, Atharva D., Abbate, Federico, Buchner, Sarah, Cameron, Andrew D., Geyer, Marisa, Gitika, Pratyasha, Keith, Michael J., Kramer, Michael, Lasky, Paul D., Parthasarathy, Aditya, Reardon, Daniel J., Singha, Jaikhomba, and Krishnan, Vivek Venkatraman
- Subjects
Astrophysics - High Energy Astrophysical Phenomena - Abstract
In an accompanying publication, the MeerKAT Pulsar Timing Array (MPTA) collaboration reports tentative evidence for the presence of a stochastic gravitational-wave background, following observations of similar signals from the European and Indian Pulsar Timing Arrays, NANOGrav, the Parkes Pulsar Timing Array and the Chinese Pulsar Timing Array. If such a gravitational-wave background signal originates from a population of inspiraling supermassive black-hole binaries, the signal may be anisotropically distributed on the sky. In this Letter we evaluate the anisotropy of the MPTA signal using a spherical harmonic decomposition. We discuss complications arising from the covariance between pulsar pairs and regularisation of the Fisher matrix. Applying our method to the 4.5 yr dataset, we obtain two forms of sky maps for the three most sensitive MPTA frequency bins between 7 -21 nHz. Our "clean maps'' estimate the distribution of gravitational-wave strain power with minimal assumptions. Our radiometer maps answer the question: is there a statistically significant point source? We find a noteworthy hotspot in the 7 nHz clean map with a $p$-factor of $p=0.015$ (not including trial factors). Future observations are required to determine if this hotspot is of astrophysical origin.
- Published
- 2024
- Full Text
- View/download PDF
44. The MeerKAT Pulsar Timing Array: The first search for gravitational waves with the MeerKAT radio telescope
- Author
-
Miles, Matthew T., Shannon, Ryan M., Reardon, Daniel J., Bailes, Matthew, Champion, David J., Geyer, Marisa, Gitika, Pratyasha, Grunthal, Kathrin, Keith, Michael J., Kramer, Michael, Kulkarni, Atharva D., Nathan, Rowina S., Parthasarathy, Aditya, Singha, Jaikhomba, Theureau, Gilles, Thrane, Eric, Abbate, Federico, Buchner, Sarah, Cameron, Andrew D., Camilo, Fernando, Moreschi, Beatrice E., Shaifullah, Golam, Shamohammadi, Mohsen, Possenti, Andrea, and Krishnan, Vivek Venkatraman
- Subjects
Astrophysics - High Energy Astrophysical Phenomena - Abstract
Pulsar Timing Arrays search for nanohertz-frequency gravitational waves by regularly observing ensembles of millisecond pulsars over many years to look for correlated timing residuals. Recently the first evidence for a stochastic gravitational wave background has been presented by the major Arrays, with varying levels of significance ($\sim$2-4$\sigma$). In this paper we present the results of background searches with the MeerKAT Pulsar Timing Array. Although of limited duration (4.5 yr), the $\sim$ 250,000 arrival times with a median error of just $3 \mu$s on 83 pulsars make it very sensitive to spatial correlations. Detection of a gravitational wave background requires careful modelling of noise processes to ensure that any correlations represent a fit to the underlying background and not other misspecified processes. Under different assumptions about noise processes we can produce either what appear to be compelling Hellings-Downs correlations of high significance (3-3.4$\sigma$) with a spectrum close to that which is predicted, or surprisingly, under slightly different assumptions, ones that are insignificant. This appears to be related to the fact that many of the highest precision MeerKAT Pulsar Timing Array pulsars are in close proximity and dominate the detection statistics. The sky-averaged characteristic strain amplitude of the correlated signal in our most significant model is $h_{c, {\rm yr}} = 7.5^{+0.8}_{-0.9} \times 10^{-15}$ measured at a spectral index of $\alpha=-0.26$, decreasing to $h_{c, {\rm yr}} = 4.8^{+0.8}_{-0.9} \times 10^{-15}$ when assessed at the predicted $\alpha=-2/3$. These data will be valuable as the International Pulsar Timing Array project explores the significance of gravitational wave detections and their dependence on the assumed noise models.
- Published
- 2024
- Full Text
- View/download PDF
45. The MeerKAT Pulsar Timing Array: The $4.5$-year data release and the noise and stochastic signals of the millisecond pulsar population
- Author
-
Miles, Matthew T., Shannon, Ryan M., Reardon, Daniel J., Bailes, Matthew, Champion, David J., Geyer, Marisa, Gitika, Pratyasha, Grunthal, Kathrin, Keith, Michael J., Kramer, Michael, Kulkarni, Atharva D., Nathan, Rowina S., Parthasarathy, Aditya, Porayko, Nataliya K., Singha, Jaikhomba, Theureau, Gilles, Abbate, Federico, Buchner, Sarah, Cameron, Andrew D., Camilo, Fernando, Moreschi, Beatrice E., Shaifullah, Golam, Shamohammadi, Mohsen, and Krishnan, Vivek Venkatraman
- Subjects
Astrophysics - High Energy Astrophysical Phenomena ,Astrophysics - Instrumentation and Methods for Astrophysics - Abstract
Pulsar timing arrays are ensembles of regularly observed millisecond pulsars timed to high precision. Each pulsar in an array could be affected by a suite of noise processes, most of which are astrophysically motivated. Analysing them carefully can be used to understand these physical processes. However, the primary purpose of these experiments is to detect signals that are common to all pulsars, in particular signals associated with a stochastic gravitational wave background. To detect this, it is paramount to appropriately characterise other signals that may otherwise impact array sensitivity or cause a spurious detection. Here we describe the second data release and first detailed noise analysis of the pulsars in the MeerKAT Pulsar Timing Array, comprising high-cadence and high-precision observations of $83$ millisecond pulsars over $4.5$ years. We use this analysis to search for a common signal in the data, finding a process with an amplitude of $\log_{10}\mathrm{A_{CURN}} = -14.25^{+0.21}_{-0.36}$ and spectral index $\gamma_\mathrm{CURN} = 3.60^{+1.31}_{-0.89}$. Fixing the spectral index at the value predicted for a background produced by the inspiral of binary supermassive black holes, we measure the amplitude to be $\log_{10}\mathrm{A_{CURN}} = -14.28^{+0.21}_{-0.21}$ at a significance expressed as a Bayes factor of $\ln(\mathcal{B}) = 4.46$. Under both assumptions, the amplitude that we recover is larger than those reported by other PTA experiments. We use the results of this analysis to forecast our sensitivity to a gravitational wave background possessing the spectral properties of the common signal we have measured.
- Published
- 2024
- Full Text
- View/download PDF
46. The ionizing photon budget and effective clumping factor in radiative transfer simulations calibrated to Lyman-alpha forest data
- Author
-
Asthana, Shikhar, Kulkarni, Girish, Haehnelt, Martin G., Bolton, James S., Keating, Laura C., and Simmonds, Charlotte
- Subjects
Astrophysics - Cosmology and Nongalactic Astrophysics - Abstract
Recent JWST observations have allowed for the first time to obtain comprehensive measurements of the ionizing photon production efficiency $\xi_\text{ion} $ for a wide range of reionization-epoch galaxies. We explore implications for the inferred UV luminosity functions and escape fractions of ionizing sources in our suite of simulations. These are run with the GPU-based radiative transfer code ATON-HE and are calibrated to the XQR-30 Lyman-alpha forest data at $5
50$% at $z> 10$, disfavouring the oligarchic source model at very high redshift. The inferred effective clumping factors in our simulations are in the range of $3-6$, suggesting consistency between the observed ionizing properties of reionization-epoch galaxies and the ionizing photon budget in our simulations., Comment: 6 pages. 3 figures - Published
- 2024
47. Long Range Named Entity Recognition for Marathi Documents
- Author
-
Deshmukh, Pranita, Kulkarni, Nikita, Kulkarni, Sanhita, Manghani, Kareena, Kale, Geetanjali, and Joshi, Raviraj
- Subjects
Computer Science - Computation and Language ,Computer Science - Machine Learning - Abstract
The demand for sophisticated natural language processing (NLP) methods, particularly Named Entity Recognition (NER), has increased due to the exponential growth of Marathi-language digital content. In particular, NER is essential for recognizing distant entities and for arranging and understanding unstructured Marathi text data. With an emphasis on managing long-range entities, this paper offers a comprehensive analysis of current NER techniques designed for Marathi documents. It dives into current practices and investigates the BERT transformer model's potential for long-range Marathi NER. Along with analyzing the effectiveness of earlier methods, the report draws comparisons between NER in English literature and suggests adaptation strategies for Marathi literature. The paper discusses the difficulties caused by Marathi's particular linguistic traits and contextual subtleties while acknowledging NER's critical role in NLP. To conclude, this project is a major step forward in improving Marathi NER techniques, with potential wider applications across a range of NLP tasks and domains.
- Published
- 2024
48. L3Cube-MahaSum: A Comprehensive Dataset and BART Models for Abstractive Text Summarization in Marathi
- Author
-
Deshmukh, Pranita, Kulkarni, Nikita, Kulkarni, Sanhita, Manghani, Kareena, and Joshi, Raviraj
- Subjects
Computer Science - Computation and Language ,Computer Science - Machine Learning - Abstract
We present the MahaSUM dataset, a large-scale collection of diverse news articles in Marathi, designed to facilitate the training and evaluation of models for abstractive summarization tasks in Indic languages. The dataset, containing 25k samples, was created by scraping articles from a wide range of online news sources and manually verifying the abstract summaries. Additionally, we train an IndicBART model, a variant of the BART model tailored for Indic languages, using the MahaSUM dataset. We evaluate the performance of our trained models on the task of abstractive summarization and demonstrate their effectiveness in producing high-quality summaries in Marathi. Our work contributes to the advancement of natural language processing research in Indic languages and provides a valuable resource for future research in this area using state-of-the-art models. The dataset and models are shared publicly at https://github.com/l3cube-pune/MarathiNLP
- Published
- 2024
49. Dissolution behavior of Olmesartan Medoxomil drug in polymeric micelles of soluplus and pluronic F127
- Author
-
Dutta, Suchetana, Kulkarni, P. K., and Shailesh, T.
- Published
- 2021
- Full Text
- View/download PDF
50. Distinct and interdependent functions of three RING proteins regulate recombination during mammalian meiosis.
- Author
-
Ito, Masaru, Yun, Yan, Kulkarni, Dhananjaya, Lee, Sunkyung, Sandhu, Sumit, Nuñez, Briana, Hu, Linya, Lee, Kevin, Lim, Nelly, Hirota, Rachel, Prendergast, Rowan, Huang, Cynthia, Huang, Ivy, and Hunter, Neil
- Subjects
crossover ,gamete ,meiosis ,reproduction ,ubiquitin ,Animals ,Mice ,Meiosis ,Male ,Ubiquitin-Protein Ligases ,Crossing Over ,Genetic ,Spermatocytes ,Chromosome Pairing ,Recombination ,Genetic ,Female ,Oocytes ,Cell Cycle Proteins - Abstract
During meiosis, each pair of homologous chromosomes becomes connected by at least one crossover, as required for accurate segregation, and adjacent crossovers are widely separated thereby limiting total numbers. In coarsening models, this crossover patterning results from nascent recombination sites competing to accrue a limiting pro-crossover RING-domain protein (COR) that diffuses between synapsed chromosomes. Here, we delineate the localization dynamics of three mammalian CORs in the mouse and determine their interdependencies. RNF212, HEI10, and the newest member RNF212B show divergent spatiotemporal dynamics along synapsed chromosomes, including profound differences in spermatocytes and oocytes, that are not easily reconciled by elementary coarsening models. Contrasting mutant phenotypes and genetic requirements indicate that RNF212B, RNF212, and HEI10 play distinct but interdependent functions in regulating meiotic recombination and coordinating the events of meiotic prophase-I by integrating signals from DNA breaks, homolog synapsis, the cell-cycle, and incipient crossover sites.
- Published
- 2025
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.