Search

The KOTO II experiment is proposed to measure the branching ratio of the decay $K_L\to\pi^0\nu\bar{\nu}$ at J-PARC. With a beamline to extract long-lived neutral kaons at 5 degrees from a production target, the single event sensitivity of the decay is $8.5\times 10^{-13}$, which is much smaller than the Standard Model prediction $3\times 10^{-11}$. This allows searches for new physics beyond the Standard Model and the first discovery of the decay with a significance exceeding $5\sigma$. As the only experiment proposed in the world dedicated to rare kaon decays, KOTO II will be indispensable in the quest for a complete understanding of flavor dynamics in the quark sector. Moreover, by combining efforts from the kaon community worldwide, we plan to develop the KOTO II detector further and expand the physics reach of the experiment to include measurements of the branching ratio of the $K_L\to\pi^0\ell^+\ell^-$ decays, studies of other $K_L$ decays, and searches for dark photons, axions, and axion-like particles. KOTO II will therefore obtain a comprehensive understanding of $K_L$ decays, providing further constraints on new physics scenarios with existing $K^+$ results., Comment: Submitted to the J-PARC PAC. arXiv admin note: substantial text overlap with arXiv:2110.04462

This paper proposes a two-timescale compressed primal-dual (TiCoPD) algorithm for decentralized optimization with improved communication efficiency over prior works on primal-dual decentralized optimization. The algorithm is built upon the primal-dual optimization framework and utilizes a majorization-minimization procedure. The latter naturally suggests the agents to share a compressed difference term during the iteration. Furthermore, the TiCoPD algorithm incorporates a fast timescale mirror sequence for agent consensus on nonlinearly compressed terms, together with a slow timescale primal-dual recursion for optimizing the objective function. We show that the TiCoPD algorithm converges with a constant step size. It also finds an O(1 /T ) stationary solution after T iterations. Numerical experiments on decentralized training of a neural network validate the efficacy of TiCoPD algorithm., Comment: 5 pages, 8 figures

Consider an $ N \times N$ Hermitian one-dimensional random band matrix with band width $W > N^{1 / 2 + \varepsilon} $ for any $ \varepsilon > 0$. In the bulk of the spectrum and in the large $ N $ limit, we obtain the following results: (i) The semicircle law holds up to the scale $ N^{-1 + \varepsilon} $ for any $ \varepsilon > 0 $. (ii) All $ L^2 $- normalized eigenvectors are delocalized, meaning their $ L^\infty$ norms are simultaneously bounded by $ N^{-\frac{1}{2} + \varepsilon} $ with overwhelming probability, for any $ \varepsilon > 0 $. (iii) Quantum unique ergodicity holds in the sense that the local $ L^2 $ mass of eigenvectors becomes equidistributed with high probability. (iv) Universality of eigenvalue statistics, i.e., the local eigenvalue statistics of these band matrices are given by those of Gaussian unitary ensembles., Comment: 85 pages, 14 figures

A new class of weighted spectral geometric means has recently been introduced. In this paper, we present its inequalities in terms of the L\"{o}wner order, operator norm, and trace. Moreover, we establish a log-majorization relationship between the new spectral geometric mean, and the R\'{e}nyi relative operator entropy. We also give the quantum divergence of the quantity, given by the difference of trace values between the arithmetic mean and new spectral geometric mean. Finally, we study the barycenter that minimizes the weighted sum of quantum divergences for given variables., Comment: 16 pages

We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish the following two results as $N\rightarrow \infty$. (i) With high probability, all eigenvalues are optimally rigid, up to an additional $N^{{\rm o}(1)}$ factor. Specifically, the fluctuations of bulk eigenvalues are bounded by $N^{-1+{\rm o}(1)}$, and the fluctuations of edge eigenvalues are bounded by $N^{-2/3+{\rm o}(1)}$. (ii) Edge universality holds for random $d$-regular graphs. That is, the distributions of $\lambda_2$ and $-\lambda_N$ converge to the Tracy-Widom$_1$ distribution associated with the Gaussian Orthogonal Ensemble. As a consequence, for sufficiently large $N$, approximately $69\%$ of $d$-regular graphs on $N$ vertices are Ramanujan, meaning $\max\{\lambda_2,|\lambda_N|\}\leq 2$., Comment: 153 pages, 3 figures

In this paper, we propose a novel method for genus-one and multiply connected genus-zero surfaces, namely periodic conformal flattening.The primary advantage of this method is its independence from the cut paths and consistency preservation of the cut seams, which introduce no additional conformal distortion near the cut seams.We utilize the conformal energy minimization technique to compute the desired conformal map, which is characterised as an easy-solved quadratic functional minimization problem.The numerical experiments illustrate that our proposed algorithms DPCF and SPCF is of high accuracy and a 4-5 times improvement in terms of efficiency compared with state-of-the-art algorithms.

In this paper we obtain inequalities for the geometric mean of elements in the Grassmannians. These inequalities reflect the elliptic geometry of the Grassmannians as Riemannian manifolds. These include Semi-Parallelogram Law, Law of Cosines and geodesic triangle inequalities.

Recent research has revealed that the CRT symmetry for fermions exhibits a fractionalization distinct from the $\mathbb{Z}_2^{\mathcal{C}}\times\mathbb{Z}_2^{\mathcal{R}}\times\mathbb{Z}_2^{\mathcal{T}}$ for scalar bosons. In fact, the CRT symmetry for fermions can be extended by internal symmetries such as fermion parity, thereby forming a group extension of the $\mathbb{Z}_2$ direct product. Conventionally, a Majorana fermion is defined by one Dirac fermion with trivial charge conjugation. However, when the spacetime dimension $d+1=5,6,7\bmod8$, the real dimension of Majorana fermion (dim$_{\mathbb{R}}\chi_{\mathcal{C}\ell(d,0)}$) aligns with the real dimension of Dirac fermion (dim$_{\mathbb{R}}\psi_{\mathcal{C}\ell(d)}$), rather than being half, which necessitates the introduction of a symplectic Majorana fermion, defined by two Dirac fermions with trivial charge conjugation. To include these two types of Majorana fermions, we embed the theory in $n_{\mathbb{R}}$ and define the Majorana fermion field as a representation of the real Clifford algebra with 8-fold periodicity. Within the Hamiltonian formalism, we identify the 8-fold CRT-internal symmetry groups across general dimensions. Similarly, Dirac fermion field is defined as a representation of the complex Clifford algebra with 2-fold periodicity. Interestingly, we discover that the CRT-internal symmetry groups exhibit an 8-fold periodicity that is distinct from that of the complex Clifford algebra. In certain dimensions where distinct mass terms can span a mass manifold, the CRT-internal symmetries can act non-trivially upon this mass manifold. Employing domain wall reduction method, we are able to elucidate the relationships between symmetries across different dimensions., Comment: 54 pages, 39 tables, sequel to arXiv:2109.15320 and arXiv:2312.17126. Include symplectic Majorana in d+1=5,6,7 mod 8, and symplectic Majorana-Weyl in d+1=6 mod 8. Motivation: use CRT-internal symmetries to rule out fermion bilinear masses. Key result: systematically assigned CRT-internal symmetries in all spacetime dimensions for both Majorana and Dirac fermions

The notion of the Yau sequence was introduced by Tomaru, as an attempt to extend Yau's elliptic sequence for (weakly) elliptic singularities to normal surface singularities of higher fundamental genera. In this paper, we obtain the canonical cycle using the Yau cycle for certain surface singularities of degree two. Furthermore, we obtain a formula of arithmetic genera and an upper bound of geometric genera for these singularities. We also give some properties about the classification of weighted dual graphs of certain surface singularities of degree two.

Spectrum prediction is considered to be a promising technology that enhances spectrum efficiency by assisting dynamic spectrum access (DSA) in cognitive radio networks (CRN). Nonetheless, the highly nonlinear nature of spectrum data across time, frequency, and space domains, coupled with the intricate spectrum usage patterns, poses challenges for accurate spectrum prediction. Deep learning (DL), recognized for its capacity to extract nonlinear features, has been applied to solve these challenges. This paper first shows the advantages of applying DL by comparing with traditional prediction methods. Then, the current state-of-the-art DL-based spectrum prediction techniques are reviewed and summarized in terms of intra-band and crossband prediction. Notably, this paper uses a real-world spectrum dataset to prove the advancements of DL-based methods. Then, this paper proposes a novel intra-band spatiotemporal spectrum prediction framework named ViTransLSTM. This framework integrates visual self-attention and long short-term memory to capture both local and global long-term spatiotemporal dependencies of spectrum usage patterns. Similarly, the effectiveness of the proposed framework is validated on the aforementioned real-world dataset. Finally, the paper presents new related challenges and potential opportunities for future research.

It is well-known that the classical Schwarz lemma yields an explicit comparison of two Hermitian metrics with uniform constant negative curvature bounds through holomorphic maps between complex manifolds. In this paper, we establish Schwarz lemmas for holomorphic bundle maps between abstract Hermitian holomorphic vector bundles with various positive curvature bounds. As applications, we prove Schwarz lemmas for holomorphic maps between complex manifolds whose curvature tensors are described by the notion ``RC-positivity''. In particular, new diameter and volume comparison theorems are obtained by using Schwarz lemmas.

In this paper we introduce a primitive path homology theory on the category of simple digraphs. On the subcategory of asymmetric digraphs, this theory coincides with the path homology theory which was introduced by Grigor'yan, Lin, Muranov, and Yau, but these theories are different in general case. We study properties of the primitive path homology and describe relations between the primitive path homology and the path homology. Let $a,b$ two different vertices of a digraph. Our approach gives a possibility to construct primitive homology theories of paths which have a given tail vertex $a$ or (and) a given head vertex $b$. We study these theories and describe also relationships between them and the path homology theory.

In this paper, we study the action of an autoequivalence, the spherical twist associated to a torsion sheaf, on the standard Bridgeland stability conditions and a generalized weak stability condition on the derived category of a K3 surface. As a special case, we construct a Bridgeland stability condition associated to a non-nef divisor, which conjecturally lies in the geometric component but outside the geometric chamber. We also discuss the destabilizing objects and stability of certain line bundles at the weak stability condition associated to a nef divisor.

This paper studies the multi-robot reliable navigation problem in uncertain topological networks, which aims at maximizing the robot team's on-time arrival probabilities in the face of road network uncertainties. The uncertainty in these networks stems from the unknown edge traversability, which is only revealed to the robot upon its arrival at the edge's starting node. Existing approaches often struggle to adapt to real-time network topology changes, making them unsuitable for varying topological environments. To address the challenge, we reformulate the problem into a Partially Observable Markov Decision Process (POMDP) framework and introduce the Dynamic Adaptive Graph Embedding method to capture the evolving nature of the navigation task. We further enhance each robot's policy learning process by integrating deep reinforcement learning with Graph Attention Networks (GATs), leveraging self-attention to focus on critical graph features. The proposed approach, namely Multi-Agent Routing in Variable Environments with Learning (MARVEL) employs the generalized policy gradient algorithm to optimize the robots' real-time decision-making process iteratively. We compare the performance of MARVEL with state-of-the-art reliable navigation algorithms as well as Canadian traveller problem solutions in a range of canonical transportation networks, demonstrating improved adaptability and performance in uncertain topological networks. Additionally, real-world experiments with two robots navigating within a self-constructed indoor environment with uncertain topological structures demonstrate MARVEL's practicality., Comment: 8 pages, 5 figures

This paper introduces the Global Challenge for Safe and Secure Large Language Models (LLMs), a pioneering initiative organized by AI Singapore (AISG) and the CyberSG R&D Programme Office (CRPO) to foster the development of advanced defense mechanisms against automated jailbreaking attacks. With the increasing integration of LLMs in critical sectors such as healthcare, finance, and public administration, ensuring these models are resilient to adversarial attacks is vital for preventing misuse and upholding ethical standards. This competition focused on two distinct tracks designed to evaluate and enhance the robustness of LLM security frameworks. Track 1 tasked participants with developing automated methods to probe LLM vulnerabilities by eliciting undesirable responses, effectively testing the limits of existing safety protocols within LLMs. Participants were challenged to devise techniques that could bypass content safeguards across a diverse array of scenarios, from offensive language to misinformation and illegal activities. Through this process, Track 1 aimed to deepen the understanding of LLM vulnerabilities and provide insights for creating more resilient models.

Differential equations offer a foundational yet powerful framework for modeling interactions within complex dynamic systems and are widely applied across numerous scientific fields. One common challenge in this area is estimating the unknown parameters of these dynamic relationships. However, traditional numerical optimization methods rely on the selection of initial parameter values, making them prone to local optima. Meanwhile, deep learning and Bayesian methods require training models on specific differential equations, resulting in poor versatility. This paper reformulates the parameter estimation problem of differential equations as an optimization problem by introducing the concept of particles from the particle swarm optimization algorithm. Building on reinforcement learning-based particle swarm optimization (RLLPSO), this paper proposes a novel method, DERLPSO, for estimating unknown parameters of differential equations. We compared its performance on three typical ordinary differential equations with the state-of-the-art methods, including the RLLPSO algorithm, traditional numerical methods, deep learning approaches, and Bayesian methods. The experimental results demonstrate that our DERLPSO consistently outperforms other methods in terms of performance, achieving an average Mean Square Error of 1.13e-05, which reduces the error by approximately 4 orders of magnitude compared to other methods. Apart from ordinary differential equations, our DERLPSO also show great promise for estimating unknown parameters of partial differential equations. The DERLPSO method proposed in this paper has high accuracy, is independent of initial parameter values, and possesses strong versatility and stability. This work provides new insights into unknown parameter estimation for differential equations.

In this paper, we study the multi-rigidity problem in rational homogeneous spaces. A Schubert class is called multi-rigid if every multiple of it can only be represented by a union of Schubert varieties. We prove the multi-rigidity of Schubert classes in rational homogeneous spaces. In particular, we characterize the multi-rigid Schubert classes in partial flag varieties of type A, B and D. Moreover, for a general rational homogeneous space $G/P$, we deduce the rigidity and multi-rigidity from the corresponding generalized Grassmannians (correspond to maximal parabolics). When $G$ is semi-simple, we also deduce the rigidity and multi-rigidity from the simple cases., Comment: 39 pages

In this note, we study the "tight gates" of some "regular" partitions in Coxeter groups. In particular, we study the tight gates of the cone type partition of a Coxeter group $W$; a partition giving rise to the minimal automaton recognising the language of reduced words of $W$ recently studied by Parkinson and Yau (2022) and Przytycki and Yau (2024). We show that "tight gates" are the join-irreducible elements of the $m$-low Garside shadows for $m \in \mathbb{N}$ and the smallest Garside shadow of $W$ under the right weak order. In the case of the tight gates of the cone type partition, we show that they also act as a "gate" of the witnesses of boundary roots of cone types. As an application of these results, we give a very efficient method of determining whether two elements have the same cone type without computing the minimal automaton. We also apply our results to explicitly describe the set of ultra-low elements in some select classes of Coxeter groups, thereby verifying a conjecture of Parkinson and Yau for these groups. Furthermore, we explicitly describe the tight gates of the cone type partition in these cases.

Stochastic decentralized optimization algorithms often suffer from issues such as synchronization overhead and intermittent communication. This paper proposes a $\underline{\rm F}$ully $\underline{\rm S}$tochastic $\underline{\rm P}$rimal $\underline{\rm D}$ual gradient $\underline{\rm A}$lgorithm (FSPDA) that suggests an asynchronous decentralized procedure with (i) sparsified non-blocking communication on random undirected graphs and (ii) local stochastic gradient updates. FSPDA allows multiple local gradient steps to accelerate convergence to stationarity while finding a consensual solution with stochastic primal-dual updates. For problems with smooth (possibly non-convex) objective function, we show that FSPDA converges to an $\mathrm{\mathcal{O}( {\it \sigma /\sqrt{nT}} )}$-stationary solution after $\mathrm{\it T}$ iterations without assuming data heterogeneity. The performance of FSPDA is on par with state-of-the-art algorithms whose convergence depend on static graph and synchronous updates. To our best knowledge, FSPDA is the first asynchronous algorithm that converges exactly under the non-convex setting. Numerical experiments are presented to show the benefits of FSPDA., Comment: 15 pages, 7 figures

Futaki invariants of the classical moduli space of 4d N=1 supersymmetric gauge theories determine whether they have a conformal fixed point in the IR. We systematically compute the Futaki invariants for a large family of 4d N=1 supersymmetric gauge theories coming from D3-branes probing Calabi-Yau 3-fold singularities whose bases are Gorenstein Fano surfaces. In particular, we focus on the toric case where the Fano surfaces are given by the 16 reflexive convex polygons and the moduli spaces are given by the corresponding toric Calabi-Yau 3-folds. We study the distribution of and conjecture new bounds on the Futaki invariants with respect to various topological and geometric quantities. These include the minimum volume of the Sasaki-Einstein base manifolds as well as the Chern and Euler numbers of the toric Fano surfaces. Even though the moduli spaces for the family of theories studied are known to be K-stable, our work sheds new light on how the topological and geometric quantities restrict the Futaki invariants for a plethora of moduli spaces., Comment: 65 pages, 19 figures, 11 tables

Practical Bayes filters often assume the state distribution of each time step to be Gaussian for computational tractability, resulting in the so-called Gaussian filters. When facing nonlinear systems, Gaussian filters such as extended Kalman filter (EKF) or unscented Kalman filter (UKF) typically rely on certain linearization techniques, which can introduce large estimation errors. To address this issue, this paper reconstructs the prediction and update steps of Gaussian filtering as solutions to two distinct optimization problems, whose optimal conditions are found to have analytical forms from Stein's lemma. It is observed that the stationary point for the prediction step requires calculating the first two moments of the prior distribution, which is equivalent to that step in existing moment-matching filters. In the update step, instead of linearizing the model to approximate the stationary points, we propose an iterative approach to directly minimize the update step's objective to avoid linearization errors. For the purpose of performing the steepest descent on the Gaussian manifold, we derive its natural gradient that leverages Fisher information matrix to adjust the gradient direction, accounting for the curvature of the parameter space. Combining this update step with moment matching in the prediction step, we introduce a new iterative filter for nonlinear systems called \textit{N}atural Gr\textit{a}dient Gaussia\textit{n} Appr\textit{o}ximation filter, or NANO filter for short. We prove that NANO filter locally converges to the optimal Gaussian approximation at each time step. Furthermore, the estimation error is proven exponentially bounded for nearly linear measurement equation and low noise levels through constructing a supermartingale-like property across consecutive time steps.

Regression analysis with missing data is a long-standing and challenging problem, particularly when there are many missing variables with arbitrary missing patterns. Likelihood-based methods, although theoretically appealing, are often computationally inefficient or even infeasible when dealing with a large number of missing variables. In this paper, we consider the Cox regression model with incomplete covariates that are missing at random. We develop an expectation-maximization (EM) algorithm for nonparametric maximum likelihood estimation, employing a transformation technique in the E-step so that it involves only a one-dimensional integration. This innovation makes our methods scalable with respect to the dimension of the missing variables. In addition, for variable selection, we extend the proposed EM algorithm to accommodate a LASSO penalty in the likelihood. We demonstrate the feasibility and advantages of the proposed methods over existing methods by large-scale simulation studies and apply the proposed methods to a cancer genomic study., Comment: 15 pages, 2 figures, 7 tables

Recent advancements in diffusion models have significantly enhanced the quality of video generation. However, fine-grained control over camera pose remains a challenge. While U-Net-based models have shown promising results for camera control, transformer-based diffusion models (DiT)-the preferred architecture for large-scale video generation - suffer from severe degradation in camera motion accuracy. In this paper, we investigate the underlying causes of this issue and propose solutions tailored to DiT architectures. Our study reveals that camera control performance depends heavily on the choice of conditioning methods rather than camera pose representations that is commonly believed. To address the persistent motion degradation in DiT, we introduce Camera Motion Guidance (CMG), based on classifier-free guidance, which boosts camera control by over 400%. Additionally, we present a sparse camera control pipeline, significantly simplifying the process of specifying camera poses for long videos. Our method universally applies to both U-Net and DiT models, offering improved camera control for video generation tasks.

K. Saito's classification of simple elliptic singularities includes three families of weighted homogeneous singularities: $ \tilde{E}_{6}, \tilde{E}_7$, and $ \tilde{E}_8 $. For each family, the isomorphism classes can be distinguished by K. Saito's $j$-functions. By applying the Mather-Yau theorem, which states that the isomorphism class of an isolated hypersurface singularity is completely determined by its $k$-th moduli algebra, M. Eastwood demonstrated explicitly that one can directly recover K. Saito's $j$-functions from the zeroth moduli algebras. This research aims to generalize M. Eastwood's result through meticulous computation of the groupoids associated with simple elliptic singularities. We not only directly retrieve K. Saito's $j$-functions from the $k$-th moduli algebras but also elucidate the automorphism structure within the $k$-th moduli algebras. We derive the automorphisms using the methodology of the $k$-th Yau algebra and establish a Torelli-type theorem for the $\tilde{E}_7 $-family when $k=1$. In contrast, we find that the Torelli-type theorem is inapplicable for the first Yau algebra in the $ \tilde{E}_6 $-family. By considering the first Yau algebra as a module rather than solely as a Lie algebra, we can impose constraints on the coefficients of the transformation matrices, which facilitates a straightforward identification of all isomorphisms. Our new approach also provides a simple verification of the result by Chen, Seeley, and Yau concerning the zeroth moduli algebras.

Previous research has explored the computational expressivity of Transformer models in simulating Boolean circuits or Turing machines. However, the learnability of these simulators from observational data has remained an open question. Our study addresses this gap by providing the first polynomial-time learnability results (specifically strong, agnostic PAC learning) for single-layer Transformers with linear attention. We show that linear attention may be viewed as a linear predictor in a suitably defined RKHS. As a consequence, the problem of learning any linear transformer may be converted into the problem of learning an ordinary linear predictor in an expanded feature space, and any such predictor may be converted back into a multiheaded linear transformer. Moving to generalization, we show how to efficiently identify training datasets for which every empirical risk minimizer is equivalent (up to trivial symmetries) to the linear Transformer that generated the data, thereby guaranteeing the learned model will correctly generalize across all inputs. Finally, we provide examples of computations expressible via linear attention and therefore polynomial-time learnable, including associative memories, finite automata, and a class of Universal Turing Machine (UTMs) with polynomially bounded computation histories. We empirically validate our theoretical findings on three tasks: learning random linear attention networks, key--value associations, and learning to execute finite automata. Our findings bridge a critical gap between theoretical expressivity and learnability of Transformers, and show that flexible and general models of computation are efficiently learnable.

Estimation algebras have been extensively studied in Euclidean space, where finite-dimensional estimation algebras form the foundation of the Kalman and Benes filters, and have contributed to the discovery of many other finite-dimensional filters. This work extends the theory of estimation algebras to filtering problems on Riemannian manifolds in continuous time. Our main result demonstrates that, with non-constant observation functions, the estimation algebra associated with the system on closed Riemannian manifolds is infinite-dimensional., Comment: 6 pages, submitted to IEEE Transaction on Automatic Control

The first very long baseline interferometry (VLBI) detections at 870$\mu$m wavelength (345$\,$GHz frequency) are reported, achieving the highest diffraction-limited angular resolution yet obtained from the surface of the Earth, and the highest-frequency example of the VLBI technique to date. These include strong detections for multiple sources observed on inter-continental baselines between telescopes in Chile, Hawaii, and Spain, obtained during observations in October 2018. The longest-baseline detections approach 11$\,$G$\lambda$ corresponding to an angular resolution, or fringe spacing, of 19$\mu$as. The Allan deviation of the visibility phase at 870$\mu$m is comparable to that at 1.3$\,$mm on the relevant integration time scales between 2 and 100$\,$s. The detections confirm that the sensitivity and signal chain stability of stations in the Event Horizon Telescope (EHT) array are suitable for VLBI observations at 870$\mu$m. Operation at this short wavelength, combined with anticipated enhancements of the EHT, will lead to a unique high angular resolution instrument for black hole studies, capable of resolving the event horizons of supermassive black holes in both space and time., Comment: Corresponding author: S. Doeleman

Optical pumping of barium monofluoride (BaF) within a cryogenic neon matrix is demonstrated. Interestingly, with an applied magnetic field of 2~G, optical pumping is found to be considerably more efficient for a laser beam with right-circular polarization compared to left-circular polarization. Calculations show that the higher efficiency is due to a constructive versus destructive interference and is dependent on the orientation of the BaF molecule relative to the magnetic field direction. The effect leads to orientation-dependent optical pumping within the matrix. As optical pumping is the first step used in our planned electron electric-dipole moment (eEDM) measurement, we intend to exploit this property to obtain the selection of molecular orientations that is required for an eEDM measurement., Comment: 9 pages, 5 figures

A method for specular reflection of polar molecules is proposed. Electrostatatic potentials and forces are calculated for a low-field-seeking molecule near a series of long cylindrical electrodes of radius $r$ with dc potentials of $+V$ and $-V$ applied to alternate electrodes. A center-to-center separation of $2.9\,r$ leads to remarkably flat equipotential surfaces and thus to a nearly planar mirror for specular reflection of the polar molecules, with the angle of reflection equalling the angle of incidence to an accuracy approaching a microradian. This mirror can be used to redirect cryogenic molecular beams. Separating barium monofluoride (BaF) molecules created in a helium-buffer-gas laser-ablation source from other ablation products is a necessary step to producing a pure sample of matrix-isolated BaF, as is required by the EDM$^3$ collaboration for implementing a precise measurement of the electron electric dipole moment. The design and modelling for the BaF deflector based on this electrode geometry is presented., Comment: 5 pages, 5 figures

A cryogenic neon solid doped with barium monofluoride (BaF) is created on a cryogenic substrate using a stream of Ne gas and a high-intensity beam of BaF molecules produced in a cryogenic helium-buffer-gas laser-ablation source. The apparatus is designed for eventual use in a measurement of the electron electric dipole moment (eEDM). Laser-induced fluorescence is observed from transitions up to the $B\,^2\Sigma_{1/2}$ state. The number of BaF molecules found to be present in the solid and addressable with this laser transition is approximately 10$^{10}$ per mm$^3$, which is of the same order as the total number of BaF molecules that impact the substrate during the hour of growth time for the solid. As a result, an eventual eEDM measurement could have continual access to an accumulation of an hour's worth of molecules (all of which are contained within a 1-mm$^3$ volume and are thermalized into the ground state), compared to beam experiments which study the molecules from a single ablation during the millisecond-timescale of their passage through a much larger-scale measurement apparatus. The number of BaF molecules observed in the doped solid matches the target value for our planned eEDM measurement., Comment: 9 pages, 6 figures

In this paper, we give a definition of weak stability condition on a triangulated category. The difference between our definition and existing definitions is that we allow objects in the kernel to have non-maximal phases. We then construct four types of weak stability conditions that naturally occur on Weierstrass ellitpic surfaces as limites of Bridgeland stability conditions., Comment: The preprint arXiv:2306.05620v1 has been divided into two papers; this is Part 1 of arXiv:2306.05620v1

We study the complex band hybridization induced by nonreciprocal local resonances in photonic crystals. Composed of trimer unit cells, a two-dimensional (2D) magnetophotonic crystal with an analytically obtainable solution is considered. We find that nonreciprocal spectral gap may appear without nonreciprocal transmission and that the imaginary parts of the complex wavevectors $\text{Im}(\mathbf{k})$ may blow up at resonance to give extreme nonreciprocal transmission. We further show that, for a subwavelegnth lattice, the isolation ratio for the nonreciprocal transmission is determined solely by $\text{Im}(\mathbf{k})$ instead of the extensively studied real part $\text{Re}(\mathbf{k})$. Our finding contradicts the common belief that "spectral nonreciprocity [$\omega(\mathbf{k})\neq\omega(-\mathbf{k})$] always implies nonreciprocal transmission"., Comment: 5 pages, 4 figures

Underwater images often suffer from quality degradation due to absorption and scattering effects. Most existing underwater image enhancement algorithms produce a single, fixed-color image, limiting user flexibility and application. To address this limitation, we propose a method called \textit{ColorCode}, which enhances underwater images while offering a range of controllable color outputs. Our approach involves recovering an underwater image to a reference enhanced image through supervised training and decomposing it into color and content codes via self-reconstruction and cross-reconstruction. The color code is explicitly constrained to follow a Gaussian distribution, allowing for efficient sampling and interpolation during inference. ColorCode offers three key features: 1) color enhancement, producing an enhanced image with a fixed color; 2) color adaptation, enabling controllable adjustments of long-wavelength color components using guidance images; and 3) color interpolation, allowing for the smooth generation of multiple colors through continuous sampling of the color code. Quantitative and visual evaluations on popular and challenging benchmark datasets demonstrate the superiority of ColorCode over existing methods in providing diverse, controllable, and color-realistic enhancement results. The source code is available at https://github.com/Xiaofeng-life/ColorCode.

Adversarial training has achieved remarkable advancements in defending against adversarial attacks. Among them, fast adversarial training (FAT) is gaining attention for its ability to achieve competitive robustness with fewer computing resources. Existing FAT methods typically employ a uniform strategy that optimizes all training data equally without considering the influence of different examples, which leads to an imbalanced optimization. However, this imbalance remains unexplored in the field of FAT. In this paper, we conduct a comprehensive study of the imbalance issue in FAT and observe an obvious class disparity regarding their performances. This disparity could be embodied from a perspective of alignment between clean and robust accuracy. Based on the analysis, we mainly attribute the observed misalignment and disparity to the imbalanced optimization in FAT, which motivates us to optimize different training data adaptively to enhance robustness. Specifically, we take disparity and misalignment into consideration. First, we introduce self-knowledge guided regularization, which assigns differentiated regularization weights to each class based on its training state, alleviating class disparity. Additionally, we propose self-knowledge guided label relaxation, which adjusts label relaxation according to the training accuracy, alleviating the misalignment and improving robustness. By combining these methods, we formulate the Self-Knowledge Guided FAT (SKG-FAT), leveraging naturally generated knowledge during training to enhance the adversarial robustness without compromising training efficiency. Extensive experiments on four standard datasets demonstrate that the SKG-FAT improves the robustness and preserves competitive clean accuracy, outperforming the state-of-the-art methods., Comment: 13 pages

Finger vein recognition technology has become one of the primary solutions for high-security identification systems. However, it still has information leakage problems, which seriously jeopardizes users privacy and anonymity and cause great security risks. In addition, there is no work to consider a fully integrated secure finger vein recognition system. So, different from the previous systems, we integrate preprocessing and template protection into an integrated deep learning model. We propose an end-to-end cancelable finger vein network (CFVNet), which can be used to design an secure finger vein recognition system.It includes a plug-and-play BWR-ROIAlign unit, which consists of three sub-modules: Localization, Compression and Transformation. The localization module achieves automated localization of stable and unique finger vein ROI. The compression module losslessly removes spatial and channel redundancies. The transformation module uses the proposed BWR method to introduce unlinkability, irreversibility and revocability to the system. BWR-ROIAlign can directly plug into the model to introduce the above features for DCNN-based finger vein recognition systems. We perform extensive experiments on four public datasets to study the performance and cancelable biometric attributes of the CFVNet-based recognition system. The average accuracy, EERs and Dsys on the four datasets are 99.82%, 0.01% and 0.025, respectively, and achieves competitive performance compared with the state-of-the-arts.

Let $ (X,0) $ denote an isolated singularity defined by a weighted homogeneous polynomial $ f $. Let $ \mathcal{O}$ be the local algebra of all holomorphic function germs at the origin with the maximal ideal $m $. We study the $k$-th Tjurina algebra, defined by $ A_k(f): = \mathcal{O} / \left( f , m^k J(f) \right) $, where $J(f)$ denotes the Jacobi ideal of $ \mathcal{O}$. The zeroth Tjurina algebra is well known to represent the tangent space of the base space of the semi-universal deformation of $(X, 0)$. Motivated by this observation, we explore the deformation of $(X,0)$ with respect to a fixed $k$-residue point. We show that the tangent space of the corresponding deformation functor is a subspace of the $k$-th Tjurina algebra. Explicitly calculating the $k$-th Tjurina numbers, which correspond to the dimensions of the Tjurina algebra, plays a crucial role in understanding these deformations. According to the results of Milnor and Orlik, the zeroth Tjurina number can be expressed explicitly in terms of the weights of the variables in $f$. However, we observe that for values of $k$ exceeding the multiplicity of $X$, the $k$-th Tjurina number becomes more intricate and is not solely determined by the weights of variables. In this paper, we introduce a novel complex derived from the classical Koszul complex and obtain a computable formula for the $k$-th Tjurina numbers for all $ k \geqslant 0 $. As applications, we calculate the $k$-th Tjurina numbers for all weighted homogeneous singularities in three variables.

Learning-based methods for underwater image enhancement (UWIE) have undergone extensive exploration. However, learning-based models are usually vulnerable to adversarial examples so as the UWIE models. To the best of our knowledge, there is no comprehensive study on the adversarial robustness of UWIE models, which indicates that UWIE models are potentially under the threat of adversarial attacks. In this paper, we propose a general adversarial attack protocol. We make a first attempt to conduct adversarial attacks on five well-designed UWIE models on three common underwater image benchmark datasets. Considering the scattering and absorption of light in the underwater environment, there exists a strong correlation between color correction and underwater image enhancement. On the basis of that, we also design two effective UWIE-oriented adversarial attack methods Pixel Attack and Color Shift Attack targeting different color spaces. The results show that five models exhibit varying degrees of vulnerability to adversarial attacks and well-designed small perturbations on degraded images are capable of preventing UWIE models from generating enhanced results. Further, we conduct adversarial training on these models and successfully mitigated the effectiveness of adversarial attacks. In summary, we reveal the adversarial vulnerability of UWIE models and propose a new evaluation dimension of UWIE models.

Generalizing deformation quantizations with separation of variables of a K\"ahler manifold $M$, we adopt Fedosov's gluing argument to construct a category $\mathsf{DQ}$, enriched over sheaves of $\mathbb{C}[[\hbar]]$-modules on $M$, as a quantization of the category of Hermitian holomorphic vector bundles over $M$ with morphisms being smooth sections of hom-bundles. We then define quantizable morphisms among objects in $\mathsf{DQ}$, generalizing Chan-Leung-Li's notion [4] of quantizable functions. Upon evaluation of quantizable morphisms at $\hbar = \tfrac{\sqrt{-1}}{k}$, we obtain an enriched category $\mathsf{DQ}_{\operatorname{qu}, k}$. We show that, when $M$ is prequantizable, $\mathsf{DQ}_{\operatorname{qu}, k}$ is equivalent to the category $\mathsf{GQ}$ of holomorphic vector bundles over $M$ with morphisms being holomorphic differential operators, via a functor obtained from Bargmann-Fock actions., Comment: 22 pages

Changes in the number of copies of certain parts of the genome, known as copy number alterations (CNAs), due to somatic mutation processes are a hallmark of many cancers. This genomic complexity is known to be associated with poorer outcomes for patients but describing its contribution in detail has been difficult. Copy number alterations can affect large regions spanning whole chromosomes or the entire genome itself but can also be localised to only small segments of the genome and no methods exist that allow this multi-scale nature to be quantified. In this paper, we address this using Wave-LSTM, a signal decomposition approach designed to capture the multi-scale structure of complex whole genome copy number profiles. Using wavelet-based source separation in combination with deep learning-based attention mechanisms. We show that Wave-LSTM can be used to derive multi-scale representations from copy number profiles which can be used to decipher sub-clonal structures from single-cell copy number data and to improve survival prediction performance from patient tumour profiles.

In this paper, we propose a deep learning (DL)-based task-driven spectrum prediction framework, named DeepSPred. The DeepSPred comprises a feature encoder and a task predictor, where the encoder extracts spectrum usage pattern features, and the predictor configures different networks according to the task requirements to predict future spectrum. Based on the Deep- SPred, we first propose a novel 3D spectrum prediction method combining a flow processing strategy with 3D vision Transformer (ViT, i.e., Swin) and a pyramid to serve possible applications such as spectrum monitoring task, named 3D-SwinSTB. 3D-SwinSTB unique 3D Patch Merging ViT-to-3D ViT Patch Expanding and pyramid designs help the model accurately learn the potential correlation of the evolution of the spectrogram over time. Then, we propose a novel spectrum occupancy rate (SOR) method by redesigning a predictor consisting exclusively of 3D convolutional and linear layers to serve possible applications such as dynamic spectrum access (DSA) task, named 3D-SwinLinear. Unlike the 3D-SwinSTB output spectrogram, 3D-SwinLinear projects the spectrogram directly as the SOR. Finally, we employ transfer learning (TL) to ensure the applicability of our two methods to diverse spectrum services. The results show that our 3D-SwinSTB outperforms recent benchmarks by more than 5%, while our 3D-SwinLinear achieves a 90% accuracy, with a performance improvement exceeding 10%.

While the earliest applications of AI methodologies to pure mathematics and theoretical physics began with the study of Hodge numbers of Calabi-Yau manifolds, the topology type of such manifold also crucially depend on their intersection theory. Continuing the paradigm of machine learning algebraic geometry, we here investigate the triple intersection numbers, focusing on certain divisibility invariants constructed therefrom, using the Inception convolutional neural network. We find $\sim90\%$ accuracies in prediction in a standard fivefold cross-validation, signifying that more sophisticated tasks of identification of manifold topologies can also be performed by machine learning., Comment: 26 pages, 5 figures

WalledEval is a comprehensive AI safety testing toolkit designed to evaluate large language models (LLMs). It accommodates a diverse range of models, including both open-weight and API-based ones, and features over 35 safety benchmarks covering areas such as multilingual safety, exaggerated safety, and prompt injections. The framework supports both LLM and judge benchmarking and incorporates custom mutators to test safety against various text-style mutations, such as future tense and paraphrasing. Additionally, WalledEval introduces WalledGuard, a new, small, and performant content moderation tool, and two datasets: SGXSTest and HIXSTest, which serve as benchmarks for assessing the exaggerated safety of LLMs and judges in cultural contexts. We make WalledEval publicly available at https://github.com/walledai/walledeval., Comment: Under review

Emotion recognition in social situations is a complex task that requires integrating information from both facial expressions and the situational context. While traditional approaches to automatic emotion recognition have focused on decontextualized signals, recent research emphasizes the importance of context in shaping emotion perceptions. This paper contributes to the emerging field of context-based emotion recognition by leveraging psychological theories of human emotion perception to inform the design of automated methods. We propose an approach that combines emotion recognition methods with Bayesian Cue Integration (BCI) to integrate emotion inferences from decontextualized facial expressions and contextual knowledge inferred via Large-language Models. We test this approach in the context of interpreting facial expressions during a social task, the prisoner's dilemma. Our results provide clear support for BCI across a range of automatic emotion recognition methods. The best automated method achieved results comparable to human observers, suggesting the potential for this approach to advance the field of affective computing., Comment: 9 pages, 5 figures, 3 tables

Depth estimation using a single-photon LiDAR is often solved by a matched filter. It is, however, error-prone in the presence of background noise. A commonly used technique to reject background noise is the rank-ordered mean (ROM) filter previously reported by Shin \textit{et al.} (2015). ROM rejects noisy photon arrival timestamps by selecting only a small range of them around the median statistics within its local neighborhood. Despite the promising performance of ROM, its theoretical performance limit is unknown. In this paper, we theoretically characterize the ROM performance by showing that ROM fails when the reflectivity drops below a threshold predetermined by the depth and signal-to-background ratio, and its accuracy undergoes a phase transition at the cutoff. Based on our theory, we propose an improved signal extraction technique by selecting tight timestamp clusters. Experimental results show that the proposed algorithm improves depth estimation performance over ROM by 3 orders of magnitude at the same signal intensities, and achieves high image fidelity at noise levels as high as 17 times that of signal., Comment: 6 pages, 7 figures, submitted to the IEEE 26th International Workshop on Multimedia Signal Processing (MMSP)

Topic modelling has become increasingly popular for summarizing text data, such as social media posts and articles. However, topic modelling is usually completed in one shot. Assessing the quality of resulting topics is challenging. No effective methods or measures have been developed for assessing the results or for making further enhancements to the topics. In this research, we propose we propose to use an iterative process to perform topic modelling that gives rise to a sense of completeness of the resulting topics when the process is complete. Using the BERTopic package, a popular method in topic modelling, we demonstrate how the modelling process can be applied iteratively to arrive at a set of topics that could not be further improved upon using one of the three selected measures for clustering comparison as the decision criteria. This demonstration is conducted using a subset of the COVIDSenti-A dataset. The early success leads us to believe that further research using in using this approach in conjunction with other topic modelling algorithms could be viable.

Critical parameters are the key to superconductivity research, and reliable instrumentations can facilitate the study. Traditionally, one has to use several different measurement techniques to measure critical parameters separately. In this work, we develop the use of a single species of quantum sensor to determine and estimate several critical parameters with the help of independent simulation data. We utilize the nitrogen-vacancy (NV) center in the diamond, which recently emerged as a promising candidate for probing exotic features in condensed matter physics. The non-invasive and highly stable nature provides extraordinary opportunities to solve scientific problems in various systems. Using a high-quality single-crystalline YBa$_{2}$Cu$_{4}$O$_{8}$ (YBCO) as a platform, we demonstrate the use of diamond particles and a bulk diamond to probe the Meissner effect. The evolution of the vector magnetic field, the $H-T$ phase diagram, and the map of fluorescence contour are studied via NV sensing. Our results reveal different critical parameters, including lower critical field $H_{c1}$, upper critical field $H_{c2}$, and critical current density $j_{c}$, as well as verifying the unconventional nature of this high-temperature superconductor YBCO. Therefore, NV-based quantum sensing techniques have huge potential in condensed matter research.

Emotion recognition in social situations is a complex task that requires integrating information from both facial expressions and the situational context. While traditional approaches to automatic emotion recognition have focused on decontextualized signals, recent research emphasizes the importance of context in shaping emotion perceptions. This paper contributes to the emerging field of context-based emotion recognition by leveraging psychological theories of human emotion perception to inform the design of automated methods. We propose an approach that combines emotion recognition methods with Bayesian Cue Integration (BCI) to integrate emotion inferences from decontextualized facial expressions and contextual knowledge inferred via Large-language Models. We test this approach in the context of interpreting facial expressions during a social task, the prisoner's dilemma. Our results provide clear support for BCI across a range of automatic emotion recognition methods. The best automated method achieved results comparable to human observers, suggesting the potential for this approach to advance the field of affective computing., Comment: 7 pages

This paper considers the collaborative graph exploration problem in GPS-denied environments, where a group of robots are required to cover a graph environment while maintaining reliable pose estimations in collaborative simultaneous localization and mapping (SLAM). Considering both objectives presents challenges for multi-robot pathfinding, as it involves the expensive covariance inference for SLAM uncertainty evaluation, especially considering various combinations of robots' paths. To reduce the computational complexity, we propose an efficient two-stage strategy where exploration paths are first generated for quick coverage, and then enhanced by adding informative and distance-efficient loop-closing actions, called loop edges, along the paths for reliable pose estimation. We formulate the latter problem as a non-monotone submodular maximization problem by relating SLAM uncertainty with pose graph topology, which (1) facilitates more efficient evaluation of SLAM uncertainty than covariance inference, and (2) allows the application of approximation algorithms in submodular optimization to provide optimality guarantees. We further introduce the ordering heuristics to improve objective values while preserving the optimality bound. Simulation experiments over randomly generated graph environments verify the efficiency of our methods in finding paths for quick coverage and enhanced pose graph reliability, and benchmark the performance of the approximation algorithms and the greedy-based algorithm in the loop edge selection problem. Our implementations will be open-source at https://github.com/bairuofei/CGE., Comment: 9 pages, 13 figures, accepted by IEEE/RSJ IROS(2024)

A quasi-local mass, typically defined as an integral over a spacelike $2$-surface $\Sigma$, should encode information about the gravitational field within a finite, extended region bounded by $\Sigma$. Therefore, in attempts to quantize gravity, one may consider an infinite dimensional space of $2$-surfaces instead of an infinite dimensional space of $4$-dimensional Lorentzian spacetimes. However, existing definitions for quasilocal mass only applies to surfaces outside an horizon whose mean curvature vector is spacelike. In this paper, we propose an extension of the Wang-Yau quasi-local energy/mass to surfaces with timelike mean curvature vector, including in particular trapped surfaces. We adopt the same canonical gauge as in the Wang-Yau quasi-local energy but allow the pulled back "killing vector" to the physical spacetime to be spacelike. We define the new quasi-local energy along the Hamiltonian formulation of the Wang-Yau quasi-local energy. The new definition yields a positive definite surface energy density and a new divergence free current. Calculations for coordinate spheres in Kerr family spacetime are shown. In the spherical symmetric case, our definition reduces to a previous definition \cite{lundgren2007self}.

This paper is the second in a series of works dedicated to studying non-linear partial differential equations via derived geometric methods. We study a natural derived enhancement of the de Rham complex of a non-linear PDE via algebro-geometric techniques and examine its consequences for the functional differential calculus on the space of solutions. Applications to the BV-formalism with and without boundary conditions are discussed., Comment: 59 pages