Search

Long-range magnetic ordering of the orbital motion of oxygen atoms within NO$_3$$^-$ cations is identified from experimental measurements of the magnetic susceptibility $\chi$($T$) in LiNO$_3$, Ca(NO$_3$)$_2$, K$_{0.5}$Rb$_{0.5}$NO$_3$ and C(NH$_2$)$_3$NO$_3$ at their respective order-disorder, solid-solid phase transitions $T$$_N$. The observed sharp changes in $\chi$($T$) and accompanying hysteretic behavior indicate the phase transitions to be first order. A model employing the law of conservation of angular momentum is used to explain why the librations between neighboring NO$_3$$^-$ become geared below $T$$_N$. Since the periodic motions involve concerted motion of net charges, the associated magnetic moments of the NO$_3$$^-$ ions indirectly establish an antiferromagnetic structure below $T$$_N$. Our findings identify a previously unidentified type of molecular interaction which may be exploited to further increase the enthalpy of the widely-popular hydrated salts employed as energy storage devices., Comment: 13 pages (single column, 1.5 spaced), 5 figures

Unlike non-volatile memory that resides on the processor memory bus, memory-semantic solid-state drives (SSDs) support both byte and block access granularity via PCIe or CXL interconnects. They provide scalable memory capacity using NAND flash at a much lower cost. In addition, they have different performance characteristics for their dual byte/block interface respectively, while offering essential memory semantics for upper-level software. Such a byte-accessible storage device provides new implications on the software system design. In this paper, we develop a new file system, named ByteFS, by rethinking the design primitives of file systems and SSD firmware to exploit the advantages of both byte and block-granular data accesses. ByteFS supports byte-granular data persistence to retain the persistence nature of SSDs. It extends the core data structure of file systems by enabling dual byte/block-granular data accesses. To facilitate the support for byte-granular writes, \pname{} manages the internal DRAM of SSD firmware in a log-structured manner and enables data coalescing to reduce the unnecessary I/O traffic to flash chips. ByteFS also enables coordinated data caching between the host page cache and SSD cache for best utilizing the precious memory resource. We implement ByteFS on both a real programmable SSD and an emulated memory-semantic SSD for sensitivity study. Compared to state-of-the-art file systems for non-volatile memory and conventional SSDs, ByteFS outperforms them by up to 2.7$\times$, while preserving the essential properties of a file system. ByteFS also reduces the write traffic to SSDs by up to 5.1$\times$ by alleviating unnecessary writes caused by both metadata and data updates in file systems., Comment: This paper is accepted at the 30th Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2025)

This paper studies an optimal insurance problem for a utility-maximizing buyer of insurance, subject to the seller's endogenous default and background risk. An endogenous default occurs when the buyer's contractual indemnity exceeds the seller's available reserve, which is random due to the background risk. We obtain an analytical solution to the optimal contract for two types of contracts, differentiated by whether their indemnity functions depend on the seller's background risk. The results shed light on the joint effect of the seller's default and background risk on the buyer's insurance demand.

In tenure decisions, the treatment of co-authored papers often raises questions about a candidate's research independence. This study examines the effects of solo versus collaborative authorship in high-profile Economics journals on long-term academic success. Our findings confirms the traditional belief that solo-authored publications significantly enhance long-term research output and citation impact compared to collaborative efforts. However, relative to solo-authored papers, international collaborations have a less negative impact on long-term success than national and institutional collaborations. Temporal trends highlight the increasing importance of diverse and international collaborations. These insights provide actionable guidance for tenure committees on evaluating co-authored work and for researchers on optimizing their publication strategies., Comment: 13 pages, including 1 table and references

Graph Neural Networks (GNNs) are the mainstream method to learn pervasive graph data and are widely deployed in industry, making their intellectual property valuable. However, protecting GNNs from unauthorized use remains a challenge. Watermarking, which embeds ownership information into a model, is a potential solution. However, existing watermarking methods have two key limitations: First, almost all of them focus on non-graph data, with watermarking GNNs for complex graph data largely unexplored. Second, the de facto backdoor-based watermarking methods pollute training data and induce ownership ambiguity through intentional misclassification. Our explanation-based watermarking inherits the strengths of backdoor-based methods (e.g., robust to watermark removal attacks), but avoids data pollution and eliminates intentional misclassification. In particular, our method learns to embed the watermark in GNN explanations such that this unique watermark is statistically distinct from other potential solutions, and ownership claims must show statistical significance to be verified. We theoretically prove that, even with full knowledge of our method, locating the watermark is an NP-hard problem. Empirically, our method manifests robustness to removal attacks like fine-tuning and pruning. By addressing these challenges, our approach marks a significant advancement in protecting GNN intellectual property.

Swift discovery of spin-crossover materials for their potential application in quantum information devices requires techniques which enable efficient identification of suitably bistable candidates. To this end, we screened the Cambridge Structural Database to develop a specialized database of 1,439 materials and computed spin-switching energies from density functional theory for each material. The database was used to train an equivariant graph convolutional neural network to predict the magnitude of the spin-conversion energy. A test mean absolute error was 360 meV. For candidate identification, we equipped the system with a relevance-based classifier. This approach leads to a nearly four-fold improvement in identifying potential spin-crossover systems of interest as compared to conventional high-throughput screening.

We present high-resolution e-MERLIN and EVN (e-VLBI) observations of a radio source associated with Dyson Sphere candidate G, identified as part of Project Hephaistos. The radio source, VLASS J233532.86-000424.9, is resolved into 3 compact components and shows the typical characteristics of a radio-loud AGN. In particular, the EVN observations show that it has a brightness temperature in excess of $10^{8}$~K. No radio emission is detected at the position of the M-dwarf star. This result confirms our earlier hypothesis, that at least some of the Dyson Sphere candidates of project Hephaistos are contaminated by obscured, background AGN, lying close to the line of sight of otherwise normal galactic stars. High-resolution radio observations of other Dyson Sphere candidates can be useful in distinguishing truly promising candidates from those contaminated by background sources., Comment: 6 pages, 2 figures, 3 tables, accepted by MNRAS Letters

It is crucial for large language models (LLMs) to follow instructions that involve multiple constraints. However, soft constraints are semantically related and difficult to verify through automated methods. These constraints remain a significant challenge for LLMs. To enhance the ability of LLMs to follow soft constraints, we initially design a pipeline to obtain high-quality outputs automatically. Additionally, to fully utilize the acquired data, we introduce a training paradigm based on curriculum learning. We experimentally evaluate the effectiveness of our methods in improving LLMs' soft constraint following ability and analyze the factors driving the improvements. The datasets and code are publicly available at https://github.com/Rainier-rq/FollowSoftConstraints.

We propose adiabatic pumping of orbital magnetization driven by coherent spin precession, facilitating the rectification of this precession. The orbital magnetization originates from the adiabatic evolution of valence electrons with a topological bulk contribution expressed as a Chern-Simons form. When the precession cone angle of spin $\mathbf{S}$ is small, the resulting magnetization is proportional to $\mathbf{S}\times \dot{\mathbf{S}}$, contributing to the magnon Zeeman effect. With a large cone angle, the magnetization can reach its natural unit, $e/T$, in an antiferromagnetic topological insulator with $e$ as the elementary charge and $T$ as the precession period. This significant magnetization is related to the global properties of the electronic geometric phases in the parameter space spanned by $\mathbf{S}$ and momentum $\mathbf{k}$. When the pumped magnetization is inhomogeneous, induced by spin textures or electronic topological phase domains, a dissipationless charge current is also pumped. At last, we discuss the boundary contributions from the spin-driving edge states, which are intricately linked to the gauge-dependent quantum uncertainty of the Chern-Simons form., Comment: 7 pages, 3 figures, comments are welcome

We present a detailed analysis of the long-duration GRB 241030A detected by {\it Swift}. Thanks to the rapid response of XRT and UVOT, the strongest part of the prompt emission of GRB 241030A has been well measured simultaneously from optical to hard X-ray band. The time-resolved WHITE band emission shows strong variability, largely tracing the activity of the prompt gamma-ray emission, may be produced by internal shocks too. The joint analysis of the XRT and BAT data reveals the presence of a thermal component with a temperature of a few keV, which can be interpreted as the photosphere radiation, and the upper limit of the Lorentz factor of this region is found to range between approximately 20 and 80. The time-resolved analysis of the initial U-band exposure data yields a very rapid rise ($ \sim t^{5.3}$) with a bright peak reaching 13.6 AB magnitude around 410 seconds, which is most likely attributed to the onset of the external shock emission. The richness and fineness of early observational data have made this burst a unique sample for studying the various radiation mechanisms of gamma-ray bursts.

We search for the leptonic decay $D^+\to e^+\nu_{e}$ using an $e^+e^-$ collision data sample with an integrated luminosity of 20.3~fb$^{-1}$ collected with the BESIII detector at the center-of-mass energy of 3.773~GeV. No significant signal is observed and an upper limit on the branching fraction of $D^+\to e^+\nu_{e}$ is set as $9.7 \times 10^{-7}$, at the 90\% confidence level. Our upper limit is an order of magnitude smaller than the previous limit for this decay mode.

The convergence of drone delivery systems, virtual worlds, and blockchain has transformed logistics and supply chain management, providing a fast, and environmentally friendly alternative to traditional ground transportation methods;Provide users with a real-world experience, virtual service providers need to collect up-to-the-minute delivery information from edge devices. To address this challenge, 1) a reinforcement learning approach is introduced to enable drones with fast training capabilities and the ability to autonomously adapt to new virtual scenarios for effective resource allocation.2) A semantic communication framework for meta-universes is proposed, which utilizes the extraction of semantic information to reduce the communication cost and incentivize the transmission of information for meta-universe services.3) In order to ensure that user information security, a lightweight authentication and key agreement scheme is designed between the drone and the user by introducing blockchain technology. In our experiments, the drone adaptation performance is improved by about 35\%, and the local offloading rate can reach 90\% with the increase of the number of base stations. The semantic communication system proposed in this paper is compared with the Cross Entropy baseline model. Introducing blockchain technology the throughput of the transaction is maintained at a stable value with different number of drones.

We present the first amplitude analysis and branching fraction measurement of the decay $D^+_s\to \pi^+\pi^+\pi^-\pi^0\pi^0$, using $e^+e^-$ collision data collected with the BESIII detector at center-of-mass energies between 4.128 and 4.226 GeV corresponding to an integrated luminosity of 7.33 fb$^{-1}$, and report the first observation of the pure $W$-annihilation decay $D_s^+ \to \omega\rho^+$ with a branching fraction of $(0.99\pm0.08_{\rm stat}\pm0.07_{\rm syst})\%$. In comparison to the low significance of the $\mathcal{D}$ wave in the decay $D_s^+ \to \phi\rho^+$, the dominance of the $\mathcal{D}$ wave over the $\mathcal{S}$ and $\mathcal{P}$ waves, with a fraction of $(51.85\pm7.28_{\rm stat}\pm7.90_{\rm syst})\%$ observed in the decay, provides crucial information for the``polarization puzzle", as well as for the understanding of charm meson decays. The branching fraction of $D^+_s\to \pi^+\pi^+\pi^-\pi^0\pi^0$ is measured to be $(4.41\pm0.15_{\rm stat}\pm0.13_{\rm syst})\%$. Moreover, the branching fraction of $D_s^+ \to \phi\rho^+$ is measured to be $(3.98\pm0.33_{\rm stat}\pm0.21_{\rm syst})\%$, and the $R_{\phi}= {\mathcal{B}(\phi\to\pi^+\pi^-\pi^0)}/{\mathcal{B}(\phi\to K^+K^-)}$ is determined to be $(0.222\pm0.019_{\rm stat}\pm0.016_{\rm syst}$), which is consistent with the previous measurement based on charm meson decays, but deviates from the results from $e^+e^-$ annihilation and $K$-$N$ scattering experiments by more than 3$\sigma$.

We study the electromagnetic Dalitz decay $J/\psi \to e^+e^- \pi^0$ using $(10087 \pm 44) \times 10^6$ $J/\psi$ events collected by the \bes detector. The di-electron-invariant-mass dependent transition form factor of this decay is explored for the first time. A significant resonant structure corresponding to the $\rho/\omega$ resonance is observed, which cannot be described by existing theoretical models, due to contributions from the isospin-conserving $J/\psi \to \rho \pi^0$ and isospin-volating $J/\psi \to \omega \pi^0$ decays. The observed $\rho$--$\omega$ interference is consistent with that of the pion form factor but features a relatively narrow $\rho$ peak. By taking into account the contribution of this resonant structure, the branching fraction of $J/\psi \to e^+e^- \pi^0$ in the full $e^+e^-$ invariant mass spectrum range is also measured for the first time to be $(8.06 \pm 0.31 (\rm{stat}) \pm 0.38 (\rm{syst}))\times 10^{-7}$, which is two times larger than the prediction of the Vector Meson Dominance model due to the observed resonant contribution of $\rho/\omega$ resonances., Comment: 9 pages, 4 figures, Submitted to Phys. Rev. Lett

Along with the proliferating research interest in Semantic Communication (SemCom), Joint Source Channel Coding (JSCC) has dominated the attention due to the widely assumed existence in efficiently delivering information semantics. %has emerged as a pivotal area of research, aiming to enhance the efficiency and reliability of information transmission through deep learning-based methods. Nevertheless, this paper challenges the conventional JSCC paradigm, and advocates for adoption of Separate Source Channel Coding (SSCC) to enjoy the underlying more degree of freedom for optimization. We demonstrate that SSCC, after leveraging the strengths of Large Language Model (LLM) for source coding and Error Correction Code Transformer (ECCT) complemented for channel decoding, offers superior performance over JSCC. Our proposed framework also effectively highlights the compatibility challenges between SemCom approaches and digital communication systems, particularly concerning the resource costs associated with the transmission of high precision floating point numbers. Through comprehensive evaluations, we establish that empowered by LLM-based compression and ECCT-enhanced error correction, SSCC remains a viable and effective solution for modern communication systems. In other words, separate source and channel coding is still what we need!

This work thoroughly examines several analytical tools, each possessing a different level of mathematical intricacy, for the purpose of characterizing the orientation distribution function of elongated objects under flow. Our investigation places an emphasis on connecting the orientation distribution to the small angle scattering spectra measured experimentally. The diverse range of mathematical approaches investigated herein provides insights into the flow behavior of elongated particles from different perspectives and serves as powerful tools for elucidating the complex interplay between flow dynamics and the orientation distribution function.

Mixture-of-Expert (MoE) models outperform conventional models by selectively activating different subnets, named \emph{experts}, on a per-token basis. This gated computation generates dynamic communications that cannot be determined beforehand, challenging the existing GPU interconnects that remain \emph{static} during the distributed training process. In this paper, we advocate for a first-of-its-kind system, called mFabric, that unlocks topology reconfiguration \emph{during} distributed MoE training. Towards this vision, we first perform a production measurement study and show that the MoE dynamic communication pattern has \emph{strong locality}, alleviating the requirement of global reconfiguration. Based on this, we design and implement a \emph{regionally reconfigurable high-bandwidth domain} on top of existing electrical interconnects using optical circuit switching (OCS), achieving scalability while maintaining rapid adaptability. We have built a fully functional mFabric prototype with commodity hardware and a customized collective communication runtime that trains state-of-the-art MoE models with \emph{in-training} topology reconfiguration across 32 A100 GPUs. Large-scale packet-level simulations show that mFabric delivers comparable performance as the non-blocking fat-tree fabric while boosting the training cost efficiency (e.g., performance per dollar) of four representative MoE models by 1.2$\times$--1.5$\times$ and 1.9$\times$--2.3$\times$ at 100 Gbps and 400 Gbps link bandwidths, respectively., Comment: Corresponding authors: zhizhenz@mit.edu (Z. Zhong), kaichen@cse.ust.hk (K. Chen)

Carnot famously showed that engine operation is chiefly characterised by the magnitude of the temperature ratio $T_\mathrm{h}/T_\mathrm{c}$ between its hot and cold reservoirs. While temperature ratios ranging between $1.3-2.8$ and $2-10$ are common in macroscopic commercial engines and engines operating in the microscopic regime, respectively, the quest is to test thermodynamics at its extremes. Here we present the hottest engine on earth, with temperature ratios as high as $110$. We achieve this by realising an underdamped single-particle engine using a charged microparticle that is electrically levitated under vacuum conditions. Noisy electric fields are used to synthesise reservoir temperatures in excess of $10^7$ K. As a result, giant fluctuations show up in all thermodynamic quantities of the engine, such as heat exchange and efficiency. Moreover, we find that the particle experiences an effective position dependent temperature, which gives rise to dynamics that drastically deviates from that of standard Brownian motion. We develop a theoretical model accounting for the effects of this multiplicative noise and find excellent agreement with the measured dynamics. The high level of control over the presented experimental platform opens the door to emulate the stochastic dynamics of cellular and biological processes, and provides thermodynamic insight required for the development of nanotechnologies.

Physical AI needs to be trained digitally first. It needs a digital twin of itself, the policy model, and a digital twin of the world, the world model. In this paper, we present the Cosmos World Foundation Model Platform to help developers build customized world models for their Physical AI setups. We position a world foundation model as a general-purpose world model that can be fine-tuned into customized world models for downstream applications. Our platform covers a video curation pipeline, pre-trained world foundation models, examples of post-training of pre-trained world foundation models, and video tokenizers. To help Physical AI builders solve the most critical problems of our society, we make our platform open-source and our models open-weight with permissive licenses available via https://github.com/NVIDIA/Cosmos.

Tabular data remains one of the most prevalent data types across a wide range of real-world applications, yet effective representation learning for this domain poses unique challenges due to its irregular patterns, heterogeneous feature distributions, and complex inter-column dependencies. This survey provides a comprehensive review of state-of-the-art techniques in tabular data representation learning, structured around three foundational design elements: training data, neural architectures, and learning objectives. Unlike prior surveys that focus primarily on either architecture design or learning strategies, we adopt a holistic perspective that emphasizes the universality and robustness of representation learning methods across diverse downstream tasks. We examine recent advances in data augmentation and generation, specialized neural network architectures tailored to tabular data, and innovative learning objectives that enhance representation quality. Additionally, we highlight the growing influence of self-supervised learning and the adaptation of transformer-based foundation models for tabular data. Our review is based on a systematic literature search using rigorous inclusion criteria, encompassing 127 papers published since 2020 in top-tier conferences and journals. Through detailed analysis and comparison, we identify emerging trends, critical gaps, and promising directions for future research, aiming to guide the development of more generalizable and effective tabular data representation methods.

Recent advancements in LiDAR-Inertial Odometry (LIO) have boosted a large amount of applications. However, traditional LIO systems tend to focus more on localization rather than mapping, with maps consisting mostly of sparse geometric elements, which is not ideal for downstream tasks. Recent emerging neural field technology has great potential in dense mapping, but pure LiDAR mapping is difficult to work on high-dynamic vehicles. To mitigate this challenge, we present a new solution that tightly couples geometric kinematics with neural fields to enhance simultaneous state estimation and dense mapping capabilities. We propose both semi-coupled and tightly coupled Kinematic-Neural LIO (KN-LIO) systems that leverage online SDF decoding and iterated error-state Kalman filtering to fuse laser and inertial data. Our KN-LIO minimizes information loss and improves accuracy in state estimation, while also accommodating asynchronous multi-LiDAR inputs. Evaluations on diverse high-dynamic datasets demonstrate that our KN-LIO achieves performance on par with or superior to existing state-of-the-art solutions in pose estimation and offers improved dense mapping accuracy over pure LiDAR-based methods. The relevant code and datasets will be made available at https://**.

Let $\gf_{p^n}$ denote the finite field containing $p^n$ elements, where $n$ is a positive integer and $p$ is a prime. The function $f_u(x)=x^{\frac{p^n+3}{2}}+ux^2$ over $\gf_{p^n}[x]$ with $u\in\gf_{p^n}\setminus\{0,\pm1\}$ was recently studied by Budaghyan and Pal in \cite{Budaghyan2024ArithmetizationorientedAP}, whose differential uniformity is at most $5$ when $p^n\equiv3~(mod~4)$. In this paper, we study the differential uniformity and the differential spectrum of $f_u$ for $u=\pm1$. We first give some properties of the differential spectrum of any cryptographic function. Moreover, by solving some systems of equations over finite fields, we express the differential spectrum of $f_{\pm1}$ in terms of the quadratic character sums., Comment: arXiv admin note: text overlap with arXiv:2409.03189

Dataset distillation is an effective technique for reducing the cost and complexity of model training while maintaining performance by compressing large datasets into smaller, more efficient versions. In this paper, we present a novel generative dataset distillation method that can improve the accuracy of aligning prediction logits. Our approach integrates self-knowledge distillation to achieve more precise distribution matching between the synthetic and original data, thereby capturing the overall structure and relationships within the data. To further improve the accuracy of alignment, we introduce a standardization step on the logits before performing distribution matching, ensuring consistency in the range of logits. Through extensive experiments, we demonstrate that our method outperforms existing state-of-the-art methods, resulting in superior distillation performance., Comment: Accepted by ICASSP 2025

1. An understanding of how biodiversity confers ecosystem stability is crucial in managing ecosystems under major environmental changes. Multiple biodiversity drivers can stabilize ecosystem functions over time. However, we know little about how local environmental conditions can influence these biodiversity drivers, and consequently how they indirectly shape the ecological stability of ecosystems. 2. We hypothesized that environmental factors can have opposite influences (i.e., not necessarily either positive or negative) on the temporal stability of communities in different environmental ranges depending on the biodiversity drivers involved. We tested this novel hypothesis by using data from a 4-year-long field study of submerged macrophyte across a water depth gradient in 8 heterogeneous bays of Erhai lake (with total sample size of 30,071 quadrats), a large lentic system in China. 3. Results indicate that a unimodal pattern of stability in temporal biomass measurements occurred along the water-depth gradient, and that multiple biodiversity drivers (the asynchrony in species dynamics, and the stability of dominant species) generally increased the temporal stability of aquatic primary producers. However, the effect of water depth either increased or decreased the stability of biomass according to the environmental conditions associated with sites along the water depth gradient. 4. Synthesis. These results reveal the influence of local environmental conditions on the biodiversity drivers of stability may help predict the functional consequences of biodiversity change across different scenarios of environmental change.

Reconfigurable battery systems (RBSs) are emerging as a promising solution to improving fault tolerance, charge and thermal balance, energy delivery, etc. To optimize these performance metrics, high-dimensional nonlinear integer programming problems need to be formulated and solved. During this process, it is necessary to address multiple challenges stemming from nonlinear battery characteristics, discrete switch states, dynamic system configurations, as well as the curse of dimensionality inherent in large-scale systems. Thus, we propose a unified modeling framework to accommodate various potential configurations of an RBS and even to cover different RBS designs, significantly facilitating the topology design and optimization problem formulation for RBSs. Moreover, to solve the formulated RBS problems, the search space is tailored to encompass only feasible SSVs, thereby ensuring safe system operation while substantially curtailing search efforts. These proposed methods, focusing on unifying the system modeling and narrowing the search space, lay a solid foundation for effectively formulating and efficiently solving RBS optimal control problems. The accuracy and effectiveness of the proposed methods are demonstrated by simulation and experimental tests.

Reorienting polyatomic ions such as NH4+ and NO3- exhibit weak magnetic fields because the ions at the extremities trace out current loops; if the periodic reorientations become long-range ordered (i.e. gearing of neighboring NO3-), then the magnetic susceptibility should exhibit a unique signature along the different crystallographic axes. For the case of ammonium nitrate NH4NO3, we report the presence of two successive sharp steps in the molar magnetic susceptibility along the a- and b-axes upon crossing its order-disorder phase transition (from phase IV to phase II). We suggest the first step pertains to the NO3- planes shifting away from facing only along the b-axis and onto the a-axis by 45{\deg}. The second step is attributed to the disordering (ungearing) of the NH4+ and NO3-. In contrast, only one step was observed in the magnetic susceptibility along the c-axis and its large magnitude suggest the NO3- remain weakly correlated even in phase I at 400 K. We also find evidence that the NH4+ become magnetically ordered (geared) along the c-axis only until phase V. The approach employed in this work can be extended to experimentally study the lattice dynamics of other solids possessing planar ions such as amphidynamic crystals., Comment: 13 pages (single column), 4 figures

Recent researches of large language models(LLM), which is pre-trained on massive general-purpose corpora, have achieved breakthroughs in responding human queries. However, these methods face challenges including limited data insufficiency to support extensive pre-training and can not align responses with users' instructions. To address these issues, we introduce a medical instruction dataset, CMedINS, containing six medical instructions derived from actual medical tasks, which effectively fine-tunes LLM in conjunction with other data. Subsequently, We launch our medical model, IIMedGPT, employing an efficient preference alignment method, Direct preference Optimization(DPO). The results show that our final model outperforms existing medical models in medical dialogue.Datsets, Code and model checkpoints will be released upon acceptance.

Navigating mobile User Interface (UI) applications using large language and vision models based on high-level goal instructions is emerging as an important research field with significant practical implications, such as digital assistants and automated UI testing. To evaluate the effectiveness of existing models in mobile UI navigation, benchmarks are required and widely used in the literature. Although multiple benchmarks have been recently established for evaluating functional correctness being judged as pass or fail, they fail to address the need for multi-dimensional evaluation of the entire UI navigation process. Furthermore, other exiting related datasets lack an automated and robust benchmarking suite, making the evaluation process labor-intensive and error-prone. To address these issues, in this paper, we propose a new benchmark named Sphinx for multi-dimensional evaluation of existing models in practical UI navigation. Sphinx provides a fully automated benchmarking suite that enables reproducibility across real-world mobile apps and employs reliable evaluators to assess model progress. In addition to functional correctness, Sphinx includes comprehensive toolkits for multi-dimensional evaluation, such as invariant-based verification, knowledge probing, and knowledge-augmented generation to evaluate model capabilities including goal understanding, knowledge and planning, grounding, and instruction following, ensuring a thorough assessment of each sub-process in mobile UI navigation. We benchmark 8 large language and multi-modal models with 13 different configurations on Sphinx. Evaluation results show that all these models struggle on Sphinx, and fail on all test generation tasks. Our further analysis of the multi-dimensional evaluation results underscores the current progress and highlights future research directions to improve a model's effectiveness for mobile UI navigation.

To accommodate the increasing communication needs in non-terrestrial networks (NTNs), wireless users in remote areas may require access to more spectrum than is currently allocated. Terrestrial networks (TNs), such as cellular networks, are deployed in specific areas, but many underused licensed spectrum bands remain in remote areas. Therefore, bringing NTNs to a shared spectrum with TNs can improve network capacity under reasonable interference management. However, in satellite-terrestrial integrated networks (STINs), the comprehensive coverage of a satellite and the unbalanced communication resources of STINs make it challenging to effectively manage mutual interference between NTN and TN. This article presents the fundamentals and prospects of spectrum sharing (SS) in STINs by introducing four SS frameworks, their potential application scenarios, and technical challenges. Furthermore, advanced SS approaches related to interference management in STINs and performance metrics of SS in STINs are introduced. Moreover, a preliminary performance evaluation showcases the potential for sharing the spectrum between NTN and TN. Finally, future research opportunities for SS in STINs are discussed.

We introduce a powerful and non-random methodology for novelty detection, offering distribution-free false discovery rate (FDR) control guarantees. Building on the full-conformal inference framework and the concept of e-values, we introduce full-conformal e-values to quantify evidence for novelty relative to a given reference dataset. These e-values are then utilized by carefully crafted multiple testing procedures to identify a set of novel units out-of-sample with provable finite-sample FDR control. Furthermore, our method is extended to address distribution shift, accommodating scenarios where novelty detection must be performed on data drawn from a shifted distribution relative to the reference dataset. In all settings, our method is non-random and can perform powerfully with limited amounts of reference data. Empirical evaluations on synthetic and real-world datasets demonstrate that our approach significantly outperforms existing methods for novelty detection.

Based on $(2712.4 \pm 14.3)\times 10^6$ $\psi(3686)$ events collected at the BESIII detector operating at the BEPCII collider, we present the first observation of the decay $\psi(3686) \to K^{-}\Lambda(1520)\bar{\Xi}^{+} + c.c.$. The product branching fraction ${\cal B}[\psi(3686) \to K^{-}\Lambda(1520)\bar{\Xi}^{+} + c.c.] \times {\cal B}[\Lambda(1520) \to pK^{-}]$ is measured to be $(9.5 \pm 0.8 \pm 1.1) \times 10^{-7}$, where the first uncertainty is statistical and the second systematic.

Distribution-free predictive inference beyond the construction of prediction sets has gained a lot of interest in recent applications. One such application is the selection task, where the objective is to design a reliable selection rule to pick out individuals with desired unobserved outcomes while controlling the error rate. In this work, we address the selection problem in the context of hierarchical data, where groups of observations may exhibit distinct within-group distributions. This generalizes existing techniques beyond the standard i.i.d./exchangeable data settings. As a correction, For hierarchical data, we introduce methods to construct valid conformal e-values, enabling control of the false discovery rate (FDR) through the e-BH procedure. In particular, we introduce and compare two approaches -- subsampling conformal e-values and hierarchical conformal e-values. Empirical results demonstrate that both approaches achieve valid FDR control while highlighting a tradeoff between stability and power. The subsampling-based method, though random, typically offers higher power, whereas the hierarchical approach, being deterministic, tends to be slightly less powerful. The effectiveness of the proposed methods is illustrated in two real-world applications.

Facial attractiveness prediction (FAP) has long been an important computer vision task, which could be widely applied in live streaming for facial retouching, content recommendation, etc. However, previous FAP datasets are either small, closed-source, or lack diversity. Moreover, the corresponding FAP models exhibit limited generalization and adaptation ability. To overcome these limitations, in this paper we present LiveBeauty, the first large-scale live-specific FAP dataset, in a more challenging application scenario, i.e., live streaming. 10,000 face images are collected from a live streaming platform directly, with 200,000 corresponding attractiveness annotations obtained from a well-devised subjective experiment, making LiveBeauty the largest open-access FAP dataset in the challenging live scenario. Furthermore, a multi-modal FAP method is proposed to measure the facial attractiveness in live streaming. Specifically, we first extract holistic facial prior knowledge and multi-modal aesthetic semantic features via a Personalized Attractiveness Prior Module (PAPM) and a Multi-modal Attractiveness Encoder Module (MAEM), respectively, then integrate the extracted features through a Cross-Modal Fusion Module (CMFM). Extensive experiments conducted on both LiveBeauty and other open-source FAP datasets demonstrate that our proposed method achieves state-of-the-art performance. Dataset will be available soon.

While recent depth estimation methods exhibit strong zero-shot generalization, achieving accurate metric depth across diverse camera types-particularly those with large fields of view (FoV) such as fisheye and 360-degree cameras-remains a significant challenge. This paper presents Depth Any Camera (DAC), a powerful zero-shot metric depth estimation framework that extends a perspective-trained model to effectively handle cameras with varying FoVs. The framework is designed to ensure that all existing 3D data can be leveraged, regardless of the specific camera types used in new applications. Remarkably, DAC is trained exclusively on perspective images but generalizes seamlessly to fisheye and 360-degree cameras without the need for specialized training data. DAC employs Equi-Rectangular Projection (ERP) as a unified image representation, enabling consistent processing of images with diverse FoVs. Its key components include a pitch-aware Image-to-ERP conversion for efficient online augmentation in ERP space, a FoV alignment operation to support effective training across a wide range of FoVs, and multi-resolution data augmentation to address resolution disparities between training and testing. DAC achieves state-of-the-art zero-shot metric depth estimation, improving delta-1 ($\delta_1$) accuracy by up to 50% on multiple fisheye and 360-degree datasets compared to prior metric depth foundation models, demonstrating robust generalization across camera types.

Artificial intelligence has achieved notable results in sign language recognition and translation. However, relatively few efforts have been made to significantly improve the quality of life for the 72 million hearing-impaired people worldwide. Sign language translation models, relying on video inputs, involves with large parameter sizes, making it time-consuming and computationally intensive to be deployed. This directly contributes to the scarcity of human-centered technology in this field. Additionally, the lack of datasets in sign language translation hampers research progress in this area. To address these, we first propose a cross-modal multi-knowledge distillation technique from 3D to 1D and a novel end-to-end pre-training text correction framework. Compared to other pre-trained models, our framework achieves significant advancements in correcting text output errors. Our model achieves a decrease in Word Error Rate (WER) of at least 1.4% on PHOENIX14 and PHOENIX14T datasets compared to the state-of-the-art CorrNet. Additionally, the TensorFlow Lite (TFLite) quantized model size is reduced to 12.93 MB, making it the smallest, fastest, and most accurate model to date. We have also collected and released extensive Chinese sign language datasets, and developed a specialized training vocabulary. To address the lack of research on data augmentation for landmark data, we have designed comparative experiments on various augmentation methods. Moreover, we performed a simulated deployment and prediction of our model on Intel platform CPUs and assessed the feasibility of deploying the model on other platforms., Comment: AAAI 2025

We study the finite basis problem for $4$-element additively idempotent semirings whose additive reducts are quasi-antichains. Up to isomorphism, there are $93$ such algebras. We show that with the exception of the semiring $S_{(4, 435)}$, all of them are finitely based.

Quaternionic signal processing provides powerful tools for efficiently managing color signals by preserving the intrinsic correlations among signal dimensions through quaternion algebra. In this paper, we address the quaternionic phase retrieval problem by systematically developing novel algorithms based on an amplitude-based model. Specifically, we propose the Quaternionic Reweighted Amplitude Flow (QRAF) algorithm, which is further enhanced by three of its variants: incremental, accelerated, and adapted QRAF algorithms. In addition, we introduce the Quaternionic Perturbed Amplitude Flow (QPAF) algorithm, which has linear convergence. Extensive numerical experiments on both synthetic data and real images, demonstrate that our proposed methods significantly improve recovery performance and computational efficiency compared to state-of-the-art approaches.

LiDAR-based SLAM is recognized as one effective method to offer localization guidance in rough environments. However, off-the-shelf LiDAR-based SLAM methods suffer from significant pose estimation drifts, particularly components relevant to the vertical direction, when passing to uneven terrains. This deficiency typically leads to a conspicuously distorted global map. In this article, a LiDAR-based SLAM method is presented to improve the accuracy of pose estimations for ground vehicles in rough terrains, which is termed Rotation-Optimized LiDAR-Only (ROLO) SLAM. The method exploits a forward location prediction to coarsely eliminate the location difference of consecutive scans, thereby enabling separate and accurate determination of the location and orientation at the front-end. Furthermore, we adopt a parallel-capable spatial voxelization for correspondence-matching. We develop a spherical alignment-guided rotation registration within each voxel to estimate the rotation of vehicle. By incorporating geometric alignment, we introduce the motion constraint into the optimization formulation to enhance the rapid and effective estimation of LiDAR's translation. Subsequently, we extract several keyframes to construct the submap and exploit an alignment from the current scan to the submap for precise pose estimation. Meanwhile, a global-scale factor graph is established to aid in the reduction of cumulative errors. In various scenes, diverse experiments have been conducted to evaluate our method. The results demonstrate that ROLO-SLAM excels in pose estimation of ground vehicles and outperforms existing state-of-the-art LiDAR SLAM frameworks., Comment: This article has been accepted by Journal of Field Robotics

A search for $\eta_c(2S)\to p\bar{p}K^+K^-$, together with measurement of branching fractions of $\chi_{cJ(J=0,1,2)}\to p\bar{p}K^+K^-$ in the $\psi(3686) \to \gamma \eta_c(2S)$ and the $\psi(3686) \to \gamma \chi_{cJ}$ radiative decays, is performed with $(2712.4\pm14.3)\times 10^6$ $\psi(3686)$ events collected with the BESIII detector at the BEPCII collider. An evidence for $\eta_c(2S)\to p\bar{p}K^+K^-$ is found, with a significance of $3.3\sigma$. The product branching fraction of $\mathcal{B}[\psi(3686)\to\gamma\eta_c(2S)]\cdot\mathcal{B}[\eta_c(2S)\to p\bar{p}K^+K^-]$ is determined to be $(1.98\mkern 2mu\pm\mkern 2mu0.41_{\text{stat.}}\mkern 2mu\pm\mkern 2mu0.99_{\text{syst.}})\times 10^{-7}$. The product branching fractions of $\mathcal{B}[\psi(3686)\to\gamma\chi_{cJ}]\cdot\mathcal{B}[\chi_{cJ}\to p\bar{p}K^+K^-]$ are measured to be $(2.49\mkern 2mu\pm\mkern 2mu 0.03_{\text{stat.}}\mkern 2mu\pm\mkern 2mu 0.15_{\text{syst.}})\times 10^{-5}$, $(1.83\mkern 2mu \pm\mkern 2mu 0.02_{\text{stat.}}\mkern 2mu \pm\mkern 2mu 0.11_{\text{syst.}})\times 10^{-5}$, and $(2.43\mkern 2mu\pm\mkern 2mu 0.02_{\text{stat.}}\mkern 2mu\pm\mkern 2mu 0.15_{\text{syst.}})\times 10^{-5}$, for $J=0,\ 1$, and 2, respectively., Comment: 12 pages, 2 figures

Cross-modal hashing (CMH) has appeared as a popular technique for cross-modal retrieval due to its low storage cost and high computational efficiency in large-scale data. Most existing methods implicitly assume that multi-modal data is correctly labeled, which is expensive and even unattainable due to the inevitable imperfect annotations (i.e., noisy labels) in real-world scenarios. Inspired by human cognitive learning, a few methods introduce self-paced learning (SPL) to gradually train the model from easy to hard samples, which is often used to mitigate the effects of feature noise or outliers. It is a less-touched problem that how to utilize SPL to alleviate the misleading of noisy labels on the hash model. To tackle this problem, we propose a new cognitive cross-modal retrieval method called Robust Self-paced Hashing with Noisy Labels (RSHNL), which can mimic the human cognitive process to identify the noise while embracing robustness against noisy labels. Specifically, we first propose a contrastive hashing learning (CHL) scheme to improve multi-modal consistency, thereby reducing the inherent semantic gap. Afterward, we propose center aggregation learning (CAL) to mitigate the intra-class variations. Finally, we propose Noise-tolerance Self-paced Hashing (NSH) that dynamically estimates the learning difficulty for each instance and distinguishes noisy labels through the difficulty level. For all estimated clean pairs, we further adopt a self-paced regularizer to gradually learn hash codes from easy to hard. Extensive experiments demonstrate that the proposed RSHNL performs remarkably well over the state-of-the-art CMH methods., Comment: 9 pages, AAAI 25 conference

We introduce EnerVerse, a comprehensive framework for embodied future space generation specifically designed for robotic manipulation tasks. EnerVerse seamlessly integrates convolutional and bidirectional attention mechanisms for inner-chunk space modeling, ensuring low-level consistency and continuity. Recognizing the inherent redundancy in video data, we propose a sparse memory context combined with a chunkwise unidirectional generative paradigm to enable the generation of infinitely long sequences. To further augment robotic capabilities, we introduce the Free Anchor View (FAV) space, which provides flexible perspectives to enhance observation and analysis. The FAV space mitigates motion modeling ambiguity, removes physical constraints in confined environments, and significantly improves the robot's generalization and adaptability across various tasks and settings. To address the prohibitive costs and labor intensity of acquiring multi-camera observations, we present a data engine pipeline that integrates a generative model with 4D Gaussian Splatting (4DGS). This pipeline leverages the generative model's robust generalization capabilities and the spatial constraints provided by 4DGS, enabling an iterative enhancement of data quality and diversity, thus creating a data flywheel effect that effectively narrows the sim-to-real gap. Finally, our experiments demonstrate that the embodied future space generation prior substantially enhances policy predictive capabilities, resulting in improved overall performance, particularly in long-range robotic manipulation tasks., Comment: Website: https://sites.google.com/view/enerverse

Debris disks, which consist of dust, planetesimals, planets, and gas, offer a unique window into the mineralogical composition of their parent bodies, especially during the critical phase of terrestrial planet formation spanning 10 to a few hundred million years. Observations from the $\textit{Spitzer}$ Space Telescope have unveiled thousands of debris disks, yet systematic studies remain scarce, let alone those with unsupervised clustering techniques. This study introduces $\texttt{CLUES}$ (CLustering UnsupErvised with Sequencer), a novel, non-parametric, fully-interpretable machine-learning spectral analysis tool designed to analyze and classify the spectral data of debris disks. $\texttt{CLUES}$ combines multiple unsupervised clustering methods with multi-scale distance measures to discern new groupings and trends, offering insights into compositional diversity and geophysical processes within these disks. Our analysis allows us to explore a vast parameter space in debris disk mineralogy and also offers broader applications in fields such as protoplanetary disks and solar system objects. This paper details the methodology, implementation, and initial results of $\texttt{CLUES}$, setting the stage for more detailed follow-up studies focusing on debris disk mineralogy and demographics., Comment: 23 pages, 16 figures, Accepted to ApJS, $\texttt{CLUES}$ software available on GitHub

With the increasing code reasoning capabilities of existing large language models (LLMs) and breakthroughs in reasoning models like OpenAI o1 and o3, there is a growing need to develop more challenging and comprehensive benchmarks that effectively test their sophisticated competition-level coding abilities. Existing benchmarks, like LiveCodeBench and USACO, fall short due to the unavailability of private test cases, lack of support for special judges, and misaligned execution environments. To bridge this gap, we introduce CodeElo, a standardized competition-level code generation benchmark that effectively addresses all these challenges for the first time. CodeElo benchmark is mainly based on the official CodeForces platform and tries to align with the platform as much as possible. We compile the recent six months of contest problems on CodeForces with detailed information such as contest divisions, problem difficulty ratings, and problem algorithm tags. We introduce a unique judging method in which problems are submitted directly to the platform and develop a reliable Elo rating calculation system that aligns with the platform and is comparable with human participants but has lower variance. By testing on our CodeElo, we provide the Elo ratings of 30 existing popular open-source and 3 proprietary LLMs for the first time. The results show that o1-mini and QwQ-32B-Preview stand out significantly, achieving Elo ratings of 1578 and 1261, respectively, while other models struggle even with the easiest problems, placing in the lowest 25 percent among all human participants. Detailed analysis experiments are also conducted to provide insights into performance across algorithms and comparisons between using C++ and Python, which can suggest directions for future studies.

Privacy-preserving machine learning (PPML) enables clients to collaboratively train deep learning models without sharing private datasets, but faces privacy leakage risks due to gradient leakage attacks. Prevailing methods leverage secure aggregation strategies to enhance PPML, where clients leverage masks and secret sharing to further protect gradient data while tolerating participant dropouts. These methods, however, require frequent inter-client communication to negotiate keys and perform secret sharing, leading to substantial communication overhead. To tackle this issue, we propose NET-SA, an efficient secure aggregation architecture for PPML based on in-network computing. NET-SA employs seed homomorphic pseudorandom generators for local gradient masking and utilizes programmable switches for seed aggregation. Accurate and secure gradient aggregation is then performed on the central server based on masked gradients and aggregated seeds. This design effectively reduces communication overhead due to eliminating the communication-intensive phases of seed agreement and secret sharing, with enhanced dropout tolerance due to overcoming the threshold limit of secret sharing. Extensive experiments on server clusters and Intel Tofino programmable switch demonstrate that NET-SA achieves up to 77x and 12x enhancements in runtime and 2x decrease in total client communication cost compared with state-of-the-art methods., Comment: 10 pages, 8 figures, 3 tables

AI agents have become increasingly prevalent in recent years, driven by significant advancements in the field of large language models (LLMs). Mobile GUI agents, a subset of AI agents, are designed to autonomously perform tasks on mobile devices. While numerous studies have introduced agents, datasets, and benchmarks to advance mobile GUI agent research, many existing datasets focus on static frame evaluations and fail to provide a comprehensive platform for assessing performance on real-world, in-the-wild tasks. To address this gap, we present Android Agent Arena (A3), a novel evaluation platform. Unlike existing in-the-wild systems, A3 offers: (1) meaningful and practical tasks, such as real-time online information retrieval and operational instructions; (2) a larger, more flexible action space, enabling compatibility with agents trained on any dataset; and (3) automated business-level LLM-based evaluation process. A3 includes 21 widely used general third-party apps and 201 tasks representative of common user scenarios, providing a robust foundation for evaluating mobile GUI agents in real-world situations and a new autonomous evaluation process for less human labor and coding expertise. The project is available at \url{https://yuxiangchai.github.io/Android-Agent-Arena/}.

Semi-supervised domain adaptation (SSDA) has been extensively researched due to its ability to improve classification performance and generalization ability of models by using a small amount of labeled data on the target domain. However, existing methods cannot effectively adapt to the target domain due to difficulty in fully learning rich and complex target semantic information and relationships. In this paper, we propose a novel SSDA learning framework called semantic regularization learning (SERL), which captures the target semantic information from multiple perspectives of regularization learning to achieve adaptive fine-tuning of the source pre-trained model on the target domain. SERL includes three robust semantic regularization techniques. Firstly, semantic probability contrastive regularization (SPCR) helps the model learn more discriminative feature representations from a probabilistic perspective, using semantic information on the target domain to understand the similarities and differences between samples. Additionally, adaptive weights in SPCR can help the model learn the semantic distribution correctly through the probabilities of different samples. To further comprehensively understand the target semantic distribution, we introduce hard-sample mixup regularization (HMR), which uses easy samples as guidance to mine the latent target knowledge contained in hard samples, thereby learning more complete and complex target semantic knowledge. Finally, target prediction regularization (TPR) regularizes the target predictions of the model by maximizing the correlation between the current prediction and the past learned objective, thereby mitigating the misleading of semantic information caused by erroneous pseudo-labels. Extensive experiments on three benchmark datasets demonstrate that our SERL method achieves state-of-the-art performance.

This Letter reports the precise measurement of reactor antineutrino spectrum and flux based on the full data set of 4.7 million inverse-beta-decay (IBD) candidates collected at Daya Bay near detectors. Expressed in terms of the IBD yield per fission, the antineutrino spectra from all reactor fissile isotopes and the specific $\mathrm{^{235}U}$ and $\mathrm{^{239}Pu}$ isotopes are measured with 1.3$\%$, 3$\%$ and 8$\%$ uncertainties respectively near the 3 MeV spectrum peak in reconstructed energy, reaching the best precision in the world. The total antineutrino flux and isotopic $\mathrm{^{235}U}$ and $\mathrm{^{239}Pu}$ fluxes are precisely measured to be $5.84\pm0.07$, $6.16\pm0.12$ and $4.16\pm0.21$ in units of $10^{-43} \mathrm{cm^2/fission}$. These measurements are compared with the Huber-Mueller (HM) model, the reevaluated conversion model based on the Kurchatov Institute (KI) measurement and the latest Summation Model (SM2023). The Daya Bay flux shows good consistency with KI and SM2023 models, but disagrees with HM model. The Daya Bay spectrum, however, disagrees with all model predictions.

The rotational Doppler effect (RDE) of structured light carrying orbital angular momentum (OAM) has attracted widespread attention for applications in optical sensors and OAM spectrum detection. These studies, however, based on RDE, are mostly focused on the motion parameters of rotating objects; other equally important attitude characteristics, e.g., the tilt angle of the axis of rotation, have rarely been considered. We observed an interesting phenomenon in the experiments: the rotational Doppler spectral distribution varies with the ellipticity of the elliptical optical vortex (EOV) and the tilt angle between the rotational axis and optical axis, which inspired us to wonder if it is possible to detect oblique rotational axis or compensate the rotational Doppler broadening effect induced by oblique incidence by utilizing the EOV. Here, we reveal the RDE quantitative relationship with tilt angle and ellipticity for the first time and report a novel approach for tilt angle measurement. By employing a series of EOV with periodically varying ellipticity to illuminate a rotating object and analyze the time-frequency spectral distribution of scattered light associated with ellipticity and tilt angle, the tilt angle can be acquired accurately based on the specific relationship between the tilt angle and ellipticity of the EOV. Furthermore, the spectrum broadening effect arising from oblique incidence in the actual scenario may be addressed through our scheme. The method may find applications in industrial manufacturing and target attitude measurement, and our results provide new insights for obtaining more information about objects.

Large Language Models (LLMs) have demonstrated remarkable performance across a wide range of tasks by understanding input information and predicting corresponding outputs. However, the internal mechanisms by which LLMs comprehend input and make effective predictions remain poorly understood. In this paper, we explore the working mechanism of LLMs in information processing from the perspective of Information Bottleneck Theory. We propose a non-training construction strategy to define a task space and identify the following key findings: (1) LLMs compress input information into specific task spaces (e.g., sentiment space, topic space) to facilitate task understanding; (2) they then extract and utilize relevant information from the task space at critical moments to generate accurate predictions. Based on these insights, we introduce two novel approaches: an Information Compression-based Context Learning (IC-ICL) and a Task-Space-guided Fine-Tuning (TS-FT). IC-ICL enhances reasoning performance and inference efficiency by compressing retrieved example information into the task space. TS-FT employs a space-guided loss to fine-tune LLMs, encouraging the learning of more effective compression and selection mechanisms. Experiments across multiple datasets validate the effectiveness of task space construction. Additionally, IC-ICL not only improves performance but also accelerates inference speed by over 40\%, while TS-FT achieves superior results with a minimal strategy adjustment., Comment: 9 pages, 9 figures, 3 tables

This paper considers reconfigurable intelligent surface (RIS)-aided integrated sensing and communication (ISAC) systems under dual-polarized (DP) channels. Unlike the existing ISAC systems, which ignored polarization of electromagnetic waves, this study adopts DP base station (BS) and DP RIS to serve users with a pair of DP antennas. The achievable sum rate is maximized through jointly optimizing the beamforming matrix at the DP BS, and the reflecting coefficients at the DP RIS. To address this problem, we first utilize the weighted minimum mean-square error (WMMSE) method to transform the objective function into a more tractable form, and then an alternating optimization (AO) method is employed to decouple the original problem into two subproblems. Due to the constant modulus constraint, the DP RIS reflection matrix optimization problem is addressed by the majorization-minimization (MM) method. For the DP beamforming matrix, we propose a penalty-based algorithm that can obtain a low-complexity closed-form solution. Simulation results validate the advantage of deploying DP transmit array and DP RIS in the considered ISAC systems.