Miracle-dz/UniFAR-FTUs huggingface dataset:
Comparing individual-based models of collective movements: active particles versus active cells

Collectively coordinated cell migration plays a role in tissue embryogenesis, cancer, homeostasis and healing. To study these processes, different cell-based modelling approaches have been developed, ranging from lattice-based cellular automata to lattice-free models that treat cells as point-like particles or extended detailed cell shape contours. In the spirit of what Osborne et al. [1]. did for cellular tissue structure simulation models, we here compare five simulation models of collective cell motion, chosen to be representative in increasing order of included detail. They are Vicsek-Gr´egoire particles, Szab´o-like particles, active particles with a Voronoi tesselation, the active cellular Potts model, and active multiparticle cells. We examine how these models compare when applied to the same biological problem, and what differences in behaviour are due to different model assumptions and abstractions. For that purpose, we use a benchmark that discriminates between complex material flow models, and that can be experimentally approached using cell cultures: the flow within a channel around a circular obstacle, that is, the geometry Stokes used in his historical 1851 experiment. For each model we explain how to best implement it; vary cell density, attraction force and alignment interaction; draw the resulting maps of velocity, density and deformation fields; and eventually discuss its respective advantages and limitations. We thus provide a recommendation on how to select a model to answer a given question, and we examine whether models of active particles and active cells
A truncation method for trace distance between fermionic Gaussian states

We develop a truncation method to calculate the trace distance between two Gaussian states in fermionic systems. The Gaussian states are fully determined by their corresponding correlation matrices. To calculate the trace distance between two Gaussian states, we truncate the corresponding correlation matrices according to the von Neumann entropies and the difference of the two correlation matrices. We ﬁnd two classes of cases for which the method works. The ﬁrst class are the cases that the von Neumann entropies of the two states are not too large and the two corresponding correlation matrices nearly commute. The other class are the cases that the two states are nearly orthogonal in the way that are characterized by the canonical values of the correlation matrix difference. We apply the method to examples of subsystems in eigenstates of Ising and XX spin chains, and when the method works we obtain the subsystem trace distances with considerably large subsystem sizes.
Context-Enhanced Stereo Transformer

Stereo depth estimation is of great interest for computer vision research. However, existing methods struggles to generalize and predict reliably in hazardous regions, such as large uniform regions. To overcome these limitations, we propose Context Enhanced Path (CEP). CEP improves the generalization and robustness against common failure cases in existing solutions by capturing the long-range global information. We construct our stereo depth estimation model, Context Enhanced Stereo Transformer (CSTR), by plugging CEP into the state-of-the-art stereo depth estimation method Stereo Transformer. CSTR is examined on distinct public datasets, such as Scene Flow, Middlebury-2014, KITTI-2015, and MPI-Sintel. We find CSTR outperforms prior approaches by a large margin. For example, in the zero-shot synthetic-to-real setting, CSTR outperforms the best competing approaches on Middlebury-2014 dataset by 11%. Our extensive experiments demonstrate that the long-range information is critical for stereo matching task and CEP successfully captures such information.
Accretion of rotating fluids onto stationary solutions

We consider a general stationary solution and derive the general laws for accretion of rotating perfect fluids. For non-degenerate and degenerate Fermi and Bose fluids we derive new effects that mimic the center-of-mass-energy effect of two colliding particle in the vicinity of horizons. Nondegenerate fluids see their chemical potential grow arbitrarily and ultra-relativistic Fermi fluids see their specific enthalpy and Fermi momentum grow arbitrarily too while the latter vanishes gradually for non-relativistic Fermi fluids. For degenerate Bose fluids two scenarios remain possible as the fluid approaches a horizon: a) The Bose-Einstein condensation ceases or b) the temperature drops gradually down to zero. The critical flow is also investigated.
Multimodal Neural Network For Demand Forecasting

Demand forecasting applications have immensely benefited from the state-of-the-art Deep Learning methods used for time series forecasting. Traditional uni-modal models are predominantly seasonality driven which attempt to model the demand as a function of historic sales along with information on holidays and promotional events. However, accurate and robust sales forecasting calls for accommodating multiple other factors, such as natural calamities, pandemics, elections, etc., impacting the demand for products and product categories in general. We propose a multi-modal sales forecasting network that combines real-life events from news articles with traditional data such as historical sales and holiday information. Further, we fuse information from general product trends published by Google trends. Empirical results show statistically significant improvements in the SMAPE error metric with an average improvement of 7.37% against the existing state-of-the-art sales forecasting techniques on a real-world supermarket dataset.
On the Economic Viability of Solar Energy When Upgrading Cellular Networks

The massive increase of data traffic, the widespread proliferation of wireless applications and the full-scale deployment of 5G and the IoT, imply a steep increase in cellular networks energy use, resulting in a significant carbon footprint. This paper presents a comprehensive model to show the interaction between the networking and energy features of the problem and study the economical and technical viability of green networking. Solar equipment, cell zooming, energy management and dynamic user allocation are considered in the upgrading network planning process. We propose a mixed-integer optimization model to minimize long-term capital costs and operational energy expenditures in a heterogeneous on-grid cellular network with different types of base station, including solar. Based on eight scenarios where realistic costs of solar panels, batteries, and inverters were considered, we first found that solar base stations are currently not economically interesting for cellular operators. We next studied the impact of a significant and progressive carbon tax on reducing greenhouse gas emissions (GHG). We found that, at current energy and equipment prices, a carbon tax ten-fold the current value is the only element that could make green base stations economically viable.
On amortizing convex conjugates for optimal transport

This paper focuses on computing the convex conjugate operation that arises when solving Euclidean Wasserstein-2 optimal transport problems. This conjugation, which is also referred to as the Legendre-Fenchel conjugate or c-transform,is considered difficult to compute and in practice,Wasserstein-2 methods are limited by not being able to exactly conjugate the dual potentials in continuous space. To overcome this, the computation of the conjugate can be approximated with amortized optimization, which learns a model to predict the conjugate. I show that combining amortized approximations to the conjugate with a solver for fine-tuning significantly improves the quality of transport maps learned for the Wasserstein-2 benchmark by Korotin et al. (2021a) and is able to model many 2-dimensional couplings and flows considered in the literature. All of the baselines, methods, and solvers in this paper are available at http://github.com/facebookresearch/w2ot.
Neural co-processors for restoring brain function: results from a cortical model of grasping

Objective. A major challenge in designing closed-loop brain-computer interfaces is finding optimal stimulation patterns as a function of ongoing neural activity for different subjects and different objectives. Traditional approaches, such as those currently used for deep brain stimulation, have largely followed a manual trial-and-error strategy to search for effective open-loop stimulation parameters, a strategy that is inefficient and does not generalize to closed-loop activity-dependent stimulation. Approach. To achieve goal-directed closed-loop neurostimulation, we propose the use of brain co-processors, devices which exploit artificial intelligence to shape neural activity and bridge injured neural circuits for targeted repair and restoration of function. Here we investigate a specific type of co-processor called a ‘neural co-processor’ which uses artificial neural networks and deep learning to learn optimal closed-loop stimulation policies. The co-processor adapts the stimulation policy as the biological circuit itself adapts to the stimulation, achieving a form of brain-device co-adaptation. Here we use simulations to lay the groundwork for future in vivo tests of neural co-processors. We leverage a previously published cortical model of grasping, to which we applied various forms of simulated lesions. We used our simulations to develop the critical learning algorithms and study adaptations to non-stationarity in preparation for future in vivo tests. Main results. Our simulations show the ability of a neural co-processor to learn a stimulation policy using a supervised learning approach, and to adapt that policy as the underlying brain and sensors change. Our co-processor successfully co-adapted with the simulated brain to accomplish the reach-and-grasp task after a variety of lesions were applied, achieving recovery towards healthy function in the range 75%–90%. Significance. Our results provide the first proof-of-concept demonstration, using computer simulations, of a neural co-processor for adaptive activity-dependent closed-loop neurostimulation for optimizing a rehabilitation goal after injury. While a significant gap remains between simulations and in vivo applications, our results provide insights on how such co-processors may eventually be developed for learning complex adaptive stimulation policies for a variety of neural rehabilitation and neuroprosthetic applications.
Pedestrian Emergency Braking in Ten Weeks

In the last decade, research in the field of autonomous vehicles has grown immensely, and there is a wealth of information available for researchers to rapidly establish an autonomous vehicle platform for basic maneuvers. In this paper, we design, implement, and test, in ten weeks, a PD approach to longitudinal control for pedestrian emergency braking. We also propose a lateral controller with a similar design for future testing in lane following. Using widely available tools, we demonstrate the safety of the vehicle in pedestrian emergency braking scenarios.
FogROS G: Enabling Secure, Connected and Mobile Fog Robotics with Global Addressability

Fog Robotics renders networked robots with greater mobility, on-demand compute capabilities and better energy efficiency by offloading heavy robotics workloads to nearby Edge and distant Cloud data centers. However, as the de-facto standard for implementing fog robotics applications, Robot Operating System (ROS) and its successor ROS2 fail to provide fog robots with a mobile-friendly and secure communication infrastructure. In this work, we present FogROS G, a secure routing framework that connects robotics software components from different physical locations, networks, Data Distribution Service (DDS) and ROS distributions. FogROS G indexes networked robots with globally unique 256-bit names that remains constant even if the robot roams between multiple administrative network domains. FogROS G leverages Global Data Plane, a global and secure peer-to-peer routing infrastructure between the names, guaranteeing that only authenticated party can send to or receive from the robot. FogROS G adopts a proxy-based design that connect nodes from ROS1 and ROS2 with mainstream DDS vendors; this can be done without any changes to the application code.
Not All Asians are the Same: A Disaggregated Approach to Identifying Anti-Asian Racism in Social Media

Recent policy initiatives have acknowledged the importance of disaggregating data pertaining to diverse Asian ethnic communities to gain a more comprehensive understanding of their current status and to improve their overall well-being. However, research on anti-Asian racism has thus far fallen short of properly incorporating data disaggregation practices. Our study addresses this gap by collecting 12-month-long data from X (formerly known as Twitter) that contain diverse sub-ethnic group representations within Asian communities. In this dataset, we break down anti-Asian toxic messages based on both temporal and ethnic factors and conduct a series of comparative analyses of toxic messages, targeting different ethnic groups. Using temporal persistence analysis, $n$-gram-based correspondence analysis, and topic modeling, this study provides compelling evidence that anti-Asian messages comprise various distinctive narratives. Certain messages targeting sub-ethnic Asian groups entail different topics that distinguish them from those targeting Asians in a generic manner or those aimed at major ethnic groups, such as Chinese and Indian. By introducing several techniques that facilitate comparisons of online anti-Asian hate towards diverse ethnic communities, this study highlights the importance of taking a nuanced and disaggregated approach for understanding racial hatred to formulate effective mitigation strategies.
Hybridised multigrid preconditioners for a compatible finite‐element dynamical core

Compatible finite‐element discretisations for the atmospheric equations of motion have recently attracted considerable interest. Semi‐implicit timestepping methods require the repeated solution of a large saddle‐point system of linear equations. Preconditioning this system is challenging, since the velocity mass matrix is nondiagonal, leading to a dense Schur complement. Hybridisable discretisations overcome this issue: weakly enforcing continuity of the velocity field with Lagrange multipliers leads to a sparse system of equations, which has a similar structure to the pressure Schur complement in traditional approaches. We describe how the hybridised sparse system can be preconditioned with a non‐nested two‐level preconditioner. To solve the coarse system, we use the multigrid pressure solver that is employed in the approximate Schur complement method previously proposed by the some of the authors. Our approach significantly reduces the number of solver iterations. The method shows excellent performance and scales to large numbers of cores in the Met Office next‐generation climate and weather prediction model LFRic.
Effects of momentum scaling for SGD

The paper studies the properties of stochastic gradient methods with preconditioning. We focus on momentum updated preconditioners with momentum coefficient $\beta$. Seeking to explain practical efficiency of scaled methods, we provide convergence analysis in a norm associated with preconditioner, and demonstrate that scaling allows one to get rid of gradients Lipschitz constant in convergence rates. Along the way, we emphasize important role of $\beta$, undeservedly set to constant $0.99. 9$ at the arbitrariness of various authors. Finally, we propose the explicit constructive formulas for adaptive $\beta$ and step size values.
Valuing Vicinity: Memory attention framework for context-based semantic segmentation in histopathology

The segmentation of histopathological whole slide images into tumourous and non-tumourous types of tissue is a challenging task that requires the consideration of both local and global spatial contexts to classify tumourous regions precisely. The identification of subtypes of tumour tissue complicates the issue as the sharpness of separation decreases and the pathologist's reasoning is even more guided by spatial context. However, the identification of detailed tissue types is crucial for providing personalized cancer therapies. Due to the high resolution of whole slide images, existing semantic segmentation methods, restricted to isolated image sections, are incapable of processing context information beyond. To take a step towards better context comprehension, we propose a patch neighbour attention mechanism to query the neighbouring tissue context from a patch embedding memory bank and infuse context embeddings into bottleneck hidden feature maps. Our memory attention framework (MAF) mimics a pathologist's annotation procedure - zooming out and considering surrounding tissue context. The framework can be integrated into any encoder-decoder segmentation method. We evaluate the MAF on two public breast cancer and liver cancer data sets and an internal kidney cancer data set using famous segmentation models (U-Net, DeeplabV3) and demonstrate the superiority over other context-integrating algorithms - achieving a substantial improvement of up to 17% on Dice score. The code is publicly available at https://github.com/tio-ikim/valuing-vicinity.
Deep radio observations of the radio halo of the bullet cluster 1E 0657−55.8

We present deep 1.1-3.1 GHz Australia Telescope Compact Array observations of the radio halo of the bullet cluster, 1E 0657-55.8. In comparison to existing images of this radio halo the detection in our images is at higher significance. The radio halo is as extended as the X-ray emission in the direction of cluster merger but is significantly less extended than the X-ray emission in the perpendicular direction. At low significance we detect a faint second peak in the radio halo close to the X-ray centroid of the smaller sub-cluster (the bullet) suggesting that, similarly to the X-ray emission, the radio halo may consist of two components. Finally, we find that the distinctive shape of the western edge of the radio halo traces out the X-ray detected bow shock. The radio halo morphology and the lack of strong point-to-point correlations between radio, X-ray and weak-lensing properties suggests that the radio halo is still being formed. The colocation of the X-ray shock with a distinctive radio brightness edge illustrates that the shock is influencing the structure of the radio halo. These observations support the theory that shocks and turbulence influence the formation and evolution of radio halo synchrotron emission.
SCL: A Secure Concurrency Layer For Paranoid Stateful Lambdas

We propose a federated Function-as-a-Service (FaaS) execution model that provides secure and stateful execution in both Cloud and Edge environments. The FaaS workers, called Paranoid Stateful Lambdas (PSLs), collaborate with one another to perform large parallel computations. We exploit cryptographically hardened and mobile bundles of data, called DataCapsules, to provide persistent state for our PSLs, whose execution is protected using hardware-secured TEEs. To make PSLs easy to program and performant, we build the familiar Key-Value Store interface on top of DataCapsules in a way that allows amortization of cryptographic operations. We demonstrate PSLs functioning in an edge environment running on a group of Intel NUCs with SGXv2. As described, our Secure Concurrency Layer (SCL), provides eventually-consistent semantics over written values using untrusted and unordered multicast. All SCL communication is encrypted, unforgeable, and private. For durability, updates are recorded in replicated DataCapsules, which are append-only cryptographically-hardened blockchain with confidentiality, integrity, and provenance guarantees. Values for inactive keys are stored in a log-structured merge-tree (LSM) in the same DataCapsule. SCL features a variety of communication optimizations, such as an efficient message passing framework that reduces the latency up to 44x from the Intel SGX SDK, and an actor-based cryptographic processing architecture that batches cryptographic operations and increases throughput by 81x.
Modelling Control Arguments via Cooperation Logic in Unforeseen Scenarios

The intent of control argumentation frameworks is to specif- ically model strategic scenarios from the perspective of an agent by extending the standard model of argumentation framework in a way that takes unquantiﬁed uncertainty re- garding arguments and attacks into account. They do not, however, adequately account for coalition formation and in- teractions among a set of agents in an uncertain environment. To address this challenge, we propose a formalism of a multi- agent scenario via cooperation logic and investigate agents’ strategies and actions in a dynamic environment.
Fast and Scalable Inference for Spatial Extreme Value Models

The generalized extreme value (GEV) distribution is a popular model for analyzing and forecasting extreme weather data. To increase prediction accuracy, spatial information is often pooled via a latent Gaussian process (GP) on the GEV parameters. Inference for GEV-GP models is typically carried out using Markov chain Monte Carlo (MCMC) methods, or using approximate inference methods such as the integrated nested Laplace approximation (INLA). However, MCMC becomes prohibitively slow as the number of spatial locations increases, whereas INLA is only applicable to a limited subset of GEV-GP models. In this paper, we revisit the original Laplace approximation for ﬁtting spatial GEV models. In combination with a popular sparsity-inducing spatial covariance approximation technique, we show through simulations that our approach accurately estimates the Bayesian predictive distribution of extreme weather events, is scalable to several thousand spatial locations, and is several orders of magnitude faster than MCMC. A case study in forecasting extreme snowfall across Canada is presented.
Turning Fixed to Adaptive: Integrating Post-Evaluation into Simultaneous Machine Translation

Simultaneous machine translation (SiMT) starts its translation before reading the whole source sentence and employs either fixed or adaptive policy to generate the target sentence. Compared to the fixed policy, the adaptive policy achieves better latency-quality tradeoffs by adopting a flexible translation policy. If the policy can evaluate rationality before taking action, the probability of incorrect actions will also decrease. However, previous methods lack evaluation of actions before taking them. In this paper, we propose a method of performing the adaptive policy via integrating post-evaluation into the fixed policy. Specifically, whenever a candidate token is generated, our model will evaluate the rationality of the next action by measuring the change in the source content. Our model will then take different actions based on the evaluation results. Experiments on three translation tasks show that our method can exceed strong baselines under all latency.