Search

Automated molecular simulations are used extensively for predicting material properties. Typically, these simulations exhibit two regimes: a dynamic equilibration part, followed by a steady state. For extracting observable properties, the simulations must first reach a steady state so that thermodynamic averages can be taken. However, as equilibration depends on simulation conditions, predicting the optimal number of simulation steps a priori is impossible. Here, we demonstrate the application of the Marginal Standard Error Rule (MSER) for automatically identifying the optimal truncation point in Grand Canonical Monte Carlo (GCMC) simulations. This novel automatic procedure determines the point in which steady state is reached, ensuring that figures-of-merits are extracted in an objective, accurate, and reproducible fashion. In the case of GCMC simulations of gas adsorption in metal-organic frameworks, we find that this methodology reduces the computational cost by up to 90%. As MSER statistics are independent of the simulation method that creates the data, this library is, in principle, applicable to any time series analysis in which equilibration truncation is required. The open-source Python implementation of our method, pyMSER, is publicly available for reuse and validation at https://github.com/IBM/pymser., Comment: 10 pages, 7 figures

Social media has become integral to human interaction, providing a platform for communication and expression. However, the rise of hate speech on these platforms poses significant risks to individuals and communities. Detecting and addressing hate speech is particularly challenging in languages like Portuguese due to its rich vocabulary, complex grammar, and regional variations. To address this, we introduce TuPy-E, the largest annotated Portuguese corpus for hate speech detection. TuPy-E leverages an open-source approach, fostering collaboration within the research community. We conduct a detailed analysis using advanced techniques like BERT models, contributing to both academic understanding and practical applications, Comment: 15 pages, 7 figures, 10 tables

We study the robustness of the baryon acoustic oscillation (BAO) analysis to the underlying cosmological model. We focus on testing the standard BAO analysis that relies on the use of a template. These templates are constructed assuming a fixed fiducial cosmological model and used to extract the location of the acoustic peaks. Such "compressed analysis" had been shown to be unbiased when applied to the $\Lambda$CDM model and some of its extensions. However, it has not been known whether this type of analysis introduces biases in a wider range of cosmological models where the template may not fully capture relevant features in the BAO signal. In this study, we apply the compressed analysis to noiseless mock power spectra that are based on Horndeski models, a broad class of modified-gravity theories specified with eight additional free parameters. We study the precision and accuracy of the BAO peak-location extraction assuming DESI, DESI II, and MegaMapper survey specifications. We find that the bias in the extracted peak locations is negligible; for example, it is less than 10% of the statistical error for even the proposed future MegaMapper survey. Our findings indicate that the compressed BAO analysis is remarkably robust to the underlying cosmological model., Comment: 30 pages, 8 Figures, published version

Covalent Organic Frameworks (COFs) have gained significant popularity in recent years due to their unique ability to provide a high surface area and customizable pore geometry and chemistry. These traits make COFs a highly promising choice for a range of applications. However, with their vast potential structures, exploring COFs experimentally can be challenging and time-consuming, yet it remains an attractive avenue for computational high-throughput studies. However, generating COF structures can be a time-consuming and challenging task. To address this challenge, here we introduce the pyCOFBuilder, an open-source Python package designed to facilitate the generation of COF structures for computational studies. The pyCOFBuilder software provides an easy-to-use set of functionalities to generate COF structures following the reticular approach. In this paper, we describe the implementation, main features, and capabilities of the pyCOFBuilder demonstrating its utility for generating COF structures with varying topologies and chemical properties. pyCOFBuilder is freely available on GitHub at https://github.com/lipelopesoliveira/pyCOFBuilder., Comment: 9 pages, 7 figures on the main text. 14 pages, 14 figures on supporting information

Redshift measurement has always been a constant need in modern astronomy and cosmology. And as new surveys have been providing an immense amount of data on astronomical objects, the need to process such data automatically proves to be increasingly necessary. In this article, we use simulated data from the Dark Energy Survey, and from a pipeline originally created to classify supernovae, we developed a linear regression algorithm optimized through novel automated machine learning (AutoML) frameworks achieving an error score better than ordinary data pre-processing methods when compared with other modern algorithms (such as XGBOOST). Numerically, the photometric prediction RMSE of type Ia supernovae events was reduced from 0.16 to 0.09 and the RMSE of all supernovae types decreased from 0.20 to 0.14. Our pipeline consists of four steps: through spectroscopic data points we interpolate the light curve using Gaussian process fitting algorithm, then using a wavelet transform we extract the most important features of such curves; in sequence we reduce the dimensionality of such features through principal component analysis, and in the end we applied super learning techniques (stacked ensemble methods) through an AutoML framework dedicated to optimize the parameters of several different machine learning models, better resolving the problem. As a final check, we obtained probability distribution functions (PDFs) using Gaussian kernel density estimations through the predictions of more than 50 models trained and optimized by AutoML. Those PDFs were calculated to replicate the original curves that used SALT2 model, a model used for the simulation of the raw data itself.

Grand Canonical Monte Carlo is an important method for performing molecular-level simulations and assisting the study and development of nanoporous materials for gas capture application. These simulations are based on the use of force fields and partial charges to model the interaction between the adsorbent molecules and the solid framework. The choice of the force field parameters and partial charges can significantly impact the results obtained, however, there are very few databases available to support a comprehensive impact evaluation. Here, we present a database of simulations of CO2 and N2 adsorption isotherms on 726 metal-organic frameworks taken from the CoRE MOF 2014 database. We performed simulations with two force fields (UFF and DREIDING), four partial charge schemes (no charge, Qeq, EQeq, and DDEC), and three temperatures (273, 298, 323 K). The resulting isotherms compose the Charge-dependent, Reproducible, Accessible, Forcefield-dependent, and Temperature-dependent Exploratory Database (CRAFTED) of adsorption isotherms., Comment: 18 pages, 6 figures, dataset available at 10.5281/zenodo.7106173

The mechanism(s) driving the early- and late-time accelerated expansion of the Universe represent one of the most compelling mysteries in fundamental physics today. The path to understanding the causes of early- and late-time acceleration depends on fully leveraging ongoing surveys, developing and demonstrating new technologies, and constructing and operating new instruments. This report presents a multi-faceted vision for the cosmic survey program in the 2030s and beyond that derives from these considerations. Cosmic surveys address a wide range of fundamental physics questions, and are thus a unique and powerful component of the HEP experimental portfolio., Comment: Submitted to the Proceedings of the US Community Study on the Future of Particle Physics (Snowmass 2021); Topical Group Report for CF06 (Cosmic Frontier Topical Group on Dark Energy and Cosmic Acceleration: Complementarity of Probes and New Facilities

Cosmological analyses with type Ia supernovae (SNe Ia) often assume a single empirical relation between color and luminosity ($\beta$) and do not account for varying host-galaxy dust properties. However, from studies of dust in large samples of galaxies, it is known that dust attenuation can vary significantly. Here we take advantage of state-of-the-art modeling of galaxy properties to characterize dust parameters (dust attenuation $A_V$, and a parameter describing the dust law slope $R_V$) for the Dark Energy Survey (DES) SN Ia host galaxies using the publicly available \texttt{BAGPIPES} code. Utilizing optical and infrared data of the hosts alone, we find three key aspects of host dust that impact SN Ia cosmology: 1) there exists a large range ($\sim1-6$) of host $R_V$ 2) high stellar mass hosts have $R_V$ on average $\sim0.7$ lower than that of low-mass hosts 3) there is a significant ($>3\sigma$) correlation between the Hubble diagram residuals of red SNe Ia that when corrected for reduces scatter by $\sim13\%$ and the significance of the ``mass step'' to $\sim1\sigma$. These represent independent confirmations of recent predictions based on dust that attempted to explain the puzzling ``mass step'' and intrinsic scatter ($\sigma_{\rm int}$) in SN Ia analyses. We also find that red-sequence galaxies have both lower and more peaked dust law slope distributions on average in comparison to non red-sequence galaxies. We find that the SN Ia $\beta$ and $\sigma_{\rm int}$ both differ by $>3\sigma$ when determined separately for red-sequence galaxy and all other galaxy hosts. The agreement between fitted host-$R_V$ and SN Ia $\beta$ \& $\sigma_{\rm int}$ suggests that host dust properties play a major role in SN Ia color-luminosity standardization and supports the claim that SN Ia intrinsic scatter is driven by $R_V$ variation., Comment: 22 pages. Submitted to MNRAS

This invited Snowmass 2021 White Paper highlights the power of joint-analysis of astronomical transients in advancing HEP Science and presents research activities that can realize the opportunities that come with current and upcoming projects. Transients of interest include gravitational wave events, neutrino events, strongly-lensed quasars and supernovae, and Type~Ia supernovae specifically. These transients can serve as probes of cosmological distances in the Universe and as cosmic laboratories of extreme strong-gravity, high-energy physics. Joint analysis refers to work that requires significant coordination from multiple experiments or facilities so encompasses Multi-Messenger Astronomy and optical transient discovery and distributed follow-up programs., Comment: Minor updates to align with the feedback from the Snowmass Community Summer Study Workshop

A number of recent works have employed decision trees for the construction of explainable partitions that aim to minimize the $k$-means cost function. These works, however, largely ignore metrics related to the depths of the leaves in the resulting tree, which is perhaps surprising considering how the explainability of a decision tree depends on these depths. To fill this gap in the literature, we propose an efficient algorithm that takes into account these metrics. In experiments on 16 datasets, our algorithm yields better results than decision-tree clustering algorithms such as the ones presented in \cite{dasgupta2020explainable}, \cite{frost2020exkmc}, \cite{laber2021price} and \cite{DBLP:conf/icml/MakarychevS21}, typically achieving lower or equivalent costs with considerably shallower trees. We also show, through a simple adaptation of existing techniques, that the problem of building explainable partitions induced by binary trees for the $k$-means cost function does not admit an $(1+\epsilon)$-approximation in polynomial time unless $P=NP$, which justifies the quest for approximation algorithms and/or heuristics., Comment: 20 pages, 3 figures (7 subfigures), 7 tables. Includes a new section with experiments calibrating the trade-off between partition quality and explainability. Section 3 of the previous version, with theoretical results on the hardness of explainable $k$-means clustering, was removed and expanded into a separate article (arXiv:2208.09643)

On 2019 August 14 at 21:10:39 UTC, the LIGO/Virgo Collaboration (LVC) detected a possible neutron star-black hole merger (NSBH), the first ever identified. An extensive search for an optical counterpart of this event, designated GW190814, was undertaken using the Dark Energy Camera (DECam) on the 4m Victor M. Blanco Telescope at the Cerro Tololo Inter-American Observatory. Target of Opportunity interrupts were issued on 8 separate nights to observe 11 candidates using the 4.1m Southern Astrophysical Research (SOAR) telescope's Goodman High Throughput Spectrograph in order to assess whether any of these transients was likely to be an optical counterpart of the possible NSBH merger. Here, we describe the process of observing with SOAR, the analysis of our spectra, our spectroscopic typing methodology, and our resultant conclusion that none of the candidates corresponded to the gravitational wave merger event but were all instead other transients. Finally, we describe the lessons learned from this effort. Application of these lessons will be critical for a successful community spectroscopic follow-up program for LVC observing run 4 (O4) and beyond., Comment: 32 pages, 18 figures, accepted for publication by ApJ

Despite the growing availability of high-capacity computational platforms, implementation complexity still has been a great concern for the real-world deployment of neural networks. This concern is not exclusively due to the huge costs of state-of-the-art network architectures, but also due to the recent push towards edge intelligence and the use of neural networks in embedded applications. In this context, network compression techniques have been gaining interest due to their ability for reducing deployment costs while keeping inference accuracy at satisfactory levels. The present paper is dedicated to the development of a novel compression scheme for neural networks. To this end, a new form of $\ell_0$-norm-based regularization is firstly developed, which is capable of inducing strong sparseness in the network during training. Then, targeting the smaller weights of the trained network with pruning techniques, smaller yet highly effective networks can be obtained. The proposed compression scheme also involves the use of $\ell_2$-norm regularization to avoid overfitting as well as fine tuning to improve the performance of the pruned network. Experimental results are presented aiming to show the effectiveness of the proposed scheme as well as to make comparisons with competing approaches., Comment: 34 pages, 9 figures, 7 tables