Search

The elastic moduli of tissues are connected to their states of health and function. The epithelial monolayer is a simple, minimal, tissue model that is often used to gain understanding of mechanical behavior at the cellular or multi-cellular scale. Here we investigate how the elastic modulus of Madin Darby Canine Kidney (MDCK) cells depends on their packing density. Rather than measuring elasticity at the sub-cellular scale with local probes, we characterize the monolayer at the multi-cellular scale, as one would a thin slab of elastic material. We use a micro-indentation system to apply gentle forces to the apical side of MDCK monolayers, applying a normal force to approximately 100 cells in each experiment. In low-density confluent monolayers, we find that the elastic modulus decreases with increasing cell density. At high densities, the modulus appears to plateau. This finding will help guide our understanding of known collective behaviors in epithelial monolayers and other tissues where variations in cell packing density are correlated with cell motion., Comment: 13 pages, 4 figures

Transitions between solid-like and fluid-like states in living tissues have been found in steps of embryonic development and in stages of disease progression. Our current understanding of these transitions has been guided by experimental and theoretical investigations focused on how motion becomes arrested with increased mechanical coupling between cells, typically as a function of packing density or cell cohesiveness. However, cells actively respond to externally applied forces by contracting after a time delay, so it is possible that at some packing densities or levels of cell cohesiveness, mechanical coupling stimulates cell motion instead of suppressing it. Here we report our findings that at low densities and within multiple ranges of cell cohesiveness, cell migration speeds increase with these measures of mechanical coupling. Our observations run counter to our intuition that cell motion will be suppressed by increasingly packing or sticking cells together and may provide new insight into biological processes involving motion in dense cell populations., Comment: 5 figures; supplementary information

Accurately tracking neuronal activity in behaving animals presents significant challenges due to complex motions and background noise. The lack of annotated datasets limits the evaluation and improvement of such tracking algorithms. To address this, we developed SINETRA, a versatile simulator that generates synthetic tracking data for particles on a deformable background, closely mimicking live animal recordings. This simulator produces annotated 2D and 3D videos that reflect the intricate movements seen in behaving animals like Hydra Vulgaris. We evaluated four state-of-the-art tracking algorithms highlighting the current limitations of these methods in challenging scenarios and paving the way for improved cell tracking techniques in dynamic biological systems., Comment: 5 pages, 3 figures, submitted at 2025 IEEE International Symposium on Biomedical Imaging (ISBI)

Validating smartphone sensor-based tests to study gait and balance against reference measurement systems in a laboratory setting poses several technical challenges related to data quality and data processing. One challenge is to guarantee the correct annotation of the data, which is required to ensure that only data collected during the same test execution are compared across measurement systems in subsequent analyses. A second challenge is to accurately synchronize the data across the different systems. Here, we propose innovative solutions for both challenges and illustrate their use in the example of comparing smartphone sensor data collected with the Floodlight technology with data collected with a motion capture system. These solutions form important tools for guaranteeing the data quality and data integrity required for the validation of gait and balance characteristics measured by digital health technology tools such as the Floodlight technology., Comment: 16 pages, 4 figures, 1 table

Despite advances with deep learning (DL), automated airway segmentation from chest CT scans continues to face challenges in segmentation quality and generalization across cohorts. To address these, we propose integrating Curriculum Learning (CL) into airway segmentation networks, distributing the training set into batches according to ad-hoc complexity scores derived from CT scans and corresponding ground-truth tree features. We specifically investigate few-shot domain adaptation, targeting scenarios where manual annotation of a full fine-tuning dataset is prohibitively expensive. Results are reported on two large open-cohorts (ATM22 and AIIB23) with high performance using CL for full training (Source domain) and few-shot fine-tuning (Target domain), but with also some insights on potential detrimental effects if using a classic Bootstrapping scoring function or if not using proper scan sequencing., Comment: Under review for 22nd IEEE International Symposium on Biomedical Imaging (ISBI), Houston, TX, USA

We compute the MU-based syntomic cohomologies, mod $(p,v_1,\cdots,v_{n+1})$, of all $\mathbb{E}_1$-MU-algebra forms of connective Morava K-theory k(n). As qualitative consequences, we deduce the Lichtenbaum--Quillen conjecture, telescope conjecture, and redshift conjecture for the algebraic K-theories of all $\mathbb{E}_{1}$-$\mathbb{S}$-algebra forms of $(2p^n-2)$-periodic Morava K-theory. Notably, the motivic spectral sequence computing $\pi_*TC(k(n))_p$ is concentrated on at most three lines, independently of $n$., Comment: 63 pages, 5 figures, Comments welcome!

We provide a unifying framework for studying variants of topological Hochschild homology such as Real topological Hochschild homology. Associated to a crossed simplicial group $\Delta G$, a category that generalizes Connes' cyclic category, we introduce an invariant of rings with twisted $G$-action, which we call topological $\Delta G$-homology. Here a ring with twisted $G$-action is a common generalization of a ring with involution and a ring with $G$-action. Our construction provides homotopical analogues of quaternionic homology, symmetric homology, braid homology, and hyperoctahedral homology defined by Fiedorowicz--Loday. In the quaternionic case our construction, called quaternionic topological Hochschild homology, is equipped with a left Pin(2)-action and we compute it for loop spaces with a twisted $C_4$-action. As an important step along the way, we introduce a new family of crossed simplicial groups called the twisted symmetric crossed simplicial groups and we prove that they corresponds to operads for algebras with twisted $G$-action., Comment: 61 pages. Comments welcome!

The Fractional Stochastic Regularity Model (FSRM) is an extension of Black-Scholes model describing the multifractal nature of prices. It is based on a multifractional process with a random Hurst exponent $H_t$, driven by a fractional Ornstein-Uhlenbeck (fOU) process. When the regularity parameter $H_t$ is equal to $1/2$, the efficient market hypothesis holds, but when $H_t\neq 1/2$ past price returns contain some information on a future trend or mean-reversion of the log-price process. In this paper, we investigate some properties of the fOU process and, thanks to information theory and Shannon's entropy, we determine theoretically the serial information of the regularity process $H_t$ of the FSRM, giving some insight into one's ability to forecast future price increments and to build statistical arbitrages with this model., Comment: 22 pages, 10 figures

Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the edges are monotonically increasing in a common direction and every edge is crossed at most $k$ times for some integer $k \ge 1$. We show that the number of crossings per edge in a monotone drawing is in general unbounded for the class of bipartite outerplanar, cubic, or bounded pathwidth DAGs. However, it is at most two for outerpaths and it is at most quadratic in the bandwidth in general. From the computational point of view, we prove that upward-$k$-planarity testing is NP-complete already for $k =1$ and even for restricted instances for which upward planarity testing is polynomial. On the positive side, we can decide in linear time whether a single-source DAG admits an upward $1$-planar drawing in which all vertices are incident to the outer face., Comment: This is the extended version, with full appendix, of a paper to appear in the Proc. 32nd Int. Symp. Graph Drawing & Network Visualization (GD 2024)

Quantum Sensing is a rapidly growing branch of research within the area of quantum science and technology offering key resources, beyond classical ones, with potential for commercialisation of novel (quantum) sensors. The exploitation of quantum resources offered by photons can boost the performance of quantum sensors for innovative and challenging applications. In this paper we build on the idea of the Quantum Ghost Spectroscopy (QGS), i.e. the counterpart in the frequency domain of Quantum Ghost Imaging (QGI), targeting specific applications in the detection of possible threats. This is implemented by exploiting the opportunities offered by Quantum Optics, i.e. the generation of photon pairs characterized by spectral correlations. We will discuss our main results obtained with pure QGS experiments showing that it is possible to assess the presence of a target dealing with a low resources measurement. The time-frequency domain reveals a huge potential for several applications and frequency correlations represent a versatile tool that can be exploited to enable the spectral analysis of objects where a direct measurement would not be feasible (e.g. security). The use of nondegenerate sources of correlated photons allowed to reveal spectral features in the near infrared wavelengths employing the usual detectors for the visible region.

Gellan gum has gained significant attention due to its versatility in multiple applications in the form of hydrogels and microgels. A thorough understanding of the rheological behaviour of these systems is crucial both for fundamental research and to optimize the manufacturing needs. To this aim, here we extensively characterize the rheological behaviour of gellan based hydrogels and microgels recently used for efficient paper cleaning for restoration interventions. In particular, we study their viscoelastic properties, also during hydrogel and microgel formation, assessing the role of temperature, gellan concentration, and, importantly, the presence of different cations, which plays a crucial role in the gelation process. We find the interesting result that, in the conditions where they are efficient for cleaning, gellan hydrogels exhibit a double yielding behavior. In addition, we provide a detailed description of gellan microgels preparation, ensuring high control and reproducibility of the samples. Altogether our study sheds light on the mechanical stability, network structure, and overall functionality of the gellan-based gels, providing valuable insights into optimizing conditions for desired applications in paper cleaning.

Deep learning has revolutionized medical image segmentation, but it relies heavily on high-quality annotations. The time, cost and expertise required to label images at the pixel-level for each new task has slowed down widespread adoption of the paradigm. We propose Pix2Rep, a self-supervised learning (SSL) approach for few-shot segmentation, that reduces the manual annotation burden by learning powerful pixel-level representations directly from unlabeled images. Pix2Rep is a novel pixel-level loss and pre-training paradigm for contrastive SSL on whole images. It is applied to generic encoder-decoder deep learning backbones (e.g., U-Net). Whereas most SSL methods enforce invariance of the learned image-level representations under intensity and spatial image augmentations, Pix2Rep enforces equivariance of the pixel-level representations. We demonstrate the framework on a task of cardiac MRI segmentation. Results show improved performance compared to existing semi- and self-supervised approaches; and a 5-fold reduction in the annotation burden for equivalent performance versus a fully supervised U-Net baseline. This includes a 30% (resp. 31%) DICE improvement for one-shot segmentation under linear-probing (resp. fine-tuning). Finally, we also integrate the novel Pix2Rep concept with the Barlow Twins non-contrastive SSL, which leads to even better segmentation performance., Comment: Accepted at MIDL 2024

This paper introduces a novel approach that combines unsupervised active contour models with deep learning for robust and adaptive image segmentation. Indeed, traditional active contours, provide a flexible framework for contour evolution and learning offers the capacity to learn intricate features and patterns directly from raw data. Our proposed methodology leverages the strengths of both paradigms, presenting a framework for both unsupervised and one-shot approaches for image segmentation. It is capable of capturing complex object boundaries without the need for extensive labeled training data. This is particularly required in histology, a field facing a significant shortage of annotations due to the challenging and time-consuming nature of the annotation process. We illustrate and compare our results to state of the art methods on a histology dataset and show significant improvements., Comment: 11 pages, 12 figures

The lack of large annotated datasets in medical imaging is an intrinsic burden for supervised Deep Learning (DL) segmentation models. Few-shot learning approaches are cost-effective solutions to transfer pre-trained models using only limited annotated data. However, such methods can be prone to overfitting due to limited data diversity especially when segmenting complex, diverse, and sparse tubular structures like airways. Furthermore, crafting informative image representations has played a crucial role in medical imaging, enabling discriminative enhancement of anatomical details. In this paper, we initially train a data-driven sparsification module to enhance airways efficiently in lung CT scans. We then incorporate these sparse representations in a standard supervised segmentation pipeline as a pretraining step to enhance the performance of the DL models. Results presented on the ATM public challenge cohort show the effectiveness of using sparse priors in pre-training, leading to segmentation Dice score increase by 1% to 10% in full-scale and few-shot learning scenarios, respectively., Comment: Accepted at 21st IEEE International Symposium on Biomedical Imaging (ISBI)

The major difference between percolation and other phase transition models is the absence of an Hamiltonian and of a partition function. For this reason it is not straightforward to identify the corresponding field theory to be used as starting point of Renormalization Group computations. Indeed, it could be identified with the field theory of $n+1$ states Potts model in the limit of $n \to 0$ only by means of the mapping discovered by Kasteleyn and Fortuin for bond percolation. In this paper we show that it is possible to recover the epsilon expansion for critical exponents in finite dimension directly using the $M$-layer expansion, without the need to perform any analytical continuation. Moreover, we also show explicitly that the critical exponents for site and bond percolation are the same. This computation provides a reference for applications of the $M$-layer method to systems where the underlying field theory is unknown or disputed.

NL2VIS (natural language to visualization) is a promising and recent research area that involves interpreting natural language queries and translating them into visualizations that accurately represent the underlying data. As we navigate the era of big data, NL2VIS holds considerable application potential since it greatly facilitates data exploration by non-expert users. Following the increasingly widespread usage of generative AI in NL2VIS applications, in this paper we present V-RECS, the first LLM-based Visual Recommender augmented with explanations(E), captioning(C), and suggestions(S) for further data exploration. V-RECS' visualization narratives facilitate both response verification and data exploration by non-expert users. Furthermore, our proposed solution mitigates computational, controllability, and cost issues associated with using powerful LLMs by leveraging a methodology to effectively fine-tune small models. To generate insightful visualization narratives, we use Chain-of-Thoughts (CoT), a prompt engineering technique to help LLM identify and generate the logical steps to produce a correct answer. Since CoT is reported to perform poorly with small LLMs, we adopted a strategy in which a large LLM (GPT-4), acting as a Teacher, generates CoT-based instructions to fine-tune a small model, Llama-2-7B, which plays the role of a Student. Extensive experiments-based on a framework for the quantitative evaluation of AI-based visualizations and on manual assessment by a group of participants-show that V-RECS achieves performance scores comparable to GPT-4, at a much lower cost. The efficacy of the V-RECS teacher-student paradigm is also demonstrated by the fact that the un-tuned Llama fails to perform the task in the vast majority of test cases. We release V-RECS for the visualization community to assist visualization designers throughout the entire visualization generation process.

When in proxy-SVARs the covariance matrix of VAR disturbances is subject to exogenous, permanent, nonrecurring breaks that generate target impulse response functions (IRFs) that change across volatility regimes, even strong, exogenous external instruments can result in inconsistent estimates of the dynamic causal effects of interest if the breaks are not properly accounted for. In such cases, it is essential to explicitly incorporate the shifts in unconditional volatility in order to point-identify the target structural shocks and possibly restore consistency. We demonstrate that, under a necessary and sufficient rank condition that leverages moments implied by changes in volatility, the target IRFs can be point-identified and consistently estimated. Importantly, standard asymptotic inference remains valid in this context despite (i) the covariance between the proxies and the instrumented structural shocks being local-to-zero, as in Staiger and Stock (1997), and (ii) the potential failure of instrument exogeneity. We introduce a novel identification strategy that appropriately combines external instruments with "informative" changes in volatility, thus obviating the need to assume proxy relevance and exogeneity in estimation. We illustrate the effectiveness of the suggested method by revisiting a fiscal proxy-SVAR previously estimated in the literature, complementing the fiscal instruments with information derived from the massive reduction in volatility observed in the transition from the Great Inflation to the Great Moderation regimes.

In statistical physics, one of the standard methods to study second order phase transitions is the renormalization group that usually leads to an expansion around the corresponding fully connected solution. Unfortunately, often in disordered models, some important finite dimensional second-order phase transitions are qualitatively different or absent in the corresponding fully connected model: in such cases the standard expansion fails. Recently, a new method, the $M$-layer one, has been introduced that performs an expansion around a different soluble mean field model: the Bethe lattice one. This new method has been already used to compute the upper critical dimension $D_U$ of different disordered systems such as the Random Field Ising model or the Spin glass model with field. If then one wants to go beyond and construct an expansion around $D_U$ to understand how critical quantities get renormalized, the actual computation of all the numerical factors is needed. This next step has still not been performed, being technically more involved. In this paper we perform this computation for the ferromagnetic Ising model without quenched disorder, in finite dimensions: we show that, at one-loop order inside the $M$-layer approach, we recover the continuum quartic field theory and we are able to identify the coupling constant $g$ and the other parameters of the theory, as a function of macroscopic and microscopic details of the model such as the lattice spacing, the physical lattice dimension and the temperature. This is a fundamental step that will help in applying in the future the same techniques to more complicated systems, for which the standard field theoretical approach is impracticable.

Pulmonary emphysema, the progressive, irreversible loss of lung tissue, is conventionally categorized into three subtypes identifiable on pathology and on lung computed tomography (CT) images. Recent work has led to the unsupervised learning of ten spatially-informed lung texture patterns (sLTPs) on lung CT, representing distinct patterns of emphysematous lung parenchyma based on both textural appearance and spatial location within the lung, and which aggregate into 6 robust and reproducible CT Emphysema Subtypes (CTES). Existing methods for sLTP segmentation, however, are slow and highly sensitive to changes in CT acquisition protocol. In this work, we present a robust 3-D squeeze-and-excitation CNN for supervised classification of sLTPs and CTES on lung CT. Our results demonstrate that this model achieves accurate and reproducible sLTP segmentation on lung CTscans, across two independent cohorts and independently of scanner manufacturer and model.

High-resolution full lung CT scans now enable the detailed segmentation of airway trees up to the 6th branching generation. The airway binary masks display very complex tree structures that may encode biological information relevant to disease risk and yet remain challenging to exploit via traditional methods such as meshing or skeletonization. Recent clinical studies suggest that some variations in shape patterns and caliber of the human airway tree are highly associated with adverse health outcomes, including all-cause mortality and incident COPD. However, quantitative characterization of variations observed on CT segmented airway tree remain incomplete, as does our understanding of the clinical and developmental implications of such. In this work, we present an unsupervised deep-learning pipeline for feature extraction and clustering of human airway trees, learned directly from projections of 3D airway segmentations. We identify four reproducible and clinically distinct airway sub-types in the MESA Lung CT cohort., Comment: Accepted to appear in Proceedings of International Symposium on Biomedical Imaging (ISBI), 2024

Robust quantification of pulmonary emphysema on computed tomography (CT) remains challenging for large-scale research studies that involve scans from different scanner types and for translation to clinical scans. Existing studies have explored several directions to tackle this challenge, including density correction, noise filtering, regression, hidden Markov measure field (HMMF) model-based segmentation, and volume-adjusted lung density. Despite some promising results, previous studies either required a tedious workflow or limited opportunities for downstream emphysema subtyping, limiting efficient adaptation on a large-scale study. To alleviate this dilemma, we developed an end-to-end deep learning framework based on an existing HMMF segmentation framework. We first demonstrate that a regular UNet cannot replicate the existing HMMF results because of the lack of scanner priors. We then design a novel domain attention block to fuse image feature with quantitative scanner priors which significantly improves the results., Comment: 5 pages, 5 figures. Accepted to IEEE International Symposium on Biomedical Imaging 2024 (ISBI 2024). Camera-ready version

We propose AFTNet, a novel network-constraint survival analysis method based on the Weibull accelerated failure time (AFT) model solved by a penalized likelihood approach for variable selection and estimation. When using the log-linear representation, the inference problem becomes a structured sparse regression problem for which we explicitly incorporate the correlation patterns among predictors using a double penalty that promotes both sparsity and grouping effect. Moreover, we establish the theoretical consistency for the AFTNet estimator and present an efficient iterative computational algorithm based on the proximal gradient descent method. Finally, we evaluate AFTNet performance both on synthetic and real data examples.

This paper proposes a dynamic interactive and weakly supervised segmentation method with minimal user interactions to address two major challenges in the segmentation of whole slide histopathology images. First, the lack of hand-annotated datasets to train algorithms. Second, the lack of interactive paradigms to enable a dialogue between the pathologist and the machine, which can be a major obstacle for use in clinical routine. We therefore propose a fast and user oriented method to bridge this gap by giving the pathologist control over the final result while limiting the number of interactions needed to achieve a good result (over 90\% on all our metrics with only 4 correction scribbles).

In this work, we present a device-centric analysis of security and privacy attacks and defenses on Extended Reality (XR) devices, highlighting the need for robust and privacy-aware security mechanisms. Based on our analysis, we present future research directions and propose design considerations to help ensure the security and privacy of XR devices., Comment: This is the author's version of the work. It is posted here for personal/educational use only. The definitive version was published in IEEE Security & Privacy Magazine Jan/Feb 2024

The automatic generation of visualizations is an old task that, through the years, has shown more and more interest from the research and practitioner communities. Recently, large language models (LLM) have become an interesting option for supporting generative tasks related to visualization, demonstrating initial promising results. At the same time, several pitfalls, like the multiple ways of instructing an LLM to generate the desired result, the different perspectives leading the generation (code-based, image-based, grammar-based), and the presence of hallucinations even for the visualization generation task, make their usage less affordable than expected. Following similar initiatives for benchmarking LLMs, this paper copes with the problem of modeling the evaluation of a generated visualization through an LLM. We propose a theoretical evaluation stack, EvaLLM, that decomposes the evaluation effort in its atomic components, characterizes their nature, and provides an overview of how to implement and interpret them. We also designed and implemented an evaluation platform that provides a benchmarking resource for the visualization generation task. The platform supports automatic and manual scoring conducted by multiple assessors to support a fine-grained and semantic evaluation based on the EvaLLM stack. Two case studies on GPT3.5-turbo with Code Interpreter and Llama2-70-b models show the benefits of EvaLLM and illustrate interesting results on the current state-of-the-art LLM-generated visualizations.

A detailed knowledge of the decay properties of the so called Hoyle state in the $^{12}$C nucleus ($E_x=7.654$ MeV, $0^+$) is required to calculate the rate at which carbon is forged in typical red-giant stars. This paper reports on a new almost background-free measurement of the radiative decay branching ratio of the Hoyle state using advanced charged particle coincidence techniques. The exploitation, for the first time in a similar experiment, of a bidimensional map of the coincidence efficiency allows to reach an unitary value and, consequently, to strongly reduce sources of systematic uncertainties. The present results suggest a value of the radiative branching ratio of $\Gamma_{rad}/\Gamma_{tot}=4.2(6)\cdot10^{-4}$. This finding helps to resolve the tension between recent data published in the literature.

The ``comma sequence'' starts with 1 and is defined by the property that if k and k' are consecutive terms, the two-digit number formed from the last digit of k and the first digit of k' is equal to the difference k'-k. If there is more than one such k', choose the smallest, but if there is no such k' the sequence terminates. The sequence begins 1, 12, 35, 94, 135, ... and, surprisingly, ends at term 2137453, which is 99999945. The paper analyzes the sequence and its generalizations to other starting values and other bases. A slight change in the rules allows infinitely long comma sequences to exist., Comment: 19 pages, 4 figures, 1 table. Corrected a formula, expanded discussion of an asymptotic estimate, other small changes

Attack Graph (AG) represents the best-suited solution to support cyber risk assessment for multi-step attacks on computer networks, although their generation suffers from poor scalability due to their combinatorial complexity. Current solutions propose to address the generation problem from the algorithmic perspective and postulate the analysis only after the generation is complete, thus implying too long waiting time before enabling analysis capabilities. Additionally, they poorly capture the dynamic changes in the networks due to long generation times. To mitigate these problems, this paper rethinks the classic AG analysis through a novel workflow in which the analyst can query the system anytime, thus enabling real-time analysis before the completion of the AG generation with quantifiable statistical significance. Further, we introduce a mechanism to accelerate the generation by steering it with the analysis query. To show the capabilities of the proposed framework, we perform an extensive quantitative validation and present a realistic case study on networks of unprecedented size. It demonstrates the advantages of our approach in terms of scalability and fitting to common attack path analyses., Comment: Accepted at ESORICS 2024 (https://link.springer.com/chapter/10.1007/978-3-031-70903-6_12)

We analyzed data from HaloSat observations for five fields in the Galactic disk located far away from the Galactic center (135$^{\circ}$ $<$ $l$ $<$ 254$^{\circ}$) to understand the nature of soft X-ray energy emission in the Galactic disk. The fields have 14$^{\circ}$ diameter and were selected to contain no significant high-flux X-ray sources. All five HaloSat soft X-ray energy spectra (0.4--7 keV with energy resolution of $<$100 eV below 1 keV) show a possibility of the presence of unresolved high-temperature plasma in the Galactic disk (UHTPGD) with a temperature of 0.8--1.0 keV and an emission measure of (8--11)$\times10^{-4} \rm cm^{-6} pc$ in addition to the soft X-ray diffuse background components mainly studied at higher galactic latitudes (solar wind charge exchange emission, local hot bubble, Milky Way halo emission, and the cosmic X-ray background). This suggests that the UHTPGD is present across the whole Galactic disk. We also observed UHTPGD emission in a region with no bright sources in an {\it XMM-Newton} field contained within one of the {\it HaloSat} fields. The temperature and emission measure are consistent with those measured with {\it HaloSat}. Moreover, the stacked spectra of the X-ray point-like sources and NIR-identified point sources such as stars in the {\it XMM-Newton} field also show a spectral feature similar to the UHTPGD emission. This suggests that the UHTPGD may partly originate from point-like sources such as stars., Comment: Accepted for publication in ApJ. 11 pages and 4 figures

Crossword puzzles are one of the most popular word games, played in different languages all across the world, where riddle style can vary significantly from one country to another. Automated crossword resolution is challenging, and typical solvers rely on large databases of previously solved crosswords. In this work, we extend WebCrow 2.0, an automatic crossword solver, to French, making it the first program for crossword solving in the French language. To cope with the lack of a large repository of clue-answer crossword data, WebCrow 2.0 exploits multiple modules, called experts, that retrieve candidate answers from heterogeneous resources, such as the web, knowledge graphs, and linguistic rules. We compared WebCrow's performance against humans in two different challenges. Despite the limited amount of past crosswords, French WebCrow was competitive, actually outperforming humans in terms of speed and accuracy, thus proving its capabilities to generalize to new languages., Comment: Accepted Paper for EAI Intetain 2023 - 14th EAI International Conference on Intelligent Technologies for Interactive Entertainment

Transformers are widely used deep learning architectures. Existing transformers are mostly designed for sequences (texts or time series), images or videos, and graphs. This paper proposes a novel transformer model for massive (up to a million) point samples in continuous space. Such data are ubiquitous in environment sciences (e.g., sensor observations), numerical simulations (e.g., particle-laden flow, astrophysics), and location-based services (e.g., POIs and trajectories). However, designing a transformer for massive spatial points is non-trivial due to several challenges, including implicit long-range and multi-scale dependency on irregular points in continuous space, a non-uniform point distribution, the potential high computational costs of calculating all-pair attention across massive points, and the risks of over-confident predictions due to varying point density. To address these challenges, we propose a new hierarchical spatial transformer model, which includes multi-resolution representation learning within a quad-tree hierarchy and efficient spatial attention via coarse approximation. We also design an uncertainty quantification branch to estimate prediction confidence related to input feature noise and point sparsity. We provide a theoretical analysis of computational time complexity and memory costs. Extensive experiments on both real-world and synthetic datasets show that our method outperforms multiple baselines in prediction accuracy and our model can scale up to one million points on one NVIDIA A100 GPU. The code is available at \url{https://github.com/spatialdatasciencegroup/HST}., Comment: Accepted in NeurIPS 2023

The occurrence of non-equilibrium transitions between arrested states has recently emerged as an intriguing issue in the field of soft glassy materials. The existence of one such transition has been suggested for aging colloidal clays (Laponite$^{\circledR}$ suspensions) at weight concentration 3.0%, although further experimental evidences are necessary to validate this scenario. Here, we test the occurrence of this transition for spontaneously aged (non-rejuvenated) samples, by exploiting the rheological tools of Dynamical Mechanical Analysis. On imposing consecutive compression cycles to differently aged clay suspensions, we find that a quite abrupt change of rheological parameters occurs for ages around three days. For the Young and elastic moduli, the change with the waiting time is essentially independent from the deformation rate, whereas other "fluid-like" properties, such as the loss modulus, do clearly display some rate dependence. We also show that the crossover identified by rheology coincides with deviations of the relaxation time (obtained through X-Ray Photon Correlation Spectroscopy) from its expected monotonic increase with aging. Thus, our results robustly support the existence of a glass-glass transition in aging colloidal clays, highlighting characteristic features of of their viscoelastic behaviour., Comment: 10 pages, 7 figures