Search

This study is based on the ICASSP 2025 Signal Processing Grand Challenge's Accelerometer-Based Person-in-Bed Detection Challenge, which aims to determine bed occupancy using accelerometer signals. The task is divided into two tracks: "in bed" and "not in bed" segmented detection, and streaming detection, facing challenges such as individual differences, posture variations, and external disturbances. We propose a spectral-temporal fusion-based feature representation method with mixup data augmentation, and adopt Intersection over Union (IoU) loss to optimize detection accuracy. In the two tracks, our method achieved outstanding results of 100.00% and 95.55% in detection scores, securing first place and third place, respectively.

Energy supply for electricity and heat sectors accounts for more than 40% of global carbon emissions in 2023, which brings great pressure for achieving net-zero carbon emission targets in the future. Under the above background, hydrogen-penetrated multi-energy systems (HMESs) have received wide attention due to their potential low-carbon attribute. However, HMESs still face the following challenge, i.e., how to survive and quickly recover from extreme and unexpected events (e.g., natural disasters, extreme weather, and cyber-physical attacks). To enable the above resilience attribute, many existing works on HMES resilience enhancement have been done. However, there lacks a systematic overview of different resilience enhancement measures for HMESs. To fill the research gap, this paper provides a comprehensive overview of resilience enhancement strategies for HMESs from the perspective of hydrogen-related planning and operation. To be specific, we propose a comprehensive resilience enhancement framework for HEMSs. Under the proposed framework, the widely used resilience metrics and event-oriented contingency models in existing works are summarized. Then, we classify the hydrogen-related planning measures for HMES resilience enhancement according to the type of hydrogen-related facilities and provide some insights for planning problem formulation framework. Moreover, we categorize the hydrogen-related operation measures for HMES resilience enhancement according to the three kinds of operation response stages involved, including preventive response, emergency response, and restoration response. Finally, we identify some research gaps and point out possible future directions., Comment: 19 pages, 13 figures

Microphone array techniques are widely used in sound source localization and smart city acoustic-based traffic monitoring, but these applications face significant challenges due to the scarcity of labeled real-world traffic audio data and the complexity and diversity of application scenarios. The DCASE Challenge's Task 10 focuses on using multi-channel audio signals to count vehicles (cars or commercial vehicles) and identify their directions (left-to-right or vice versa). In this paper, we propose a graph-enhanced dual-stream feature fusion network (GEDF-Net) for acoustic traffic monitoring, which simultaneously considers vehicle type and direction to improve detection. We propose a graph-enhanced dual-stream feature fusion strategy which consists of a vehicle type feature extraction (VTFE) branch, a vehicle direction feature extraction (VDFE) branch, and a frame-level feature fusion module to combine the type and direction feature for enhanced performance. A pre-trained model (PANNs) is used in the VTFE branch to mitigate data scarcity and enhance the type features, followed by a graph attention mechanism to exploit temporal relationships and highlight important audio events within these features. The frame-level fusion of direction and type features enables fine-grained feature representation, resulting in better detection performance. Experiments demonstrate the effectiveness of our proposed method. GEDF-Net is our submission that achieved 1st place in the DCASE 2024 Challenge Task 10., Comment: Shitong Fan and Feiyang Xiao contributed equally. Accepted by the IEEE International Conference on Acoustics, Speech, and Signal Processing(ICASSP)2025

This study focuses on the First VoicePrivacy Attacker Challenge within the ICASSP 2025 Signal Processing Grand Challenge, which aims to develop speaker verification systems capable of determining whether two anonymized speech signals are from the same speaker. However, differences between feature distributions of original and anonymized speech complicate this task. To address this challenge, we propose an attacker system that combines Data Augmentation enhanced feature representation and Speaker Identity Difference enhanced classifier to improve verification performance, termed DA-SID. Specifically, data augmentation strategies (i.e., data fusion and SpecAugment) are utilized to mitigate feature distribution gaps, while probabilistic linear discriminant analysis (PLDA) is employed to further enhance speaker identity difference. Our system significantly outperforms the baseline, demonstrating exceptional effectiveness and robustness against various voice anonymization systems, ultimately securing a top-5 ranking in the challenge., Comment: 2 pages, submitted to ICASSP 2025 GC-7: The First VoicePrivacy Attacker Challenge (by invitation), fixed a numerical typo: In Table II, the EER% for DA-SID w/o DA under T8-5 is corrected to 26.96

Secure quantum remote sensing (SQRS) uses quantum states to gather information about distant objects or environments while ensuring secure data transmission against eavesdropping. It has potential applications in various fields, including environmental monitoring, military surveillance, and disaster response, where both data accuracy and transmission security are critical. Recent experiments have demonstrated the feasibility of SQRS using entanglement states. Here, we experimentally demonstrate an SQRS that can estimate a phase without requiring entanglement, offering the practical advantage that single-qubit states are easier to prepare. We successfully estimate the preset phase information at a remote site over a fiber distance of 50 km, which serves as a key step toward long-distance applications.

Sleep disorders have a major impact on both lifestyle and health. Effective sleep disorder prediction from lifestyle and physiological data can provide essential details for early intervention. This research utilizes three deep time series models and facilitates them with explainability approaches for sleep disorder prediction. Specifically, our approach adopts Temporal Convolutional Networks (TCN), Long Short-Term Memory (LSTM) for time series data analysis, and Temporal Fusion Transformer model (TFT). Meanwhile, the temporal attention mechanism and counterfactual explanation with SHapley Additive exPlanations (SHAP) approach are employed to ensure dependable, accurate, and interpretable predictions. Finally, using a large dataset of sleep health measures, our evaluation demonstrates the effect of our method in predicting sleep disorders.

This research proposes a novel approach utilizing Orbital Angular Momentum (OAM) beams to enhance Radar Cross Section (RCS) diversity for target detection in future transportation systems. Unlike conventional OAM beams with hollow-shaped divergence patterns, the new proposed OAM beams provide uniform illumination across the target without a central energy void, but keep the inherent phase gradient of vortex property. We utilize waveguide slot antennas to generate four different modes of these novel OAM beams at X-band frequency. Furthermore, these different mode OAM beams are used to illuminate metal models, and the resulting RCS is compared with that obtained using plane waves. The findings reveal that the novel OAM beams produce significant azimuthal RCS diversity, providing a new approach for the detection of weak and small targets.This study not only reveals the RCS diversity phenomenon based on novel OAM beams of different modes but also addresses the issue of energy divergence that hinders traditional OAM beams in long-range detection applications.

Local climate zone (LCZ) classification is of great value for understanding the complex interactions between urban development and local climate. Recent studies have increasingly focused on the fusion of synthetic aperture radar (SAR) and multi-spectral data to improve LCZ classification performance. However, it remains challenging due to the distinct physical properties of these two types of data and the absence of effective fusion guidance. In this paper, a novel band prompting aided data fusion framework is proposed for LCZ classification, namely BP-LCZ, which utilizes textual prompts associated with band groups to guide the model in learning the physical attributes of different bands and semantics of various categories inherent in SAR and multi-spectral data to augment the fused feature, thus enhancing LCZ classification performance. Specifically, a band group prompting (BGP) strategy is introduced to align the visual representation effectively at the level of band groups, which also facilitates a more adequate extraction of semantic information of different bands with textual information. In addition, a multivariate supervised matrix (MSM) based training strategy is proposed to alleviate the problem of positive and negative sample confusion by completing the supervised information. The experimental results demonstrate the effectiveness and superiority of the proposed data fusion framework., Comment: Accepted by ICASSP 2025

Recent 3D content generation pipelines commonly employ Variational Autoencoders (VAEs) to encode shapes into compact latent representations for diffusion-based generation. However, the widely adopted uniform point sampling strategy in Shape VAE training often leads to a significant loss of geometric details, limiting the quality of shape reconstruction and downstream generation tasks. We present Dora-VAE, a novel approach that enhances VAE reconstruction through our proposed sharp edge sampling strategy and a dual cross-attention mechanism. By identifying and prioritizing regions with high geometric complexity during training, our method significantly improves the preservation of fine-grained shape features. Such sampling strategy and the dual attention mechanism enable the VAE to focus on crucial geometric details that are typically missed by uniform sampling approaches. To systematically evaluate VAE reconstruction quality, we additionally propose Dora-bench, a benchmark that quantifies shape complexity through the density of sharp edges, introducing a new metric focused on reconstruction accuracy at these salient geometric features. Extensive experiments on the Dora-bench demonstrate that Dora-VAE achieves comparable reconstruction quality to the state-of-the-art dense XCube-VAE while requiring a latent space at least 8$\times$ smaller (1,280 vs. > 10,000 codes). We will release our code and benchmark dataset to facilitate future research in 3D shape modeling., Comment: Project page: https://aruichen.github.io/Dora/

Score-based causal discovery methods can effectively identify causal relationships by evaluating candidate graphs and selecting the one with the highest score. One popular class of scores is kernel-based generalized score functions, which can adapt to a wide range of scenarios and work well in practice because they circumvent assumptions about causal mechanisms and data distributions. Despite these advantages, kernel-based generalized score functions pose serious computational challenges in time and space, with a time complexity of $\mathcal{O}(n^3)$ and a memory complexity of $\mathcal{O}(n^2)$, where $n$ is the sample size. In this paper, we propose an approximate kernel-based generalized score function with $\mathcal{O}(n)$ time and space complexities by using low-rank technique and designing a set of rules to handle the complex composite matrix operations required to calculate the score, as well as developing sampling algorithms for different data types to benefit the handling of diverse data types efficiently. Our extensive causal discovery experiments on both synthetic and real-world data demonstrate that compared to the state-of-the-art method, our method can not only significantly reduce computational costs, but also achieve comparable accuracy, especially for large datasets.

Let $\mathcal{R}$ be a commutative ring with unity, and let $P$ be a locally finite poset. The aim of the paper is to provide an explicit description of the additive biderivations of the incidence algebra $I(P, \mathcal{R})$. We demonstrate that every additive biderivation is the sum of several inner biderivations and extremal biderivations. Furthermore, if the number of elements in any maximal chain in $P$ is infinite, every additive biderivation of $I(P,\mathcal{R})$ is the sum of several inner biderivations., Comment: 18 pages, 3 figures

The performance of computer vision models in certain real-world applications (e.g., rare wildlife observation) is limited by the small number of available images. Expanding datasets using pre-trained generative models is an effective way to address this limitation. However, since the automatic generation process is uncontrollable, the generated images are usually limited in diversity, and some of them are undesired. In this paper, we propose a human-guided image generation method for more controllable dataset expansion. We develop a multi-modal projection method with theoretical guarantees to facilitate the exploration of both the original and generated images. Based on the exploration, users refine the prompts and re-generate images for better performance. Since directly refining the prompts is challenging for novice users, we develop a sample-level prompt refinement method to make it easier. With this method, users only need to provide sample-level feedback (e.g., which samples are undesired) to obtain better prompts. The effectiveness of our method is demonstrated through the quantitative evaluation of the multi-modal projection method, improved model performance in the case study for both classification and object detection tasks, and positive feedback from the experts., Comment: Accepted by TVCG2025

The o1 model series is trained with large-scale reinforcement learning to reason using chain of thought. These advanced reasoning capabilities provide new avenues for improving the safety and robustness of our models. In particular, our models can reason about our safety policies in context when responding to potentially unsafe prompts, through deliberative alignment. This leads to state-of-the-art performance on certain benchmarks for risks such as generating illicit advice, choosing stereotyped responses, and succumbing to known jailbreaks. Training models to incorporate a chain of thought before answering has the potential to unlock substantial benefits, while also increasing potential risks that stem from heightened intelligence. Our results underscore the need for building robust alignment methods, extensively stress-testing their efficacy, and maintaining meticulous risk management protocols. This report outlines the safety work carried out for the OpenAI o1 and OpenAI o1-mini models, including safety evaluations, external red teaming, and Preparedness Framework evaluations.

Online psychological counseling dialogue systems are trending, offering a convenient and accessible alternative to traditional in-person therapy. However, existing psychological counseling dialogue systems mainly focus on basic empathetic dialogue or QA with minimal professional knowledge and without goal guidance. In many real-world counseling scenarios, clients often seek multi-type help, such as diagnosis, consultation, therapy, console, and common questions, but existing dialogue systems struggle to combine different dialogue types naturally. In this paper, we identify this challenge as how to construct mixed-type dialogue systems for psychological counseling that enable clients to clarify their goals before proceeding with counseling. To mitigate the challenge, we collect a mixed-type counseling dialogues corpus termed STAMPsy, covering five dialogue types, task-oriented dialogue for diagnosis, knowledge-grounded dialogue, conversational recommendation, empathetic dialogue, and question answering, over 5,000 conversations. Moreover, spatiotemporal-aware knowledge enables systems to have world awareness and has been proven to affect one's mental health. Therefore, we link dialogues in STAMPsy to spatiotemporal state and propose a spatiotemporal-aware mixed-type psychological counseling dataset. Additionally, we build baselines on STAMPsy and develop an iterative self-feedback psychological dialogue generation framework, named Self-STAMPsy. Results indicate that clarifying dialogue goals in advance and utilizing spatiotemporal states are effective.

We present the first search for the lepton flavor-violating decay modes $B^0 \rightarrow K_S^0 \tau^\pm \ell^\mp~(\ell=\mu, e)$ using the 711 fb$^{-1}$ and 365 fb$^{-1}$ data samples recorded by the Belle and Belle II detectors, respectively. We use a hadronic $B$-tagging technique, and search for the signal decay in the system recoiling against the fully reconstructed $B$ meson. We find no evidence for $B^0 \rightarrow K_S^0 \tau^\pm \ell^\mp$ decays and set 90\% confidence level upper limits on the branching fractions in the range of $[0.8,\,3.6]\times10^{-5}$.

As large-scale language models increasingly impact safety-critical domains, ensuring their reliable adherence to well-defined principles remains a fundamental challenge. We introduce Deliberative Alignment, a new paradigm that directly teaches the model safety specifications and trains it to explicitly recall and accurately reason over the specifications before answering. We used this approach to align OpenAI's o-series models, and achieved highly precise adherence to OpenAI's safety policies, without requiring human-written chain-of-thoughts or answers. Deliberative Alignment pushes the Pareto frontier by simultaneously increasing robustness to jailbreaks while decreasing overrefusal rates, and also improves out-of-distribution generalization. We demonstrate that reasoning over explicitly specified policies enables more scalable, trustworthy, and interpretable alignment., Comment: 24 pages

Existing Autonomous Driving Systems (ADS) independently make driving decisions, but they face two significant limitations. First, in complex scenarios, ADS may misinterpret the environment and make inappropriate driving decisions. Second, these systems are unable to incorporate human driving preferences in their decision-making processes. This paper proposes Autoware$.$Flex, a novel ADS system that incorporates human input into the driving process, allowing users to guide the ADS in making more appropriate decisions and ensuring their preferences are satisfied. Achieving this needs to address two key challenges: (1) translating human instructions, expressed in natural language, into a format the ADS can understand, and (2) ensuring these instructions are executed safely and consistently within the ADS' s decision-making framework. For the first challenge, we employ a Large Language Model (LLM) assisted by an ADS-specialized knowledge base to enhance domain-specific translation. For the second challenge, we design a validation mechanism to ensure that human instructions result in safe and consistent driving behavior. Experiments conducted on both simulators and a real-world autonomous vehicle demonstrate that Autoware$.$Flex effectively interprets human instructions and executes them safely., Comment: 14 pages, 13 figures

Using the Liu's method, we prove a new Witten rigidity theorem of elliptic genus of twisted Dirac operators in even dimensional spin manifolds under the circle action. Combined with the Han-Yu's method, we prove the Witten rigidity theorems of elliptic genus of twisted Toplitz operators of odd-dimensional spin manifolds under the circle action. Moreover, we have obtained several similar Witten rigidity theorems of elliptic genus., Comment: arXiv admin note: text overlap with arXiv:2401.06944. text overlap with arXiv:1504.03007 by other authors

Retrieval-augmented generation (RAG) synergizes the retrieval of pertinent data with the generative capabilities of Large Language Models (LLMs), ensuring that the generated output is not only contextually relevant but also accurate and current. We introduce XRAG, an open-source, modular codebase that facilitates exhaustive evaluation of the performance of foundational components of advanced RAG modules. These components are systematically categorized into four core phases: pre-retrieval, retrieval, post-retrieval, and generation. We systematically analyse them across reconfigured datasets, providing a comprehensive benchmark for their effectiveness. As the complexity of RAG systems continues to escalate, we underscore the critical need to identify potential failure points in RAG systems. We formulate a suite of experimental methodologies and diagnostic testing protocols to dissect the failure points inherent in RAG engineering. Subsequently, we proffer bespoke solutions aimed at bolstering the overall performance of these modules. Our work thoroughly evaluates the performance of advanced core components in RAG systems, providing insights into optimizations for prevalent failure points.

Small-angle scattering (SAS) techniques are indispensable tools for probing the structure of soft materials. However, traditional analytical models often face limitations in structural inversion for complex systems, primarily due to the absence of closed-form expressions of scattering functions. To address these challenges, we present a machine learning framework based on the Kolmogorov-Arnold Network (KAN) for directly extracting real-space structural information from scattering spectra in reciprocal space. This model-independent, data-driven approach provides a versatile solution for analyzing intricate configurations in soft matter. By applying the KAN to lyotropic lamellar phases and colloidal suspensions -- two representative soft matter systems -- we demonstrate its ability to accurately and efficiently resolve structural collectivity and complexity. Our findings highlight the transformative potential of machine learning in enhancing the quantitative analysis of soft materials, paving the way for robust structural inversion across diverse systems., Comment: 9 pages, 8 figures

Traffic accident forecasting is an important task for intelligent transportation management and emergency response systems. However, this problem is challenging due to the spatial heterogeneity of the environment. Existing data-driven methods mostly focus on studying homogeneous areas with limited size (e.g. a single urban area such as New York City) and fail to handle the heterogeneous accident patterns over space at different scales. Recent advances (e.g. spatial ensemble) utilize pre-defined space partitions and learn multiple models to improve prediction accuracy. However, external knowledge is required to define proper space partitions before training models and pre-defined partitions may not necessarily reduce the heterogeneity. To address this issue, we propose a novel Learning-Integrated Space Partition Framework (LISA) to simultaneously learn partitions while training models, where the partitioning process and learning process are integrated in a way that partitioning is guided explicitly by prediction accuracy rather than other factors. Experiments using real-world datasets, demonstrate that our work can capture underlying heterogeneous patterns in a self-guided way and substantially improve baseline networks by an average of 13.0%.

We measure the branching fraction and $\it CP$-violating flavor-dependent rate asymmetry of $B^{0} \to \pi^{0} \pi^{0}$ decays reconstructed using the Belle II detector in an electron-positron collision sample containing $387 \times 10^{6}$ $B\overline{B}$ pairs. Using an optimized event selection, we find $126\pm 20$ signal decays in a fit to background-discriminating and flavor-sensitive distributions. The resulting branching fraction is $(1.25 \pm 0.23)\times 10^{-6}$ and the $\it CP$-violating asymmetry is $0.03 \pm 0.30$.

Using $(2712.4\pm 14.3)\times10^6 \psi(3686)$ events collected by the BESIII detector operating at the BEPCII collider, we present the first observations of the decays $\chi_{cJ}(J=0,1,2)\to p\bar{p}\eta\pi^{0}$. Their decay branching fractions are determined to be ${\cal B}(\chi_{c0}\to p\bar{p}\eta\pi^{0})=({2.41 \pm 0.07 \pm 0.19}) \times 10^{-4}$, ${\cal B}(\chi_{c1}\to p\bar{p}\eta\pi^{0})=({1.95 \pm 0.05 \pm 0.12}) \times 10^{-4}$, and ${\cal B}(\chi_{c2}\to p\bar{p}\eta\pi^{0})=({1.31 \pm 0.05 \pm 0.08}) \times 10^{-4}$, where the first uncertainties are statistical and the second systematic.

Machine learning training has emerged as one of the most prominent workloads in modern data centers. These training jobs are large-scale, long-lasting, and tightly coupled, and are often disrupted by various events in the cluster such as failures, maintenance, and job scheduling. To handle these events, we rely on cold migration, where we first checkpoint the entire cluster, replace the related machines, and then restart the training. This approach leads to disruptions to the training jobs, resulting in significant downtime. In this paper, we present TrainMover, a live migration system that enables machine replacement during machine learning training. TrainMover minimizes downtime by leveraging member replacement of collective communication groups and sandbox lazy initialization. Our evaluation demonstrates that TrainMover achieves 16x less downtime compared to all baselines, effectively handling data center events like straggler rebalancing, maintenance, and unexpected failures., Comment: 13 pages body, 19 pages total

Due to the superior ability of global dependency, transformer and its variants have become the primary choice in Masked Time-series Modeling (MTM) towards time-series classification task. In this paper, we experimentally analyze that existing transformer-based MTM methods encounter with two under-explored issues when dealing with time series data: (1) they encode features by performing long-dependency ensemble averaging, which easily results in rank collapse and feature homogenization as the layer goes deeper; (2) they exhibit distinct priorities in fitting different frequency components contained in the time-series, inevitably leading to spectrum energy imbalance of encoded feature. To tackle these issues, we propose an auxiliary content-aware balanced decoder (CBD) to optimize the encoding quality in the spectrum space within masked modeling scheme. Specifically, the CBD iterates on a series of fundamental blocks, and thanks to two tailored units, each block could progressively refine the masked representation via adjusting the interaction pattern based on local content variations of time-series and learning to recalibrate the energy distribution across different frequency components. Moreover, a dual-constraint loss is devised to enhance the mutual optimization of vanilla decoder and our CBD. Extensive experimental results on ten time-series classification datasets show that our method nearly surpasses a bunch of baselines. Meanwhile, a series of explanatory results are showcased to sufficiently demystify the behaviors of our method., Comment: 13 pages, Accepted by AAAI 25

Deep learning has enabled the development of highly robust foundation models for various pathological tasks across diverse diseases and patient cohorts. Among these models, vision-language pre-training, which leverages large-scale paired data to align pathology image and text embedding spaces, and provides a novel zero-shot paradigm for downstream tasks. However, existing models have been primarily data-driven and lack the incorporation of domain-specific knowledge, which limits their performance in cancer diagnosis, especially for rare tumor subtypes. To address this limitation, we establish a Knowledge-enhanced Pathology (KEEP) foundation model that harnesses disease knowledge to facilitate vision-language pre-training. Specifically, we first construct a disease knowledge graph (KG) that covers 11,454 human diseases with 139,143 disease attributes, including synonyms, definitions, and hypernym relations. We then systematically reorganize the millions of publicly available noisy pathology image-text pairs, into 143K well-structured semantic groups linked through the hierarchical relations of the disease KG. To derive more nuanced image and text representations, we propose a novel knowledge-enhanced vision-language pre-training approach that integrates disease knowledge into the alignment within hierarchical semantic groups instead of unstructured image-text pairs. Validated on 18 diverse benchmarks with more than 14,000 whole slide images (WSIs), KEEP achieves state-of-the-art performance in zero-shot cancer diagnostic tasks. Notably, for cancer detection, KEEP demonstrates an average sensitivity of 89.8% at a specificity of 95.0% across 7 cancer types. For cancer subtyping, KEEP achieves a median balanced accuracy of 0.456 in subtyping 30 rare brain cancers, indicating strong generalizability for diagnosing rare tumors.

Using $(2712.4\pm14.3)\times10^{6}$ $\psi(3686)$ events collected with the BESIII detector at the BEPCII collider, the decay $\eta_c\to\gamma\gamma$ in $J/\psi\to\gamma\eta_c$ is observed for the first time. We determine the product branching fraction $\mathcal{B}(J/\psi\to\gamma\eta_c)\times\mathcal{B}(\eta_c\to\gamma\gamma)=(5.23\pm0.26_{\rm{stat.}}\pm0.30_{\rm{syst.}})\times10^{-6}$. This result is well consistent with the LQCD calculation $(5.34\pm0.16)\times10^{-6}$ from HPQCD in 2023. By using the world-average values of $\mathcal{B}(J/\psi\to\gamma\eta_c)$ and the total decay width of $\eta_c$, the partial decay width $\Gamma(\eta_c\to\gamma\gamma)$ is determined to be $(11.30\pm0.56_{\rm{stat.}}\pm0.66_{\rm{syst.}}\pm1.14_{\rm{ref.}})~\rm{keV}$, which deviates from the corresponding world-average value by $3.4\sigma$., Comment: 10 pages, 4 figures

The Myers-Briggs Type Indicator (MBTI) is one of the most influential personality theories reflecting individual differences in thinking, feeling, and behaving. MBTI personality detection has garnered considerable research interest and has evolved significantly over the years. However, this task tends to be overly optimistic, as it currently does not align well with the natural distribution of population personality traits. Specifically, (1) the self-reported labels in existing datasets result in incorrect labeling issues, and (2) the hard labels fail to capture the full range of population personality distributions. In this paper, we optimize the task by constructing MBTIBench, the first manually annotated high-quality MBTI personality detection dataset with soft labels, under the guidance of psychologists. As for the first challenge, MBTIBench effectively solves the incorrect labeling issues, which account for 29.58% of the data. As for the second challenge, we estimate soft labels by deriving the polarity tendency of samples. The obtained soft labels confirm that there are more people with non-extreme personality traits. Experimental results not only highlight the polarized predictions and biases in LLMs as key directions for future research, but also confirm that soft labels can provide more benefits to other psychological tasks than hard labels. The code and data are available at https://github.com/Personality-NLP/MbtiBench., Comment: Accepted by COLING 2025. 28 papges, 20 figures, 10 tables

We measure the branching fraction of the decay $B^0 \to J/\psi \omega$ using data collected with the Belle II detector at the SuperKEKB collider. The data contain $(387 \pm 6) \times 10^6$ $B\overline{B}$ meson pairs produced in energy-asymmetric $e^+e^-$ collisions at the $\Upsilon (4S)$ resonance. The measured branching fraction $\mathcal{B}(B^0 \to J/\psi \omega) = \left( 2.16 \pm 0.30 \pm 0.14 \right) \times 10^{-5}$, where the first uncertainty is statistical and the second is systematic, is more precise than previous results and constitutes the first observation of the decay with a significance of $6.5$ standard deviations.

Transportability analysis is a causal inference framework used to evaluate the external validity of randomized clinical trials (RCTs) or observational studies. Most existing transportability analysis methods require individual patient-level data (IPD) for both the source and the target population, narrowing its applicability when only target aggregate-level data (AgD) is available. Besides, accounting for censoring is essential to reduce bias in longitudinal data, yet AgD-based transportability methods in the presence of censoring remain underexplored. Here, we propose a two-stage weighting framework named "Target Aggregate Data Adjustment" (TADA) to address the mentioned challenges simultaneously. TADA is designed as a two-stage weighting scheme to simultaneously adjust for both censoring bias and distributional imbalances of effect modifiers (EM), where the final weights are the product of the inverse probability of censoring weights and participation weights derived using the method of moments. We have conducted an extensive simulation study to evaluate TADA's performance. Our results indicate that TADA can effectively control the bias resulting from censoring within a non-extreme range suitable for most practical scenarios, and enhance the application and clinical interpretability of transportability analyses in settings with limited data availability.

Accurate trajectory prediction is essential for the safety and efficiency of autonomous driving. Traditional models often struggle with real-time processing, capturing non-linearity and uncertainty in traffic environments, efficiency in dense traffic, and modeling temporal dynamics of interactions. We introduce NEST (Neuromodulated Small-world Hypergraph Trajectory Prediction), a novel framework that integrates Small-world Networks and hypergraphs for superior interaction modeling and prediction accuracy. This integration enables the capture of both local and extended vehicle interactions, while the Neuromodulator component adapts dynamically to changing traffic conditions. We validate the NEST model on several real-world datasets, including nuScenes, MoCAD, and HighD. The results consistently demonstrate that NEST outperforms existing methods in various traffic scenarios, showcasing its exceptional generalization capability, efficiency, and temporal foresight. Our comprehensive evaluation illustrates that NEST significantly improves the reliability and operational efficiency of autonomous driving systems, making it a robust solution for trajectory prediction in complex traffic environments., Comment: Accepted by AAAI-25

Website Fingerprinting (WF) aims to deanonymize users on the Tor network by analyzing encrypted network traffic. Recent deep-learning-based attacks show high accuracy on undefended traces. However, they struggle against modern defenses that use tactics like injecting dummy packets and delaying real packets, which significantly degrade classification performance. Our analysis reveals that current attacks inadequately leverage the timing information inherent in traffic traces, which persists as a source of leakage even under robust defenses. Addressing this shortfall, we introduce a novel feature representation named the Inter-Arrival Time (IAT) histogram, which quantifies the frequencies of packet inter-arrival times across predetermined time slots. Complementing this feature, we propose a new CNN-based attack, WFCAT, enhanced with two innovative architectural blocks designed to optimally extract and utilize timing information. Our approach uses kernels of varying sizes to capture multi-scale features, which are then integrated using a weighted sum across all feature channels to enhance the model's efficacy in identifying temporal patterns. Our experiments validate that WFCAT substantially outperforms existing methods on defended traces in both closed- and open-world scenarios. Notably, WFCAT achieves over 59% accuracy against Surakav, a recently developed robust defense, marking an improvement of over 28% and 48% against the state-of-the-art attacks RF and Tik-Tok, respectively, in the closed-world scenario., Comment: 13 pages

Recent efforts to enhance immersive and interactive user experiences have driven the development of volumetric video, a form of 3D content that enables 6 DoF. Unlike traditional 2D content, volumetric content can be represented in various ways, such as point clouds, meshes, or neural representations. However, due to its complex structure and large amounts of data size, deploying this new form of 3D data presents significant challenges in transmission and rendering. These challenges have hindered the widespread adoption of volumetric video in daily applications. In recent years, researchers have proposed various AI-driven techniques to address these challenges and improve the efficiency and quality of volumetric content streaming. This paper provides a comprehensive overview of recent advances in AI-driven approaches to facilitate volumetric content streaming. Through this review, we aim to offer insights into the current state-of-the-art and suggest potential future directions for advancing the deployment of volumetric video streaming in real-world applications.

Among various branches of offline reinforcement learning (RL) methods, goal-conditioned supervised learning (GCSL) has gained increasing popularity as it formulates the offline RL problem as a sequential modeling task, therefore bypassing the notoriously difficult credit assignment challenge of value learning in conventional RL paradigm. Sequential modeling, however, requires capturing accurate dynamics across long horizons in trajectory data to ensure reasonable policy performance. To meet this requirement, leveraging large, expressive models has become a popular choice in recent literature, which, however, comes at the cost of significantly increased computation and inference latency. Contradictory yet promising, we reveal that lightweight models as simple as shallow 2-layer MLPs, can also enjoy accurate dynamics consistency and significantly reduced sequential modeling errors against large expressive models by adopting a simple recursive planning scheme: recursively planning coarse-grained future sub-goals based on current and target information, and then executes the action with a goal-conditioned policy learned from data rela-beled with these sub-goal ground truths. We term our method Recursive Skip-Step Planning (RSP). Simple yet effective, RSP enjoys great efficiency improvements thanks to its lightweight structure, and substantially outperforms existing methods, reaching new SOTA performances on the D4RL benchmark, especially in multi-stage long-horizon tasks., Comment: Instead of relying on expressive models, shallow MLPs can also excel in long sequential decision-making tasks with Recursive Skip-Step Planning (RSP)

Abstraction is an important and useful concept in the field of artificial intelligence. To the best of our knowledge, there is no syntactic method to compute a sound and complete abstraction from a given low-level basic action theory and a refinement mapping. This paper aims to address this issue.To this end, we first present a variant of situation calculus,namely linear integer situation calculus, which serves as the formalization of high-level basic action theory. We then migrate Banihashemi, De Giacomo, and Lesp\'erance's abstraction framework to one from linear integer situation calculus to extended situation calculus. Furthermore, we identify a class of Golog programs, namely guarded actions,that is used to restrict low-level Golog programs, and impose some restrictions on refinement mappings. Finally, we design a syntactic approach to computing a sound and complete abstraction from a low-level basic action theory and a restricted refinement mapping.

An amplitude analysis of the Cabibbo-favored decay $D^+ \to K^-\pi^+\pi^+\pi^0$ is performed, using 7.93 $\rm{fb}^{-1}$ of $e^+e^-$ collision data collected with the BESIII detector at the center-of-mass energy of 3.773 GeV. The branching fractions of the intermediate processes are measured, with the dominant contribution $D^+ \to \bar{K}^{*}(892)^0\rho(770)^+$ observed to have a branching fraction of $(4.15\pm0.07_{\rm stat.}\pm0.17_{\rm syst.})\%$. With the detection efficiency derived from the amplitude analysis, the absolute branching fraction of $D^+ \to K^-\pi^+\pi^+\pi^0$ is measured to be $(6.06\pm0.04_{\rm stat.}\pm0.07_{\rm syst.})\%$.

We report an improved study of the semileptonic decay $D^0 \rightarrow \bar{K}^0\pi^-e^+\nu_{e}$ based on a sample of $7.9~\mathrm{fb}^{-1}$ of $e^+e^-$ annihilation data collected at a center-of-mass energy of 3.773~GeV with the BESIII detector at the BEPCII collider. The branching fraction of this decay is measured to be $\mathcal{B}(D^0\rightarrow \bar{K}^0\pi^-e^+\nu_{e}) = (1.444 \pm 0.022_{\rm stat} \pm 0.024_{\rm syst})\%$, which is the most precise to date, where the first uncertainty is statistical and the second is systematic. Based on investigation of the decay dynamics, we find that the decay is dominated by the $K^{*}(892)^-$ component and present an improved measurement of its branching fraction to be $\mathcal{B}(D^0\rightarrow K^{*}(892)^-e^+\nu_e) = (2.039 \pm 0.032_{\rm stat} \pm 0.034_{\rm syst})\%$. We also determine the ratios of the hadronic form factors for the $K^{*}(892)^-e^+\nu_e$ decay to be $r_{V} = V(0)/A_1(0) = 1.48 \pm 0.05_{\rm stat} \pm 0.02_{\rm syst}$ and $r_{2} = A_2(0)/A_1(0) = 0.70 \pm 0.04_{\rm stat} \pm 0.02_{\rm syst}$, where $V(0)$ is the vector form factor and $A_{1,2}(0)$ are the axial form factors. In addition, the $\bar{K}^0\pi^-$ $\mathcal{S}$-wave component is found to account for $(5.87 \pm 0.32_{\rm stat} \pm 0.16_{\rm syst})\%$ of the total decay rate, corresponding to a branching fraction of $\mathcal{B}[D^0\rightarrow (\bar{K}^0\pi^-)_{S-{\rm wave}}e^+\nu_e] = (0.085 \pm 0.005_{\rm stat} \pm 0.003_{\rm syst})\%$., Comment: 20 pages, 3 figures

Estimation of patient acuity in the Intensive Care Unit (ICU) is vital to ensure timely and appropriate interventions. Advances in artificial intelligence (AI) technologies have significantly improved the accuracy of acuity predictions. However, prior studies using machine learning for acuity prediction have predominantly relied on electronic health records (EHR) data, often overlooking other critical aspects of ICU stay, such as patient mobility, environmental factors, and facial cues indicating pain or agitation. To address this gap, we present MANGO: the Multimodal Acuity traNsformer for intelliGent ICU Outcomes, designed to enhance the prediction of patient acuity states, transitions, and the need for life-sustaining therapy. We collected a multimodal dataset ICU-Multimodal, incorporating four key modalities, EHR data, wearable sensor data, video of patient's facial cues, and ambient sensor data, which we utilized to train MANGO. The MANGO model employs a multimodal feature fusion network powered by Transformer masked self-attention method, enabling it to capture and learn complex interactions across these diverse data modalities even when some modalities are absent. Our results demonstrated that integrating multiple modalities significantly improved the model's ability to predict acuity status, transitions, and the need for life-sustaining therapy. The best-performing models achieved an area under the receiver operating characteristic curve (AUROC) of 0.76 (95% CI: 0.72-0.79) for predicting transitions in acuity status and the need for life-sustaining therapy, while 0.82 (95% CI: 0.69-0.89) for acuity status prediction...

We present DeepSeek-VL2, an advanced series of large Mixture-of-Experts (MoE) Vision-Language Models that significantly improves upon its predecessor, DeepSeek-VL, through two key major upgrades. For the vision component, we incorporate a dynamic tiling vision encoding strategy designed for processing high-resolution images with different aspect ratios. For the language component, we leverage DeepSeekMoE models with the Multi-head Latent Attention mechanism, which compresses Key-Value cache into latent vectors, to enable efficient inference and high throughput. Trained on an improved vision-language dataset, DeepSeek-VL2 demonstrates superior capabilities across various tasks, including but not limited to visual question answering, optical character recognition, document/table/chart understanding, and visual grounding. Our model series is composed of three variants: DeepSeek-VL2-Tiny, DeepSeek-VL2-Small and DeepSeek-VL2, with 1.0B, 2.8B and 4.5B activated parameters respectively. DeepSeek-VL2 achieves competitive or state-of-the-art performance with similar or fewer activated parameters compared to existing open-source dense and MoE-based models. Codes and pre-trained models are publicly accessible at https://github.com/deepseek-ai/DeepSeek-VL2.

Soliton cores at the center of fuzzy dark matter (FDM) halos provide a promising way to distinguish FDM from other dark matter models. However, the relation between solitons and their host halos remains contentious. Here, we rigorously examine this soliton-halo relation (SHR) using a rich set of cosmological simulations across various FDM particle masses, halo masses, and redshifts. We explicitly demonstrate thermal equilibrium between solitons and surrounding halo granules, energy equipartition within halos, and an FDM concentration-mass-nonisothermality relation. For each FDM halo, we confirm that its density profile outside the central soliton matches a collisionless N-body simulation from the same initial condition, serving as stringent numerical convergence tests. Our refined SHR agrees well with virialized halos in simulations, with a $1\sigma$ deviation of less than $30\%$. These findings not only reaffirm the SHR proposed by Schive et al. (2014) but also offer a more comprehensive understanding that extends its applicability. The simulation code GAMER is accessible at https://github.com/gamer-project/gamer. A Python script for computing the theoretical SHR is available at https://github.com/calab-ntu/fdm-soliton-halo-relation., Comment: 7 pages, 5 figures

This paper investigates robust stochastic differential games among insurers under model uncertainty and stochastic volatility. The surplus processes of ambiguity-averse insurers (AAIs) are characterized by drifted Brownian motion with both common and idiosyncratic insurance risks. To mitigate these risks, AAIs can purchase proportional reinsurance. Besides, AAIs allocate their wealth in a financial market consisting of cash, and a stock characterized by the 4/2 stochastic volatility model. AAIs compete with each other based on relative performance with the mean-variance criterion under the worst-case scenario. This paper formulates a robust time-consistent mean-field game in a non-linear system. The AAIs seek robust, time-consistent response strategies to achieve Nash equilibrium strategies in the game. We introduce $n$-dimensional extended Hamilton-Jacobi-Bellman-Isaacs (HJBI) equations and corresponding verification theorems under compatible conditions. Semi-closed forms of the robust $n$-insurer equilibrium and mean-field equilibrium are derived, relying on coupled Riccati equations. Suitable conditions are presented to ensure the existence and uniqueness of the coupled Riccati equation as well as the integrability in the verification theorem. As the number of AAIs increases, the results in the $n$-insurer game converge to those in the mean-field game. Numerical examples are provided to illustrate economic behaviors in the games, highlighting the herd effect of competition on the AAIs.

This paper studies the robust reinsurance and investment games for competitive insurers. Model uncertainty is characterized by a class of equivalent probability measures. Each insurer is concerned with relative performance under the worst-case scenario. Insurers' surplus processes are approximated by drifted Brownian motion with common and idiosyncratic insurance risks. The insurers can purchase proportional reinsurance to divide the insurance risk with the reinsurance premium calculated by the variance principle. We consider an incomplete market driven by the 4/2 stochastic volatility mode. This paper formulates the robust mean-field game for a non-linear system originating from the variance principle and the 4/2 model. For the case of an exponential utility function, we derive closed-form solutions for the $n$-insurer game and the corresponding mean-field game. We show that relative concerns lead to new hedging terms in the investment and reinsurance strategies. Model uncertainty can significantly change the insurers' hedging demands. The hedging demands in the investment-reinsurance strategies exhibit highly non-linear dependence with the insurers' competitive coefficients, risk aversion and ambiguity aversion coefficients. Finally, numerical results demonstrate the herd effect of competition.

This note is to study Bourgain's slicing problem following the routes investigated in the last decade. We show that the slicing constant $L_n$ is bounded by $C\log(\log n) $, $n\geq 3$, for some universal constant $C$., Comment: 21 pages

Characterizing low-energy (O(1keV)) nuclear recoils near the detector threshold is one of the major challenges for large direct dark matter detectors. To that end, we have successfully used a Yttrium-Beryllium photoneutron source that emits 152 keV neutrons for the calibration of the light and charge yields of the XENONnT experiment for the first time. After data selection, we accumulated 474 events from 183 hours of exposure with this source. The expected background was $55 \pm 12$ accidental coincidence events, estimated using a dedicated 152 hour background calibration run with a Yttrium-PVC gamma-only source and data-driven modeling. From these calibrations, we extracted the light yield and charge yield for liquid xenon at our field strength of 23 V/cm between 0.5 keV$_{\rm NR}$ and 5.0 keV$_{\rm NR}$ (nuclear recoil energy in keV). This calibration is crucial for accurately measuring the solar $^8$B neutrino coherent elastic neutrino-nucleus scattering and searching for light dark matter particles with masses below 12 GeV/c$^2$.

This study investigates the development dilemma of ride-sharing services using real-world mobility datasets from nine cities and calibrated customers' price and detour elasticity. Through massive numerical experiments, this study reveals that while ride-sharing can benefit social welfare, it may also lead to a loss of revenue for transportation network companies (TNCs) or drivers compared with solo-hailing, which limits TNCs' motivation to develop ride-sharing services. Three key factors contributing to this revenue loss are identified: (1) the low successful sharing ratio for customers choosing ride-sharing in some cases, (2) the limited saved trip distance by pooling two customers, and (3) the potential revenue loss when pooling customers with significantly different trip fares. Furthermore, this study finds that the monetary benefits of carbon emission reductions from ride-sharing are not substantial enough to affect customers' choices between solo-hailing and ride-sharing. The findings provide a valuable reference for TNCs and governments. For TNCs, effective pricing strategies, such as dynamic pricing, should be designed to prevent revenue loss when introducing ride-sharing. Governments are suggested to subsidize ride-sharing services to solve the development dilemma and maintain or even increase social welfare benefits from ride-sharing, including reduced carbon emissions and improved vehicle occupancy rates.

Mathematics education, a crucial and basic field, significantly influences students' learning in related subjects and their future careers. Utilizing artificial intelligence to interpret and comprehend math problems in education is not yet fully explored. This is due to the scarcity of quality datasets and the intricacies of processing handwritten information. In this paper, we present a novel contribution to the field of mathematics education through the development of MNIST-Fraction, a dataset inspired by the renowned MNIST, specifically tailored for the recognition and understanding of handwritten math fractions. Our approach is the utilization of deep learning, specifically Convolutional Neural Networks (CNNs), for the recognition and understanding of handwritten math fractions to effectively detect and analyze fractions, along with their numerators and denominators. This capability is pivotal in calculating the value of fractions, a fundamental aspect of math learning. The MNIST-Fraction dataset is designed to closely mimic real-world scenarios, providing a reliable and relevant resource for AI-driven educational tools. Furthermore, we conduct a comprehensive comparison of our dataset with the original MNIST dataset using various classifiers, demonstrating the effectiveness and versatility of MNIST-Fraction in both detection and classification tasks. This comparative analysis not only validates the practical utility of our dataset but also offers insights into its potential applications in math education. To foster collaboration and further research within the computational and educational communities. Our work aims to bridge the gap in high-quality educational resources for math learning, offering a valuable tool for both educators and researchers in the field.

As decentralized applications on permissionless blockchains are prevalent, more and more latency-sensitive usage scenarios emerged, where the lower the latency of sending and receiving messages, the better the chance of earning revenue. To reduce latency, we present Pioplat, a feasible, customizable, and low-cost latency reduction framework consisting of multiple relay nodes on different continents and at least one instrumented variant of a full node. The node selection strategy of Pioplat and the low-latency communication protocol offer an elastic way to reduce latency effectively. We demonstrate Pioplat's feasibility with an implementation running on five continents and show that Pioplat can significantly reduce the latency of receiving blocks/transactions and sending transactions, thus fulfilling the requirements of most latency-sensitive use cases. Furthermore, we provide the complete implementation of Pioplat to promote further research and allow people to apply the framework to more blockchain systems., Comment: 12 pages, 5 figures

Mixup is a data augmentation technique that enhances model generalization by interpolating between data points using a mixing ratio $\lambda$ in the image domain. Recently, the concept of mixup has been adapted to the graph domain through node-centric interpolations. However, these approaches often fail to address the complexity of interconnected relationships, potentially damaging the graph's natural topology and undermining node interactions. Furthermore, current graph mixup methods employ a one-size-fits-all strategy with a randomly sampled $\lambda$ for all mixup pairs, ignoring the diverse needs of different pairs. This paper proposes an Adaptive Graph Mixup (AGMixup) framework for semi-supervised node classification. AGMixup introduces a subgraph-centric approach, which treats each subgraph similarly to how images are handled in Euclidean domains, thus facilitating a more natural integration of mixup into graph-based learning. We also propose an adaptive mechanism to tune the mixing ratio $\lambda$ for diverse mixup pairs, guided by the contextual similarity and uncertainty of the involved subgraphs. Extensive experiments across seven datasets on semi-supervised node classification benchmarks demonstrate AGMixup's superiority over state-of-the-art graph mixup methods. Source codes are available at \url{https://github.com/WeigangLu/AGMixup}., Comment: Accepted by AAAI 2025

In this article, we use a class of harmonic functions (maybe multi-valued) to study the equality part in a weighted version of Suita conjecture for high derivatives and finite points case, and we obtain some sufficient and necessary conditions for the equality part to hold when the harmonic part $u$ of the weight is trivial., Comment: 20 pages. All comments are welcome!

While the capacity to self-regulate has been found to be crucial for secondary school students, prior studies often rely on self-report surveys and think-aloud protocols that present notable limitations in capturing self-regulated learning (SRL) processes. This study advances the understanding of SRL in secondary education by using trace data to examine SRL processes during multi-source writing tasks, with higher education participants included for comparison. We collected fine-grained trace data from 66 secondary school students and 59 university students working on the same writing tasks within a shared SRL-oriented learning environment. The data were labelled using Bannert's validated SRL coding scheme to reflect specific SRL processes, and we examined the relationship between these processes, essay performance, and educational levels. Using epistemic network analysis (ENA) to model and visualise the interconnected SRL processes in Bannert's coding scheme, we found that: (a) secondary school students predominantly engaged in three SRL processes -- Orientation, Re-reading, and Elaboration/Organisation; (b) high-performing secondary students engaged more in Re-reading, while low-performing students showed more Orientation process; and (c) higher education students exhibited more diverse SRL processes such as Monitoring and Evaluation than their secondary education counterparts, who heavily relied on following task instructions and rubrics to guide their writing. These findings highlight the necessity of designing scaffolding tools and developing teacher training programs to enhance awareness and development of SRL skills for secondary school learners.