Search

Causal systems often exhibit variations of the underlying causal mechanisms between the variables of the system. Often, these changes are driven by different environments or internal states in which the system operates, and we refer to context variables as those variables that indicate this change in causal mechanisms. An example are the causal relations in soil moisture-temperature interactions and their dependence on soil moisture regimes: Dry soil triggers a dependence of soil moisture on latent heat, while environments with wet soil do not feature such a feedback, making it a context-specific property. Crucially, a regime or context variable such as soil moisture need not be exogenous and can be influenced by the dynamical system variables - precipitation can make a dry soil wet - leading to joint systems with endogenous context variables. In this work we investigate the assumptions for constraint-based causal discovery of context-specific information in systems with endogenous context variables. We show that naive approaches such as learning different regime graphs on masked data, or pooling all data, can lead to uninformative results. We propose an adaptive constraint-based discovery algorithm and give a detailed discussion on the connection to structural causal models, including sufficiency assumptions, which allow to prove the soundness of our algorithm and to interpret the results causally. Numerical experiments demonstrate the performance of the proposed method over alternative baselines, but they also unveil current limitations of our method.

Face recognition and verification are two computer vision tasks whose performances have advanced with the introduction of deep representations. However, ethical, legal, and technical challenges due to the sensitive nature of face data and biases in real-world training datasets hinder their development. Generative AI addresses privacy by creating fictitious identities, but fairness problems remain. Using the existing DCFace SOTA framework, we introduce a new controlled generation pipeline that improves fairness. Through classical fairness metrics and a proposed in-depth statistical analysis based on logit models and ANOVA, we show that our generation pipeline improves fairness more than other bias mitigation approaches while slightly improving raw performance.

Virtual Reality (VR) applications have a number of unique characteristics that set them apart from traditional video streaming. These characteristics have major implications on the design of VR rendering, adaptation, prefetching, caching, and transport mechanisms. This paper contrasts VR to video streaming, stored 2D video streaming in particular, and discusses how to rethink system and network support for VR.

With the recent advancements in generative modeling, the realism of deepfake content has been increasing at a steady pace, even reaching the point where people often fail to detect manipulated media content online, thus being deceived into various kinds of scams. In this paper, we survey deepfake generation and detection techniques, including the most recent developments in the field, such as diffusion models and Neural Radiance Fields. Our literature review covers all deepfake media types, comprising image, video, audio and multimodal (audio-visual) content. We identify various kinds of deepfakes, according to the procedure used to alter or generate the fake content. We further construct a taxonomy of deepfake generation and detection methods, illustrating the important groups of methods and the domains where these methods are applied. Next, we gather datasets used for deepfake detection and provide updated rankings of the best performing deepfake detectors on the most popular datasets. In addition, we develop a novel multimodal benchmark to evaluate deepfake detectors on out-of-distribution content. The results indicate that state-of-the-art detectors fail to generalize to deepfake content generated by unseen deepfake generators. Finally, we propose future directions to obtain robust and powerful deepfake detectors. Our project page and new benchmark are available at https://github.com/CroitoruAlin/biodeep.

Patches of catalyst imprinted on supporting walls induce motion of the fluid around them once they are supplied with the chemical species (``fuel'') that are converted by the catalytic chemical reaction. While the functioning of such chemically active micropumps is conceptually well understood, an in-depth characterization of the induced hydrodynamic flow, and in particular of its possible dependences on parameters such as material properties of the patch and the wall or the geometry of the experimental cell, remains elusive. By using a simple model for the chemical activity of a patch imprinted on a planar wall, we determine analytically the induced hydrodynamic flow in a Newtonian solution that occupies the half space above the wall supporting the patch. This can be seen as an approximation for an experimental-cell geometry with a height much larger than its diameter, the latter, in turn, being much larger than the size of the patch.) The general flow is a linear superposition of a surface-driven and a bulk-driven component; they have different topologies and, generically, each one dominates in distinct regions, with the surface-driven flow being most relevant at small heights above the wall. The surface-driven flows exhibit a somewhat unexpectedly rich behavior, including qualitative changes in the topology of the flow, as a function of the contrast in surface-chemistry (osmotic slip coefficient) between the patch and the support wall. The results are expected to provide guidance for the interpretation of the drift of tracers by the ambient flow, which is the observable usually studied in experimental investigations of chemically active micropumps.

Dark matter is one of the pillars of the current standard model of structure formation: it is assumed to constitute most of the matter in the Universe. However, it can so far only be probed indirectly through its gravitational effects, and its nature remains elusive. In this focus meeting, we discussed different methods used to estimate galaxies' visible and dark matter masses in the nearby and distant Universe. We reviewed successes of the standard model relying on cold dark matter, confronted observations with simulations, and highlighted inconsistencies between the two. We discussed how robust mass measurements can help plan, perform, and refine particle dark matter searches. We further exchanged about alternatives to cold dark matter, such as warm, self-interacting, and fuzzy dark matter, as well as modified gravity. Finally, we discussed prospects and strategies that could be implemented to reveal the nature of this crucial component of the Universe., Comment: Rationale and highlights of the Focus Meeting 9 "Measures of luminous and dark matter in galaxies across time" at the XXXIInd IAU General Assembly in Cape Town, August 2024. 12 pages

Let $(f,g): (S,s) \to (\mathbb{C}^2, 0)$ be a finite morphism from a germ of normal complex analytic surface to the germ of $\mathbb{C}^2$ at the origin. We show that the affine algebraic curve in $\mathbb{C}^2$ defined by the initial Newton polynomial of a defining series of the discriminant germ of $(f,g)$ depends up to toric automorphisms only on the germs of curves defined by $f$ and $g$. This result generalizes a theorem of Gryszka, Gwo\'zdziewicz and Parusi\'nski, which is the special case in which $(S,s)$ is smooth. Our proof uses a common generalization of formulas of L\^e and Casas-Alvero for the intersection number of the discriminant with a germ of plane curve. It uses also a theorem of Delgado and Maugendre characterizing the special members of pencils of curves on normal surface singularities. We apply it to the pencils generated by all pairs $(f^b, g^a)$, for varying positive integral exponents $a, b$, following a strategy initiated by Gwo\'zdziewicz. This is similar to the Eudoxian method of comparison of magnitudes by comparing the sizes of their positive integral multiples., Comment: 27 pages, 3 figures

We locally classify all possible cosmological homogeneous and isotropic Landsberg-type Finsler structures, in 4-dimensions. Among them, we identify viable non-stationary Finsler spacetimes, i.e. those geometries leading to a physical causal structure and a dynamical universe. Noting that any non-stationary Landsberg metric must be actually non-Berwaldian (i.e., it should be a so-called 'unicorn'), we construct the unique Finsler, non-Berwaldian Landsberg generalization of Friedmann-Lemaitre-Robertson-Walker geometry.

We investigate the physical properties and redshift evolution of simulated galaxies residing in protoclusters at cosmic noon, to understand the influence of the environment on galaxy formation. This work is to build clear expectations for the ongoing ODIN survey, devoted to mapping large-scale structures at z=2.4, 3.1, and 4.5 using Ly$\alpha$-emitting galaxies (LAEs) as tracers. From the IllustrisTNG simulations, we define subregions centered on the most massive clusters ranked by total stellar mass at z=0 and study the properties of galaxies within, including LAEs. To model the LAE population, we take a semi-analytical approach that assigns Ly$\alpha$ luminosity and equivalent width based on the UV luminosities to galaxies in a probabilistic manner. We investigate stellar mass, star formation rate, major mergers, and specific star formation rate of the population of star-forming galaxies and LAEs in the field and protocluster environment and trace their evolution. We find that the overall shape of the UV luminosity function (LF) in simulated protocluster environments is characterized by a shallower faint-end slope and an excess on the bright end, signaling different formation histories for galaxies therein. The difference is milder for the Ly$\alpha$ LF. While protocluster galaxies follow the same SFR-$M_{\odot}$ scaling relation as average field galaxies, a larger fraction appears to have experienced major mergers in the last 200 Myr and as a result shows enhanced star formation at a ~60% level, leading to a flatter distribution in both SFR and $M_{\odot}$ relative to galaxies in the average field. We find that protocluster galaxies, including LAEs, begin to quench much earlier (z~0.8-1.6) than field galaxies (z~0.5-0.9); our result is in agreement with recent observational results and highlights the importance of large-scale environment on the overall formation history of galaxies., Comment: 18 pages, 13 figures, to be submitted to Astronomy & Astrophysics, the abstract was reduced to meet character requirements; edits include: updating coauthor list and affiliations, updating citations in Sec 2.1

Multilingual NMT is a viable solution for translating low-resource languages (LRLs) when data from high-resource languages (HRLs) from the same language family is available. However, the training schedule, i.e. the order of presentation of languages, has an impact on the quality of such systems. Here, in a many-to-one translation setting, we propose to apply two algorithms that use reinforcement learning to optimize the training schedule of NMT: (1) Teacher-Student Curriculum Learning and (2) Deep Q Network. The former uses an exponentially smoothed estimate of the returns of each action based on the loss on monolingual or multilingual development subsets, while the latter estimates rewards using an additional neural network trained from the history of actions selected in different states of the system, together with the rewards received. On a 8-to-1 translation dataset with LRLs and HRLs, our second method improves BLEU and COMET scores with respect to both random selection of monolingual batches and shuffled multilingual batches, by adjusting the number of presentations of LRL vs. HRL batches.

Predicting time-dependent dynamics of complex systems governed by non-linear partial differential equations (PDEs) with varying parameters and domains is a challenging task motivated by applications across various fields. We introduce a novel family of neural operators based on our Graph Fourier Neural Kernels, designed to learn solution generators for nonlinear PDEs in which the highest-order term is diffusive, across multiple domains and parameters. G-FuNK combines components that are parameter- and domain-adapted with others that are not. The domain-adapted components are constructed using a weighted graph on the discretized domain, where the graph Laplacian approximates the highest-order diffusive term, ensuring boundary condition compliance and capturing the parameter and domain-specific behavior. Meanwhile, the learned components transfer across domains and parameters using our variant Fourier Neural Operators. This approach naturally embeds geometric and directional information, improving generalization to new test domains without need for retraining the network. To handle temporal dynamics, our method incorporates an integrated ODE solver to predict the evolution of the system. Experiments show G-FuNK's capability to accurately approximate heat, reaction diffusion, and cardiac electrophysiology equations across various geometries and anisotropic diffusivity fields. G-FuNK achieves low relative errors on unseen domains and fiber fields, significantly accelerating predictions compared to traditional finite-element solvers.

Many-to-one neural machine translation systems improve over one-to-one systems when training data is scarce. In this paper, we design and test a novel algorithm for selecting the language of minibatches when training such systems. The algorithm changes the language of the minibatch when the weights of the model do not evolve significantly, as measured by the smoothed KL divergence between all layers of the Transformer network. This algorithm outperforms the use of alternating monolingual batches, but not the use of shuffled batches, in terms of translation quality (measured with BLEU and COMET) and convergence speed.

The effectiveness of Recommender Systems (RS) is closely tied to the quality and distinctiveness of user profiles, yet despite many advancements in raw performance, the sensitivity of RS to user profile quality remains under-researched. This paper introduces novel information-theoretic measures for understanding recommender systems: a "surprise" measure quantifying users' deviations from popular choices, and a "conditional surprise" measure capturing user interaction coherence. We evaluate 7 recommendation algorithms across 9 datasets, revealing the relationships between our measures and standard performance metrics. Using a rigorous statistical framework, our analysis quantifies how much user profile density and information measures impact algorithm performance across domains. By segmenting users based on these measures, we achieve improved performance with reduced data and show that simpler algorithms can match complex ones for low-coherence users. Additionally, we employ our measures to analyze how well different recommendation algorithms maintain the coherence and diversity of user preferences in their predictions, providing insights into algorithm behavior. This work advances the theoretical understanding of user behavior and practical heuristics for personalized recommendation systems, promoting more efficient and adaptive architectures.

Trans-Neptunian objects (TNOs) are considered to be among the most primitive objects in our Solar System. Knowledge of their primary physical properties is essential for understanding their origin and the evolution of the outer Solar System. We predicted a stellar occultation by this TNO for 2020 October 23 UT and ran a specific campaign to investigate this event. We derived the projected profile shape and size from the occultation observations by means of an elliptical fit to the occultation chords. We also performed photometric observations of (143707) 2003 UY117 to obtain the absolute magnitude and the rotational period from the observed rotational light curve. Finally, we combined these results to derive the three-dimensional shape, volume-equivalent diameter, and geometric albedo for this TNO. From the stellar occultation, we obtained a projected ellipse with axes of $(282 \pm 18) \times (184 \pm 32)$ km. The area-equivalent diameter for this ellipse is $D_\textrm{eq,A} = 228 \pm 21$ km. From our photometric $R$ band observations, we derived an absolute magnitude of $H_V = 5.97 \pm 0.07$ mag using $V-R = 0.46 \pm 0.07$ mag, which was derived from a $V$ band subset of these data. The rotational light curve has a peak-to-valley amplitude of $\Delta m = 0.36 \pm 0.13$ mag. We find the most likely rotation period to be $P = 12.376 \pm 0.0033$ hours. By combining the occultation with the rotational light curve results and assuming a triaxial ellipsoid, we derived axes of $a \times b \times c = (332 \pm 24)$ km $\times$ $(216 \pm 24)$ km $\times$ $(180\substack{+28\\-24})$ km for this ellipsoid, and therefore a volume-equivalent diameter of $D_\textrm{eq,V} = 235 \pm 25$ km. Finally, the values for the absolute magnitude and for the area-equivalent diameter yield a geometric albedo of $p_V = 0.139 \pm 0.027$., Comment: 9 pages, 7 figures, accepted for publication in Astronomy and Astrophysics on Sept 13, 2024

A De Bruijn cycle is a cyclic sequence in which every word of length $n$ over an alphabet $\mathcal{A}$ appears exactly once. De Bruijn tori are a two-dimensional analogue. Motivated by recent progress on universal partial cycles and words, which shorten De Bruijn cycles using a wildcard character, we introduce universal partial tori and matrices. We find them computationally and construct infinitely many of them using one-dimensional variants of universal cycles, including a new variant called a universal partial family., Comment: 22 pages, 1 figure

Chalcogenide optical phase change materials (PCMs) have garnered significant interest for their growing applications in programmable photonics, optical analog computing, active metasurfaces, and beyond. Limited endurance or cycling lifetime is however increasingly becoming a bottleneck toward their practical deployment for these applications. To address this issue, we performed a systematic study elucidating the cycling failure mechanisms of Ge$_2$Sb$_2$Se$_4$Te (GSST), a common optical PCM tailored for infrared photonic applications, in an electrothermal switching configuration commensurate with their applications in on-chip photonic devices. We further propose a set of design rules building on insights into the failure mechanisms, and successfully implemented them to boost the endurance of the GSST device to over 67,000 cycles.

As QKD infrastructure becomes increasingly complex while being developed by different actors (typically national governments), interconnecting them into a federated network of very elaborate sub-networks that maintain a high degree of autonomy will pose unique challenges. We identify several such challenges and propose a 4-step orchestration framework to address them based on centralized research, target network planning, optimal QKD design, and protocol enforcement.

Greither and Kurihara proved a theorem about the commutativity of projective limits and Fitting ideals for modules over the classical equivariant Iwasawa algebra $\Lambda_G=\mathbb{Z}_p[[T]][G]$, where $G$ is a finite, abelian group and $\Bbb Z_p$ is the ring of $p$--adic integers, for some prime $p$. In this paper, we generalize their result first to the Noetherian Iwasawa algebra $\mathbb{Z}_p[[T_1, T_2, \cdots, T_n]][G]$ and, most importantly, to the non-Noetherian algebra $\mathbb{Z}_p[[T_1, T_2, \cdots, T_n, \cdots]][G]$ of countably many generators. The latter generalization is motivated by the recent work of Bley-Popescu on the geometric Equivariant Iwasawa Conjecture for function fields, where the Iwasawa algebra is not Noetherian, of the type described above. Applications of these results to the emerging field of non-Noetherian Iwasawa Theory will be given in an upcoming paper., Comment: 31 pages

In this paper we cover a few topics on how to treat inverse problems. There are two different flows of ideas. One approach is based on Morse Lemma. The other is based on analyticity which proves that the number of solutions to the inverse problems is generically isolated for some particular class of dynamical systems.

Researchers and practitioners interested in computational politics rely on automatic content analysis tools to make sense of the large amount of political texts available on the Web. Such tools should provide objective and subjective aspects at different granularity levels to make the analyses useful in practice. Existing methods produce interesting insights for objective aspects, but are limited for subjective ones, are often limited to national contexts, and have limited explainability. We introduce a text analysis framework which integrates both perspectives and provides a fine-grained processing of subjective aspects. Information retrieval techniques and knowledge bases complement powerful natural language processing components to allow a flexible aggregation of results at different granularity levels. Importantly, the proposed bottom-up approach facilitates the explainability of the obtained results. We illustrate its functioning with insights on news outlets, political orientations, topics, individual entities, and demographic segments. The approach is instantiated on a large corpus of French news, but is designed to work seamlessly for other languages and countries.

Data centers have become ubiquitous for today's businesses. From banks to startups, they rely on cloud infrastructure to deploy user applications. In this context, it is vital to provide users with application performance guarantees. Network interference is one of the causes of unpredictable application performance, and many solutions have been proposed over the years. The main objective of this survey is to familiarize the reader with research into network measurement-based resource allocation and control in data centers, focusing on network resources in order to provide cloud performance guarantees. We start with a primer on general network measurement techniques and data center network and applications to give the reader context. We then summarize the characteristics of network traffic and cluster workloads in data centers, which are pivotal for measurement-based allocation and control. We study and compare network monitoring in data centers, giving an overview on their evolution from Software-Defined Networking (SDN) to programmable dataplanes-based. The network monitoring information can serve as input to cluster allocation and scheduling decisions. We next categorize cluster scheduling frameworks, and perform an analysis of those that provide network guarantees in data centers, and we also look at emergent Machine Learning-driven resource allocation and control. We conclude with a discussion about future research directions.

When a particle moves in a Newtonian flow at low Reynolds number, inertia is irrelevant and a linear relationship exists between velocities and forces. For incompressible flows, any force distribution $\mathbf{f}(\mathbf{r})$ acting in the fluid bulk induces flow and motion only through its solenoidal component. For force distributions that are spatially localized (i.e., vanish sufficiently fast at infinity), we derive the representation of the rigid body motion as an explicit linear functional of $\nabla\times\mathbf{f}$, which complements the usual representation in terms of $\mathbf{f}$. We illustrate the utility of this alternative representation, which has the advantage of having the incompressibility constraint built-in, in avoiding certain ambiguities that arise, e.g., when implementing approximations for swimmers., Comment: The manuscript proper and the supplemental material have been merged consecutively into a single PDF file

The influence of space weathering on the observed spectra of C-complex asteroids remains uncertain. This has long hindered our understanding of their composition through telescope observations. Multi-band imaging of Ryugu by ONC-T on Hayabusa2 and that of Bennu by MapCam on OSIRIS-REx found opposite spectral trends of space weathering; Ryugu darkened/reddened while Bennu brightened/blued. How the spectra of Ryugu and Bennu evolved relative to each other would place a constraint for understanding their origins and evolutions. In this study, we compared the space weathering trends on Ryugu and Bennu by applying the results of cross calibration between ONC-T and MapCam. We show that the average Bennu surface is brighter by 18.0 $\pm$ 1.5% at 550 nm and bluer by 0.18 $\pm$ 0.03 $\mu$m$^{-1}$ (480-850 nm slope) than Ryugu. The spectral slopes of surface materials are more uniform on Bennu than on Ryugu at spatial scales $\gtrsim$1 m, but Bennu is more heterogeneous at $\lesssim$1 m. This suggests that lateral mixing due to resurfacing may have been more efficient on Bennu. The reflectance-spectral slope distributions of craters on Ryugu and Bennu appeared to follow two trend lines with an offset before cross calibration, but they converged to a single straight trend without a bend after cross calibration. We show that the spectra of the freshest craters on Ryugu and Bennu are indistinguishable within the uncertainty of cross calibration. These results suggest that Ryugu and Bennu initially had similar spectra before space weathering and that they evolved in completely opposite directions along the same trend line, subsequently evolving into asteroids with different disk-averaged spectra. These findings further suggest that space weathering likely expanded the spectral slope variation of C-complex asteroids, implying that they may have formed from materials with more uniform spectral slopes.

Reasoning with defeasible and conflicting knowledge in an argumentative form is a key research field in computational argumentation. Reasoning under various forms of uncertainty is both a key feature and a challenging barrier for automated argumentative reasoning. It was shown that argumentative reasoning using probabilities faces in general high computational complexity, in particular for the so-called constellation approach. In this paper, we develop an algorithmic approach to overcome this obstacle. We refine existing complexity results and show that two main reasoning tasks, that of computing the probability of a given set being an extension and an argument being acceptable, diverge in their complexity: the former is #P-complete and the latter is #-dot-NP-complete when considering their underlying counting problems. We present an algorithm for the complex task of computing the probability of a set of arguments being a complete extension by using dynamic programming operating on tree-decompositions. An experimental evaluation shows promise of our approach.

Self-chemophoresis is an appealing and quite successful interpretation of the motility exhibited by certain chemically active colloidal particles suspended in a solution of their "fuel": the particle has a phoretic response to self-generated, rather than externally imposed, inhomogeneities in the chemical composition of the solution. The postulated mechanism of chemophoresis is the interaction of the particle (via an adsorption potential) with the chemical inhomogeneities in the surrounding medium. When the range of this interaction is much smaller than any other relevant scale in the system, the (translational and rotational) phoretic velocities can be described in terms of a phoretic coefficient and a slip fluid velocity at the surface of the particle. Using the case of a spherical particle as a simple and physically insightful example, here we exploit an integral representation of the rigid-body motion to critically re-examine this framework. The systematic analysis highlights two steps in the approximation: first the thin-layer approximation (very large particle size), and subsequently a lubrication approximation (slow variation of the adsorption potential along the tangential direction). We also discuss how these approximations could be relaxed and the effect of this on the particle's motion.

With the recent advancements in quantum technologies, the QKD market exploded. World players are scrambling to win the race towards global QKD networks, even before the rules and policies required by such large endeavors were even discussed. Several vendors are on the market, each with specific parameters and advantages (in terms of key rate, link range, KMS software, etc.), hence considerable effort is now made towards standardization. While quantum communications is expected to reach a market size of up to \$36B by 2040, the largest QKD initiative to date is EuroQCI, which, due to its sheer scale, is forcing the market to mature. Although building a QKD network is believed to be trivial today, inter-connecting federated networks on a global scale is a heavy challenge. We propose QKD virtual networks not only as a useful infrastructure abstraction for increased flexibility and granular security, but as an inevitable solution for several problems that future QKD networks will encounter on the way towards widespread adoption.

In recent years, artificial intelligence (AI) has deeply impacted various fields, including Earth system sciences. Here, AI improved weather forecasting, model emulation, parameter estimation, and the prediction of extreme events. However, the latter comes with specific challenges, such as developing accurate predictors from noisy, heterogeneous and limited annotated data. This paper reviews how AI is being used to analyze extreme events (like floods, droughts, wildfires and heatwaves), highlighting the importance of creating accurate, transparent, and reliable AI models. We discuss the hurdles of dealing with limited data, integrating information in real-time, deploying models, and making them understandable, all crucial for gaining the trust of stakeholders and meeting regulatory needs. We provide an overview of how AI can help identify and explain extreme events more effectively, improving disaster response and communication. We emphasize the need for collaboration across different fields to create AI solutions that are practical, understandable, and trustworthy for analyzing and predicting extreme events. Such collaborative efforts aim to enhance disaster readiness and disaster risk reduction.

In recent years, Large Language Models (LLMs) have achieved almost human-like performance on various tasks. While some LLMs have been trained on multilingual data, most of the training data is in English; hence, their performance in English greatly exceeds other languages. To our knowledge, we are the first to collect and translate a large collection of texts, instructions, and benchmarks and train, evaluate, and release open-source LLMs tailored for Romanian. We evaluate our methods on four different categories, including academic benchmarks, MT-Bench (manually translated), and a professionally built historical, cultural, and social benchmark adapted to Romanian. We argue for the usefulness and high performance of RoLLMs by obtaining state-of-the-art results across the board. We publicly release all resources (i.e., data, training and evaluation code, models) to support and encourage research on Romanian LLMs while concurrently creating a generalizable recipe, adequate for other low or less-resourced languages., Comment: Accepted at The 2024 Conference on Empirical Methods in Natural Language Processing (EMNLP 2024 Findings). arXiv admin note: text overlap with arXiv:2405.07703

Automatic markerless estimation of infant posture and motion from ordinary videos carries great potential for movement studies "in the wild", facilitating understanding of motor development and massively increasing the chances of early diagnosis of disorders. There is rapid development of human pose estimation methods in computer vision thanks to advances in deep learning and machine learning. However, these methods are trained on datasets featuring adults in different contexts. This work tests and compares seven popular methods (AlphaPose, DeepLabCut/DeeperCut, Detectron2, HRNet, MediaPipe/BlazePose, OpenPose, and ViTPose) on videos of infants in supine position. Surprisingly, all methods except DeepLabCut and MediaPipe have competitive performance without additional finetuning, with ViTPose performing best. Next to standard performance metrics (object keypoint similarity, average precision and recall), we introduce errors expressed in the neck-mid-hip ratio and additionally study missed and redundant detections and the reliability of the internal confidence ratings of the different methods, which are relevant for downstream tasks. Among the networks with competitive performance, only AlphaPose could run close to real time (27 fps) on our machine. We provide documented Docker containers or instructions for all the methods we used, our analysis scripts, and processed data at https://hub.docker.com/u/humanoidsctu and https://osf.io/x465b/., Comment: 21 pages, 3 figures, 14 tables

Face recognition and verification are two computer vision tasks whose performance has progressed with the introduction of deep representations. However, ethical, legal, and technical challenges due to the sensitive character of face data and biases in real training datasets hinder their development. Generative AI addresses privacy by creating fictitious identities, but fairness problems persist. We promote fairness by introducing a demographic attributes balancing mechanism in generated training datasets. We experiment with an existing real dataset, three generated training datasets, and the balanced versions of a diffusion-based dataset. We propose a comprehensive evaluation that considers accuracy and fairness equally and includes a rigorous regression-based statistical analysis of attributes. The analysis shows that balancing reduces demographic unfairness. Also, a performance gap persists despite generation becoming more accurate with time. The proposed balancing method and comprehensive verification evaluation promote fairer and transparent face recognition and verification.

In \cite{FGHP}, the first author and his collaborators proved an equivariant Tamagawa number formula for the special value at $s=0$ of a Goss--type $L$--function, equivariant with respect to a Galois group $G$, and associated to a Drinfeld module defined on $\Bbb F_q[t]$ and over a finite, integral extension of $\Bbb F_q[t]$. The formula in question was proved provided that the values at $0$ of the Euler factors of the equivariant $L$--function in question satisfy certain identities involving Fitting ideals of certain $G$--cohomologically trivial, finite $\Bbb F_q[t][G]$--modules associated to the Drinfeld module. In \cite{FGHP}, we prove these identities in the particular case of the Carlitz module. In this paper, we develop general techniques and prove the identities in question for arbitrary Drinfeld modules. Further, we indicate how these techniques can be extended to the more general case of higher dimensional abelian $t$--modules, which is relevant in the context of the proof of the equivariant Tamagawa number formula for abelian $t$--modules given by N. Green and the first author in \cite{Green-Popescu}. This paper is based on a lecture given by the first author at ICMAT Madrid in May 2023 and builds upon results obtained by the second author in his PhD thesis \cite{Ramachandran-thesis}.

Many biological microswimmers are capable of chemotaxis, i.e., they can sense an ambient chemical gradient and adjust their mechanism of motility to move towards or away from the source of the gradient. Synthetic active colloids endowed with chemotactic behavior hold considerable promise for targeted drug delivery and the realization of programmable and reconfigurable materials. Here we study the chemotactic behavior of a Janus particle, which converts ``fuel'' molecules, released at an axisymmetric chemical patch located on a planar wall, into ``product'' molecules at its catalytic cap and moves by self-phoresis induced by the product. The chemotactic behavior is characterized as a function of the interplay between the rates of release (at the patch) and the consumption (at the particle) of fuel, as well as of details of the phoretic response of the particle (i.e., its phoretic mobility). Among others, we find that, under certain conditions, the particle is attracted to a stable ``hovering state'' in which it aligns its axis normal to the wall and rests (positions itself) at an activity-dependent distance above the center of the patch., Comment: 21 pages, 17 figures

To understand the formation and evolution of massive cosmic structures, studying them at high redshift, in the epoch when they formed the majority of their mass is essential. The One-hundred-deg$^2$ DECam Imaging in Narrowbands (ODIN) survey is undertaking the widest-area narrowband program to date, to use Ly$\alpha$-emitting galaxies (LAEs) to trace the large-scale structure (LSS) of the Universe on the scale of 10 - 100 cMpc at three cosmic epochs. In this work, we present results at $z$ = 3.1 based on early ODIN data in the COSMOS field. We identify and characterize protoclusters and cosmic filaments using multiple methods and discuss their strengths and weaknesses. We then compare our observations against the IllustrisTNG suite of cosmological hydrodynamical simulations. The two are in excellent agreement, with a similar number and angular size of structures identified above a specified density threshold. We are able to recover the simulated protoclusters with $\log$(M$_{z=0}$/$M_\odot$) $\gtrsim$ 14.4 in $\sim$ 60% of the cases. With these objects we show that the descendant masses of the protoclusters in our sample can be estimated purely based on our 2D measurements, finding a median $z$ = 0 mass of $\sim10^{14.5}$M$_\odot$. The lack of information on the radial extent of each protocluster introduces a $\sim$0.4 dex uncertainty in its descendant mass. Finally, we show that the recovery of the cosmic web in the vicinity of protoclusters is both efficient and accurate. The similarity of our observations and the simulations imply that our structure selection is likewise robust and efficient, demonstrating that LAEs are reliable tracers of the LSS., Comment: 29 pages, 20 figures; Accepted for publication in ApJ

Satellite images have the potential to detect volcanic deformation prior to eruptions, but while a vast number of images are routinely acquired, only a small percentage contain volcanic deformation events. Manual inspection could miss these anomalies, and an automatic system modelled with supervised learning requires suitably labelled datasets. To tackle these issues, this paper explores the use of unsupervised deep learning on satellite data for the purpose of identifying volcanic deformation as anomalies. Our detector is based on Patch Distribution Modeling (PaDiM), and the detection performance is enhanced with a weighted distance, assigning greater importance to features from deeper layers. Additionally, we propose a preprocessing approach to handle noisy and incomplete data points. The final framework was tested with five volcanoes, which have different deformation characteristics and its performance was compared against the supervised learning method for volcanic deformation detection.

In recent years, Large Language Models (LLMs) have achieved almost human-like performance on various tasks. While some LLMs have been trained on multilingual data, most of the training data is in English. Hence, their performance in English greatly exceeds their performance in other languages. This document presents our approach to training and evaluating the first foundational and chat LLM specialized for Romanian.

In the paradigmatic example of quantum measurements, whenever one measures a system which starts in a superposition of two states of a conserved quantity, it jumps to one of the two states, implying different final values for the quantity that should have been conserved. The standard law of conservation for quantum mechanics handles this jump by stating only that the total distribution of the conserved quantity over repeated measurements is unchanged, but states nothing about individual cases. Here however we show that one can go beyond this and have conservation in each individual instance. We made our arguments in the case of angular momentum of a particle on a circle, where many technicalities simplify, and bring arguments to show that this holds in full generality. Hence we argue that the conservation law in quantum mechanics should be rewritten, to go beyond its hitherto statistical formulation, to state that the total of a conserved quantity is unchanged in every individual measurement outcome. As a further crucial element, we show that conservation can be localised at the level of the system of interest and its relevant frame of reference, and is independent on any assumptions on the distribution of the conserved quantity over the entire universe., Comment: 8 pages, 1 table

We re-examine the self-phoresis of a particle that releases(removes) pairs of ions into(from) the electrolyte solution. We show analytically that in the linear regime the mathematical description of this system maps onto that of the correlation-induced (self-)chemophoresis (CICP). This connection provides a unifying perspective of the two phenomena, within which one recovers and extends recent predictions as particular instances of CICP. Conversely, ion-phoretic particles are identified as candidates for experimental investigations into the rich variety of motility patterns predicted by CICP., Comment: The manuscript proper and the supplemental material have been merged consecutively into a single PDF file

In this paper we introduce and study new classes of mappings in metric spaces. The main class of mappings is called generalized orbital triangular contractions and it generalizes some existing results (such as Banach contractions, mappings contracting perimeters of triangles). We prove that these contractions are not necessarily continuous and have a unique fixed point under certain conditions. Moreover, we extend our class to generalized orbital triangular Kannan contractions and generalized orbital triangular Chatterjea contractions., Comment: Submitted to Journal on 24 April 2024

Electrically tunable optical devices present diverse functionalities for manipulating electromagnetic waves by leveraging elements capable of reversibly switching between different optical states. This adaptability in adjusting their responses to electromagnetic waves after fabrication is crucial for developing more efficient and compact optical systems for a broad range of applications including sensing, imaging, telecommunications, and data storage. Chalcogenide-based phase change materials (PCMs) have shown great promise due to their stable, non-volatile phase transition between amorphous and crystalline states. Nonetheless, optimizing the switching parameters of PCM devices and maintaining their stable operation over thousands of cycles with minimal variation can be challenging. In this paper, we report on the critical role of PCM pattern as well as electrical pulse form in achieving reliable and stable switching, extending the operational lifetime of the device beyond 13,000 switching events. To achieve this, we have developed a computer-aided algorithm that monitors optical changes in the device and adjusts the applied voltage in accordance with the phase transformation process, thereby significantly enhancing the lifetime of these reconfigurable devices. Our findings reveal that patterned PCM structures show significantly higher endurance compared to blanket PCM thin films.

This technical report introduces Pegasus-1, a multimodal language model specialized in video content understanding and interaction through natural language. Pegasus-1 is designed to address the unique challenges posed by video data, such as interpreting spatiotemporal information, to offer nuanced video content comprehension across various lengths. This technical report overviews Pegasus-1's architecture, training strategies, and its performance in benchmarks on video conversation, zero-shot video question answering, and video summarization. We also explore qualitative characteristics of Pegasus-1 , demonstrating its capabilities as well as its limitations, in order to provide readers a balanced view of its current state and its future direction.

The goal of this paper is to study the structure of noncommutative weighted shifts, their properties, and to understand their role as models (up to similarity) for $n$-tuples of operators on Hilbert spaces as well as their implications to function theory on noncommutative (resp.commutative) Reinhardt domains. We obtain a Rota type similarity result concerning the joint similarity of $n$-tuples of operators to parts of noncommutative weighted multi-shifts and provide a noncommutative multivariable analogue of Foias-Pearcy model for quasinilpotent operators. The model noncommutative weighted multi-shift which is studied in this paper is the $n$-tuple $W=(W_1,\ldots, W_n)$, where $W_i$ are weighted left creation operators of the full Fock space with $n$ generators associated with a weight sequence $\boldsymbol \mu=\{\mu_\beta\}_{|\beta|\geq 1}$ of nonnegative numbers. We also represent the injective weighted multi-shifts $W_1,\ldots, W_n$ as ordinary multiplications by $Z_1,\ldots, Z_n$ on a Hilbert space of noncommutative formal power series. This leads naturally to analytic function theory in several complex variables. One of the goal for the remainder of the paper is to analyze the extent to which our noncommutative formal power series represent analytic functions in several noncommutative (resp. commutative) variables and to develop a functional calculus for arbitrary $n$-tuples of operators on a Hilbert space., Comment: 49 pages

Let B(H) be the algebra of all bounded linear operators on a Hilbert space H. The main goal of the paper is to find large classes of noncommutative domains in B(H) with prescribed universal operator models, acting on the full Fock space with n generators, and to study these domains and their universal models in connection with the Hardy algebras and the C^*-algebras they generate. While the class of these domains contains the regular noncommutative domains previously studied in the literature, the main focus of the present paper is on the non-regular domains. The multi-variable operator theory of these domains is developed throughout the paper., Comment: 38 pages

In a recent paper, we introduced and studied the class of admissible noncommutative domains $D_{g^{-1}}(H)$ in $B(H)^n$ associated with admissible free holomorphic functions $g$ in noncommutative indeterminates $Z_1,\ldots, Z_n$. Each such a domain admits a universal model ${\bf W}:=(W_1,\ldots, W_n)$ of weighted left creation operators acting on the full Fock space with $n$ generators. In the present paper, we continue the study of these domains and their universal models in connection with the Hardy algebras and the $C^*$-algebras they generate. We obtain a Beurling type characterization of the invariant subspaces of the universal model ${\bf W}:=(W_1,\ldots, W_n)$ and develop a dilation theory for the elements of the noncommutative domain $D_{g^{-1}}(H)$. We also obtain results concerning the commutant lifting and Toeplitz-corrona in our setting as as well as some results on the boundary property for universal models., Comment: 29 pages