Search

A complete experimental study of temperature dependence of the total spectral emissivity has been performed, for the first time, for absorber reflector selective coatings used in concentrated solar power (CSP) systems for energy harvesting. The coating consist of double cermet layers of silicon oxide with different amounts of molybdenum over a silver infrared mirror layer. The experimental measurements were carried out by a high accurate radiometer (HAIRL) with controlled atmosphere in the mid-infrared and for temperatures between 150 and 600 C. The spectral emissivity is nearly constant in this temperature range. Therefore, the temperature dependence of the total emissivity is given by Planck function. These results were compared with those obtained with the usual calculus using room temperature reflectance spectrum. Finally, the performance of the coating was analyzed by comparison of coated respect to non-coated stainless steel., Comment: 6 pages, 10 figures

We introduce a biologically detailed, stochastic model of gene expression describing the multiple rate-limiting steps of transcription, nuclear pre-mRNA processing, nuclear mRNA export, cytoplasmic mRNA degradation and translation of mRNA into protein. The processes in sub-cellular compartments are described by an arbitrary number of processing stages, thus accounting for a significantly finer molecular description of gene expression than conventional models such as the telegraph, two-stage and three-stage models of gene expression. We use two distinct tools, queueing theory and model reduction using the slow-scale linear-noise approximation, to derive exact or approximate analytic expressions for the moments or distributions of nuclear mRNA, cytoplasmic mRNA and protein fluctuations, as well as lower bounds for their Fano factors in steady-state conditions. We use these to study the phase diagram of the stochastic model; in particular we derive parametric conditions determining three types of transitions in the properties of mRNA fluctuations: from sub-Poissonian to super-Poissonian noise, from high noise in the nucleus to high noise in the cytoplasm, and from a monotonic increase to a monotonic decrease of the Fano factor with the number of processing stages. In contrast, protein fluctuations are always super-Poissonian and show weak dependence on the number of mRNA processing stages. Our results delineate the region of parameter space where conventional models give qualitatively incorrect results and provide insight into how the number of processing stages, e.g. the number of rate-limiting steps in initiation, splicing and mRNA degradation, shape stochastic gene expression by modulation of molecular memory., Comment: 49 pages, 4 figures

Maximum diversity problems arise in many practical settings from facility location to social networks, and constitute an important class of NP-hard problems in combinatorial optimization. There has been a growing interest in these problems in recent years, and different mathematical programming models have been proposed to capture the notion of diversity. They basically consist of selecting a subset of elements of a given set in such a way that a measure based on their pairwise distances is maximized to achieve dispersion or representativeness. In this paper, we perform an exhaustive comparison of four mathematical models to achieve diversity over the public domain library MDPLIB, studying the structure of the solutions obtained with each of them. We extend this library by including new Euclidean instances which permit to analyze the geometrical distribution of the solutions. Our study concludes which models are better suited for dispersion and which ones for representativeness in terms of the structure of their solutions, as well as which instances are difficult to solve. We also identify in our conclusions one of the models which is not recommended in any setting. We finalize by proposing two improvements, one related to the models and one to solving methods. The computational testing shows the value of the analysis and merit of our proposals.

In this article we analyze the reconstruction of inflation in the framework of a non-canonical theory. In this sense, we study the viability of reconstructing the background variables assuming a non-lineal kinetic term given by $K(X,\phi)=X+g(\phi)X^2$, with $X$ the standard kinetic term associated to the scalar field $\phi$ and $g(\phi)$ an arbitrary coupling function. In order to achieve this reconstruction in the context of inflation, we assume the slow-roll approximation together with the parametrization of the scalar spectral index $n_s$ and the speed of sound $c_s$ as a function of the number of $e-$folds $N$. By assuming the simplest parametrizations for $n_s-1=-2/N$ and $c_s\propto N^{-\beta}$ with $\beta$ a constant, we find the reconstruction of the effective potential $V(\phi)$ and the coupling function $g(\phi)$ in terms of the scalar field. Besides, we study the reheating epoch by considering a constant equation of state parameter, where we determine the temperature and number of $e-$folds during the reheating epoch in terms of the reconstructed variables and the observational parameters. In this way, the parameter-space related to the reconstructed inflationary model are constrained during the epochs of inflation and reheating by assuming the current astronomical data from Planck and BICEP/Keck results., Comment: 20 pages and 5 figures. Accepted by Physics of the Dark Universe

We prove nonasymptotic matrix concentration inequalities for the spectral norm of (sub)gaussian random matrices with centered independent entries that capture fluctuations at the Tracy-Widom scale. This considerably improves previous bounds in this setting due to Bandeira and Van Handel, and establishes the best possible tail behavior for random matrices with an arbitrary variance pattern. These bounds arise from an extremum problem for nonhomogeneous random matrices: among all variance patterns with a given sparsity parameter, the moments of the random matrix are maximized by block-diagonal matrices with i.i.d. entries in each block. As part of the proof, we obtain sharp bounds on large moments of Gaussian Wishart matrices., Comment: 35 pages, 1 figure

Prevailing $N$-body planet formation models typically start with lunar-mass embryos and show a general trend of rapid migration of massive planetary cores to the inner Solar System in the absence of a migration trap. This setup cannot capture the evolution from a planetesimal to embryo, which is crucial to the final architecture of the system. We aim to model planet formation with planet migration starting with planetesimals of $\sim10^{-6}$ -- $10^{-4}M_\oplus$ and reproduce the giant planets of the Solar System. We simulated a population of 1,000 -- 5,000 planetesimals in a smooth protoplanetary disc, which was evolved under the effects of their mutual gravity, pebble accretion, gas accretion, and planet migration, employing the parallelized $N$-body code SyMBAp. We find that the dynamical interactions among growing planetesimals are vigorous and can halt pebble accretion for excited bodies. While a set of results without planet migration produces one to two gas giants and one to two ice giants beyond 6 au, massive planetary cores readily move to the inner Solar System once planet migration is in effect. Dynamical heating is important in a planetesimal disc and the reduced pebble encounter time should be considered in similar models. Planet migration remains a challenge to form cold giant planets in a smooth protoplanetary disc, which suggests an alternative mechanism is required to stop them at wide orbits., Comment: 17 pages, 14 figures, replaced with published version on A&A

The present article is devoted to introduce the notion of Hopf bracoid in the braided monoidal framework as the quantum version of skew bracoids, which have been presented by Martin-Lyons and Paul J. Truman. Taking into account that Hopf braces are particular examples of Hopf bracoids, in this paper we generalize many properties of Hopf braces to the Hopf bracoid setting and we obtain a categorical isomorphism between certain full subcategories of the Hopf bracoids category and the 1-cocycles category., Comment: arXiv admin note: text overlap with arXiv:2311.05235

With the rapid evolution of Natural Language Processing (NLP), Large Language Models (LLMs) like ChatGPT have emerged as powerful tools capable of transforming various sectors. Their vast knowledge base and dynamic interaction capabilities represent significant potential in improving education by operating as a personalized assistant. However, the possibility of generating incorrect, biased, or unhelpful answers are a key challenge to resolve when deploying LLMs in an education context. This work introduces an innovative architecture that combines the strengths of ChatGPT with a traditional information retrieval based chatbot framework to offer enhanced student support in higher education. Our empirical evaluations underscore the high promise of this approach., Comment: To appear at INTED2024 - 18th annual International Technology, Education and Development Conference

In this investigation, we leverage the combination of Dark Energy Spectroscopic Instrument Legacy imaging Surveys Data Release 9 (DESI LS DR9), Survey Validation 3 (SV3), and Year 1 (Y1) data sets to estimate the conditional luminosity and stellar mass functions (CLFs & CSMFs) of galaxies across various halo mass bins and redshift ranges. To support our analysis, we utilize a realistic DESI Mock Galaxy Redshift Survey (MGRS) generated from a high-resolution Jiutian simulation. An extended halo-based group finder is applied to both MGRS catalogs and DESI observation. By comparing the r and z-band luminosity functions (LFs) and stellar mass functions (SMFs) derived using both photometric and spectroscopic data, we quantified the impact of photometric redshift (photo-z) errors on the galaxy LFs and SMFs, especially in the low redshift bin at low luminosity/mass end. By conducting prior evaluations of the group finder using MGRS, we successfully obtain a set of CLF and CSMF measurements from observational data. We find that at low redshift the faint end slopes of CLFs and CSMFs below $10^{9}h^{-2}L_{\odot}$ (or $h^{-2}M_{\odot}$) evince a compelling concordance with the subhalo mass functions. After correcting the cosmic variance effect of our local Universe following arXiv:1809.00523, the faint end slopes of the LFs/SMFs turn out to be also in good agreement with the slope of the halo mass function., Comment: 28 pages, 13 figures, Accepted for publication in ApJ

Our online lives generate a wealth of behavioral records -'digital footprints'- which are stored and leveraged by technology platforms. This data can be used to create value for users by personalizing services. At the same time, however, it also poses a threat to people's privacy by offering a highly intimate window into their private traits (e.g., their personality, political ideology, sexual orientation). Prior work has proposed a potential remedy: The cloaking of users' footprints. That is, platforms could allow users to hide portions of their digital footprints from predictive algorithms to avoid undesired inferences. While such an approach has been shown to offer privacy protection in the moment, there are two open questions. First, it remains unclear how well cloaking performs over time. As people constantly leave new digital footprints, the algorithm might regain the ability to predict previously cloaked traits. Second, cloaking digital footprints to avoid one undesirable inference may degrade the performance of models for other, desirable inferences (e.g., those driving desired personalized content). In the light of these research gaps, our contributions are twofold: 1) We propose a novel cloaking strategy that conceals 'metafeatures' (automatically generated higher-level categories) and compares its effectiveness against existing cloaking approaches, and 2) we test the spill-over effects of cloaking one trait on the accuracy of inferences on other traits. A key finding is that the effectiveness of cloaking degrades over times, but the rate at which it degrades is significantly smaller when cloaking metafeatures rather than individual footprints. In addition, our findings reveal the expected trade-off between privacy and personalization: Cloaking an undesired trait also partially conceals other desirable traits.

We prove that several classical Banach space properties are equivalent to separability for the class of Lipschitz-free spaces, including Corson's property ($\mathcal{C}$), Talponen's Countable Separation Property, or being a G\^ateaux differentiability space. On the other hand, we single out more general properties where this equivalence fails. In particular, the question whether the duals of non-separable Lipschitz-free spaces have a weak$^*$ sequentially compact ball is undecidable in ZFC. Finally, we provide an example of a nonseparable dual Lipschitz-free space that fails the Radon-Nikod\'ym property.

A source assumed to prepare a specified reference state sometimes prepares an anomalous one. We address the task of identifying these anomalous states in a series of $n$ preparations with $k$ anomalies. We analyze the minimum-error protocol and the zero-error (unambiguous) protocol and obtain closed expressions for the success probability when both reference and anomalous states are known to the observer and anomalies can appear equally likely in any position of the preparation series. We find the solution using results from association schemes theory, thus establishing a connection between graph theory and quantum hypothesis testing. In particular, we use the Johnson association scheme which arises naturally from the Gram matrix of this problem. We also study the regime of large $n$ and obtain the expression of the success probability that is non-vanishing. Finally, we address the case in which the observer is blind to the reference and the anomalous states. This scenario requires a universal protocol for which we prove that in the asymptotic limit, the success probability corresponds to the average of the known state scenario., Comment: 9 pages, 4 figures

Full-shell nanowires have been proposed as an alternative nanowire design in the search of topological superconductivity and Majorana zero modes (MZMs). They are hybrid nanostructures consisting of a semiconductor core fully covered by a thin superconductor shell and subject to a magnetic flux. In this work we critically examine this proposal, finding a very rich spectral phenomenology that combines the Little-Parks modulation of the parent-gap superconductor with flux, the presence of flux-dispersing Caroli-de Gennes-Matricon (CdGM) analog subgap states, and the emergence of MZMs across finite flux intervals that depend on the transverse wavefunction profile of the charge density in the core section. Through microscopic simulations and analytical derivations, we study different regimes for the semiconductor core, ranging from the hollow-core approximation, to the tubular-core nanowire appropriate for a semiconductor tube with an insulating core, to the solid-core nanowire. We compute the phase diagrams for the different models in cylindrical nanowires and find that MZMs typically coexist with CdGM analogs at zero energy, rendering them gapless. However, we also find topologically protected parameter regions, or islands, with gapped MZMs. In this sense, the most promising candidate to obtain topologically protected MZMs in a full-shell geometry is the nanowire with a tubular-shaped core. Moving beyond pristine nanowires, we study the effect of mode mixing perturbations. Strikingly, mode mixing can act like a topological $p$-wave pairing between particle-hole Bogoliubov partners, and is therefore able to create new topologically protected MZMs in regions of the phase diagram that were originally trivial. As a result, the phase diagram is utterly transformed and exhibits protected MZMs in around half of the parameter space., Comment: 28 pages, 13 figures. Final version

For nonlinear parabolic gradient systems of the form \[ u_t = -\nabla V(u) + u_{xx} \,, \] where the spatial domain is the whole real line, the state variable $u$ is multidimensional, and the potential function $V$ is coercive at infinity, the following result is proved: for every critical point of $V$ which is not a global minimum point, there exists a travelling front, either pushed or pulled, invading this critical point at a speed which is not smaller than its linear spreading speed. By contrast with previous existence results of the same kind, no further assumption is made (neither that the invaded critical point is a non-degenerate local minimum point, nor other assumptions ensuring pushed invasion)., Comment: 26 pages, 7 figures

Molybdenum disulfide, $MoS_2$, is a next-generation semiconductor and is frequently integrated into emergent optoelectronic technologies based on two-dimensional materials. Here, we present a method that provides direct optical feedback on the thickness and crystallinity of sputter-deposited $MoS_2$ down to the few-layer regime. This smart sensing enables tracking the material's functional properties, such as excitonic response, sheet resistance, and hardness across the amorphous-crystalline transition. To illustrate the potential of such feedback-controlled fabrication, we realized $MoS_2$-based hyperbolic metamaterials (HMM) with controllable optical topological transitions and hardness., Comment: 17 pages, 4 figures, 68 references. Supplementary available with 16 pages, 8 figures, and 10 references

This work has two contributions. The first one is extending the Large Deviation Principle for uniform hyper-graphons from Lubetzky and Zhao \cite{lubetzky2015replica} to the multi-relational setting where each hyper-graphon can have different arities. This extension enables the formulation of the most typical possible world in Relational Probabilistic Logic with symmetric relational symbols in terms of entropy maximization subjected to constraints of quantum sub-hypergraph densities. The second contribution is to prove the most typical constrained multi-relational hyper-graphons (the most typical possible worlds) are computable by proving the solutions of the maximum entropy subjected by quantum sub-hypergraph densities in the space of multi-relational hyper-graphons are step functions except for in a zero measure set of combinations of quantum hyper-graphs densities with multiple relations. This result proves in a very general context the conjecture formulated by Radin et al.\ \cite{radin2014asymptotics} that states the constrained graphons with maximum entropy are step functions., Comment: 44 pages, 4 figures, We plan to submit Random Structures and Algorithms

Cancer progression and monotonic accumulation models were developed to discover dependencies in the irreversible acquisition of binary traits from cross-sectional data. They have been used in computational oncology and virology but also in widely different problems such as malaria progression. These methods have been applied to predict future states of the system, identify routes of feature acquisition, and improve patient stratification, and they hold promise for evolutionary-based treatments. New methods continue to be developed. But these methods have shortcomings, which are yet to be systematically critiqued, regarding key evolutionary assumptions and interpretations. After an overview of the available methods, we focus on why inferences might not be about the processes we intend. Using fitness landscapes, we highlight difficulties that arise from bulk sequencing and reciprocal sign epistasis, from conflating lines of descent, path of the maximum, and mutational profiles, and from ambiguous use of the idea of exclusivity. We examine how the previous concerns change when bulk sequencing is explicitly considered, and underline opportunities for addressing dependencies due to frequency-dependent selection. This review identifies major standing issues, and should encourage the use of these methods in other areas with a better alignment between entities and model assumptions., Comment: fixed wrong fig. ref; driv./pass.; [Previous: Abstract 200 words; details BML; consistent Brit. spell.; Iain G. Johnston coauthor; clarified LOD/POM; clarified scenarios; comment Schill et al. 2024 selection bias; fixed typos; additional annotation in some figures and figure legends. Added URLs and DOIs to references; corrected typos; added URL to software]

In this paper we introduce the notion of generalized invertible 1-cocycle in a strict braided monoidal category C, and we prove that the category of Hopf trusses is equivalent to the category of generalized invertible 1-cocycles. On the other hand, we also introduce the notions of module for a Hopf truss and for a generalized invertible 1-cocycle. We prove some functorial results involving these categories of modules and we show that the category of modules associated to a generalized invertible 1-cocycle is equivalent to a category of modules associated to a suitable Hopf truss. Finally, assuming that in C we have equalizers, we introduce the notion of Hopf-module in the Hopf truss setting and we obtain the Fundamental Theorem of Hopf modules associated to a Hopf truss.

The ability to enter in contact with and manipulate physical objects with a flying robot enables many novel applications, such as contact inspection, painting, drilling, and sample collection. Generally, these aerial robots need more degrees of freedom than a standard quadrotor. While there is active research of over-actuated, omnidirectional MAVs and aerial manipulators as well as VTOL and hybrid platforms, the two concepts have not been combined. We address the problem of conceptualization, characterization, control, and testing of a 5DOF rotary-/fixed-wing hybrid, tilt-rotor, split tilt-wing, nearly omnidirectional aerial robot. We present an elegant solution with a minimal set of actuators and that does not need any classical control surfaces or flaps. The concept is validated in a wind tunnel study and in multiple flights with forward and backward transitions. Fixed-wing flight speeds up to 10 m/s were reached, with a power reduction of 30% as compared to rotary wing flight., Comment: Accepted and presented at the 18th International Symposium on Experimental Robotics (ISER 2023)

This paper proposes a new control framework for manipulating soft objects. A Deep Reinforcement Learning (DRL) approach is used to make the shape of a deformable object reach a set of desired points by controlling a robotic arm which manipulates it. Our framework is more easily generalizable than existing ones: it can work directly with different initial and desired final shapes without need for relearning. We achieve this by using learning parallelization, i.e., executing multiple agents in parallel on various environment instances. We focus our study on deformable linear objects. These objects are interesting in industrial and agricultural domains, yet their manipulation with robots, especially in 3D workspaces, remains challenging. We simulate the entire environment, i.e., the soft object and the robot, for the training and the testing using PyBullet and OpenAI Gym. We use a combination of state-of-the-art DRL techniques, the main ingredient being a training approach for the learning agent (i.e., the robot) based on Deep Deterministic Policy Gradient (DDPG). Our simulation results support the usefulness and enhanced generality of the proposed approach., Comment: 7 pages, 5 figures, 1 table, Accepted for IEEE CASE 2022

Distance minimization is a general principle of language. A special case of this principle in the domain of word order is swap distance minimization. This principle predicts that variations from a canonical order that are reached by fewer swaps of adjacent constituents are lest costly and thus more likely. Here we investigate the principle in the context of the triple formed by subject (S), object (O) and verb (V). We introduce the concept of word order rotation as a cognitive underpinning of that prediction. When the canonical order of a language is SOV, the principle predicts SOV < SVO, OSV < VSO, OVS < VOS, in order of increasing cognitive cost. We test the prediction in three flexible order SOV languages: Korean (Koreanic), Malayalam (Dravidian), and Sinhalese (Indo-European). Evidence of swap distance minimization is found in all three languages, but it is weaker in Sinhalese. Swap distance minimization is stronger than a preference for the canonical order in Korean and especially Malayalam.

We present the results of a systematic search of the Transiting Exoplanet Survey Satellite (TESS) 2-min cadence data for new rapidly oscillating Ap (roAp) stars observed during the Cycle 2 phase of its mission. We find seven new roAp stars previously unreported as such and present the analysis of a further 25 roAp stars that are already known. Three of the new stars show multiperiodic pulsations, while all new members are rotationally variable stars, leading to almost 70 per cent (22) of the roAp stars presented being $\alpha^2$ CVn-type variable stars. We show that targeted observations of known chemically peculiar stars are likely to overlook many new roAp stars, and demonstrate that multi-epoch observations are necessary to see pulsational behaviour changes. We find a lack of roAp stars close to the blue edge of the theoretical roAp instability strip, and reaffirm that mode instability is observed more frequently with precise, space-based observations. In addition to the Cycle 2 observations, we analyse TESS data for all known roAp stars. This amounts to 18 further roAp stars observed by TESS. Finally, we list six known roAp stars that TESS is yet to observe. We deduce that the incidence of roAp stars amongst the Ap star population is just 5.5 per cent, raising fundamental questions about the conditions required to excite pulsations in Ap stars. This work, coupled with our previous work on roAp stars in Cycle 1 observations, presents the most comprehensive, homogeneous study of the roAp stars in the TESS nominal mission, with a collection of 112 confirmed roAp stars in total., Comment: Accepted for publication in MNRAS. 32 Pages, 2 Tables, 77 Figures

We estimate the redshift-dependent, anisotropic clustering signal in DESI's Year 1 Survey created by tidal alignments of Luminous Red Galaxies (LRGs) and a selection-induced galaxy orientation bias. To this end, we measured the correlation between LRG shapes and the tidal field with DESI's Year 1 redshifts, as traced by LRGs and Emission-Line Galaxies (ELGs). We also estimate the galaxy orientation bias of LRGs caused by DESI's aperture-based selection, and find it to increase by a factor of seven between redshifts 0.4 - 1.1 due to redder, fainter galaxies falling closer to DESI's imaging selection cuts. These effects combine to dampen measurements of the quadrupole of the correlation function caused by structure growth on scales of 10 - 80 Mpc/h by about 0.15% for low redshifts (0.4

Linear arrangements of graphs are a well-known type of graph labeling and are found in many important computational problems, such as the Minimum Linear Arrangement Problem ($\texttt{minLA}$). A linear arrangement is usually defined as a permutation of the $n$ vertices of a graph. An intuitive geometric setting is that of vertices lying on consecutive integer positions in the real line, starting at 1; edges are often drawn as semicircles above the real line. In this paper we study the Maximum Linear Arrangement problem ($\texttt{MaxLA}$), the maximization variant of $\texttt{minLA}$. We devise a new characterization of maximum arrangements of general graphs, and prove that $\texttt{MaxLA}$ can be solved for cycle graphs in constant time, and for $k$-linear trees ($k\le2$) in time $O(n)$. We present two constrained variants of $\texttt{MaxLA}$ we call $\texttt{bipartite MaxLA}$ and $\texttt{1-thistle MaxLA}$. We prove that the former can be solved in time $O(n)$ for any bipartite graph; the latter, by an algorithm that typically runs in time $O(n^4)$ on unlabelled trees. The combination of the two variants has two promising characteristics. First, it solves $\texttt{MaxLA}$ for almost all trees consisting of a few tenths of nodes. Second, we prove that it constitutes a $3/2$-approximation algorithm for $\texttt{MaxLA}$ for trees. Furthermore, we conjecture that $\texttt{bipartite MaxLA}$ solves $\texttt{MaxLA}$ for at least $50\%$ of all free trees.

Robotic manipulation of deformable linear objects (DLOs) has great potential for applications in diverse fields such as agriculture or industry. However, a major challenge lies in acquiring accurate deformation models that describe the relationship between robot motion and DLO deformations. Such models are difficult to calculate analytically and vary among DLOs. Consequently, manipulating DLOs poses significant challenges, particularly in achieving large deformations that require highly accurate global models. To address these challenges, this paper presents MultiAC6: a new multi Actor-Critic framework for robot action space decomposition to control large 3D deformations of DLOs. In our approach, two deep reinforcement learning (DRL) agents orient and position a robot gripper to deform a DLO into the desired shape. Unlike previous DRL-based studies, MultiAC6 is able to solve the sim-to-real gap, achieving large 3D deformations up to 40 cm in real-world settings. Experimental results also show that MultiAC6 has a 66\% higher success rate than a single-agent approach. Further experimental studies demonstrate that MultiAC6 generalizes well, without retraining, to DLOs with different lengths or materials., Comment: 9 pages, 7 figures, 5 tables, Accepted for IEEE Robotics and Automation Letters (RA-L)

Due to the advent and increase in the popularity of the Internet, people have been producing and disseminating textual data in several ways, such as reviews, social media posts, and news articles. As a result, numerous researchers have been working on discovering patterns in textual data, especially because social media posts function as social sensors, indicating peoples' opinions, interests, etc. However, most tasks regarding natural language processing are addressed using traditional machine learning methods and static datasets. This setting can lead to several problems, such as an outdated dataset, which may not correspond to reality, and an outdated model, which has its performance degrading over time. Concept drift is another aspect that emphasizes these issues, which corresponds to data distribution and pattern changes. In a text stream scenario, it is even more challenging due to its characteristics, such as the high speed and data arriving sequentially. In addition, models for this type of scenario must adhere to the constraints mentioned above while learning from the stream by storing texts for a limited time and consuming low memory. In this study, we performed a systematic literature review regarding concept drift adaptation in text stream scenarios. Considering well-defined criteria, we selected 40 papers to unravel aspects such as text drift categories, types of text drift detection, model update mechanism, the addressed stream mining tasks, types of text representations, and text representation update mechanism. In addition, we discussed drift visualization and simulation and listed real-world datasets used in the selected papers. Therefore, this paper comprehensively reviews the concept drift adaptation in text stream mining scenarios., Comment: 49 pages