Search

Progress in gravitational-wave astronomy depends upon having sensitive detectors with good data quality. Since the end of the LIGO-Virgo-KAGRA third Observing run in March 2020, detector-characterization efforts have lead to increased sensitivity of the detectors, swifter validation of gravitational-wave candidates and improved tools used for data-quality products. In this article, we discuss these efforts in detail and their impact on our ability to detect and study gravitational-waves. These include the multiple instrumental investigations that led to reduction in transient noise, along with the work to improve software tools used to examine the detectors data-quality. We end with a brief discussion on the role and requirements of detector characterization as the sensitivity of our detectors further improves in the future Observing runs., Comment: 35 pages, 18 figures

We meticulously study the individual effects of hydrogen irradiation and annealing on the electronic structure and magnetic properties of nanostructured MoS2 thin films grown through Chemical Vapor Deposition (CVD). The role of edge-terminated structure and point defects to induce room-temperature ferromagnetism (RTFM) is thoroughly investigated. The nanostructured pristine MoS2 thin films show the formation of a pure 2-H MoS2 phase, confirmed by X-ray diffraction (XRD) and Raman spectroscopy. Pristine MoS2 thin films are independently annealed in a reducing hydrogen environment and irradiated with low-energy hydrogen ions to study the significance of point defects like sulfur vacancies. RTFM with saturation magnetization value (Ms: 1.66 emu/g) has been observed in the pristine film. Magnetization increases after irradiation and annealing processes. However, hydrogen annealing at a temperature of 200oC exhibits a maximum Ms value of 2.7 emu/g at room temperature. The increase in ferromagnetism is attributed to an increment in sulfur vacancies, hydrogen adsorption with sulfur, and modification in edges, which is confirmed by the analysis of Electron probe micro-analyzer (EPMA), X-ray photoelectron spectroscopy (XPS), and Field emission scanning electron microscopy (FESEM) measurements. The Density Functional Theory (DFT) calculations have demonstrated that the edge-oriented structure of MoS2 exhibits a magnetization value of 3.2 {\mu}B. Additionally, introducing an S-vacancy and H-adsorption in a parallel position to the sulfur further enhances the magnetization value to 3.85 {\mu}B and 3.43 {\mu}B respectively. These findings align broadly with our experimental results., Comment: arXiv admin note: text overlap with arXiv:2406.09721

The calculation of material phonon thermal conductivity from density functional theory calculations requires computationally expensive evaluation of anharmonic interatomic force constants and has remained a computational bottleneck in the high-throughput discovery of materials. In this work, we present a machine learning-assisted approach for the extraction of anharmonic force constants through local learning of the potential energy surface. We demonstrate our approach on a diverse collection of 220 ternary materials for which the total computational time for anharmonic force constants evaluation is reduced by more than an order of magnitude from 480,000 cpu-hours to less than 12,000 cpu-hours while preserving the thermal conductivity prediction accuracy to within 10%. Our approach removes a major hurdle in computational thermal conductivity evaluation and will pave the way forward for the high-throughput discovery of materials.

Error-correcting codes are one of the most fundamental objects in pseudorandomness, with applications in communication, complexity theory, and beyond. Codes are useful because of their ability to support decoding, which is the task of recovering a codeword from its noisy copy. List decoding is a relaxation where the decoder is allowed to output a list of codewords, and has seen tremendous progress over the last 25 years. In this thesis, we prove new algorithmic and combinatorial results about list decoding. We describe a list decoding framework that reduces the task of efficient decoding to proving distance in certain restricted proof systems. We then instantiate this framework for Tanner codes of Sipser and Spielman [IEEE Trans. Inf. Theory 1996] and Alon-Edmonds-Luby (AEL) distance amplification [FOCS 1995] of unique decodable base codes to get the first polynomial time list decoding algorithms for these codes. We also show extensions to the quantum version of AEL distance amplification to get polynomial-time list decodable quantum LDPC codes. We next give an alternate viewpoint of the above framework based on abstract regularity lemmas. We show how to efficiently implement the regularity lemma for the case of Ta-Shma's explicit codes near the Gilbert-Varshamov bound [STOC 2017]. This leads to a near-linear time algorithm for unique decoding of Ta-Shma's code. We also give new combinatorial results that improve known list sizes beyond the Johnson bound. Firstly, we adapt the AEL amplification to construct a new family of explicit codes that can be combinatorially list decoded to the optimal error correction radius. This is the first example of such a code that does not use significant algebraic ingredients. Secondly, we present list size improvements for Folded Reed-Solomon codes, improving the state of the art list size for explicit list decoding capacity achieving codes., Comment: PhD Thesis, 235 pages

We show in this letter how a heavy $(\mathcal{O}(TeV))$ invisible $Z'$ gauge boson that will practically be out of reach of the Large Hadron Collider (LHC), can be discovered at the future muon collider. The new force carrier has a relatively stronger coupling with the beyond standard model (BSM) sector, while its interaction with the SM fields is much weaker. This weaker coupling is induced through mixing mechanisms, specifically via gauge kinetic mixing and the $Z-Z'$ mixing. We consider a scenario where the new gauge boson decays mostly to charge-neutral long-lived particles and/or dark matter (DM). We show how producing and detecting this heavier invisible $Z'$, that will be beyond the reach of even the very high luminosity LHC, becomes possible if it is produced in association with an energetic photon at the future muon collider. The on-shell production of the $Z'$ will lead to a peak in the photon energy distribution, following the so-called radiative return phenomena and can lead to the accurate determination of the $Z'$ mass and its interaction with SM particles., Comment: 6 pages, 4 figures, 5 tables

Our study delves into the fusion of abstract art interpretation and text-to-image synthesis, addressing the challenge of achieving precise spatial control over image composition solely through textual prompts. Leveraging the capabilities of ControlNet, we empower users with finer control over the synthesis process, enabling enhanced manipulation of synthesized imagery. Inspired by the minimalist forms found in abstract artworks, we introduce a novel condition crafted from geometric primitives such as triangles., Comment: 5 pages, 4 figures

We propose the first comprehensive approach for modeling and analyzing the spatiotemporal shape variability in tree-like 4D objects, i.e., 3D objects whose shapes bend, stretch, and change in their branching structure over time as they deform, grow, and interact with their environment. Our key contribution is the representation of tree-like 3D shapes using Square Root Velocity Function Trees (SRVFT). By solving the spatial registration in the SRVFT space, which is equipped with an L2 metric, 4D tree-shaped structures become time-parameterized trajectories in this space. This reduces the problem of modeling and analyzing 4D tree-like shapes to that of modeling and analyzing elastic trajectories in the SRVFT space, where elasticity refers to time warping. In this paper, we propose a novel mathematical representation of the shape space of such trajectories, a Riemannian metric on that space, and computational tools for fast and accurate spatiotemporal registration and geodesics computation between 4D tree-shaped structures. Leveraging these building blocks, we develop a full framework for modelling the spatiotemporal variability using statistical models and generating novel 4D tree-like structures from a set of exemplars. We demonstrate and validate the proposed framework using real 4D plant data.

$MHyPbBr_xCl_{3-x}$ exhibits an interesting temperature-induced phase diagram transitioning from monoclinic (Phase-II) to orthorhombic (Phase-I) and eventually to the high-temperature disordered cubic phase. However, experimental observations indicate the absence of either the cubic or orthorhombic phases in compositions with x=0 (chloride) and x=3 (bromide), respectively. We explain the composition dependence of the phase transition sequence in MHyPbX3 (X = Cl, Br) from the perspective of a host/guest framework for the system. We argue that the sequence of phase transitions in MHyPbX3 can be anticipated based on the competition between host distortion and host/guest coupling energies. A dominant coupling in MHyPbCl3 ensures the stabilization of the intermediate Phase-I while pushing the transition to cubic phase beyond its decomposition temperature. On the other hand, a balance of the energy scales in MHyPbBr3 suppresses Phase-I and stabilizes the cubic phase. Our expectations were supported by first-principles based estimates of the transition temperatures in both compounds, which yield trends in agreement with experimental observations. Furthermore, ab initio molecular dynamics simulations revealed that the cubic phase of MHyPbBr3 results from a disorder over locally orthorhombic structures, a clear manifestation of the balance of energy scales. We propose that the same concept can be employed to predict the stable phases in other hybrid perovskites.

Anonymity is an important principle online. However, malicious actors have long used misleading identities to conduct fraud, spread disinformation, and carry out other deceptive schemes. With the advent of increasingly capable AI, bad actors can amplify the potential scale and effectiveness of their operations, intensifying the challenge of balancing anonymity and trustworthiness online. In this paper, we analyze the value of a new tool to address this challenge: "personhood credentials" (PHCs), digital credentials that empower users to demonstrate that they are real people -- not AIs -- to online services, without disclosing any personal information. Such credentials can be issued by a range of trusted institutions -- governments or otherwise. A PHC system, according to our definition, could be local or global, and does not need to be biometrics-based. Two trends in AI contribute to the urgency of the challenge: AI's increasing indistinguishability from people online (i.e., lifelike content and avatars, agentic activity), and AI's increasing scalability (i.e., cost-effectiveness, accessibility). Drawing on a long history of research into anonymous credentials and "proof-of-personhood" systems, personhood credentials give people a way to signal their trustworthiness on online platforms, and offer service providers new tools for reducing misuse by bad actors. In contrast, existing countermeasures to automated deception -- such as CAPTCHAs -- are inadequate against sophisticated AI, while stringent identity verification solutions are insufficiently private for many use-cases. After surveying the benefits of personhood credentials, we also examine deployment risks and design challenges. We conclude with actionable next steps for policymakers, technologists, and standards bodies to consider in consultation with the public., Comment: 63 pages, 7 figures, 5 tables; minor additions to acknowledgments and wording changes for clarity; corrected typo

A graph $G$ is $k$-edge geodetic graph if every edge of $G$ lies in at least one geodesic of length $k$. We studied some basic properties of $k$-edge geodetic graphs. We investigated the $k$ edge-geodeticity of complete bipartite graph $K_{m,n}$ and provide the minimum number of largest fixed order path that can cover $K_{m,n}$. We also studied the $k$-edge geodeticity of tree and the product graphs like Cartesian product, Strong product, Corona product, and provide the bounds for the minimum number of the largest fixed order path that can cover the graph.

With the advent of multi-modal large language models (MLLMs), datasets used for visual question answering (VQA) and referring expression comprehension have seen a resurgence. However, the most popular datasets used to evaluate MLLMs are some of the earliest ones created, and they have many known problems, including extreme bias, spurious correlations, and an inability to permit fine-grained analysis. In this paper, we pioneer evaluating recent MLLMs (LLaVA 1.5, LLaVA-NeXT, BLIP2, InstructBLIP, GPT-4V, and GPT-4o) on datasets designed to address weaknesses in earlier ones. We assess three VQA datasets: 1) TDIUC, which permits fine-grained analysis on 12 question types; 2) TallyQA, which has simple and complex counting questions; and 3) DVQA, which requires optical character recognition for chart understanding. We also study VQDv1, a dataset that requires identifying all image regions that satisfy a given query. Our experiments reveal the weaknesses of many MLLMs that have not previously been reported. Our code is integrated into the widely used LAVIS framework for MLLM evaluation, enabling the rapid assessment of future MLLMs. Project webpage: https://kevinlujian.github.io/MLLM_Evaluations/

Recently, a linear relationship between product of bound energy, a thermodynamic quantity, of a ground state with system size and square of half-chain entanglement entropy has been established for free fermionic chain with nearest neighbor hopping and conjectured to be true for all 1D conformal field theories [Phys. Rev. B, 107,075116(20230]. We probe this relationship in domain where conformal symmetry is broken using 1D Kitaev model with pairing term which decays with distance as a power-law with exponent $\alpha$. We analytically show that for $\alpha=1$, this relationship persists with same slope as found in $\alpha \to \infty$ case where conformal symmetry is unbroken. We recall that conformal symmetry is broken for $\alpha<3/2$ [Phys. Rev. Lett., 113,156402(2014)]. We numerically show that linearity persists for intermediate values of $\alpha$. The presence of long range pairing helps in extracting more energy for the work i.e. ergotropy. We show analytically that ergotropy increases logarithmically with system size for $\alpha=1$ and becomes proportional to system size for $\alpha=0$ (numerically).

Data sharing is central to a wide variety of applications such as fraud detection, ad matching, and research. The lack of data sharing abstractions makes the solution to each data sharing problem bespoke and cost-intensive, hampering value generation. In this paper, we first introduce a data sharing model to represent every data sharing problem with a sequence of dataflows. From the model, we distill an abstraction, the contract, which agents use to communicate the intent of a dataflow and evaluate its consequences, before the dataflow takes place. This helps agents move towards a common sharing goal without violating any regulatory and privacy constraints. Then, we design and implement the contract programming model (CPM), which allows agents to program data sharing applications catered to each problem's needs. Contracts permit data sharing, but their interactive nature may introduce inefficiencies. To mitigate those inefficiencies, we extend the CPM so that it can save intermediate outputs of dataflows, and skip computation if a dataflow tries to access data that it does not have access to. In our evaluation, we show that 1) the contract abstraction is general enough to represent a wide range of sharing problems, 2) we can write programs for complex data sharing problems and exhibit qualitative improvements over other alternate technologies, and 3) quantitatively, our optimizations make sharing programs written with the CPM efficient.

Land Use Land Cover (LULC) mapping is a vital tool for urban and resource planning, playing a key role in the development of innovative and sustainable cities. This study introduces a semi-supervised segmentation model for LULC prediction using high-resolution satellite images with a vast diversity of data distributions in different areas of India. Our approach ensures a robust generalization across different types of buildings, roads, trees, and water bodies within these distinct areas. We propose a modified Cross Pseudo Supervision framework to train image segmentation models on sparsely labelled data. The proposed framework addresses the limitations of the famous 'Cross Pseudo Supervision' technique for semi-supervised learning, specifically tackling the challenges of training segmentation models on noisy satellite image data with sparse and inaccurate labels. This comprehensive approach significantly enhances the accuracy and utility of LULC mapping, providing valuable insights for urban and resource planning applications.

Advanced Persistent Threats (APTs) bring significant challenges to cybersecurity due to their sophisticated and stealthy nature. Traditional cybersecurity measures fail to defend against APTs. Cognitive vulnerabilities can significantly influence attackers' decision-making processes, which presents an opportunity for defenders to exploit. This work introduces PsybORG$^+$, a multi-agent cybersecurity simulation environment designed to model APT behaviors influenced by cognitive vulnerabilities. A classification model is built for cognitive vulnerability inference and a simulator is designed for synthetic data generation. Results show that PsybORG$^+$ can effectively model APT attackers with different loss aversion and confirmation bias levels. The classification model has at least a 0.83 accuracy rate in predicting cognitive vulnerabilities.

As users migrate their analytical workloads to cloud databases, it is becoming just as important to reduce monetary costs as it is to optimize query runtime. In the cloud, a query is billed based on either its compute time or the amount of data it processes. We observe that analytical queries are either compute- or IO-bound and each query type executes cheaper in a different pricing model. We exploit this opportunity and propose methods to build cheaper execution plans across pricing models that complete within user-defined runtime constraints. We implement these methods and produce execution plans spanning multiple pricing models that reduce the monetary cost for workloads by as much as 56%. We reduce individual query costs by as much as 90%. The prices chosen by cloud vendors for cloud services also impact savings opportunities. To study this effect, we simulate our proposed methods with different cloud prices and observe that multi-cloud savings are robust to changes in cloud vendor prices. These results indicate the massive opportunity to save money by executing workloads across multiple pricing models., Comment: 12 pages; VLDB 2024

The ability to form diamond electrodes on insulating polycrystalline diamond substrates using single-step laser patterning, and the use of the electrodes as a substrate that supports the adhesion and proliferation of human mesenchymal stem cells (hMSCs) is demonstrated. Laser induced graphitisation results in a conductive amorphous carbon surface, rich in oxygen and nitrogen terminations. This results in an electrode with a high specific capacitance of 182 uF/cm2, a wide water window of 3.25 V, and a low electrochemical impedance of 129 Ohms/cm2 at 1 kHz. The electrodes surface exhibited a good level of biocompatibility with hMSCs, supporting cell adhesion and proliferation. The cells cultured on the electrode displayed significant elongation and alignment along the direction of the laser patterned microgrooves. Because of its favourable electrochemical performance and biocompatibility, the laser-patterned diamond electrodes create a potential for a versatile platform in stem cell therapeutics.

Data-enabled predictive control (DeePC) has garnered significant attention for its ability to achieve safe, data-driven optimal control without relying on explicit system models. Traditional DeePC methods use pre-collected input/output (I/O) data to construct Hankel matrices for online predictive control. However, in systems with evolving dynamics or insufficient pre-collected data, incorporating real-time data into the DeePC framework becomes crucial to enhance control performance. This paper proposes an online DeePC framework for time-varying systems (i.e., systems with evolving dynamics), enabling the algorithm to update the Hankel matrix online by adding real-time informative signals. By exploiting the minimum non-zero singular value of the Hankel matrix, the developed online DeePC selectively integrates informative data and effectively captures evolving system dynamics. Additionally, a numerical singular value decomposition technique is introduced to reduce the computational complexity for updating a reduced-order Hankel matrix. Simulation results on two cases, a linear time-varying system and the vehicle anti-rollover control, demonstrate the effectiveness of the proposed online reduced-order DeePC framework.

Concept Bottleneck Models (CBMs) provide interpretable prediction by introducing an intermediate Concept Bottleneck Layer (CBL), which encodes human-understandable concepts to explain models' decision. Recent works proposed to utilize Large Language Models (LLMs) and pre-trained Vision-Language Models (VLMs) to automate the training of CBMs, making it more scalable and automated. However, existing approaches still fall short in two aspects: First, the concepts predicted by CBL often mismatch the input image, raising doubts about the faithfulness of interpretation. Second, it has been shown that concept values encode unintended information: even a set of random concepts could achieve comparable test accuracy to state-of-the-art CBMs. To address these critical limitations, in this work, we propose a novel framework called Vision-Language-Guided Concept Bottleneck Model (VLG-CBM) to enable faithful interpretability with the benefits of boosted performance. Our method leverages off-the-shelf open-domain grounded object detectors to provide visually grounded concept annotation, which largely enhances the faithfulness of concept prediction while further improving the model performance. In addition, we propose a new metric called Number of Effective Concepts (NEC) to control the information leakage and provide better interpretability. Extensive evaluations across five standard benchmarks show that our method, VLG-CBM, outperforms existing methods by at least 4.27% and up to 51.09% on accuracy at NEC=5, and by at least 0.45% and up to 29.78% on average accuracy across different NECs, while preserves both faithfulness and interpretability of the learned concepts as demonstrated in extensive experiments.

The 4D-5D connection allows us to view the same near horizon geometry as part of a 4D black hole or a 5D black hole. A much studied example of this phenomenon is the BMPV black hole uplifted to 6D with flat base space versus Taub-NUT base space. These black holes have identical near horizon AdS_3 x S^3 geometry. In this paper, we study modes in AdS_3 x S^3 and identify those that correspond to supersymmetric hair modes in the full black hole spacetimes. We show that these modes satisfy non-normalisable boundary conditions in AdS_3. The non-normalisable boundary conditions are different for different hair modes. We also discuss how the supersymmetric hair modes on BMPV black holes fit into the classification of supersymmetric solutions of 6D supergravity., Comment: 25 pages, no figures

Frequency comb and field-resolved broadband absorption spectroscopy are promising techniques for rapid, precise, and sensitive detection of short-lived atmospheric pollutants on-site. Enhancing detection sensitivity in absorption spectroscopy hinges on bright sources that cover molecular resonances and fast signal modulation techniques to implement lock-in detection schemes efficiently. Yb:YAG thin-disk lasers, combined with optical parametric oscillators (OPO), present a compelling solution to fulfill these requirements. In this work, we report on a bright OPO pumped by a Yb:YAG thin-disk Kerr-lens mode-locked oscillator delivering 2.8 W, 114 fs pulses at 2.06 {\mu}m with an averaged energy of 90 nJ. The OPO cavity operates at 30.9 MHz pulse repetition rates, the second harmonic of the pump cavity, allowing for broadband, efficient, and dispersion-free modulation of the OPO output pulses at 15.45 MHz rate. With 13% optical-to-optical conversion efficiency and a high-frequency intra-cavity modulation, this scalable scheme holds promise to advance the detection sensitivity and frontiers of field-resolved spectroscopic techniques.

E-governance is a two-way protocol through which one can use government services, share data and request information. It refers to the use of communication and information technologies to provide government services to public in an efficient and fast manner. In addition, any document submitted to the e-Government system must be authenticated by a government officer using a digital signature scheme. In the context of digital signatures, the proxy signature is an important cryptographic primitive that allows the original signer to delegate signing authority to another signer (proxy signer). The proxy signature has a number of important applications in the e-government system. There are now a large amount of proxy signature schemes. The security of most of them relies on the following hard problems: the discrete logarithm problem and the factorization of integers problem. However, a large-scale quantum computer can solve them in polynomial time due to Shor's algorithm. As a consequence, there is a need for a quantum computer-resistant proxy signature to secure e-governance system from quantum adversaries. In this work, we propose the first post-quantum isogeny based proxy signature scheme CSI-PS (commutative supersingular isogeny proxy signature). Our construction is proven to be uf-cma secure under the hardness of the group action inverse problem (GAIP) based on isogeny.

Text summarization is a well-studied problem that deals with deriving insights from unstructured text consumed by humans, and it has found extensive business applications. However, many real-life tasks involve generating a series of actions to achieve specific goals, such as workflows, recipes, dialogs, and travel plans. We refer to them as planning-like (PL) tasks noting that the main commonality they share is control flow information. which may be partially specified. Their structure presents an opportunity to create more practical summaries to help users make quick decisions. We investigate this observation by introducing a novel plan summarization problem, presenting a dataset, and providing a baseline method for generating PL summaries. Using quantitative metrics and qualitative user studies to establish baselines, we evaluate the plan summaries from our method and large language models. We believe the novel problem and dataset can reinvigorate research in summarization, which some consider as a solved problem.

We present results from a search for X-ray/gamma-ray counterparts of gravitational-wave (GW) candidates from the third observing run (O3) of the LIGO-Virgo-KAGRA (LVK) network using the Swift Burst Alert Telescope (Swift-BAT). The search includes 636 GW candidates received in low latency, 86 of which have been confirmed by the offline analysis and included in the third cumulative Gravitational-Wave Transient Catalogs (GWTC-3). Targeted searches were carried out on the entire GW sample using the maximum--likelihood NITRATES pipeline on the BAT data made available via the GUANO infrastructure. We do not detect any significant electromagnetic emission that is temporally and spatially coincident with any of the GW candidates. We report flux upper limits in the 15-350 keV band as a function of sky position for all the catalog candidates. For GW candidates where the Swift-BAT false alarm rate is less than 10$^{-3}$ Hz, we compute the GW--BAT joint false alarm rate. Finally, the derived Swift-BAT upper limits are used to infer constraints on the putative electromagnetic emission associated with binary black hole mergers., Comment: 50 pages, 10 figures, 4 tables

In social robotics, a pivotal focus is enabling robots to engage with humans in a more natural and seamless manner. The emergence of advanced large language models (LLMs) such as Generative Pre-trained Transformers (GPTs) and autoregressive models like Large Language Model Meta AI (Llamas) has driven significant advancements in integrating natural language understanding capabilities into social robots. This paper presents a system for speech-guided sequential planning in autonomous navigation, utilizing Llama3 and the Robot Operating System~(ROS). The proposed system involves using Llama3 to interpret voice commands, extracting essential details through parsing, and decoding these commands into sequential actions for tasks. Such sequential planning is essential in various domains, particularly in the pickup and delivery of an object. Once a sequential navigation task is evaluated, we employ DRL-VO, a learning-based control policy that allows a robot to autonomously navigate through social spaces with static infrastructure and (crowds of) people. We demonstrate the effectiveness of the system in simulation experiment using Turtlebot 2 in ROS1 and Turtlebot 3 in ROS2. We conduct hardware trials using a Clearpath Robotics Jackal UGV, highlighting its potential for real-world deployment in scenarios requiring flexible and interactive robotic behaviors.

The eruption of Nova V2891 Cygni in 2019 offers a rare opportunity to explore the shock-induced processes in novae ejecta. The spectral evolution shows noticeable differences in the evolution of various oxygen emission lines such as O I 7773 {\AA}, O I 8446 {\AA}, O I 1.1286 $\mu$m, O I 1.3164 $\mu$m, etc. Here, we use spectral synthesis code CLOUDY to study the temporal evolution of these oxygen emission lines. Our photoionization model requires the introduction of a component with a very high density ($n ~ 10^{11}$ cm$^{-3}$) and an enhanced oxygen abundance (O/H $\sim$ 28) to produce the O I 7773 {\AA} emission line, suggesting a stratification of material with high oxygen abundance within the ejecta. An important outcome is the behaviour of the O I 1.3164 $\mu$m line, which could only be generated by invoking the collisional ionization models in CLOUDY. Our phenomenological analysis suggests that O I 1.3164 $\mu$m emission originates from a thin, dense shell characterized by a high density of about $10^{12.5} - 10^{12.8}$ cm$^{-3}$, which is most likely formed due to the strong internal collisions. If such is the case, the O I 1.3164 $\mu$m emission presents itself as a tracer of shock-induced dust formation in V2891 Cyg. The collisional ionization models have also been successful in creating the high-temperature conditions ($~ 7.07 - 7.49 \times 10^5$ K) required to reproduce the observed high ionization potential coronal lines, which coincide with the epoch of dust formation and evolution of the O I 1.3164 $\mu$m emission line., Comment: 17 pages, 8 figures. Manuscript has been accepted for publication in MNRAS

The consequences of a healthcare data breach can be devastating for the patients, providers, and payers. The average financial impact of a data breach in recent months has been estimated to be close to USD 10 million. This is especially significant for healthcare organizations in India that are managing rapid digitization while still establishing data governance procedures that align with the letter and spirit of the law. Computer-based systems for de-identification of personal information are vulnerable to data drift, often rendering them ineffective in cross-institution settings. Therefore, a rigorous assessment of existing de-identification against local health datasets is imperative to support the safe adoption of digital health initiatives in India. Using a small set of de-identified patient discharge summaries provided by an Indian healthcare institution, in this paper, we report the nominal performance of de-identification algorithms (based on language models) trained on publicly available non-Indian datasets, pointing towards a lack of cross-institutional generalization. Similarly, experimentation with off-the-shelf de-identification systems reveals potential risks associated with the approach. To overcome data scarcity, we explore generating synthetic clinical reports (using publicly available and Indian summaries) by performing in-context learning over Large Language Models (LLMs). Our experiments demonstrate the use of generated reports as an effective strategy for creating high-performing de-identification systems with good generalization capabilities., Comment: Accepted at BioNLP Workshop at ACL 2024; 21 pages (9 pages main content)

This paper introduces the concept of the closed neighborhood corona product of the graph. We explore the mathematical features of this product graph, specifically in terms of its spectral characteristics. We have calculated the characteristic polynomials of the adjacency, Laplacian, and signless Laplacian matrices. Moreover, we investigate the conditions under which two graphs are cospectral regarding this product. A significant portion of our study is dedicated to computing the Kirchhoff index, the number of spanning trees and the sequence of non-cospectral equienergetic product graphs. We also outline specific criteria that determine when the product graph is integral.

Knowledge Graph Question Answering (KGQA) simplifies querying vast amounts of knowledge stored in a graph-based model using natural language. However, the research has largely concentrated on English, putting non-English speakers at a disadvantage. Meanwhile, existing multilingual KGQA systems face challenges in achieving performance comparable to English systems, highlighting the difficulty of generating SPARQL queries from diverse languages. In this research, we propose a simplified approach to enhance multilingual KGQA systems by incorporating linguistic context and entity information directly into the processing pipeline of a language model. Unlike existing methods that rely on separate encoders for integrating auxiliary information, our strategy leverages a single, pretrained multilingual transformer-based language model to manage both the primary input and the auxiliary data. Our methodology significantly improves the language model's ability to accurately convert a natural language query into a relevant SPARQL query. It demonstrates promising results on the most recent QALD datasets, namely QALD-9-Plus and QALD-10. Furthermore, we introduce and evaluate our approach on Chinese and Japanese, thereby expanding the language diversity of the existing datasets.

The rainfall associated with Topical Cyclone(TC) contributes a major amount to the annual rainfall in India. Due to the limited research on the quantitative precipitation associated with Tropical Cyclones (TC), the prediction of the amount of precipitation and area that it may cover remains a challenge. This paper proposes an approach to estimate the accumulated precipitation and impact on affected area using Remote Sensing data. For this study, an instance of Extremely Severe Cyclonic Storm, Biparjoy that formed over the Arabian Sea and hit India in 2023 is considered in which we have used the satellite images of IMERG-Late Run of Global Precipitation Measurement (GPM). Image processing techniques were employed to identify and extract precipitation clusters linked to the cyclone. The results indicate that Biparjoy contributed a daily average rainfall of 53.14 mm/day across India and the Arabian Sea, with the Indian boundary receiving 11.59 mm/day, covering an extensive 411.76 thousand square kilometers. The localized intensity and variability observed in states like Gujarat, Rajasthan, Madhya Pradesh, and Uttar Pradesh highlight the need for tailored response measures, emphasizing the importance of further research to enhance predictive models and disaster readiness, crucial for building resilience against the diverse impacts of tropical cyclones.

In this manuscript, we initiate the study of the number of rational points with bounded denominators, contained in a non-isotropic $\delta_1\times\ldots\times \delta_R$ neighborhood of a compact submanifold $\mathcal{M}$ of codimension $R$ in $\mathbb{R}^{M}$. We establish an upper bound for this counting function which holds when $\mathcal{M}$ satisfies a strong curvature condition, first introduced by Schindler-Yamagishi in \cite{schindler2022density}. Further, even in the isotropic case when $\delta_1=\ldots=\delta_R=\delta$, we obtain an asymptotic formula which holds beyond the range of distance to $\mathcal{M}$ established in \cite{schindler2022density}. Our result is also a generalization of the work of J.J. Huang \cite{huangduke} for hypersurfaces. As an application, we establish for the first time an upper bound for the Hausdorff dimension of the set of weighted simultaneously well approximable points on a manifold $\mathcal{M}$ satisfying the strong curvature condition, which agrees with the lower bound obtained by Allen-Wang in \cite{allen2022note}. Moreover, for $R>1$, we obtain a new upper bound for the number of rational points \textit{on} $\mathcal{M}$, which goes beyond the bound in an analogue of Serre's dimension growth conjecture for submanifolds of $\mathbb{R}^M$ ., Comment: 42 pages. Comments welcome! Updated Conjecture 1.2 and corrected minor typos

Given a special biserial algebra $\Lambda$ over an algebraically closed field, let $\mathrm{rad}_\Lambda$ denote the radical of its module category. The authors showed with Sinha that the stable rank of a special biserial algebra $\Lambda$, i.e., the least ordinal $\gamma$ satisfying $\mathrm{rad}_\Lambda^\gamma=\mathrm{rad}_\Lambda^{\gamma+1}$, is strictly bounded above by $\omega^2$. We use finite automata to give simple algorithmic proofs, complete with their time complexity analyses, of two key ingredients in the proof of this result--the first one states that certain linear orders called hammocks associated with such algebras are \emph{finite description linear orders}, i.e., they lie in the smallest class of linear orders that contains finite linear orders and $\omega$, and that is closed under isomorphisms, order-reversals, binary sums, co-lexicographic products and finitary shuffles. We also document a complete proof of the result that the class of order types(=order-isomorphism classes) of finite description linear orders coincides with that of languages of finite automata under inorder., Comment: 15 pages, 9 figures