Search

With the increasing development of intelligent transportation systems and advancements in aviation technology, the concept of Advanced Air Mobility (AAM) is gaining attention. This study aims to improve operational safety and service quality within Urban Air Mobility (UAM) through a trajectory-based operation (TBO). A multi-layer operational risk assessment model is introduced to capture the effects of aircraft failure scenarios on critical urban entities, including ground personnel, vehicles, and in-flight UAVs (unmanned aerial vehicles). Based on this, a single-aircraft track planning model is designed to balance operational risk and transportation cost under the performance constraints of eVTOL (electric Vertical Take-off and Landing) aircraft. A customized track planning algorithm with safety buffer zones is used to identify the most efficient flight paths. Additionally, a multi-aircraft scheduling optimization model is proposed to minimize delays and reduce mid-air collision risks. Experimental results show that the presented approach improves both efficiency and safety, providing practical solutions for UAM operations., Comment: 35 pages, 24 figures,7 tables

SMILES, a crucial textual representation of molecular structures, has garnered significant attention as a foundation for pre-trained language models (LMs). However, most existing pre-trained SMILES LMs focus solely on the single-token level supervision during pre-training, failing to fully leverage the substructural information of molecules. This limitation makes the pre-training task overly simplistic, preventing the models from capturing richer molecular semantic information. Moreover, during pre-training, these SMILES LMs only process corrupted SMILES inputs, never encountering any valid SMILES, which leads to a train-inference mismatch. To address these challenges, we propose SMI-Editor, a novel edit-based pre-trained SMILES LM. SMI-Editor disrupts substructures within a molecule at random and feeds the resulting SMILES back into the model, which then attempts to restore the original SMILES through an editing process. This approach not only introduces fragment-level training signals, but also enables the use of valid SMILES as inputs, allowing the model to learn how to reconstruct complete molecules from these incomplete structures. As a result, the model demonstrates improved scalability and an enhanced ability to capture fragment-level molecular information. Experimental results show that SMI-Editor achieves state-of-the-art performance across multiple downstream molecular tasks, and even outperforming several 3D molecular representation models.

We present the first multi-band centimeter detection of POX 52, a nearby dwarf galaxy believed to habor a robust intermediate mass black hole (IMBH). We conducted the deep observations using the Australia Telescope Compact Array (ATCA), spanning frequencies from 4.5 to 10 GHz, as well as the sensitive observations from the Karl G. Jansky Very Large Array (VLA) operating in its most extended A-configuration at S band (2--4 GHz) and C band (4--8 GHz). In the ATCA observations, the source shows a compact morphology, with only one direction marginally resolved. The higher resolution of the VLA allowed us to slightly resolve the source, fitting it well with a two-dimensional Gaussian model. The detected radio emission confirms the presence of Active Galactic Nucleus (AGN) activity, indicating either a low-power jet or AGN-driven winds/outflows. Our dual-epoch observations with ATCA and VLA, together with previous non-detection flux density upper limits, reveal radio emission variability spanning two decades. In addition, we find that POX 52 aligns well with the low-mass extension of the fundamental plane for high-accretion, radio-quiet massive AGNs., Comment: Submitted to ApJ; 11 pages, 3 figures

Electro-optic modulators for next-generation optical interconnects require low loss-efficiency products, compact footprints, high modulation efficiency, broad bandwidths, and low losses. Here we propose and demonstrate a low-loss high-efficiency thin-film lithium-niobate Mach Zehnder modulator enabled by a novel ultralow-loss slow-light structure based on apodized gratings in cascade. The present loss-engineered slow-light structure achieves excess losses as low as 0.6 dB/mm experimentally, which is tens of times lower than conventional slow-light structures, and a high modulation bandwidth up to 320GHz in theory is achieved with optimally-designed capacitively-loaded traveling-wave electrodes. Experimentally, the fabricated slow-light modulator with a 2.8-mm-long modulation region has an ultra-low loss-efficiency product of 7.4 VdB and a flat electro-optic response up to 67 GHz, enabling 100-Gbps on-off keying with high ERs of 4.5 dB at a low driving voltage of 2Vpp, while 200-Gbps PAM4 and 150-Gbps PAM8 signals are also generated to show great promise for advanced modulation formats. In particular, it has also achieved the highest figure-of-merit(FOM) of 182 for high-speed optical modulation , including the bit rate, the extinction ratio normalized with respective to Vpp, the modulation efficiency. The outstanding performance of the present apodized-grating-based slow-light modulator shows great potential and paves the way for developing high-speed optical interconnects for both data-centers and high-performance computing systems.

Scoliosis is one of the most common diseases in adolescents. Traditional screening methods for the scoliosis usually use radiographic examination, which requires certified experts with medical instruments and brings the radiation risk. Considering such requirement and inconvenience, we propose to use natural images of the human back for wide-range scoliosis screening, which is a challenging problem. In this paper, we notice that the human back has a certain degree of symmetry, and asymmetrical human backs are usually caused by spinal lesions. Besides, scoliosis severity levels have ordinal relationships. Taking inspiration from this, we propose a dual-path scoliosis detection network with two main modules: symmetric feature matching module (SFMM) and ordinal regression head (ORH). Specifically, we first adopt a backbone to extract features from both the input image and its horizontally flipped image. Then, we feed the two extracted features into the SFMM to capture symmetric relationships. Finally, we use the ORH to transform the ordinal regression problem into a series of binary classification sub-problems. Extensive experiments demonstrate that our approach outperforms state-of-the-art methods as well as human performance, which provides a promising and economic solution to wide-range scoliosis screening. In particular, our method achieves accuracies of 95.11% and 81.46% in estimation of general severity level and fine-grained severity level of the scoliosis, respectively., Comment: This paper has been accepted by Applied Intelligence

Quantum networks provide a novel framework for quantum information processing, significantly enhancing system capacity through the interconnection of modular quantum nodes. Beyond the capability to distribute quantum states, the ability to remotely control quantum gates is a pivotal step for quantum networks. In this Letter, we implement high fidelity quantum controlled-NOT (CNOT) gate teleportation with state-of-the-art silicon photonic integrated circuits. Based on on-chip generation of path-entangled quantum state, CNOT gate operation and chip-to-chip quantum photonic interconnect, the CNOT gate is teleported between two remote quantum nodes connected by the single-mode optical fiber. Equip with 5 m (1 km)-long interconnecting fiber, quantum gate teleportation is verified by entangling remote qubits with 95.69% +- 1.19% (94.07% +- 1.54%) average fidelity and gate tomography with 94.81% +- 0.81% (93.04% +- 1.09%) fidelity. These results advance the realization of large-scale and practical quantum networks with photonic integrated circuits., Comment: 6 pages, 3 figures

We investigate the spin-density wave (SDW) behavior and the potential for superconductivity (SC) in La$_4$Ni$_3$O$_{10}$ under ambient pressure using a multi-orbital random-phase approximation (RPA). Starting with a twelve-orbital tight-binding model derived from density functional theory (DFT) calculations, we explore the influence of Hubbard interactions on SDW formation. Our analysis reveals a stripe-like SDW characterized by an incommensurate wave vector, $Q\approx(\pm 0.7\pi,0)$, suggesting a possible density wave instability in agreement with recent experiments. This configuration is driven by nesting of outer-layer Ni $d_{z^2}$ orbitals and exhibits interlayer antiferromagnetic ordering between the top and bottom NiO layers, with the middle layer serving as a node. We demonstrate that the Hund's coupling $J_H$ is the primary driver of the observed SDW. While superconductivity is absent in the undoped system under ambient pressure, it becomes attainable with appropriate hole doping ($\delta=-0.4$), resulting in a SC gap structure similar to the high-pressure phase. Our study identifies the specific conditions for realizing the ambient pressure stripe density wave: $J_H>0.16U$. Additionally, when doping leads to sufficient nesting at (0,0), the system's magnetic fluctuations transition into a stable Neel-type antiferromagnetic state, analogous to the high-pressure case., Comment: 6 pages, 7 figures

This study investigates the dynamic relationship between the built environment and travel in Austin, Texas, over a 20-year period. Using three waves of household travel surveys from 1997, 2006, and 2017, the research employs a repeated cross-sectional approach to address the limitations of traditional longitudinal and cross-sectional studies. Methodologically, it integrates machine learning and inferential modeling to uncover non-linear relationships and threshold effects of built environment characteristics on travel. Findings reveal that the built environment serves as a sustainable tool for managing travel in the long term, contributing 50% or more to the total feature importance in predicting individual travel-surpassing the combined effects of personal and household characteristics. Increased transit accessibility, local and regional destination accessibility, population and employment density, and diversity significantly reduce travel, particularly within their identified thresholds, though the magnitude of their influence varies across time periods. These findings highlight the potential of smart growth policies-such as expanding transit accessibility, promoting high-density and mixed-use development, and discouraging single-use development and peripheral sprawl-as effective strategies to reduce car dependency and manage travel demand.

Solar energetic particle (SEP) events are associated with coronal mass ejections (CMEs) and/or solar flares. SEPs travel through the corona and interplanetary space to reach Earth, posing a radiation hazard to spacecraft and astronauts working in space and the electronics on spacecraft. Due to the distinct magnetic field configuration and solar eruption kinematic properties associated with each event, the utilization of a data-driven model becomes essential for predicting SEP hazards. In this study, we use a developed model that utilizes photospheric magnetic field measurements and CME shock observations as inputs to simulate several historical SEP events associated with fast CME speeds (>700 km/s). The model includes an SEP source term aligned with the theory of diffusive shock acceleration by the CME shock. The performance of the model is accessed by comparing simulations and observations of SEP intensity time profiles at SOHO, ACE, STEREO-A and STEREO-B. The results generally matched observations well, particularly for protons below 40.0 MeV. However, discrepancies arose for higher-energy protons, notably for the events on 2011 March 7 and 2014 February 25, where the simulation tended to overestimate the proton flux . At STEREO-A, the modeled proton intensities for the SEP events on 2013 April 11 and 2011 March 7 display a very different behavior compared to observations because of the efficient transport in longitude caused by the weak magnetic field., Comment: 22 pages, 16 figures

One dimensional fluid/electron Monte Carlo simulations of capacitively coupled Ar/O2 discharges driven by sawtooth up voltage waveforms are performed as a function of the number of consecutive harmonics driving frequencies of 13.56 MHz, N (1-3), pressure (200-500 mTorr) and gas mixture (10-90 % admixture of O2 to Ar). The effects of these external parameters on the electron dynamics, and the transport of ions and neutrals are revealed at constant peak-to-peak driving voltage. The electronegativity is found to decline as the number of consecutive harmonics increases and the DC self-bias voltage decreases. Increasing the pressure also leads to a decrease in electronegativity. The combination of a decrease in the mean free path of electrons and the presence of the Electrical Asymmetry Effect (EAE) result in different spatio-temporal distributions of the ionization rate, which lead to a reduction in the amplitude of the DC self-bias at higher pressure. As the admixture of electronegative O2 increases, the electronegativity is enhanced, and the discharge mode changes from an {\alpha}-Drift Ambipolar (DA) hybrid to DA mode. This work focuses on linking these fundamental changes of the plasma physics induced by changing external parameters to process relevant charged particle and neutral fluxes to the electrodes. Particular attention is paid to O(1D) flux, because it is a precursor of deposition. In discharges driven by sawtooth up voltage waveforms, placing the substrate on the grounded electrode and increasing the number of consecutive harmonics, N, can facilitate the deposition process, since the O(1D) flux to the substrate is higher in these scenarios. Moreover, at an O2 admixture of 20%, the O(1D) flux is nearly as high as that at an O2 admixture of 90%, indicating that a higher O(1D) flux can be achieved without excessively increasing the O2 admixture., Comment: Ar/O2 gas discharges, electron dynamics, transport of charged and neutral particles, sawtooth up voltage waveforms

We derive a $K$-theoretic analogue of the Vafa--Intriligator formula, computing the (virtual) Euler characteristics of vector bundles over the Quot scheme that compactifies the space of degree $d$ morphisms from a fixed projective curve to the Grassmannian $\mathrm{Gr}(r,N)$. As an application, we deduce interesting vanishing results, used in Part I (arXiv:2406.12191) to study the quantum $K$-ring of $\mathrm{Gr}(r,N)$. In the genus-zero case, we prove a simplified formula involving Schur functions, consistent with the Borel-Weil-Bott theorem in the degree-zero setting. These new formulas offer a novel approach for computing the structure constants of quantum $K$-products., Comment: 45 pages

In this paper, we focus on the generalized Einstein-Maxwell-Dilaton (EMD) gravity, including a nonminimal coupling term between the Maxwell field and scalar field. We construct charged lifshitz black holes with scalar hair of EMD gravity in the presence of cosmological constant for various horizon topologies $(k = 0, \pm 1)$. Then, we consider the scalar perturbations of charged Lifshitz black hole solutions and explore quasinormal modes (QNMs) of these black holes. By using the improved asymptotic iteration method (AIM), we recover the effects of factors such as the curvature, mass, and critical dynamic exponent of black holes on the QNMs.

Source-free domain adaptation is a crucial machine learning topic, as it contains numerous applications in the real world, particularly with respect to data privacy. Existing approaches predominantly focus on Euclidean data, such as images and videos, while the exploration of non-Euclidean graph data remains scarce. Recent graph neural network (GNN) approaches can suffer from serious performance decline due to domain shift and label scarcity in source-free adaptation scenarios. In this study, we propose a novel method named Graph Diffusion-based Alignment with Jigsaw (GALA), tailored for source-free graph domain adaptation. To achieve domain alignment, GALA employs a graph diffusion model to reconstruct source-style graphs from target data. Specifically, a score-based graph diffusion model is trained using source graphs to learn the generative source styles. Then, we introduce perturbations to target graphs via a stochastic differential equation instead of sampling from a prior, followed by the reverse process to reconstruct source-style graphs. We feed the source-style graphs into an off-the-shelf GNN and introduce class-specific thresholds with curriculum learning, which can generate accurate and unbiased pseudo-labels for target graphs. Moreover, we develop a simple yet effective graph-mixing strategy named graph jigsaw to combine confident graphs and unconfident graphs, which can enhance generalization capabilities and robustness via consistency learning. Extensive experiments on benchmark datasets validate the effectiveness of GALA., Comment: IEEE TPAMI

Supervised fine-tuning (SFT) is crucial in adapting large language models (LLMs) to a specific domain or task. However, only a limited amount of labeled data is available in practical applications, which poses a severe challenge for SFT in yielding satisfactory results. Therefore, a data-efficient framework that can fully exploit labeled and unlabeled data for LLM fine-tuning is highly anticipated. Towards this end, we introduce a semi-supervised fine-tuning framework named SemiEvol for LLM adaptation from a propagate-and-select manner. For knowledge propagation, SemiEvol adopts a bi-level approach, propagating knowledge from labeled data to unlabeled data through both in-weight and in-context methods. For knowledge selection, SemiEvol incorporates a collaborative learning mechanism, selecting higher-quality pseudo-response samples. We conducted experiments using GPT-4o-mini and Llama-3.1 on seven general or domain-specific datasets, demonstrating significant improvements in model performance on target data. Furthermore, we compared SemiEvol with SFT and self-evolution methods, highlighting its practicality in hybrid data scenarios.

Bone marrow lesions (BMLs) are critical indicators of knee osteoarthritis (OA). Since they often appear as small, irregular structures with indistinguishable edges in knee magnetic resonance images (MRIs), effective detection of BMLs in MRI is vital for OA diagnosis and treatment. This paper proposes a semi-supervised local anomaly detection method using mask inpainting models for identification of BMLs in high-resolution knee MRI, effectively integrating a 3D femur bone segmentation model, a large mask inpainting model, and a series of post-processing techniques. The method was evaluated using MRIs at various resolutions from a subset of the public Osteoarthritis Initiative database. Dice score, Intersection over Union (IoU), and pixel-level sensitivity, specificity, and accuracy showed an advantage over the multiresolution knowledge distillation method-a state-of-the-art global anomaly detection method. Especially, segmentation performance is enhanced on higher-resolution images, achieving an over two times performance increase on the Dice score and the IoU score at a 448x448 resolution level. We also demonstrate that with increasing size of the BML region, both the Dice and IoU scores improve as the proportion of distinguishable boundary decreases. The identified BML masks can serve as markers for downstream tasks such as segmentation and classification. The proposed method has shown a potential in improving BML detection, laying a foundation for further advances in imaging-based OA research., Comment: 5 pages, 3 figures, submitted to SPIE Conference on Image Processing

In this paper, we explore the quasinormal modes (QNMs) of a black hole surrounded by a fluid of strings within the framework of Rastall gravity. We analyze the behavior of scalar, electromagnetic, and gravitational perturbations, focusing on the influence of the black hole charge $Q$ and angular momentum $l$ on the quasinormal frequencies. Our numerical results reveal a significant dependence on the parameter $\varepsilon$. These trends are consistent across different types of perturbations, emphasizing the relationship between black hole parameters and QNMs behavior.

In this paper, we focus on massive Einstein-dilaton gravity including the coupling of dilaton scalar field to massive graviton terms, and then derive static and spherically symmetric solutions of charged dilatonic black holes in four dimensional spacetime. We find that the dilatonic black hole could possess different horizon structures for some suitably parameters. Then, we also investigate the thermodynamic properties of charged dilatonic black holes where $f(r)$ approaches $+\infty$ and $-\infty$, respectively., Comment: 19 pages, 5 figures. arXiv admin note: text overlap with arXiv:2310.14653

Graph neural networks (GNNs) have achieved impressive performance in graph domain adaptation. However, extensive source graphs could be unavailable in real-world scenarios due to privacy and storage concerns. To this end, we investigate an underexplored yet practical problem of source-free graph domain adaptation, which transfers knowledge from source models instead of source graphs to a target domain. To solve this problem, we introduce a novel GNN-based approach called Rank and Align (RNA), which ranks graph similarities with spectral seriation for robust semantics learning, and aligns inharmonic graphs with harmonic graphs which close to the source domain for subgraph extraction. In particular, to overcome label scarcity, we employ the spectral seriation algorithm to infer the robust pairwise rankings, which can guide semantic learning using a similarity learning objective. To depict distribution shifts, we utilize spectral clustering and the silhouette coefficient to detect harmonic graphs, which the source model can easily classify. To reduce potential domain discrepancy, we extract domain-invariant subgraphs from inharmonic graphs by an adversarial edge sampling process, which guides the invariant learning of GNNs. Extensive experiments on several benchmark datasets demonstrate the effectiveness of our proposed RNA., Comment: Published in IJCAI2024

In recent years, with the rapid application of large language models across various fields, the scale of these models has gradually increased, and the resources required for their pre-training have grown exponentially. Training an LLM from scratch will cost a lot of computation resources while scaling up from a smaller model is a more efficient approach and has thus attracted significant attention. In this paper, we present AquilaMoE, a cutting-edge bilingual 8*16B Mixture of Experts (MoE) language model that has 8 experts with 16 billion parameters each and is developed using an innovative training methodology called EfficientScale. This approach optimizes performance while minimizing data requirements through a two-stage process. The first stage, termed Scale-Up, initializes the larger model with weights from a pre-trained smaller model, enabling substantial knowledge transfer and continuous pretraining with significantly less data. The second stage, Scale-Out, uses a pre-trained dense model to initialize the MoE experts, further enhancing knowledge transfer and performance. Extensive validation experiments on 1.8B and 7B models compared various initialization schemes, achieving models that maintain and reduce loss during continuous pretraining. Utilizing the optimal scheme, we successfully trained a 16B model and subsequently the 8*16B AquilaMoE model, demonstrating significant improvements in performance and training efficiency.

Retrieval-augmented generation (RAG) is a framework enabling large language models (LLMs) to enhance their accuracy and reduce hallucinations by integrating external knowledge bases. In this paper, we introduce a hybrid RAG system enhanced through a comprehensive suite of optimizations that significantly improve retrieval quality, augment reasoning capabilities, and refine numerical computation ability. We refined the text chunks and tables in web pages, added attribute predictors to reduce hallucinations, conducted LLM Knowledge Extractor and Knowledge Graph Extractor, and finally built a reasoning strategy with all the references. We evaluated our system on the CRAG dataset through the Meta CRAG KDD Cup 2024 Competition. Both the local and online evaluations demonstrate that our system significantly enhances complex reasoning capabilities. In local evaluations, we have significantly improved accuracy and reduced error rates compared to the baseline model, achieving a notable increase in scores. In the meanwhile, we have attained outstanding results in online assessments, demonstrating the performance and generalization capabilities of the proposed system. The source code for our system is released in \url{https://gitlab.aicrowd.com/shizueyy/crag-new}., Comment: Technical report for 3rd prize in Task 1 of Meta CRAG KDD Cup 2024

In this work, we introduce Gemma 2, a new addition to the Gemma family of lightweight, state-of-the-art open models, ranging in scale from 2 billion to 27 billion parameters. In this new version, we apply several known technical modifications to the Transformer architecture, such as interleaving local-global attentions (Beltagy et al., 2020a) and group-query attention (Ainslie et al., 2023). We also train the 2B and 9B models with knowledge distillation (Hinton et al., 2015) instead of next token prediction. The resulting models deliver the best performance for their size, and even offer competitive alternatives to models that are 2-3 times bigger. We release all our models to the community.

Task-oriented dialogue (TOD) systems aim to efficiently handle task-oriented conversations, including information collection. How to utilize TOD accurately, efficiently and effectively for information collection has always been a critical and challenging task. Recent studies have demonstrated that Large Language Models (LLMs) excel in dialogue, instruction generation, and reasoning, and can significantly enhance the performance of TOD through fine-tuning. However, current datasets primarily cater to user-led systems and are limited to predefined specific scenarios and slots, thereby necessitating improvements in the proactiveness, diversity, and capabilities of TOD. In this study, we present a detailed multi-domain task-oriented data construction process for conversations, and a Chinese dialogue dataset generated based on this process, TransferTOD, which authentically simulates human-computer dialogues in 30 popular life service scenarios. Leveraging this dataset, we trained a model called TransferTOD-7B using full-parameter fine-tuning, showcasing notable abilities in slot filling and questioning. Our work has demonstrated its strong generalization capabilities in various downstream scenarios, significantly enhancing both data utilization efficiency and system performance. The data is released in https://github.com/KongLongGeFDU/TransferTOD.

Graph classification is a critical task in numerous multimedia applications, where graphs are employed to represent diverse types of multimedia data, including images, videos, and social networks. Nevertheless, in real-world scenarios, labeled graph data can be limited or scarce. To address this issue, we focus on the problem of semi-supervised graph classification, which involves both supervised and unsupervised models learning from labeled and unlabeled data. In contrast to recent approaches that transfer the entire knowledge from the unsupervised model to the supervised one, we argue that an effective transfer should only retain the relevant semantics that align well with the supervised task. In this paper, we propose a novel framework named DisenSemi, which learns disentangled representation for semi-supervised graph classification. Specifically, a disentangled graph encoder is proposed to generate factor-wise graph representations for both supervised and unsupervised models. Then we train two models via supervised objective and mutual information (MI)-based constraints respectively. To ensure the meaningful transfer of knowledge from the unsupervised encoder to the supervised one, we further define an MI-based disentangled consistency regularization between two models and identify the corresponding rationale that aligns well with the current graph classification task. Experimental results on a range of publicly accessible datasets reveal the effectiveness of our DisenSemi., Comment: Accepted by IEEE Transactions on Neural Networks and Learning Systems (TNNLS 2024)

Geometry problem solving (GPS) requires capacities of multi-modal understanding, multi-hop reasoning and theorem knowledge application. In this paper, we propose a neural-symbolic model for plane geometry problem solving (PGPS), named PGPSNet-v2, with three key steps: modal fusion, reasoning process and knowledge verification. In modal fusion, we leverage textual clauses to express fine-grained structural and semantic content of geometry diagram, and fuse diagram with textual problem efficiently through structural-semantic pre-training. For reasoning, we design an explicable solution program to describe the geometric reasoning process, and employ a self-limited decoder to generate solution program autoregressively. To reduce solution errors, a multi-level theorem verifier is proposed to eliminate solutions that do not match geometric principles, alleviating the hallucination of the neural model. We also construct a large-scale geometry problem dataset called PGPS9K, containing fine-grained annotations of textual clauses, solution program and involved knowledge tuples. Extensive experiments on datasets Geometry3K and PGPS9K show that our PGPSNet solver outperforms existing symbolic and neural solvers in GPS performance, while maintaining good explainability and reliability, and the solver components (fusion, reasoning, verification) are all justified effective., Comment: under review by journal

The increasing development of large language models (LLMs) in code generation has drawn significant attention among researchers. To enhance LLM-based code generation ability, current efforts are predominantly directed towards collecting high-quality datasets and leveraging diverse training technologies. However, there is a notable lack of comprehensive studies examining the limitations and boundaries of these existing methods. To bridge this gap, we conducted an extensive empirical study evaluating the performance of three leading closed-source LLMs and four popular open-source LLMs on three commonly used benchmarks. Our investigation, which evaluated the length, cyclomatic complexity and API number of the generated code, revealed that these LLMs face challenges in generating successful code for more complex problems, and tend to produce code that is shorter yet more complicated as compared to canonical solutions. Additionally, we developed a taxonomy of bugs for incorrect codes that includes three categories and 12 sub-categories, and analyze the root cause for common bug types. Furthermore, to better understand the performance of LLMs in real-world projects, we manually created a real-world benchmark comprising 140 code generation tasks. Our analysis highlights distinct differences in bug distributions between actual scenarios and existing benchmarks. Finally, we propose a novel training-free iterative method that introduces self-critique, enabling LLMs to critique and correct their generated code based on bug types and compiler feedback. Experimental results demonstrate that our approach can significantly mitigate bugs and increase the passing rate by 29.2% after two iterations, indicating substantial potential for LLMs to handle more complex problems., Comment: 17 pages, 7 figures

Visually impaired people are a large group who can only use braille for reading and writing. However, the lack of special educational resources is the bottleneck for educating them. Educational equity is a reflection of the level of social civilization, cultural equality, and individual dignity. Facilitating and improving lifelong learning channels for the visually impaired is of great significance. Their written braille homework or exam papers cannot be understood by sighted teachers, because of the lack of a highly accurate braille translation system, especially in Chinese which has tone marks. braille writers often omit tone marks to save space, leading to confusion when braille with the same consonants and vowels is translated into Chinese. Previous algorithms were insufficient in extracting contextual information, resulting in low accuracy of braille translations into Chinese. This project informatively fine-tuned the mT5 model with an Encoder-decoder architecture for braille to Chinese character conversion. This research created a training set of braille and corresponding Chinese text from the Leipzig Corpora. This project significantly reduced the confusion in braille, achieving $62.4$ and $62.3$ BLEU scores in the validation and test sets, with a curriculum learning fine-tuning method. By incorporating the braille recognition algorithm, this project is the first publicly available braille translation system and can benefit lots of visually impaired students and families who are preparing for the Chinese College Test and help to propel their college dreams in the future. There is a demo on our homepage\footnote{\url{https://vision-braille.com/}}., Comment: This paper is submitted to NeurIPS 2024 High School Project Track

Large Multimodal Models (LMMs) exhibit impressive cross-modal understanding and reasoning abilities, often assessed through multiple-choice questions (MCQs) that include an image, a question, and several options. However, many benchmarks used for such evaluations suffer from systematic biases. Remarkably, Large Language Models (LLMs) without any visual perception capabilities achieve non-trivial performance, undermining the credibility of these evaluations. To address this issue while maintaining the efficiency of MCQ evaluations, we propose MMEvalPro, a benchmark designed to avoid Type-I errors through a trilogy evaluation pipeline and more rigorous metrics. For each original question from existing benchmarks, human annotators augment it by creating one perception question and one knowledge anchor question through a meticulous annotation process. MMEvalPro comprises $2,138$ question triplets, totaling $6,414$ distinct questions. Two-thirds of these questions are manually labeled by human experts, while the rest are sourced from existing benchmarks (MMMU, ScienceQA, and MathVista). Compared with the existing benchmarks, our experiments with the latest LLMs and LMMs demonstrate that MMEvalPro is more challenging (the best LMM lags behind human performance by $31.73\%$, compared to an average gap of $8.03\%$ in previous benchmarks) and more trustworthy (the best LLM trails the best LMM by $23.09\%$, whereas the gap for previous benchmarks is just $14.64\%$). Our in-depth analysis explains the reason for the large performance gap and justifies the trustworthiness of evaluation, underscoring its significant potential for advancing future research., Comment: 21 pages, code released at https://github.com/chenllliang/MMEvalPro, Homepage at https://mmevalpro.github.io/

Due to the rapid advancements in multimodal large language models, evaluating their multimodal mathematical capabilities continues to receive wide attention. Despite the datasets like MathVista proposed benchmarks for assessing mathematical capabilities in multimodal scenarios, there is still a lack of corresponding evaluation tools and datasets for fine-grained assessment in the context of K12 education in Chinese language. To systematically evaluate the capability of multimodal large models in solving Chinese multimodal mathematical problems, we propose a Chinese Multi-modal Math Skill Evaluation Benchmark, named CMMaTH, contraining 23k multimodal K12 math related questions, forming the largest Chinese multimodal mathematical problem benchmark to date. CMMaTH questions from elementary to high school levels, provide increased diversity in problem types, solution objectives, visual elements, detailed knowledge points, and standard solution annotations. We have constructed an open-source tool GradeGPT integrated with the CMMaTH dataset, facilitating stable, rapid, and cost-free model evaluation. Our data and code are available.

Graph pooling has gained attention for its ability to obtain effective node and graph representations for various downstream tasks. Despite the recent surge in graph pooling approaches, there is a lack of standardized experimental settings and fair benchmarks to evaluate their performance. To address this issue, we have constructed a comprehensive benchmark that includes 17 graph pooling methods and 28 different graph datasets. This benchmark systematically assesses the performance of graph pooling methods in three dimensions, i.e., effectiveness, robustness, and generalizability. We first evaluate the performance of these graph pooling approaches across different tasks including graph classification, graph regression and node classification. Then, we investigate their performance under potential noise attacks and out-of-distribution shifts in real-world scenarios. We also involve detailed efficiency analysis, backbone analysis, parameter analysis and visualization to provide more evidence. Extensive experiments validate the strong capability and applicability of graph pooling approaches in various scenarios, which can provide valuable insights and guidance for deep geometric learning research. The source code of our benchmark is available at https://github.com/goose315/Graph_Pooling_Benchmark.

In recent years, deep learning on graphs has achieved remarkable success in various domains. However, the reliance on annotated graph data remains a significant bottleneck due to its prohibitive cost and time-intensive nature. To address this challenge, self-supervised learning (SSL) on graphs has gained increasing attention and has made significant progress. SSL enables machine learning models to produce informative representations from unlabeled graph data, reducing the reliance on expensive labeled data. While SSL on graphs has witnessed widespread adoption, one critical component, Graph Contrastive Learning (GCL), has not been thoroughly investigated in the existing literature. Thus, this survey aims to fill this gap by offering a dedicated survey on GCL. We provide a comprehensive overview of the fundamental principles of GCL, including data augmentation strategies, contrastive modes, and contrastive optimization objectives. Furthermore, we explore the extensions of GCL to other aspects of data-efficient graph learning, such as weakly supervised learning, transfer learning, and related scenarios. We also discuss practical applications spanning domains such as drug discovery, genomics analysis, recommender systems, and finally outline the challenges and potential future directions in this field.

In this paper, we investigate the existence of weak solutions for a class of degenerate elliptic Dirichlet problems with critical nonlinearity and a logarithmic perturbation

Few-body physics for anyons has been intensively studied within the anyon-Hubbard model, including the quantum walk and Bloch oscillations of two-anyon states. However, the known theoretical proposal and experimental simulations of two-anyon states in one-dimensional lattice have been carried out by expanding the wavefunction in terms of non-orthogonal basis vectors, which introduces extra non-physical degrees of freedom. In the present work, we deduce the finite difference equations for the two-anyon state in the one-dimensional lattice by solving the Schr\"odinger equation with orthogonal basis vectors. Such an orthogonal scheme gives all the orthogonal physical eigenstates for the time-independent two-anyon Schr\"odinger equation, while the conventional (non-orthogonal) method produces a lot of non-physical redundant eigen-solutions whose components violate the anyonic relations. The dynamical property of the two-anyon states in a sufficiently large lattice has been investigated and compared in both the orthogonal and conventional schemes, which proves to depend crucially on the initial states. When the initial states with two anyons on the same site or (next-)neighboring sites are suitably chosen to be in accordance with the anyonic coefficient relation, we observe exactly the same dynamical behavior in the two schemes, including the revival probability, the probability density function, and the two-body correlation, otherwise, the conventional scheme will produce erroneous results which not any more describe anyons. The period of the Bloch oscillation in the pseudo-fermionic limit is found to be twice that in the bosonic limit, while the oscillations disappear for statistical parameters in between. Our findings are vital for quantum simulations of few-body physics with anyons in the lattice., Comment: 11 pages, 9 figures

In this paper, we study semi-supervised graph classification, which aims at accurately predicting the categories of graphs in scenarios with limited labeled graphs and abundant unlabeled graphs. Despite the promising capability of graph neural networks (GNNs), they typically require a large number of costly labeled graphs, while a wealth of unlabeled graphs fail to be effectively utilized. Moreover, GNNs are inherently limited to encoding local neighborhood information using message-passing mechanisms, thus lacking the ability to model higher-order dependencies among nodes. To tackle these challenges, we propose a Hypergraph-Enhanced DuAL framework named HEAL for semi-supervised graph classification, which captures graph semantics from the perspective of the hypergraph and the line graph, respectively. Specifically, to better explore the higher-order relationships among nodes, we design a hypergraph structure learning to adaptively learn complex node dependencies beyond pairwise relations. Meanwhile, based on the learned hypergraph, we introduce a line graph to capture the interaction between hyperedges, thereby better mining the underlying semantic structures. Finally, we develop a relational consistency learning to facilitate knowledge transfer between the two branches and provide better mutual guidance. Extensive experiments on real-world graph datasets verify the effectiveness of the proposed method against existing state-of-the-art methods., Comment: Accepted by Proceedings of the 41st International Conference on Machine Learning (ICML 2024)

In Re-identification (ReID), recent advancements yield noteworthy progress in both unimodal and cross-modal retrieval tasks. However, the challenge persists in developing a unified framework that could effectively handle varying multimodal data, including RGB, infrared, sketches, and textual information. Additionally, the emergence of large-scale models shows promising performance in various vision tasks but the foundation model in ReID is still blank. In response to these challenges, a novel multimodal learning paradigm for ReID is introduced, referred to as All-in-One (AIO), which harnesses a frozen pre-trained big model as an encoder, enabling effective multimodal retrieval without additional fine-tuning. The diverse multimodal data in AIO are seamlessly tokenized into a unified space, allowing the modality-shared frozen encoder to extract identity-consistent features comprehensively across all modalities. Furthermore, a meticulously crafted ensemble of cross-modality heads is designed to guide the learning trajectory. AIO is the \textbf{first} framework to perform all-in-one ReID, encompassing four commonly used modalities. Experiments on cross-modal and multimodal ReID reveal that AIO not only adeptly handles various modal data but also excels in challenging contexts, showcasing exceptional performance in zero-shot and domain generalization scenarios., Comment: 12 pages, 3 figure, CVPR 2024

It is believed that dual active galactic nuclei (dual AGN) will form during galaxies merge. Studying dual-AGN emission can provide valuable insights into galaxy merging and evolution. To investigate parsec-scale radio emission properties, we observed eight radio components of four selected dual-AGN systems using the Very Long Baseline Array (VLBA) at 5 GHz in multiple-phase-center mode. Among them, two compact radio components, labeled J0051+0020B and J2300-0005A, were detected clearly on parsec scales for the first time. However, the radio emission of the other six components was resolved out in the high-resolution images. We provided the values or upper limits of the brightness temperature and radio emission power, and analyzed the emission origins in detail for each target. Based on their physical properties reported in this work and in the literature, we suggest the radio emission in J0051+0020B and J2300-0005A originates primarily from compact jets, while the other six sources show more complex emission mechanisms. In addition, our VLBA observations suggest the systematic X-ray deficit in our dual-AGN sample is likely attributed to the tidally induced effect and possible viewing angle effect., Comment: 15 pages, 4 figures

Human cognition exhibits systematic compositionality, the algebraic ability to generate infinite novel combinations from finite learned components, which is the key to understanding and reasoning about complex logic. In this work, we investigate the compositionality of large language models (LLMs) in mathematical reasoning. Specifically, we construct a new dataset \textsc{MathTrap} by introducing carefully designed logical traps into the problem descriptions of MATH and GSM8K. Since problems with logical flaws are quite rare in the real world, these represent "unseen" cases to LLMs. Solving these requires the models to systematically compose (1) the mathematical knowledge involved in the original problems with (2) knowledge related to the introduced traps. Our experiments show that while LLMs possess both components of requisite knowledge, they do not \textbf{spontaneously} combine them to handle these novel cases. We explore several methods to mitigate this deficiency, such as natural language prompts, few-shot demonstrations, and fine-tuning. Additionally, we test the recently released OpenAI o1 model and find that human-like `slow thinking' helps improve the compositionality of LLMs. Overall, systematic compositionality remains an open challenge for large language models., Comment: Accepted by EMNLP 2024

In this work, we discuss the generalized Einstein-Maxwell-Dilaton gravity theory with a nonminimal coupling between the Maxwell field and scalar field. Considering different geometric properties of black hole horizon structure, the charged dilaton Lifshitz black hole solutions are presented in 4-dimensional spacetimes. Later, utilizing the Wald Formalism, we derive the thermodynamic first law of black hole and conserved quantities. According to the relationship between the heat capacity and the local stability of black hole, we study the stability of charged Lifshitz black holes and identify the thermodynamic stable region of black holes that meet the criteria., Comment: 12 pages, 2 figures

Plasma disruption presents a significant challenge in tokamak fusion, where it can cause severe damage and economic losses. Current disruption predictors mainly rely on data-driven methods, requiring extensive discharge data for training. However, future tokamaks require disruption prediction from the first shot, posing challenges of data scarcity during the early operation period. In this period disruption prediction aims to support safe exploration of operation range and accumulate necessary data to develop advanced prediction models. Thus, predictors must adapt to evolving plasma environments during this exploration phase. To address these issues, this study proposes a cross-tokamak adaptive deployment method using the Enhanced Convolutional Autoencoder Anomaly Detection (E-CAAD) predictor, enabling disruption prediction from the first shot of new devices. Experimental results indicate the ability of E-CAAD model trained on existing devices to effectively differentiate between disruption precursors and non-disruption samples on new devices, proving the feasibility of model cross-device transfer. Building upon this, adaptive learning from scratch and threshold adaptive adjustment strategies are proposed to achieve model cross-device transfer. The adaptive learning from scratch strategy enables the predictor to use scarce data during the early operation of the new device while rapidly adapting to changes in operation environment. The threshold adaptive adjustment strategy addresses the challenge of selecting warning thresholds on new devices where validation set is lacking, ensuring that the warning thresholds adapt to changes in the operation environment. Finally, experiments transferring the model from J-TEXT to EAST exhibit comparable performance to EAST models trained with ample data, achieving a TPR of 85.88% and a FPR of 6.15%, with a 20ms reserved MGI system reaction time., Comment: 18 pages, 7 figures

Within the framework of braneworld holography, we construct a quantum charged black hole localized on a three-dimensional anti-de Sitter (AdS) brane that intersects the asymptotic boundary of the four-dimensional AdS spacetime at the conformal defects and incorporates quantum backreaction effects from the conformal field theory (CFT) on the brane. This quantum charged black hole is an exact solution of the semiclassical gravitational equation corresponding to a theory with higher curvature gravity and nonminimally coupled nonlinear gauge field. In the framework of double holography, we investigate the thermodynamics of the quantum charged black hole from three perspectives: a pure bulk perspective, in which four-dimensional classical Einstein gravity couples to Maxwell electrodynamics and a codimension-one tensional brane; a brane perspective, where semiclassical higher curvature gravity is subject to quantum backreaction from the holographic CFT on the brane, yielding a quantum charged black hole; and a boundary perspective, where the defect CFT is coupled to a boundary CFT at the asymptotic boundary and the degrees of freedom for defect quantum conformal matter is considered. In so doing, we obtain doubly holographic formulations of both the first law of thermodynamics and the Smarr (energy) relations for the quantum charged black holes., Comment: 30 pages, 4 figures

Quantum algorithms offer significant speed-ups over their classical counterparts in various applications. In this paper, we develop quantum algorithms for the Kalman filter widely used in classical control engineering using the block encoding method. The entire calculation process is achieved by performing matrix operations on Hamiltonians based on the block encoding framework, including addition, multiplication, and inversion, which can be completed in a unified framework compared to previous quantum algorithms for solving control problems. We demonstrate that the quantum algorithm exponentially accelerates the computation of the Kalman filter compared to traditional methods. The time complexity can be reduced from $O(n^3)$ to $O(\kappa poly\log(n/\epsilon)\log(1/\epsilon'))$, where $n$ represents the matrix dimension, $\kappa$ denotes the condition number for the matrix to be inverted, $\epsilon$ indicates desired precision in block encoding, $\epsilon'$ signifies desired precision in matrix inversion. This paper provides a comprehensive quantum solution for implementing the Kalman filter and serves as an attempt to broaden the scope of quantum computation applications. Finally, we present an illustrative example implemented in Qiskit (a Python-based open-source toolkit) as a proof-of-concept., Comment: 23 pages, 20 figures, 3 tables

We present a new challenge to examine whether large language models understand social norms. In contrast to existing datasets, our dataset requires a fundamental understanding of social norms to solve. Our dataset features the largest set of social norm skills, consisting of 402 skills and 12,383 questions covering a wide set of social norms ranging from opinions and arguments to culture and laws. We design our dataset according to the K-12 curriculum. This enables the direct comparison of the social understanding of large language models to humans, more specifically, elementary students. While prior work generates nearly random accuracy on our benchmark, recent large language models such as GPT3.5-Turbo and LLaMA2-Chat are able to improve the performance significantly, only slightly below human performance. We then propose a multi-agent framework based on large language models to improve the models' ability to understand social norms. This method further improves large language models to be on par with humans. Given the increasing adoption of large language models in real-world applications, our finding is particularly important and presents a unique direction for future improvements.