Search

The time series theory is set in this work under the domain of general elliptically contoured distributions. The advent of a time series approach that is in accordance with the expected reality of dependence between errors, transfers the increasingly complex and difficult to handle correlation analysis into a discipline that models volatility from a new view of a likelihood based on dependent probabilistic samples. The equally important problem of model selection is strengthened, but at the same time criticized with the introduction of degrees of evidence of significant difference in the modified BIC criterion . The demanding scale of differentiation puts a well-known database in trouble by observing insignificant relevance between the hierarchical models most used in the theory of time series under independence, such as Arch, Garch, Tgarch and Egarch. For extreme cases where the probabilistic independence of the samples is exceptionally demonstrated by an expert, the article also proposes the theory of time series under elliptical models, but with the same demanding comparison of the degrees of evidence of differences of the modified BIC. The example studied under this approach also does not denote any advantage of the hierarchical models studied. Such a new perspective for a likelihood based on dependent probabilistic samples has arisen naturally in similar context in finance under the setting of multivector variate distributions.

We introduce a novel approach to reduce the number of times required for reprogramming memristors on bit-sliced compute-in-memory crossbars for deep neural networks (DNNs). Our idea addresses the limited non-volatile memory endurance, which restrict the number of times they can be reprogrammed. To reduce reprogramming demands, we employ two techniques: (1) we organize weights into sorted sections to schedule reprogramming of similar crossbars, maximizing memristor state reuse, and (2) we reprogram only a fraction of randomly selected memristors in low-order columns, leveraging their bit-level distribution and recognizing their relatively small impact on model accuracy. We evaluate our approach for state-of-the-art models on the ImageNet-1K dataset. We demonstrate a substantial reduction in crossbar reprogramming by 3.7x for ResNet-50 and 21x for ViT-Base, while maintaining model accuracy within a 1% margin., Comment: 5 pages, 10 figures

The Travelling Salesman Problem - TSP is one of the most explored problems in the scientific literature to solve real problems regarding the economy, transportation, and logistics, to cite a few cases. Adapting TSP to solve different problems has originated several variants of the optimization problem with more complex objectives and different restrictions. Metaheuristics have been used to solve the problem in polynomial time. Several studies have tried hybridising metaheuristics with specialised heuristics to improve the quality of the solutions. However, we have found no study to evaluate whether the searching mechanism of a particular metaheuristic is more adequate for exploring hybridization. This paper focuses on the solution of the classical TSP using high-level hybridisations, experimenting with eight metaheuristics and heuristics derived from k-OPT, SISR, and segment intersection search, resulting in twenty-four combinations. Some combinations allow more than one set of searching parameters. Problems with 50 to 280 cities are solved. Parameter tuning of the metaheuristics is not carried out, exploiting the different searching patterns of the eight metaheuristics instead. The solutions' quality is compared to those presented in the literature.

Plasticity Loss is an increasingly important phenomenon that refers to the empirical observation that as a neural network is continually trained on a sequence of changing tasks, its ability to adapt to a new task diminishes over time. We introduce Self-Normalized Resets (SNR), a simple adaptive algorithm that mitigates plasticity loss by resetting a neuron's weights when evidence suggests its firing rate has effectively dropped to zero. Across a battery of continual learning problems and network architectures, we demonstrate that SNR consistently attains superior performance compared to its competitor algorithms. We also demonstrate that SNR is robust to its sole hyperparameter, its rejection percentile threshold, while competitor algorithms show significant sensitivity. SNR's threshold-based reset mechanism is motivated by a simple hypothesis test that we derive. Seen through the lens of this hypothesis test, competing reset proposals yield suboptimal error rates in correctly detecting inactive neurons, potentially explaining our experimental observations. We also conduct a theoretical investigation of the optimization landscape for the problem of learning a single ReLU. We show that even when initialized adversarially, an idealized version of SNR learns the target ReLU, while regularization-based approaches can fail to learn.

Constrained multiobjective optimization problems (CMOPs) are commonly found in real-world applications. CMOP is a complex problem that needs to satisfy a set of equality or inequality constraints. This paper proposes a variant of the bidirectional coevolution algorithm (BiCo) with differential evolution (DE). The novelties in the model include the DE differential mutation and crossover operators as the main search engine and a non-dominated sorting selection scheme. Experimental results on two benchmark test suites and eight real-world CMOPs suggested that the proposed model reached better overall performance than the original model., Comment: 6 pages

This paper introduces the inverse modeling constrained multi-objective evolutionary algorithm based on decomposition (IM-C-MOEA/D) for addressing constrained real-world optimization problems. Our research builds upon the advancements made in evolutionary computing-based inverse modeling, and it strategically bridges the gaps in applying inverse models based on decomposition to problem domains with constraints. The proposed approach is experimentally evaluated on diverse real-world problems (RWMOP1-35), showing superior performance to state-of-the-art constrained multi-objective evolutionary algorithms (CMOEAs). The experimental results highlight the robustness of the algorithm and its applicability in real-world constrained optimization scenarios., Comment: 6 pages, 1 figure, 1 algorithm, and 2 tables

Characterizing the host galaxies of astrophysical transients is important to many areas of astrophysics, including constraining the progenitor systems of core-collapse supernovae, correcting Type Ia supernova distances, and probabilistically classifying transients without photometric or spectroscopic data. Given the increasing transient discovery rate in the coming years, there is substantial utility in providing public, transparent, reproducible, and automatic characterization for large samples of transient host galaxies. Here we present Blast, a web application that ingests live streams of transient alerts, matches transients to their host galaxies, and performs photometry on coincident archival imaging data of the host galaxy. The photometry is then used to infer both global host-galaxy properties and galaxy properties within 2 kpc of the transient location by using the Prospector Bayesian inference framework, with an acceleration in evaluation speed achieved via simulation-based inference. Blast provides host-galaxy properties to users via a web browser or an application program interface. The software can be extended to support alternative photometric or SED-fitting algorithms, and can be scaled via an asynchronous worker queue across multiple compute nodes to handle the processing of large volumes of transient alerts for upcoming transient surveys. Blast has been ingesting newly discovered transients from the Transient Name Server since mid-2024, and has currently measured SED parameters for more than 6000 transients. The service is publicly available at https://blast.scimma.org/., Comment: submitted to PASP

Autism Spectrum Disorder (ASD) is a neurodivergent condition with a wide range of characteristics and support levels. Individuals with ASD can exhibit various combinations of traits such as difficulties in social interaction, communication, and language, alongside restricted interests and repetitive activities. Many adults with ASD live independently due to increased awareness and late diagnoses, which help them manage long-standing challenges. Predictability, clarity, and minimized sensory stimuli are crucial for the daily comfort of autistic individuals. In mobile applications, autistic users face significant cognitive overload compared to neurotypicals, resulting in higher effort and time to complete tasks. Urban mobility apps, essential for daily routines, often overlook the needs of autistic users, leading to cognitive overload issues. This study investigates the accessibility of urban mobility apps for autistic individuals using the Interfaces Accessibility Guide for Autism (GAIA). By evaluating various apps, we have identified a common gap regarding accessibility for people with Autism Spectrum Disorder (ASD). This limitation relates to the absence of a functionality that allows users on the autism spectrum to customize the characteristics of the textual and visual elements of the software, such as changing the text font, altering the font type, and adjusting text colors, as well as native audio guidance within the applications themselves. Currently, the only function in this context is for visually impaired people, which completely changes the user experience in terms of navigation., Comment: Author pre-print of article published in the XXIII Brazilian Symposium on Human Factors in Computing Systems (IHC'24)

We introduce $\textit{sorted weight sectioning}$ (SWS): a weight allocation algorithm that places sorted deep neural network (DNN) weight sections on bit-sliced compute-in-memory (CIM) crossbars to reduce analog-to-digital converter (ADC) energy consumption. Data conversions are the most energy-intensive process in crossbar operation. SWS effectively reduces this cost leveraging (1) small weights and (2) zero weights (weight sparsity). DNN weights follow bell-shaped distributions, with most weights near zero. Using SWS, we only need low-order crossbar columns for sections with low-magnitude weights. This reduces the quantity and resolution of ADCs used, exponentially decreasing ADC energy costs without significantly degrading DNN accuracy. Unstructured sparsification further sharpens the weight distribution with small accuracy loss. However, it presents challenges in hardware tracking of zeros: we cannot switch zero rows to other layer weights in unsorted crossbars without index matching. SWS efficiently addresses unstructured sparse models using offline remapping of zeros into earlier sections, which reveals full sparsity potential and maximizes energy efficiency. Our method reduces ADC energy use by 89.5% on unstructured sparse BERT models. Overall, this paper introduces a novel algorithm to promote energy-efficient CIM crossbars for unstructured sparse DNN workloads., Comment: 5 pages, 4 figures

Federated Kolmogorov-Arnold Networks (F-KANs) have already been proposed, but their assessment is at an initial stage. We present a comparison between KANs (using B-splines and Radial Basis Functions as activation functions) and Multi- Layer Perceptrons (MLPs) with a similar number of parameters for 100 rounds of federated learning in the MNIST classification task using non-IID partitions with 100 clients. After 15 trials for each model, we show that the best accuracies achieved by MLPs can be achieved by Spline-KANs in half of the time (in rounds), with just a moderate increase in computing time., Comment: 10 pages, 5 figures, for associated code see https://github.com/artsasse/fedkan

In this paper we consider a massive self-interacting scalar quantum field in a Lorentz-violation scenario based on a Horava-Lifshitz model. Specifically, we investigate the vacuum energy density and its loop correction, up to first order in the self-interaction coupling constant, and also the topological mass generation. These quantities are also analyzed in the case where the field is massless. The scalar vacuum state is perturbed by the presence of two large parallel plates, placed at a distance L from each other, due to the imposition of Dirichlet boundary condition on the two plates. To perform this study, the effective potential approach in quantum field theory is applied., Comment: 14 pages, 3 Figures. arXiv admin note: text overlap with arXiv:2405.14656

We introduce a Retrieval-Augmented Generation (RAG) system for translating user questions into accurate federated SPARQL queries over bioinformatics knowledge graphs (KGs) leveraging Large Language Models (LLMs). To enhance accuracy and reduce hallucinations in query generation, our system utilises metadata from the KGs, including query examples and schema information, and incorporates a validation step to correct generated queries. The system is available online at chat.expasy.org.

Background. In the last decades, several life science resources have structured data using the same framework and made these accessible using the same query language to facilitate interoperability. Knowledge graphs have seen increased adoption in bioinformatics due to their advantages for representing data in a generic graph format. For example, yummydata.org catalogs more than 60 knowledge graphs accessible through SPARQL, a technical query language. Although SPARQL allows powerful, expressive queries, even across physically distributed knowledge graphs, formulating such queries is a challenge for most users. Therefore, to guide users in retrieving the relevant data, many of these resources provide representative examples. These examples can also be an important source of information for machine learning, if a sufficiently large number of examples are provided and published in a common, machine-readable and standardized format across different resources. Findings. We introduce a large collection of human-written natural language questions and their corresponding SPARQL queries over federated bioinformatics knowledge graphs (KGs) collected for several years across different research groups at the SIB Swiss Institute of Bioinformatics. The collection comprises more than 1000 example questions and queries, including 65 federated queries. We propose a methodology to uniformly represent the examples with minimal metadata, based on existing standards. Furthermore, we introduce an extensive set of open-source applications, including query graph visualizations and smart query editors, easily reusable by KG maintainers who adopt the proposed methodology. Conclusions. We encourage the community to adopt and extend the proposed methodology, towards richer KG metadata and improved Semantic Web services.

We study the properties of a system composed of strongly interacting matter with an isospin imbalance, using as an effective description of QCD the two-flavor Linear Sigma Model with quarks. From the one-loop effective potential, including the two light quarks, pions and sigma contributions, and enforcing the restrictions imposed by chiral symmetry, we show that the development of an isospin condensate comes together with the emergence of a Goldstone mode that provides a constraint for the chiral and isospin condensates as a result of a non-trivial mixing between the charged pions and the sigma. We compute the thermodynamical quantities of interest and in particular the sound velocity squared, showing that it presents a maximum for an isospin chemical potential similar to the one reported by lattice QCD results and also with a similar height. Therefore, we attribute the origin of the peak of the sound velocity to the proper treatment of the Goldstone mode and to the non-trivial mixing of the charged pions and sigma in the isospin condensed phase., Comment: 7 pages, 2 figures

Quantum computing with qudits, an extension of qubits to multiple levels, is a research field less mature than qubit-based quantum computing. However, qudits can offer some advantages over qubits, by representing information with fewer separated components. In this article, we present QuForge, a Python-based library designed to simulate quantum circuits with qudits. This library provides the necessary quantum gates for implementing quantum algorithms, tailored to any chosen qudit dimension. Built on top of differentiable frameworks, QuForge supports execution on accelerating devices such as GPUs and TPUs, significantly speeding up simulations. It also supports sparse operations, leading to a reduction in memory consumption compared to other libraries. Additionally, by constructing quantum circuits as differentiable graphs, QuForge facilitates the implementation of quantum machine learning algorithms, enhancing the capabilities and flexibility of quantum computing research., Comment: 18 pages, 7 figures

Most stars are born in the crowded environments of gradually forming star clusters. Dynamical interactions between close-passing stars and the evolving UV radiation fields from proximate massive stars are expected to sculpt the protoplanetary discs in these clusters, potentially contributing to the diversity of planetary systems that we observe. Here, we investigate the impact of cluster environment on disc demographics by implementing simple protoplanetary disc evolution models within $N$-body simulations of gradual star cluster formation. We consider a range of star formation efficiency per free-fall time, $\epsilon_{\rm ff}$, and mass surface density of the natal cloud environment, $\Sigma_{\rm cl}$, both of which affect the overall duration of cluster formation. We track the interaction history of all stars to estimate the dynamical truncation of the discs around stars involved in close encounters. We also track external photoevaporation of the discs due to the ionizing radiation field of the nearby high- and intermediate-mass ($> 5 M_\odot$) stars. We find that $\epsilon_{\rm ff}$, $\Sigma_{\rm cl}$, and the degree of primordial binarity have major influences on the masses and radii of the disc population. In particular, external photo-evaporation has a greater impact than dynamical interactions in determining the fate of discs in our clusters., Comment: Submitted to MNRAS. 16 pages, 9 figures. Comments welcome

We study the symmetry breaking and restoration behavior of a self-interacting charged scalar field theory under the influence of a constant electric field and finite temperature. Our study is performed in the context of the optimized perturbation theory. The dependence of the effective potential with constant electric fields is established by means of the bosonic propagators in the Schwinger proper-time method. Explicit analytical expressions for the electric and thermal contributions are found. Our results show a decreasing behavior for the vacuum expectation value as a function of the electric fields, which is strengthened by the temperature effect. A first-order phase transition that occurs at zero /weak electric fields changes to a second-order phase transition under strong electric fields. The critical temperature for the phase transition exhibited a very weak dependence on the electric field. Additionally, we computed the vacuum persistence probability rate for the interacting theory, finding a peak at the critical point. The maximum value of this rate at the critical point is found to be independent of the coupling constant but depended solely on the magnitude of the electric field.

We present multi-wavelength data of SN2020acct, a double-peaked stripped-envelope supernova (SN) in NGC2981 at ~150 Mpc. The two peaks are temporally distinct, with maxima separated by 58 rest-frame days, and a factor of 20 reduction in flux between. The first is luminous (M$_{r}$ = -18.00 $\pm$ 0.02 mag), blue (g - r = 0.27 $\pm$ 0.03 mag), and displays spectroscopic signatures of interaction with hydrogen-free circumstellar material. The second peak is fainter (M$_{r}$ = -17.29 $\pm$ 0.03 mag), and spectroscopically similar to an evolved stripped-envelope SNe, with strong blended forbidden [Ca II] and [O II] features. No other known double-peak SN exhibits a light curve similar to that of SN 2020acct. We find the likelihood of two individual SNe occurring in the same star-forming region within that time to be highly improbable, while an implausibly fine-tuned configuration would be required to produce two SNe from a single binary system. We find that the peculiar properties of SN2020acct match models of pulsational pair instability (PPI), in which the initial peak is produced by collisions of shells of ejected material, shortly followed by a terminal explosion. Pulsations from a star with a 72 M$_{\odot}$ helium core provide an excellent match to the double-peaked light curve. The local galactic environment has a metallicity of 0.4 Z$_{\odot}$, a level where massive single stars are not expected retain enough mass to encounter the PPI. However, late binary mergers or a low-metallicity pocket may allow the required core mass. We measure the rate of SN 2020acct-like events to be $<3.3\times10^{-8}$ Mpc$^{-3}$ yr$^{-1}$ at z = 0.07, or <0.1% of the total core-collapse SN rate., Comment: 31 pages, 14 figures. Submitted to ApJL, comments welcome

We present a comprehensive analysis of the photometric and spectroscopic evolution of SN~2021foa, unique among the class of transitional supernovae for repeatedly changing its spectroscopic appearance from hydrogen-to-helium-to-hydrogen-dominated (IIn-to-Ibn-to-IIn) within 50 days past peak brightness. The spectra exhibit multiple narrow ($\approx$ 300--600~km~s$^{-1}$) absorption lines of hydrogen, helium, calcium and iron together with broad helium emission lines with a full-width-at-half-maximum (FWHM) of $\sim 6000$~km~s$^{-1}$. For a steady, wind-mass loss regime, light curve modeling results in an ejecta mass of $\sim 8$ M$_{\odot}$ and CSM mass below 1 M$_{\odot}$, and an ejecta velocity consistent with the FWHM of the broad helium lines. We obtain a mass-loss rate of $\approx 2$ M$_{\odot} {\rm yr}^{-1}$. This mass-loss rate is three orders of magnitude larger than derived for normal Type II SNe. We estimate that the bulk of the CSM of SN~2021foa must have been expelled within half a year, about 15 years ago. Our analysis suggests that SN~2021foa had a helium rich ejecta which swept up a dense shell of hydrogen rich CSM shortly after explosion. At about 60 days past peak brightness, the photosphere recedes through the dense ejecta-CSM region, occulting much of the red-shifted emission of the hydrogen and helium lines, which results in observed blue-shift ($\sim -3000$~km~s$^{-1}$). Strong mass loss activity prior to explosion, such as those seen in SN~2009ip-like objects and SN~2021foa as precursor emission, are the likely origin of a complex, multiple-shell CSM close to the progenitor star., Comment: Revised. Accepted in ApJ

This study investigates vulnerabilities in dependencies of sampled open-source software (OSS) projects, the relationship between these and overall project security, and how developers' behaviors and practices influence their mitigation. Through analysis of OSS projects, we have identified common issues in outdated or unmaintained dependencies, including pointer dereferences and array bounds violations, that pose significant security risks. We have also examined developer responses to formal verifier reports, noting a tendency to dismiss potential issues as false positives, which can lead to overlooked vulnerabilities. Our results suggest that reducing the number of direct dependencies and prioritizing well-established libraries with strong security records are effective strategies for enhancing the software security landscape. Notably, four vulnerabilities were fixed as a result of this study, demonstrating the effectiveness of our mitigation strategies., Comment: 16 pages

Ground state preparation is a key area where quantum computers are expected to prove advantageous. Double-bracket quantum algorithms (DBQAs) have been recently proposed to diagonalize Hamiltonians and in this work we show how to use them to prepare ground states. We propose to improve an initial state preparation by adding a few steps of DBQAs. The interfaced method systematically achieves a better fidelity while significantly reducing the computational cost of the procedure. For a Heisenberg model, we compile our algorithm using CZ and single-qubit gates into circuits that match capabilities of near-term quantum devices. Moreover, we show that DBQAs can benefit from the experimental availability of increasing circuit depths. Whenever an approximate ground state can be prepared without exhausting the available circuit depth, then DBQAs can be enlisted to algorithmically seek a higher fidelity preparation., Comment: 5 pages + appendix, 4 figures, code available at: https://github.com/qiboteam/boostvqe

In this proceedings, we present two new quantum circuit simulation protocols recently added as optional backends to Qibo, an open-source framework for quantum simulation, hardware control and calibration. We describe the current status of the framework as for version 0.2.9. In detail, the two new backends for Clifford and tensor networks simulation are presented and benchmarked against the state-of-the-art., Comment: 7 pages, 2 figures, proceedings for ACAT24, code available at https://github.com/qiboteam/qibo

The Model-X knockoffs is a practical methodology for variable selection, which stands out from other selection strategies since it allows for the control of the false discovery rate (FDR), relying on finite-sample guarantees. In this article, we propose a Truncated D-vine Copula Knockoffs (TDCK) algorithm for sampling approximate knockoffs from complex multivariate distributions. Our algorithm enhances and improves features of previous attempts to sample knockoffs under the multivariate setting, with the three main contributions being: 1) the truncation of the D-vine copula, which reduces the dependence between the original variables and their corresponding knockoffs, improving the statistical power; 2) the employment of a straightforward non-parametric formulation for marginal transformations, eliminating the need for a specific parametric family or a kernel density estimator; 3) the use of the "rvinecopulib'' R package offers better flexibility than the existing fitting vine copula knockoff methods. To eliminate the randomness in distinct realizations resulting in different sets of selected variables, we wrap the TDCK method with an existing derandomizing procedure for knockoffs, leading to a Derandomized Truncated D-vine Copula Knockoffs with e-values (DTDCKe) procedure. We demonstrate the robustness of the DTDCKe procedure under various scenarios with extensive simulation studies. We further illustrate its efficacy using a gene expression dataset, showing it achieves a more reliable gene selection than other competing methods, when the findings are compared with those of a meta-analysis. The results indicate that our Truncated D-vine copula approach is robust and has superior power, representing an appealing approach for variable selection in different multivariate applications, particularly in gene expression analysis., Comment: 31 pages, 9 figures, 1 table

This paper develops an adaptive Proximal Alternating Direction Method of Multipliers (P-ADMM) for solving linearly-constrained, weakly convex, composite optimization problems. This method is adaptive to all problem parameters, including smoothness and weak convexity constants. It is assumed that the smooth component of the objective is weakly convex and possibly nonseparable, while the non-smooth component is convex and block-separable. The proposed method is tolerant to the inexact solution of its block proximal subproblem so it does not require that the non-smooth component has easily computable block proximal maps. Each iteration of our adaptive P-ADMM consists of two steps: (1) the sequential solution of each block proximal subproblem, and (2) adaptive tests to decide whether to perform a full Lagrange multiplier and/or penalty parameter update(s). Without any rank assumptions on the constraint matrices, it is shown that the adaptive P-ADMM obtains an approximate first-order stationary point of the constrained problem in a number of iterations that matches the state-of-the-art complexity for the class of P-ADMMs. The two proof-of-concept numerical experiments that conclude the paper suggest our adaptive P-ADMM enjoys significant computational benefits.

This paper introduces a tool for verifying Python programs, which, using type annotation and front-end processing, can harness the capabilities of a bounded model-checking (BMC) pipeline. It transforms an input program into an abstract syntax tree to infer and add type information. Then, it translates Python expressions and statements into an intermediate representation. Finally, it converts this description into formulae evaluated with satisfiability modulo theories (SMT) solvers. The proposed approach was realized with the efficient SMT-based bounded model checker (ESBMC), which resulted in a tool called ESBMC-Python, the first BMC-based Python-code verifier. Experimental results, with a test suite specifically developed for this purpose, showed its effectiveness, where successful and failed tests were correctly evaluated. Moreover, it found a real problem in the Ethereum Consensus Specification.

Young associations record complete histories of star forming events through their demographics and dynamics, and Gaia has greatly expanded our knowledge of these associations. We present the first structural and dynamical overview study of the Cep-Her Complex, which has recently emerged as the largest stellar population within 500 pc that still lacks substantial follow-up. We reveal that Cep-Her is not a singular association, but rather an amalgam of four, consisting of the older ($\tau > 100$ Myr) open cluster Roslund 6, in addition to three dynamically coherent and highly substructured young associations that we focus on: Orpheus (25-40 Myr), Cinyras (28-43 Myr), and Cupavo (54-80 Myr). With $9552 \pm 960$ stars in Orpheus, $3872 \pm 455$ stars in Cinyras, and $8794 \pm 1827$ stars in Cupavo, all three are among the largest young associations within 500 pc, rivalling major associations like Sco-Cen. Our novel view of the ages and dynamics of these associations reveals evidence for sequential star formation in Cinyras, in addition to a multi-origin pattern of stellar dispersal in Orpheus that may hint to the presence of multiple clouds at formation. Dynamical simulations indicate that while some embedded open clusters and central components of these associations are converging, they likely lack the mass necessary to capture one another and undergo hierarchical cluster assembly. Our results provide our first view of the complex star-forming environments that gave rise to the associations of Cep-Her, which will serve as important laboratories for future studies of star and planet formation., Comment: Accepted to ApJ. 39 Pages, 21 Figures, 5 Tables in AASTEX63 format

Strongly correlated electrons systems may exhibit a variety of interesting phenomena, for instance, superconductivity and pseudogap, as is the case of cuprates and pnictides. In strongly correlated electron systems, it is considered essential to understand, not only the nature of the pseudogap, but also the relationship between superconductivity and the pseudogap. In order to address this question, in the present work, we investigated a one-band Hubbard model treated by the Green's function method within an n-pole approximation. In the strongly correlated regime, antiferromagnetic correlations give rise to nearly flat band regions in the nodal points of the quasiparticle bands. As a consequence, a pseudogap emerges at the antinodal points of the Fermi surface. The obtained results indicate that the same antiferromagnetic correlations responsible for a pseudogap, can also favor superconductivity, providing an increase in the superconducting critical temperature Tc., Comment: 16 pages, 9 figures

We study the thermodynamics of the Polyakov-Nambu-Jona-Lasinio model considering the effects of an effective chiral chemical potential. We offer a new parametrization of the Polyakov-loop potential depending on temperature and the chiral chemical potential which, when used together with a proper regularization scheme of vacuum contributions, predicts results consistent with those from lattice simulations., Comment: Replaced with the version matching the published one in the Physical Review D

LiteBIRD, the next-generation cosmic microwave background (CMB) experiment, aims for a launch in Japan's fiscal year 2032, marking a major advancement in the exploration of primordial cosmology and fundamental physics. Orbiting the Sun-Earth Lagrangian point L2, this JAXA-led strategic L-class mission will conduct a comprehensive mapping of the CMB polarization across the entire sky. During its 3-year mission, LiteBIRD will employ three telescopes within 15 unique frequency bands (ranging from 34 through 448 GHz), targeting a sensitivity of 2.2\,$\mu$K-arcmin and a resolution of 0.5$^\circ$ at 100\,GHz. Its primary goal is to measure the tensor-to-scalar ratio $r$ with an uncertainty $\delta r = 0.001$, including systematic errors and margin. If $r \geq 0.01$, LiteBIRD expects to achieve a $>5\sigma$ detection in the $\ell=$2-10 and $\ell=$11-200 ranges separately, providing crucial insight into the early Universe. We describe LiteBIRD's scientific objectives, the application of systems engineering to mission requirements, the anticipated scientific impact, and the operations and scanning strategies vital to minimizing systematic effects. We will also highlight LiteBIRD's synergies with concurrent CMB projects., Comment: 23 pages, 9 figures, 1 table, SPIE Astronomical Telescopes + Instrumentation 2024

Simulating a single trajectory of a dynamical system under some state-dependent policy is a core bottleneck in policy optimization algorithms. The many inherently serial policy evaluations that must be performed in a single simulation constitute the bulk of this bottleneck. To wit, in applying policy optimization to supply chain optimization (SCO) problems, simulating a single month of a supply chain can take several hours. We present an iterative algorithm for policy simulation, which we dub Picard Iteration. This scheme carefully assigns policy evaluation tasks to independent processes. Within an iteration, a single process evaluates the policy only on its assigned tasks while assuming a certain 'cached' evaluation for other tasks; the cache is updated at the end of the iteration. Implemented on GPUs, this scheme admits batched evaluation of the policy on a single trajectory. We prove that the structure afforded by many SCO problems allows convergence in a small number of iterations, independent of the horizon. We demonstrate practical speedups of 400x on large-scale SCO problems even with a single GPU, and also demonstrate practical efficacy in other RL environments.

To address the peculiarities of directed and/or signed graphs, new Laplacian operators have emerged. For instance, in the case of directionality, we encounter the magnetic operator, dilation (which is underexplored), operators based on random walks, and so forth. The definition of these new operators leads to the need for new studies and concepts, and consequently, the development of new computational tools. But is this really necessary? In this work, we define the concept of effective adjacency matrices that arise from the definition of deformed Laplacian operators such as magnetic, dilation, and signal. These effective matrices allow mapping generic graphs to a family of unsigned, undirected graphs, enabling the application of the well-explored toolkit of measures, machine learning methods, and renormalization groups of undirected graphs. To explore the interplay between deformed operators and effective matrices, we show how the Hodge-Helmholtz decomposition can assist us in navigating this complexity., Comment: This work was carried out during the author's PhD program at the University of S\~ao Paulo (USP), S\~ao Carlos, Brazil

We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex-valued data vectors of $d=\binom{n}{k}$ components into a subspace of fixed Hamming weight $k$. This represents a polynomial space compression. The circuit is optimal in that it expresses an arbitrary data vector using only $d-1$ (controlled) Reconfigurable Beam Splitter (RBS) gates and is constructed by an efficient classical algorithm that sequentially generates all bitstrings of weight $k$ and identifies all gate parameters. An explicit compilation into CNOTs and single-qubit gates is presented, with the total CNOT-gate count of $\mathcal{O}(k\, d)$ provided in analytical form. In addition, we show how to load data in the binary basis by sequentially stacking encoders of different Hamming weights using $\mathcal{O}(d\,\log(d))$ CNOT gates. Moreover, using generalized RBS gates that mix states of different Hamming weights, we extend the construction to efficiently encode arbitrary sparse vectors. Finally, we perform an experimental proof-of-principle demonstration of our scheme on a commercial trapped-ion quantum computer. We successfully upload a $q$-Gaussian probability distribution in the non-log-concave regime with $n = 6$ and $k = 2$. We also showcase how the effect of hardware noise can be alleviated by quantum error mitigation. Our results constitute a versatile framework for quantum data compression with various potential applications in fields such as quantum chemistry, quantum machine learning, and constrained combinatorial optimizations., Comment: 13 pages, 7 figures, 4 tables; Revised text + new experimental data

LiteBIRD, a forthcoming JAXA mission, aims to accurately study the microwave sky within the 40-400 GHz frequency range divided into 15 distinct nominal bands. The primary objective is to constrain the CMB inflationary signal, specifically the primordial B-modes. LiteBIRD targets the CMB B-mode signal on large angular scales, where the primordial inflationary signal is expected to dominate, with the goal of reaching a tensor-to-scalar ratio sensitivity of $\sigma_r\sim0.001$. LiteBIRD frequency bands will be split among three telescopes, with some overlap between telescopes for better control of systematic effects. Here we report on the development status of the detector arrays for the Low Frequency Telescope (LFT), which spans the 34-161 GHz range, with 12 bands subdivided between four types of trichroic pixels consisting of lenslet-coupled sinuous antennas. The signal from the antenna is bandpass filtered and sensed by AlMn Transition-Edge Sensors (TES). We provide an update on the status of the design and development of LiteBIRD's LFT LF1 (40-60-78 GHz), LF2 (50-68-89 GHz) pixels. We discuss design choices motivated by LiteBIRD scientific goals. In particular we focus on the details of the optimization of the design parameters of the sinuous antenna, on-chip bandpass filters, cross-under and impedance transformers and all the RF components that define the LF1 and LF2 pixel detection chain. We present this work in the context of the technical challenges and physical constraints imposed by the finite size of the instrument., Comment: 12 pages, 10 figures, 1 table, SPIE 2024

In this paper the vacuum energy density and generation of topological mass are investigated for a system of a real and complex scalar fields interacting with each other. In addition to that, it is also included the quartic self-interaction for each one of the fields. The condition imposed on the real field is the periodic condition, while the complex field obey a quasi-periodic condition. The system is placed in a scenario where the CPT-even aether-type Lorentz symmetry violation takes place. We allow that the Lorentz violation affects the fields with different intensities. The vacuum energy density, its loop correction, and the topological mass are evaluated analytically. It is also discussed the possibility of different vacuum states and their corresponding stability requirements, which depends on the conditions imposed on the fields, the interaction coupling constants and also the Lorentz violation parameters. The formalism used here to perform this investigation is the effective potential one, which is written as a loop expansion via path integral in quantum field theory., Comment: 18 pages, 6 figures, version accepted for publication in IJMPD. arXiv admin note: text overlap with arXiv:2302.14540

Variational Quantum Algorithms (VQAs) have emerged as pivotal strategies for attaining quantum advantages in diverse scientific and technological domains, notably within Quantum Neural Networks. However, despite their potential, VQAs encounter significant obstacles, chief among them being the gradient vanishing problem, commonly referred to as barren plateaus. In this study, we unveil a direct correlation between the dimension of qudits and the occurrence of barren plateaus, a connection previously overlooked. Through meticulous analysis, we demonstrate that existing literature implicitly suggests the intrinsic influence of qudit dimensionality on barren plateaus. To instantiate these findings, we present numerical results that exemplify the impact of qudit dimensionality on barren plateaus. Additionally, despite the proposition of various error mitigation techniques, our results call for further scrutiny about their efficacy in the context of VQAs with qudits.

We present a robust shadow estimation protocol for wide classes of shallow measurement circuits that mitigates noise as long as the effective measurement map is locally unitarily invariant. This is in practice an excellent approximation, encompassing for instance the case of ideal single-qubit Clifford gates composing the first circuit layer of an otherwise arbitrary circuit architecture and even non-Markovian, gate-dependent noise in the rest of the circuit. We argue that for approximately local noise the measurement channel has an efficient matrix-product (tensor-train) representation, and show how to estimate this directly from experimental data using tensor-network tools, eliminating the need for analytical or numeric calculations. We illustrate the relevance of our method with both numerics and proof-of-principle experiments on an IBM Q device. Numerically, we show that, while unmitigated shallow shadows with noisy circuits become more biased as the depth increases, robust ones become more accurate for relevant parameter regimes. Experimentally, we observe major bias reductions in two simple fidelity estimation tasks using 5-qubit circuits with up to 2 layers of entangling gates using the mitigated variant, of close to an order of magnitude for $10^4$ measurement shots, e.g. Under the practical constraints of current and near-term noisy quantum devices, our method maximally realizes the potential of shadow estimation with global rotations., Comment: 11 pages, 9 figures

We study in detail the influence of different chemical potentials (baryon, charged, strange, and neutrino) on how and how fast a free gas of quarks in the zero-temperature limit reaches the conformal limit. We discuss the influence of non-zero masses, the inclusion of leptons, and different constraints, such as charge neutrality, zero-net strangeness, and fixed lepton fraction. We also investigate for the first time how the symmetry energy of the system under some of these conditions approaches the conformal limit. Finally, we briefly discuss what kind of corrections are expected from perturbative QCD as one goes away from the conformal limit., Comment: 14 pages, 5 figures

Convection-permitting models (CPMs) enable the representation of meteorological variables at horizontal high resolution spatial scales (higher than 4 km), where convection plays a significant role. Physical schemes need to be evaluated considering factors in the studied region such as orography and climate variability. This study investigates the sensitivity of the WRF model as CPM to the use of different physics schemes on Andalusia, a complex orography region in southern Iberian Peninsula (IP). A set of 1-year WRF simulations was completed based on two one-way nested domains: the parent domain (d01) spanning the entire IP with 5 km spatial resolution and the nested domain (d02) for the region of Andalusia at 1 km of spatial resolution. 12 physic schemes were examined from combinations of microphysics (MP) schemes including THOMPSON, WRF single moment 6-class (WSM6), and WRF single moment 7-class (WSM7), and different options for the convection in d01, the Grell 3D (G3), Grell-Freitas (GF), Kain-Fritsch (KF), and deactivated cumulus parameterization (OFF). The simulated precipitation and 2-m temperature for the year 2018, a very wet year, were compared with observational datasets to determine the optimal WRF configuration, including point-to-point and station-point comparisons at different time aggregations. In general, greater differences were shown when comparing the results of convection schemes in d01. Simulations completed with GF or OFF presented better performance compared to the reference datasets. Concerning the MP, although THOMPSON showed a better fit in high mountain areas, it generally presents a worse agreement with the reference datasets. In terms of temperature, the results were very similar and, therefore, the selection of the best configuration was based mainly on the precipitation results with the WSM7-GF scheme being suitable for Andalusia region.

Small rocky planets, as well as larger planets that suffered extensive volatile loss, tend to be drier and have thinner atmospheres as compared to Earth. Such planets probably outnumber worlds better endowed with volatiles, being the most common habitable planets. For the subgroup of fast rotators following eccentric orbits, atmospheres suffer radiative forcing and their heat capacity provides a method for gauging atmospheric thickness and surface conditions. We further explore the model presented in a previous paper and apply it to real and hypothetical exoplanets in the habitable zone of various classes of stars, simulating atmospheric and orbital characteristics. For planetary eccentricities e ~0.3, the forcing-induced hypothetical temperature variation would reach ~80 K for airless planets and ~10 K for planets with substantial atmospheres. For Kepler-186 f and Kepler-442 b, assuming e ~0.1, temperature variations can reach ~24 K. We also consider habitable exomoons in circular orbits around gas giants within the habitable zone, which suffer radiative forcing due to their epicyclic motion. We study several combinations of parameters for the characterization of planets (mass, eccentricity and semi-major axis) and exomoons (mass, orbital radius, albedo and atmospheric characteristics) for different stellar types. For e ~0.3, exomoon temperature varies up to ~90 K, while for ~0.6 variations can reach ~200 K. Such exomoons may plausibly retain their volatiles by continued volcanic activity fueled by tidal dissipation. Although currently undetectable, such effects might be within reach of future Extremely Large Telescope-class telescopes and space missions with mid-infrared and coronagraphic capabilities., Comment: 16 pages, 12 figures and 7 tables

Data analysis and machine learning are of preeminent importance in the legal domain, especially in tasks like clustering and text classification. In this study, we harnessed the power of natural language processing tools to enhance datasets meticulously curated by experts. This process significantly improved the classification workflow for legal texts using machine learning techniques. We considered the Sustainable Development Goals (SDGs) data from the United Nations 2030 Agenda as a practical case study. Data augmentation clustering-based strategy led to remarkable enhancements in the accuracy and sensitivity metrics of classification models. For certain SDGs within the 2030 Agenda, we observed performance gains of over 15%. In some cases, the example base expanded by a noteworthy factor of 5. When dealing with unclassified legal texts, data augmentation strategies centered around clustering prove to be highly effective. They provide a valuable means to expand the existing knowledge base without the need for labor-intensive manual classification efforts., Comment: 23 pages, 4 figures. submitted to Artificial Intelligence and Law Journal

Companies developing Web applications have faced an increasing demand for high-quality products with low cost and production time ever smaller. However, developing such applications is still considered a time-consuming and error-prone task, mainly due to the difficulty of promoting the reuse of features (or functionalities) and modules, and the heterogeneity of Web frameworks. Nowadays, companies must face ever-changing requirements. Software product lines emerged as an alternative to face this challenge by creating a collection of applications from a core of software assets. Despite the potential, the current literature lacks works that propose a product line for Web applications. This paper, therefore, presents WebSPL, a product line for Web applications that supports the main features found in Wed applications in real-world settings. The proposed WebSPL was evaluated by comparing it with a Web application developed based on a traditional approach. A case study that involves the development of two Web applications enabled data collection. Two Web applications were developed -- one with and another without the support of the proposed WebSPL. We compared these two applications using software design metrics, including complexity, size, duplicate lines, and technical debt. The initial results were encouraging and showed the potential for using WebSPL to support the development of Web applications., Comment: 6 figures, 3 tables

We present LAISS (Lightcurve Anomaly Identification and Similarity Search), an automated pipeline to detect anomalous astrophysical transients in real-time data streams. We deploy our anomaly detection model on the nightly ZTF Alert Stream via the ANTARES broker, identifying a manageable $\sim$1-5 candidates per night for expert vetting and coordinating follow-up observations. Our method leverages statistical light-curve and contextual host-galaxy features within a random forest classifier, tagging transients of rare classes (spectroscopic anomalies), of uncommon host-galaxy environments (contextual anomalies), and of peculiar or interaction-powered phenomena (behavioral anomalies). Moreover, we demonstrate the power of a low-latency ($\sim$ms) approximate similarity search method to find transient analogs with similar light-curve evolution and host-galaxy environments. We use analogs for data-driven discovery, characterization, (re-)classification, and imputation in retrospective and real-time searches. To date we have identified $\sim$50 previously known and previously missed rare transients from real-time and retrospective searches, including but not limited to: SLSNe, TDEs, SNe IIn, SNe IIb, SNe Ia-CSM, SNe Ia-91bg-like, SNe Ib, SNe Ic, SNe Ic-BL, and M31 novae. Lastly, we report the discovery of 325 total transients, all observed between 2018-2021 and absent from public catalogs ($\sim$1% of all ZTF Astronomical Transient reports to the Transient Name Server through 2021). These methods enable a systematic approach to finding the "needle in the haystack" in large-volume data streams. Because of its integration with the ANTARES broker, LAISS is built to detect exciting transients in Rubin data., Comment: 44 pages (68 pages with Appendix), 15 figures, accepted to ApJ

The Simons Array (SA) project is a ground-based Cosmic Microwave Background (CMB) polarization experiment. The SA observes the sky using three telescopes, and POLARBEAR-2A (PB-2A) is the receiver system on the first telescope. For the ground-based experiment, atmospheric fluctuation is the primary noise source that could cause polarization leakage. In the PB-2A receiver system, a continuously rotating half-wave plate (HWP) is used to mitigate the polarization leakage. However, due to the rapid modulation of the polarization signal, the uncertainty in the time constant of the detector results in an uncertainty in the polarization angle. For PB-2A, the time constant of each bolometer needs to be calibrated at the sub-millisecond level to avoid introducing bias to the polarization signal. We have developed a new calibrator system that can be used to calibrate the time constants of the detectors. In this study, we present the design of the calibration system and the preliminary results of the time constant calibration for PB-2A., Comment: Proceedings of the 15th Asia Pacific Physics Conference (APPC15)

The growing interaction between traditional knowledge and formal sciences emerges as a relevant field of research. In this perspective, the aim of this article is to investigate the intersections between Physics and traditional knowledge in the ceramics practices of Vila Cuera, in Bragan\c{c}a, state of Para. Using an ethnographic approach, complemented by qualitative analysis, we realize that ceramists use their sensitive intuition and, masterfully, apply thermodynamic principles in the production of handmade ceramics. The results highlight the value of Ethnophysics, underlining that, long before the formal structuring of science as we know it, traditional societies already practiced and understood natural phenomena in tune with contemporary physical principles. We conclude that there is an inherent link between Physics and traditional knowledge with regard to the traditional ceramics practice, grounded on empirical observations and ancestral wisdom, that dialogues with science in a complementary relationship. The study highlights the importance of valuing and recognizing the knowledge of traditional populations by highlighting the knowledge doings of cultures and institutionalized science., Comment: in Portuguese

This work provides the first convergence analysis for the Randomized Block Coordinate Descent method for minimizing a function that is both H\"older smooth and block H\"older smooth. Our analysis applies to objective functions that are non-convex, convex, and strongly convex. For non-convex functions, we show that the expected gradient norm reduces at an $O\left(k^{\frac{\gamma}{1+\gamma}}\right)$ rate, where $k$ is the iteration count and $\gamma$ is the H\"older exponent. For convex functions, we show that the expected suboptimality gap reduces at the rate $O\left(k^{-\gamma}\right)$. In the strongly convex setting, we show this rate for the expected suboptimality gap improves to $O\left(k^{-\frac{2\gamma}{1-\gamma}}\right)$ when $\gamma>1$ and to a linear rate when $\gamma=1$. Notably, these new convergence rates coincide with those furnished in the existing literature for the Lipschitz smooth setting.