Miracle-dz/UniFAR-FTUs huggingface dataset:
Provable Security for the Onion Routing and Mix Network Packet Format Sphinx

Onion routing and mix networks are fundamental concepts to provide users with anonymous access to the Internet. Various corresponding solutions rely on the efficient Sphinx packet format. However, flaws in Sphinx's underlying proof strategy were found recently. It is thus currently unclear which guarantees Sphinx actually provides, and, even worse, there is no suitable proof strategy available. In this paper, we restore the security foundation for all these works by building a theoretical framework for Sphinx. We discover that the previously-used DDH assumption is insufficient for a security proof and show that the Gap Diffie-Hellman (GDH) assumption is required instead. We apply it to prove that a slightly adapted version of the Sphinx packet format is secure under the GDH assumption. Ours is the first work to provide a detailed, in-depth security proof for Sphinx in this manner. Our adaptations to Sphinx are necessary, as we demonstrate with an attack on sender privacy that would be possible otherwise.
Active Inference and Intentional Behaviour

Recent advances in theoretical biology suggest that basal cognition and sentient behaviour are emergent properties of in vitro cell cultures and neuronal networks, respectively. Such neuronal networks spontaneously learn structured behaviours in the absence of reward or reinforcement. In this paper, we characterise this kind of self-organisation through the lens of the free energy principle, i.e., as self-evidencing. We do this by first discussing the definitions of reactive and sentient behaviour in the setting of active inference, which describes the behaviour of agents that model the consequences of their actions. We then introduce a formal account of intentional behaviour, that describes agents as driven by a preferred endpoint or goal in latent state-spaces. We then investigate these forms of (reactive, sentient, and intentional) behaviour using simulations. First, we simulate the aforementioned in vitro experiments, in which neuronal cultures spontaneously learn to play Pong, by implementing nested, free energy minimising processes. The simulations are then used to deconstruct the ensuing predictive behaviour, leading to the distinction between merely reactive, sentient, and intentional behaviour, with the latter formalised in terms of inductive planning. This distinction is further studied using simple machine learning benchmarks (navigation in a grid world and the Tower of Hanoi problem), that show how quickly and efficiently adaptive behaviour emerges under an inductive form of active inference.
CLIP as RNN: Segment Countless Visual Concepts without Training Endeavor

Existing open-vocabulary image segmentation methods require a fine-tuning step on mask annotations and/or image-text datasets. Mask labels are labor-intensive, which limits the number of categories in segmentation datasets. As a result, the open-vocabulary capacity of pre-trained VLMs is severely reduced after fine-tuning. However, without fine-tuning, VLMs trained under weak image-text supervision tend to make suboptimal mask predictions when there are text queries referring to non-existing concepts in the image. To alleviate these issues, we introduce a novel recurrent framework that progressively filters out irrelevant texts and enhances mask quality without training efforts. The recurrent unit is a two-stage segmenter built upon a VLM with frozen weights. Thus, our model retains the VLM's broad vocabulary space and strengthens its segmentation capability. Experimental results show that our method outperforms not only the training-free counterparts, but also those fine-tuned with millions of additional data samples, and sets new state-of-the-art records for both zero-shot semantic and referring image segmentation tasks. Specifically, we improve the current record by 28.8, 16.0, and 6.9 mIoU on Pascal VOC, COCO Object, and Pascal Context.
A Deep Learning-Based System for Automatic Case Summarization

This paper presents a deep learning-based system for efficient automatic case summarization. Leveraging state-of-the-art natural language processing techniques, the system offers both supervised and unsupervised methods to generate concise and relevant summaries of lengthy legal case documents. The user-friendly interface allows users to browse the system's database of legal case documents, select their desired case, and choose their preferred summarization method. The system generates comprehensive summaries for each subsection of the legal text as well as an overall summary. This demo streamlines legal case document analysis, potentially benefiting legal professionals by reducing workload and increasing efficiency. Future work will focus on refining summarization techniques and exploring the application of our methods to other types of legal texts.
The Impact of Home Modification and Other Community-Based Services on the Ability to Age in Place Among Older Blacks and Whites in Georgia

As the U.S. population ages, there is a significant increase in functional impairment, chronic conditions and other age related health concerns. In later life, functional limitations and poor quality of health often lead to the utilization of skilled nursing care in institutional settings. However, older adults often report the desire to age in place even when experiencing health challenges. Therefore, identifying ways to promote aging in place at home as a long-term care option could enhance quality of life. The objective of the study is to examine the impact of home modification and other home and community-based services on the ability of Black older adults to age in place in comparison to Whites. The study utilizes administrative data from the Georgia Money Follows the Person program. The results indicate that race, the use of financial support and the utilization of many services were significant in attaining success in the MFP program. INDEX WORDS: Money Follows the Person; home modification; community-based service; life course perspective; cumulative disadvantage; person environment fit THE IMPACT OF HOME MODIFICATION AND OTHER COMMUNTIY-BASED SERVICES ON THE ABILITY TO AGE IN PLACE AMONG OLDER BLACKS AND WHITES IN GEORGIA
View-Dependent Octree-based Mesh Extraction in Unbounded Scenes for Procedural Synthetic Data

Procedural synthetic data generation has received increasing attention in computer vision. Procedural signed distance functions (SDFs) are a powerful tool for modeling large-scale detailed scenes, but existing mesh extraction methods have artifacts or performance profiles that limit their use for synthetic data. We propose OcMesher, a mesh extraction algorithm that efficiently handles high-detail unbounded scenes with perfect view-consistency, with easy export to downstream real-time engines. The main novelty of our solution is an algorithm to construct an octree based on a given SDF and multiple camera views. We performed extensive experiments, and show our solution produces better synthetic data for training and evaluation of computer vision models.
Learning Nash Equilibria in Zero-Sum Markov Games: A Single Time-scale Algorithm Under Weak Reachability

We consider decentralized learning for zero-sum games, where players only see their payoff information and are agnostic to actions and payoffs of the opponent. Previous works demonstrated convergence to a Nash equilibrium in this setting using double time-scale algorithms under strong reachability assumptions. We address the open problem of achieving an approximate Nash equilibrium efficiently with an uncoupled and single time-scale algorithm under weaker conditions. Our contribution is a rational and convergent algorithm, utilizing Tsallis-entropy regularization in a value-iteration-based approach. The algorithm learns an approximate Nash equilibrium in polynomial time, requiring only the existence of a policy pair that induces an irreducible and aperiodic Markov chain, thus considerably weakening past assumptions. Our analysis leverages negative drift inequalities and introduces novel properties of Tsallis entropy that are of independent interest.
Hydrodynamics and instabilities of relativistic superfluids at finite superflow

We study the linear response of relativistic superfluids with a non-zero superfluid velocity. For sufficiently large superflow, an instability develops via the crossing of a pole of the retarded Green's functions to the upper half complex frequency plane. We show that this is caused by a local thermodynamic instability, i.e. when an eigenvalue of the static susceptibility matrix (the second derivatives of the free energy) diverges and changes sign. The onset of the instability occurs when $\partial_{\zeta}(n_s\zeta)=0$, with $\zeta$ the norm of the superfluid velocity and $n_s$ the superfluid density. The Landau instability for non-relativistic superfluids such as Helium 4 also coincides with the non-relativistic version of this criterion. We then turn to gauge/gravity duality and show that this thermodynamic instability criterion applies equally well to strongly-coupled superfluids. In passing, we compute holographically a number of transport coefficients parametrizing deviations out-of-equilibrium in the hydrodynamic regime and demonstrate that the gapless quasinormal modes of the dual planar black hole match those predicted by superfluid hydrodynamics.
Mutual-Learning Knowledge Distillation for Nighttime UAV Tracking

Nighttime unmanned aerial vehicle (UAV) tracking has been facilitated with indispensable plug-and-play low-light enhancers. However, the introduction of low-light enhancers increases the extra computational burden for the UAV, significantly hindering the development of real-time UAV applications. Meanwhile, these state-of-the-art (SOTA) enhancers lack tight coupling with the advanced daytime UAV tracking approach. To solve the above issues, this work proposes a novel mutual-learning knowledge distillation framework for nighttime UAV tracking, i.e., MLKD. This framework is constructed to learn a compact and fast nighttime tracker via knowledge transferring from the teacher and knowledge sharing among various students. Specifically, an advanced teacher based on a SOTA enhancer and a superior tracking backbone is adopted for guiding the student based only on the tight coupling-aware tracking backbone to directly extract nighttime object features. To address the biased learning of a single student, diverse lightweight students with different distillation methods are constructed to focus on various aspects of the teacher's knowledge. Moreover, an innovative mutual-learning room is designed to elect the superior student candidate to assist the remaining students frame-by-frame in the training phase. Furthermore, the final best student, i.e., MLKD-Track, is selected through the testing dataset. Extensive experiments demonstrate the effectiveness and superiority of MLKD and MLKD-Track. The practicality of the MLKD-Track is verified in real-world tests with different challenging situations. The code is available at https://github.com/lyfeng001/MLKD.
Audio Deepfake Detection With Self-Supervised Wavlm And Multi-Fusion Attentive Classifier

With the rapid development of speech synthesis and voice conversion technologies, Audio Deepfake has become a serious threat to the Automatic Speaker Verification (ASV) system. Numerous countermeasures are proposed to detect this type of attack. In this paper, we report our efforts to combine the self-supervised WavLM model and Multi-Fusion Attentive classifier for audio deepfake detection. Our method exploits the WavLM model to extract features that are more conducive to spoofing detection for the first time. Then, we propose a novel Multi-Fusion Attentive (MFA) classifier based on the Attentive Statistics Pooling (ASP) layer. The MFA captures the complementary information of audio features at both time and layer levels. Experiments demonstrate that our methods achieve state-of-the-art results on the ASVspoof 2021 DF set and provide competitive results on the ASVspoof 2019 and 2021 LA set.
Efficient Representation of the Activation Space in Deep Neural Networks

The representations of the activation space of deep neural networks (DNNs) are widely utilized for tasks like natural language processing, anomaly detection and speech recognition. Due to the diverse nature of these tasks and the large size of DNNs, an efficient and task-independent representation of activations becomes crucial. Empirical p-values have been used to quantify the relative strength of an observed node activation compared to activations created by already-known inputs. Nonetheless, keeping raw data for these calculations increases memory resource consumption and raises privacy concerns. To this end, we propose a model-agnostic framework for creating representations of activations in DNNs using node-specific histograms to compute p-values of observed activations without retaining already-known inputs. Our proposed approach demonstrates promising potential when validated with multiple network architectures across various downstream tasks and compared with the kernel density estimates and brute-force empirical baselines. In addition, the framework reduces memory usage by 30% with up to 4 times faster p-value computing time while maintaining state of-the-art detection power in downstream tasks such as the detection of adversarial attacks and synthesized content. Moreover, as we do not persist raw data at inference time, we could potentially reduce susceptibility to attacks and privacy issues.
Exploring Key Aspects of Sea Level Rise and Their Implications: An Overview

Sea level rise (SLR) is one of the most pressing challenges of climate change and has drawn noticeable research interest over the past few decades. Factors induced by global climate change, such as temperature increase, have resulted in both direct and indirect changes in sea levels at different spatial scales. Various climatic and non-climatic events contribute to sea level changes, posing risks to coastal and low-lying areas. Nevertheless, changes in sea level are not uniformly distributed globally due to several regional factors such as wave actions, storm surge frequencies, and tectonic land movement. The high exposure to those factors increases the vulnerability of subjected areas to SLR impacts. The impacts of events induced by climate change and SLR are reflected in biophysical, socioeconomic, and environmental aspects. Different indicator-based and model-based approaches are used to assess coastal areas’ vulnerabilities, response to impacts, and implementation of adaptation and mitigation measures. Various studies have been conducted to project future SLR impacts and evaluate implemented protection and adaptation approaches, aiding policymakers in planning effective adaptation and mitigation measures to reduce damage. This paper provides an overview of SLR and its key elements, encompassing contributing factors, impacts, and mitigation and adaptation measures, featuring a dedicated section on the Arabian Gulf, a semi-enclosed sea.
Red-shift effect on the zero field splitting for negatively charged nitrogen-vacancy centers in diamond

The zero field splitting (ZFS) quantifies the energy difference for the ground electron spin-triplet of a nitrogen-vacancy center in the absence of external fields. The values of the ZFS play a key role in determining the Larmor precession of the Bloch sphere and the Rabi oscillation of a spin system. The ZFS is generally detected using coherent spin manipulation by sweeping microwaves (MWs) at frequencies close to resonance with the ZFS. In this letter, we report our experimental observations of the red-shift effect on the ZFS as a function of the MW power for two different thermal environments of a sample. We find an asymptotic property of the red shifts of the ZFS. Given the identical initial thermal equilibrium states of the sample, the differences in the raw values of the ZFS between the two cases randomly vary from 47 kHz to 1505 kHz over the entire experimental range. According to the asymptotic approximation, the differences are reduced to 29-166 kHz with a standard deviation of 49 kHz, suggesting a significant elimination of the red-shift effect. To the best of our knowledge, no other study has addressed the quantification and elimination of the red shift-effect of the MW field dependence using the asymptotic approximation.
A covariant regulator for entanglement entropy: proofs of the Bekenstein bound and QNEC

While von Neumann entropies for subregions in quantum field theory universally contain ultraviolet divergences, differences between von Neumann entropies are finite and well-defined in many physically relevant scenarios. We demonstrate that such a notion of entropy differences can be rigorously defined in quantum field theory in a general curved spacetime by introducing a novel, covariant regulator for the entropy based on the modular crossed product. This regulator associates a type II von Neumann algebra to each spacetime subregion, resulting in well-defined renormalized entropies. This prescription reproduces formulas for entropy differences that coincide with heuristic formulas widely used in the literature, and we prove that it satisfies desirable properties such as unitary invariance and concavity. As an application, we provide proofs of the Bekenstein bound and the quantum null energy condition, formulated directly in terms of vacuum-subtracted von Neumann entropies.
Three-Filters-to-Normal+: Revisiting Discontinuity Discrimination in Depth-to-Normal Translation

This article introduces three-filters-to-normal+ (3F2N+), an extension of our previous work three-filters-to-normal (3F2N), with a specific focus on incorporating discontinuity discrimination capability into surface normal estimators (SNEs). 3F2N+ achieves this capability by utilizing a novel discontinuity discrimination module (DDM), which combines depth curvature minimization and correlation coefficient maximization through conditional random fields (CRFs). To evaluate the robustness of SNEs on noisy data, we create a large-scale synthetic surface normal (SSN) dataset containing 20 scenarios (ten indoor scenarios and ten outdoor scenarios with and without random Gaussian noise added to depth images). Extensive experiments demonstrate that 3F2N+ achieves greater performance than all other geometry-based surface normal estimators, with average angular errors of 7.85$^\circ$, 8.95$^\circ$, 9.25$^\circ$, and 11.98$^\circ$ on the clean-indoor, clean-outdoor, noisy-indoor, and noisy-outdoor datasets, respectively. We conduct three additional experiments to demonstrate the effectiveness of incorporating our proposed 3F2N+ into downstream robot perception tasks, including freespace detection, 6D object pose estimation, and point cloud completion. Our source code and datasets are publicly available at https://mias.group/3F2Nplus.
COVID-19 Detection Using Slices Processing Techniques and a Modified Xception Classifier from Computed Tomography Images

This paper extends our previous method for COVID-19 diagnosis, proposing an enhanced solution for detecting COVID-19 from computed tomography (CT) images. To decrease model misclassifications, two key steps of image processing were employed. Firstly, the uppermost and lowermost slices were removed, preserving sixty percent of each patient's slices. Secondly, all slices underwent manual cropping to emphasize the lung areas. Subsequently, resized CT scans (224 by 224) were input into an Xception transfer learning model. Leveraging Xception's architecture and pre-trained weights, the modified model achieved binary classification. Promising results on the COV19-CT database showcased higher validation accuracy and macro F1 score at both the slice and patient levels compared to our previous solution and alternatives on the same dataset.
Differentially Private Gradient Flow based on the Sliced Wasserstein Distance for Non-Parametric Generative Modeling

Safeguarding privacy in sensitive training data is paramount, particularly in the context of generative modeling. This is done through either differentially private stochastic gradient descent, or with a differentially private metric for training models or generators. In this paper, we introduce a novel differentially private generative modeling approach based on parameter-free gradient flows in the space of probability measures. The proposed algorithm is a new discretized flow which operates through a particle scheme, utilizing drift derived from the sliced Wasserstein distance and computed in a private manner. Our experiments show that compared to a generator-based model, our proposed model can generate higher-fidelity data at a low privacy budget, offering a viable alternative to generator-based approaches.
Semantic Lens: Instance-Centric Semantic Alignment for Video Super-Resolution

As a critical clue of video super-resolution (VSR), inter-frame alignment significantly impacts overall performance. However, accurate pixel-level alignment is a challenging task due to the intricate motion interweaving in the video. In response to this issue, we introduce a novel paradigm for VSR named Semantic Lens, predicated on semantic priors drawn from degraded videos. Specifically, video is modeled as instances, events, and scenes via a Semantic Extractor. Those semantics assist the Pixel Enhancer in understanding the recovered contents and generating more realistic visual results. The distilled global semantics embody the scene information of each frame, while the instance-specific semantics assemble the spatial-temporal contexts related to each instance. Furthermore, we devise a Semantics-Powered Attention Cross-Embedding (SPACE) block to bridge the pixel-level features with semantic knowledge, composed of a Global Perspective Shifter (GPS) and an Instance-Specific Semantic Embedding Encoder (ISEE). Concretely, the GPS module generates pairs of affine transformation parameters for pixel-level feature modulation conditioned on global semantics. After that the ISEE module harnesses the attention mechanism to align the adjacent frames in the instance-centric semantic space. In addition, we incorporate a simple yet effective pre-alignment module to alleviate the difficulty of model training. Extensive experiments demonstrate the superiority of our model over existing state-of-the-art VSR methods.
Convergence of Riemannian stochastic gradient descent on Hadamard manifold

Novel convergence analyses are presented of Riemannian stochastic gradient descent (RSGD) on a Hadamard manifold. RSGD is the most basic Riemannian stochastic optimization algorithm and is used in many applications in the field of machine learning. The analyses incorporate the concept of mini-batch learning used in deep learning and overcome several problems in previous analyses. Four types of convergence analysis are described for both constant and decreasing step sizes. The number of steps needed for RSGD convergence is shown to be a convex monotone decreasing function of the batch size. Application of RSGD with several batch sizes to a Riemannian stochastic optimization problem on a symmetric positive definite manifold theoretically shows that increasing the batch size improves RSGD performance. Numerical evaluation of the relationship between batch size and RSGD performance provides evidence supporting the theoretical results.