1141438 results (page 76 of 45658)
-
DPC: A Distributed Page Cache over CXL
Modern distributed file systems rely on uncoordinated, per node page caches that replicate hot data locally across the cluster. While ensuring fast local access, this architecture underutilizes aggregate cluster DRAM capacity through massive data redundancy and incurs prohibitive coherence overhead via heavyweight, lock-based protocols. In this paper, we focus on the design of a distributed page c…
-
A Nonparametric Goodness-of-Fit Test for High-Dimensional Generalized Gaussian Distributions via Nearest-Neighbor Graphs
The multivariate generalised Gaussian distribution (MGGD) is commonly used to model high-dimensional vectors with non-Gaussian radial behaviour, ranging from sharp-peaked to heavy-tailed profiles. However, because many classical multivariate tests are based on covariance inversion or high-dimensional density estimation, formal goodness-of-fit assessment for MGGD models remains challenging in moder…
-
Translating Ethical Frameworks Into User-Centred Anti-Social Behaviour Interventions
In 2025 one million Anti-Social Behaviour (ASB) cases were recorded in England & Wales, impacting community cohesion. Statutory guidance presents punitive interventions that lack technological input and does not often root ethical frameworks within government system design. This work takes a novel approach in framing ASB intervention as a human-computer interaction problem by embedding an ethical …
-
Seeing Candidates at Scale: Multimodal LLMs for Visual Political Communication on Instagram
This paper presents a computational case study that evaluates the capabilities of specialized machine learning models and emerging multimodal large language models for Visual Political Communication (VPC) analysis. Focusing on concentrated visibility in Instagram stories and posts during the 2021 German federal election campaign, we compare the performance of traditional computer vision models (Fa…
-
CoDA: Towards Effective Cross-domain Knowledge Transfer via CoT-guided Domain Adaptation
Large language models (LLMs) have achieved substantial advances in logical reasoning, yet they continue to lag behind human-level performance. In-context learning provides a viable solution that boosts the model's performance via prompting its input with expert-curated, in-domain exemplars. However, in many real-world, expertise-scarce domains, such as low-resource scientific disciplines, emerging…
-
EVPO: Explained Variance Policy Optimization for Adaptive Critic Utilization in LLM Post-Training
Reinforcement learning (RL) for LLM post-training faces a fundamental design choice: whether to use a learned critic as a baseline for policy optimization. Classical theory favors critic-based methods such as PPO for variance reduction, yet critic-free alternatives like GRPO have gained widespread adoption due to their simplicity and competitive performance. We show that in sparse-reward settings,…
-
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
We prove that, for every fixed $θ_0>0$, selecting a subset of prescribed cardinality that maximizes the Solow--Polasky diversity indicator is NP-hard for finite point sets in $\mathbb{R}^2$ with the Euclidean metric, and therefore also for finite point sets in $\mathbb{R}^d$ for every fixed dimension $d \ge 2$. This strictly strengthens our earlier NP-hardness result for general metric spaces by s…
-
The No Barber Principle: Towards Formalised Selection in the Inaccessible Game
The inaccessible game (Lawrence, 2025, 2026) is an information-theoretic dynamical system governed by three information loss axioms, a marginal entropy conservation constraint and maximum entropy dynamics. In this paper we look at selection in the game. Our aim is to develop a selection policy for the game rules based on a minimal set of assumptions. We seek necessary consistency constraints for s…
-
Deep sprite-based image models: An analysis
While foundation models drive steady progress in image segmentation and diffusion algorithms compose always more realistic images, the seemingly simple problem of identifying recurrent patterns in a collection of images remains very much open. In this paper, we focus on sprite-based image decomposition models, which have shown some promise for clustering and image decomposition and are appealing b…
-
Non-extensive entropy of Vinen quantum turbulence
In Ref. [1] the statistical structure of the turbulent cascade in the context of non-additive entropy was considered. Here we suggest that the vortex line ensemble in the Vinen quantum turbulence in superfluids is described by the non-extensive Tsallis-Cirto statistics with $δ=3$.
-
Deep Supervised Contrastive Learning of Pitch Contours for Robust Pitch Accent Classification in Seoul Korean
The intonational structure of Seoul Korean has been defined with discrete tonal categories within the Autosegmental-Metrical model of intonational phonology. However, it is challenging to map continuous $F_0$ contours to these invariant categories due to variable $F_0$ realizations in real-world speech. Our paper proposes Dual-Glob, a deep supervised contrastive learning framework to robustly clas…
-
Harmonizing MR Images Across 100+ Scanners: Multi-site Validation with Traveling Subjects and Real-world Protocols
Reliable harmonization of heterogeneous magnetic resonance~(MR) image datasets, especially those acquired in pragmatic clinical trials, is critical to advance multi-center neuroimaging studies and translational machine learning in healthcare. We present an enhanced and rigorously validated version of the HACA3 harmonization algorithm, which we refer to as HACA3$^+$, incorporating key methodologica…
-
TS-Attn: Temporal-wise Separable Attention for Multi-Event Video Generation
Generating high-quality videos from complex temporal descriptions that contain multiple sequential actions is a key unsolved problem. Existing methods are constrained by an inherent trade-off: using multiple short prompts fed sequentially into the model improves action fidelity but compromises temporal consistency, while a single complex prompt preserves consistency at the cost of prompt-following…
-
ALMA Observations of Acetone in Hot Cores
Acetone (CH3COCH3) is a ubiquitous interstellar molecule, and serves as an important tracer of hot core chemistry. We conducted a line survey of acetone and its precursor acetaldehyde (CH3CHO) towards 60 hot cores by using the ALMA 3 mm lines observations. We calculated the rotational temperatures and column densities of acetone using the XCLASS software. Acetone was detected in 15 hot cores with …
-
API Security Based on Automatic OpenAPI Mapping
This paper presents Map Reduce Graph (MRG), a novel unsupervised method for modeling and securing HTTP REST APIs. MRG learns API structure from real-world traffic without prior knowledge or labels, automatically generating OpenAPI-compliant documentation by reconstructing routes, methods, and parameter formats. MRG enables real-time updates, explainable visualization, and anomaly detection, helpin…
-
Wrench-Aware Admittance Control for Unknown-Payload Manipulation
Unknown payloads can strongly affect compliant robotic manipulation, especially when the payload center of mass is not aligned with the tool center point. In this case, the payload generates an offset wrench at the robot wrist. During motion, this wrench is not only related to payload weight, but also to payload inertia. If it is not modeled, the compliant controller can interpret it as an externa…
-
Fairness Audits of Institutional Risk Models in Deployed ML Pipelines
Fairness audits of institutional risk models are critical for understanding how deployed machine learning pipelines allocate resources. Drawing on multi-year collaboration with Centennial College, where our prior ethnographic work introduced the ASP-HEI Cycle, we present a replica-based audit of a deployed Early Warning System (EWS), replicating its model using institutional training data and desi…
-
The eigenvector centrality of hypergraphs
A hypergraph is called uniform when every hyperedge contains the same number of vertices, otherwise, it is called non-uniform. In the real world, many systems give rise to non-uniform hypergraphs, such as email networks and co-authorship networks. A uniform hypergraph has a natural one-to-one correspondence with its adjacency tensor. In 2019, Benson proposed the eigenvector centrality of uniform h…
-
Cosmology of the interacting Tsallis holographic dark energy in $f(R,T)$ gravity framework
In this work, we have analyzed the cosmology of the Tsallis holographic dark energy (THDE), a particular case of Nojiri-Odintsov HDE proposed in [S. Nojiri and S. D. Odintsov, \textit{Gen. Relativ. Gravit.} \textbf{38} (2006), 1285; \textit{Eur. Phys. J. C} \textbf{77} (2017) 528], using Hubble's horizon cutoff in $f(R,T)=μR+νT$ model considering pressureless dark matter. We have examined the equa…
-
A neural operator framework for data-driven discovery of stability and receptivity in physical systems
Understanding how complex systems respond to perturbations, such as whether they will remain stable or what their most sensitive patterns are, is a fundamental challenge across science and engineering. Traditional stability and receptivity (resolvent) analyses are powerful but rely on known equations and linearization, limiting their use in nonlinear or poorly modeled systems. Here, we introduce a…
-
LePREC: Reasoning as Classification over Structured Factors for Assessing Relevance of Legal Issues
More than half of the global population struggles to meet their civil justice needs due to limited legal resources. While Large Language Models (LLMs) have demonstrated impressive reasoning capabilities, significant challenges remain even at the foundational step of legal issue identification. To investigate LLMs' capabilities in this task, we constructed a dataset from 769 real-world Malaysian Co…
-
On combining estimated and analytic covariance matrices
The statistical analysis of cosmological data often assumes a Gaussian sampling distribution and relies on covariance matrices estimated from simulations. In this setting, the likelihood function of the data is not Gaussian but is instead a multivariate Student-t distribution, arising from marginalisation over an inverse-Wishart distribution for the true covariance matrix. This framework, introduc…
-
Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(ε^{-4/(3p+1)})$ $p$th-Order Oracle Complexity
When the objective has Lipschitz continuous $p$th-order derivatives, it is known that convex-concave minimax problems can be solved with $\mathcal{O}(ε^{-2/(p+1)})$ $p$th-order oracle calls. This complexity upper bound was speculated to be optimal as it is achieved by a natural generalization of the optimal first-order method. In this work, we show an improved upper bound of $\tilde{\mathcal{O}}(ε…
-
Involuntary In-Context Learning: Exploiting Few-Shot Pattern Completion to Bypass Safety Alignment in GPT-5.4
Safety alignment in large language models relies on behavioral training that can be overridden when sufficiently strong in-context patterns compete with learned refusal behaviors. We introduce Involuntary In-Context Learning (IICL), an attack class that uses abstract operator framing with few-shot examples to force pattern completion that overrides safety training. Through 3479 probes across 10 Op…
-
Optimal Multispectral Imaging using RGB Cameras
We present a physics-driven framework for accurate evaluation of discrete spectral bands using a low-cost multispectral setup built from off-the-shelf RGB cameras and narrow multi-band optical filters. The approach starts by explicitly formulating a linear measurement model. The camera responses are expressed as linear mixtures of unknown spectral components, with mixing coefficients determined by…