Search

In this paper, we further investigate the orthogonally connected sets and establish necessary and sufficient conditions for a set to be staircase connected., Comment: 13 pages, 11 figures

Let $k$ be a commutative Noetherian ring, and $k[S]$ the polynomial ring with indeterminates parameterized by elements in a set $S$. We show that $k[S]$ is Noetherian up to actions of permutation groups on $S$ satisfying certain combinatorial conditions. Moreover, there is a special linear order on every infinite $S$ such that $k[S]$ is Noetherian up to the action of the order-preserving permutation group, and the existence of such a linear order is equivalent to the Axiom of Choice. These Noetherian results are proved via a sheaf theoretic approach and the work of Nagel-R\"{o}mer.

ASVspoof 5 is the fifth edition in a series of challenges which promote the study of speech spoofing and deepfake attacks as well as the design of detection solutions. We introduce the ASVspoof 5 database which is generated in crowdsourced fashion from data collected in diverse acoustic conditions (cf. studio-quality data for earlier ASVspoof databases) and from ~2,000 speakers (cf. ~100 earlier). The database contains attacks generated with 32 different algorithms, also crowdsourced, and optimised to varying degrees using new surrogate detection models. Among them are attacks generated with a mix of legacy and contemporary text-to-speech synthesis and voice conversion models, in addition to adversarial attacks which are incorporated for the first time. ASVspoof 5 protocols comprise seven speaker-disjoint partitions. They include two distinct partitions for the training of different sets of attack models, two more for the development and evaluation of surrogate detection models, and then three additional partitions which comprise the ASVspoof 5 training, development and evaluation sets. An auxiliary set of data collected from an additional 30k speakers can also be used to train speaker encoders for the implementation of attack algorithms. Also described herein is an experimental validation of the new ASVspoof 5 database using a set of automatic speaker verification and spoof/deepfake baseline detectors. With the exception of protocols and tools for the generation of spoofed/deepfake speech, the resources described in this paper, already used by participants of the ASVspoof 5 challenge in 2024, are now all freely available to the community., Comment: Database link: https://zenodo.org/records/14498691, Database mirror link: https://huggingface.co/datasets/jungjee/asvspoof5, ASVspoof 5 Challenge Workshop Proceeding: https://www.isca-archive.org/asvspoof_2024/index.html

Time-evolving magnetohydrodynamic (MHD) coronal modeling, driven by a series of time-dependent photospheric magnetograms, represents a new generation of coronal simulations. This approach offers greater realism compared to traditional coronal models constrained by a static magnetogram. However, its practical application is seriously limited by low computational efficiency and poor numerical stability. Therefore, we propose an extended magnetic field decomposition strategy and implement it in the implicit MHD model to develop a coronal model that is both efficient and numerically stable enough for simulating the long-term evolutions of the global corona. The traditional decomposition strategies split the magnetic field into a time-invariant potential field and a time-dependent component $\mathbf{B}_1$. It works well for quasi-steady-state coronal simulations where $\left|\mathbf{B}_1\right|$ is typically small. However, as the inner-boundary magnetic field evolves, $\left|\mathbf{B}_1\right|$ can grow significantly larger and its discretization errors often lead to nonphysical negative thermal pressure, ultimately causing the code to crash. In this paper, we mitigate such undesired situations by introducing a temporally piecewise-constant variable to accommodate part of the non-potential field and remain $\left|\mathbf{B}_1\right|$ consistently small throughout the simulations. We incorporate this novel magnetic field decomposition strategy into our implicit MHD coronal model and apply it to simulate the evolution of coronal structures within 0.1 AU over two solar-maximum Carrington rotations. The results show that this coronal model effectively captures observations and performs more than 80 times faster than real time using only 192 CPU cores, making it well-suited for practical applications in simulating the time-evolving corona., Comment: 26 pages,9 figures

Magnetic Resonance Imaging (MRI) offers critical insights into microstructural details, however, the spatial resolution of standard 1.5T imaging systems is often limited. In contrast, 7T MRI provides significantly enhanced spatial resolution, enabling finer visualization of anatomical structures. Though this, the high cost and limited availability of 7T MRI hinder its widespread use in clinical settings. To address this challenge, a novel Super-Resolution (SR) model is proposed to generate 7T-like MRI from standard 1.5T MRI scans. Our approach leverages a diffusion-based architecture, incorporating gradient nonlinearity correction and bias field correction data from 7T imaging as guidance. Moreover, to improve deployability, a progressive distillation strategy is introduced. Specifically, the student model refines the 7T SR task with steps, leveraging feature maps from the inference phase of the teacher model as guidance, aiming to allow the student model to achieve progressively 7T SR performance with a smaller, deployable model size. Experimental results demonstrate that our baseline teacher model achieves state-of-the-art SR performance. The student model, while lightweight, sacrifices minimal performance. Furthermore, the student model is capable of accepting MRI inputs at varying resolutions without the need for retraining, significantly further enhancing deployment flexibility. The clinical relevance of our proposed method is validated using clinical data from Massachusetts General Hospital. Our code is available at https://github.com/ZWang78/SR.

Constrained optimization is popularly seen in reinforcement learning for addressing complex control tasks. From the perspective of dynamic system, iteratively solving a constrained optimization problem can be framed as the temporal evolution of a feedback control system. Classical constrained optimization methods, such as penalty and Lagrangian approaches, inherently use proportional and integral feedback controllers. In this paper, we propose a more generic equivalence framework to build the connection between constrained optimization and feedback control system, for the purpose of developing more effective constrained RL algorithms. Firstly, we define that each step of the system evolution determines the Lagrange multiplier by solving a multiplier feedback optimal control problem (MFOCP). In this problem, the control input is multiplier, the state is policy parameters, the dynamics is described by policy gradient descent, and the objective is to minimize constraint violations. Then, we introduce a multiplier guided policy learning (MGPL) module to perform policy parameters updating. And we prove that the resulting optimal policy, achieved through alternating MFOCP and MGPL, aligns with the solution of the primal constrained RL problem, thereby establishing our equivalence framework. Furthermore, we point out that the existing PID Lagrangian is merely one special case within our framework that utilizes a PID controller. We also accommodate the integration of other various feedback controllers, thereby facilitating the development of new algorithms. As a representative, we employ model predictive control (MPC) as the feedback controller and consequently propose a new algorithm called predictive Lagrangian optimization (PLO). Numerical experiments demonstrate its superiority over the PID Lagrangian method, achieving a larger feasible region up to 7.2% and a comparable average reward.

Purpose: To propose a domain-conditioned and temporal-guided diffusion modeling method, termed dynamic Diffusion Modeling (dDiMo), for accelerated dynamic MRI reconstruction, enabling diffusion process to characterize spatiotemporal information for time-resolved multi-coil Cartesian and non-Cartesian data. Methods: The dDiMo framework integrates temporal information from time-resolved dimensions, allowing for the concurrent capture of intra-frame spatial features and inter-frame temporal dynamics in diffusion modeling. It employs additional spatiotemporal ($x$-$t$) and self-consistent frequency-temporal ($k$-$t$) priors to guide the diffusion process. This approach ensures precise temporal alignment and enhances the recovery of fine image details. To facilitate a smooth diffusion process, the nonlinear conjugate gradient algorithm is utilized during the reverse diffusion steps. The proposed model was tested on two types of MRI data: Cartesian-acquired multi-coil cardiac MRI and Golden-Angle-Radial-acquired multi-coil free-breathing lung MRI, across various undersampling rates. Results: dDiMo achieved high-quality reconstructions at various acceleration factors, demonstrating improved temporal alignment and structural recovery compared to other competitive reconstruction methods, both qualitatively and quantitatively. This proposed diffusion framework exhibited robust performance in handling both Cartesian and non-Cartesian acquisitions, effectively reconstructing dynamic datasets in cardiac and lung MRI under different imaging conditions. Conclusion: This study introduces a novel diffusion modeling method for dynamic MRI reconstruction., Comment: 21 pages, 15 figures, 2 tables

We introduce Tarsier2, a state-of-the-art large vision-language model (LVLM) designed for generating detailed and accurate video descriptions, while also exhibiting superior general video understanding capabilities. Tarsier2 achieves significant advancements through three key upgrades: (1) Scaling pre-training data from 11M to 40M video-text pairs, enriching both volume and diversity; (2) Performing fine-grained temporal alignment during supervised fine-tuning; (3) Using model-based sampling to automatically construct preference data and applying DPO training for optimization. Extensive experiments show that Tarsier2-7B consistently outperforms leading proprietary models, including GPT-4o and Gemini 1.5 Pro, in detailed video description tasks. On the DREAM-1K benchmark, Tarsier2-7B improves F1 by 2.8% over GPT-4o and 5.8% over Gemini-1.5-Pro. In human side-by-side evaluations, Tarsier2-7B shows a +8.6% performance advantage over GPT-4o and +24.9% over Gemini-1.5-Pro. Tarsier2-7B also sets new state-of-the-art results across 15 public benchmarks, spanning tasks such as video question-answering, video grounding, hallucination test, and embodied question-answering, demonstrating its versatility as a robust generalist vision-language model.

In this work, based on the continuous time approach, we propose an accelerated gradient method with adaptive residual restart for convex multiobjective optimization problems. For the first, we derive rigorously the continuous limit of the multiobjective accelerated proximal gradient method by Tanabe et al. [Comput. Optim. Appl., 2023]. It is a second-order ordinary differential equation (ODE) that involves a special projection operator and can be viewed as an extension of the ODE by Su et al. [J. Mach. Learn. Res., 2016] for Nesterov acceleration. Then, we introduce a novel accelerated multiobjective gradient (AMG) flow with tailored time scaling that adapts automatically to the convex case and the strongly convex case, and the exponential decay rate of a merit function along with the solution trajectory of AMG flow is established via the Lyapunov analysis. After that, we consider an implicit-explicit time discretization and obtain an accelerated multiobjective gradient method with a convex quadratic programming subproblem. The fast sublinear rate and linear rate are proved respectively for convex and strongly convex problems. In addition, we present an efficient residual based adaptive restart technique to overcome the oscillation issue and improve the convergence significantly. Numerical results are provided to validate the practical performance of the proposed method.

We detail the training of the LLM360 K2-65B model, scaling up our 360-degree OPEN SOURCE approach to the largest and most powerful models under project LLM360. While open-source LLMs continue to advance, the answer to "How are the largest LLMs trained?" remains unclear within the community. The implementation details for such high-capacity models are often protected due to business considerations associated with their high cost. This lack of transparency prevents LLM researchers from leveraging valuable insights from prior experience, e.g., "What are the best practices for addressing loss spikes?" The LLM360 K2 project addresses this gap by providing full transparency and access to resources accumulated during the training of LLMs at the largest scale. This report highlights key elements of the K2 project, including our first model, K2 DIAMOND, a 65 billion-parameter LLM that surpasses LLaMA-65B and rivals LLaMA2-70B, while requiring fewer FLOPs and tokens. We detail the implementation steps and present a longitudinal analysis of K2 DIAMOND's capabilities throughout its training process. We also outline ongoing projects such as TXT360, setting the stage for future models in the series. By offering previously unavailable resources, the K2 project also resonates with the 360-degree OPEN SOURCE principles of transparency, reproducibility, and accessibility, which we believe are vital in the era of resource-intensive AI research.

Kernel density estimation (KDE) has become a popular method for visual analysis in various fields, such as financial risk forecasting, crime clustering, and traffic monitoring. KDE can identify high-density areas from discrete datasets. However, most existing works only consider planar distance and spatial data. In this paper, we introduce a new model, called TN-KDE, that applies KDE-based techniques to road networks with temporal data. Specifically, we introduce a novel solution, Range Forest Solution (RFS), which can efficiently compute KDE values on spatiotemporal road networks. To support the insertion operation, we present a dynamic version, called Dynamic Range Forest Solution (DRFS). We also propose an optimization called Lixel Sharing (LS) to share similar KDE values between two adjacent lixels. Furthermore, our solutions support many non-polynomial kernel functions and still report exact values. Experimental results show that our solutions achieve up to 6 times faster than the state-of-the-art method.

The annotation (assigning structural chemical identities) of MS/MS spectra remains a significant challenge due to the enormous molecular diversity in biological samples and the limited scope of reference databases. Currently, the vast majority of spectral measurements remain in the "dark chemical space" without structural annotations. To improve annotation, we propose MADGEN (Mass-spec Attends to De Novo Molecular GENeration), a scaffold-based method for de novo molecular structure generation guided by mass spectrometry data. MADGEN operates in two stages: scaffold retrieval and spectra-conditioned molecular generation starting with the scaffold. In the first stage, given an MS/MS spectrum, we formulate scaffold retrieval as a ranking problem and employ contrastive learning to align mass spectra with candidate molecular scaffolds. In the second stage, starting from the retrieved scaffold, we employ the MS/MS spectrum to guide an attention-based generative model to generate the final molecule. Our approach constrains the molecular generation search space, reducing its complexity and improving generation accuracy. We evaluate MADGEN on three datasets (NIST23, CANOPUS, and MassSpecGym) and evaluate MADGEN's performance with a predictive scaffold retriever and with an oracle retriever. We demonstrate the effectiveness of using attention to integrate spectral information throughout the generation process to achieve strong results with the oracle retriever., Comment: preprint

Prenatal ultrasound evaluates fetal growth and detects congenital abnormalities during pregnancy, but the examination of ultrasound images by radiologists requires expertise and sophisticated equipment, which would otherwise fail to improve the rate of identifying specific types of fetal central nervous system (CNS) abnormalities and result in unnecessary patient examinations. We construct a deep learning model to improve the overall accuracy of the diagnosis of fetal cranial anomalies to aid prenatal diagnosis. In our collected multi-center dataset of fetal craniocerebral anomalies covering four typical anomalies of the fetal central nervous system (CNS): anencephaly, encephalocele (including meningocele), holoprosencephaly, and rachischisis, patient-level prediction accuracy reaches 94.5%, with an AUROC value of 99.3%. In the subgroup analyzes, our model is applicable to the entire gestational period, with good identification of fetal anomaly types for any gestational period. Heatmaps superimposed on the ultrasound images not only provide a visual interpretation for the algorithm but also provide an intuitive visual aid to the physician by highlighting key areas that need to be reviewed, helping the physician to quickly identify and validate key areas. Finally, the retrospective reader study demonstrates that by combining the automatic prediction of the DL system with the professional judgment of the radiologist, the diagnostic accuracy and efficiency can be effectively improved and the misdiagnosis rate can be reduced, which has an important clinical application prospect.

Massive data analysis calls for distributed algorithms and theories. We design a multi-round distributed algorithm for canonical correlation analysis. We construct principal directions through the convex formulation of canonical correlation analysis and use the shift-and-invert preconditioning iteration to expedite the convergence rate. This distributed algorithm is communication-efficient. The resultant estimate achieves the same convergence rate as if all observations were pooled together, but does not impose stringent restrictions on the number of machines. We take a gap-free analysis to bypass the widely used yet unrealistic assumption of an explicit gap between the successive canonical correlations in the canonical correlation analysis. Extensive simulations and applications to three benchmark image data are conducted to demonstrate the empirical performance of our proposed algorithms and theories.

Adolphson and Sperber characterized the unique unit root of $L$-function associated with toric exponential sums in terms of the $\mathcal{A}$-hypergeometric functions. For the unit root $L$-function associated with a family of toric exponential sums, Haessig and Sperber conjectured its unit root behaves similarly to the classical case studied by Adolphson and Sperber. Under the assumption of a lower deformation hypothesis, Haessig and Sperber proved this conjecture. In this paper, we demonstrate that Haessig and Sperber's conjecture holds in general., Comment: 18pages

Photocurrent-induced harmonics appear in gases and solids due to tunnel ionization of electrons in strong fields and subsequent acceleration. In contrast to three-step harmonic emission, no return to the parent ions is necessary. Here we show that the same mechanism produces harmonics in metallic nanostructures in strong fields. Furthermore, we demonstrate how strong local field gradient, appearing as a consequence of the field enhancement, affects photocurrent-induced harmonics. This influence can shed light at the state of electron as it appears in the continuum, in particular, to its initial velocity.

Trajectory prediction plays a crucial role in improving the safety of autonomous vehicles. However, due to the highly dynamic and multimodal nature of the task, accurately predicting the future trajectory of a target vehicle remains a significant challenge. To address this challenge, we propose an Ego vehicle Planning-informed Network (EPN) for multimodal trajectory prediction. In real-world driving, the future trajectory of a vehicle is influenced not only by its own historical trajectory, but also by the behavior of other vehicles. So, we incorporate the future planned trajectory of the ego vehicle as an additional input to simulate the mutual influence between vehicles. Furthermore, to tackle the challenges of intention ambiguity and large prediction errors often encountered in methods based on driving intentions, we propose an endpoint prediction module for the target vehicle. This module predicts the target vehicle endpoints, refines them using a correction mechanism, and generates a multimodal predicted trajectory. Experimental results demonstrate that EPN achieves an average reduction of 34.9%, 30.7%, and 30.4% in RMSE, ADE, and FDE on the NGSIM dataset, and an average reduction of 64.6%, 64.5%, and 64.3% in RMSE, ADE, and FDE on the HighD dataset. The code will be open sourced after the letter is accepted.

This paper proposes a new backtracking strategy based on the FISTA accelerated algorithm for multiobjective optimization problems. The strategy focuses on solving the problem of Lipschitz constant being unknown. It allows estimate parameter updates non-increasingly. Furthermore, the proposed strategy effectively avoids the limitation in convergence proofs arising from the non-negativity of the auxiliary sequence, thus providing a theoretical guarantee for its performance. We demonstrate that, under relatively mild assumptions, the algorithm achieves the convergence rate of $O(1/k2)$., Comment: arXiv admin note: text overlap with arXiv:2312.01609

Neural networks are commonly known to be vulnerable to adversarial attacks mounted through subtle perturbation on the input data. Recent development in voice-privacy protection has shown the positive use cases of the same technique to conceal speaker's voice attribute with additive perturbation signal generated by an adversarial network. This paper examines the reversibility property where an entity generating the adversarial perturbations is authorized to remove them and restore original speech (e.g., the speaker him/herself). A similar technique could also be used by an investigator to deanonymize a voice-protected speech to restore criminals' identities in security and forensic analysis. In this setting, the perturbation generative module is assumed to be known in the removal process. To this end, a joint training of perturbation generation and removal modules is proposed. Experimental results on the LibriSpeech dataset demonstrated that the subtle perturbations added to the original speech can be predicted from the anonymized speech while achieving the goal of privacy protection. By removing these perturbations from the anonymized sample, the original speech can be restored. Audio samples can be found in \url{https://voiceprivacy.github.io/Perturbation-Generation-Removal/}., Comment: 6 pages, 3 figures, published to IEEE SLT Workshop 2024

The primary aim of this article is to investigate the domination relationship between two $L^2$-semigroups using probabilistic methods. According to Ouhabaz's domination criterion, the domination of semigroups can be transformed into relationships involving the corresponding Dirichlet forms. Our principal result establishes the equivalence between the domination of Dirichlet forms and the killing transformation of the associated Markov processes, which generalizes and completes the results in \cite{Y962} and \cite{Y96}. Based on this equivalence, we provide a representation of the dominated Dirichlet form using the bivariate Revuz measure associated with the killing transformation and further characterize the sandwiched Dirichlet form within the broader Dirichlet form framework. In particular, our findings apply to the characterization of operators sandwiched between the Dirichlet Laplacian and the Neumann Laplacian. For the local boundary case, we eliminate all technical conditions identified in the literature \cite{AW03} and deliver a complete representation of all sandwiched operators governed by a Robin boundary condition determined by a specific quasi-admissible measure. Additionally, our results offer a comprehensive characterization of related operators in the non-local Robin boundary case, specifically resolving an open problem posed in the literature \cite{OA21}.

Unsupervised Outlier Detection (UOD) is a critical task in data mining and machine learning, aiming to identify instances that significantly deviate from the majority. Without any label, deep UOD methods struggle with the misalignment between the model's direct optimization goal and the final performance goal of Outlier Detection (OD) task. Through the perspective of training dynamics, this paper proposes an early stopping algorithm to optimize the training of deep UOD models, ensuring they perform optimally in OD rather than overfitting the entire contaminated dataset. Inspired by UOD mechanism and inlier priority phenomenon, where intuitively models fit inliers more quickly than outliers, we propose GradStop, a sampling-based label-free algorithm to estimate model's real-time performance during training. First, a sampling method generates two sets: one likely containing more outliers and the other more inliers, then a metric based on gradient cohesion is applied to probe into current training dynamics, which reflects model's performance on OD task. Experimental results on 4 deep UOD algorithms and 47 real-world datasets and theoretical proofs demonstrate the effectiveness of our proposed early stopping algorithm in enhancing the performance of deep UOD models. Auto Encoder (AE) enhanced by GradStop achieves better performance than itself, other SOTA UOD methods, and even ensemble AEs. Our method provides a robust and effective solution to the problem of performance degradation during training, enabling deep UOD models to achieve better potential in anomaly detection tasks.

Singing Voice Synthesis (SVS) aims to generate singing voices of high fidelity and expressiveness. Conventional SVS systems usually utilize an acoustic model to transform a music score into acoustic features, followed by a vocoder to reconstruct the singing voice. It was recently shown that end-to-end modeling is effective in the fields of SVS and Text to Speech (TTS). In this work, we thus present a fully end-to-end SVS method together with a chunkwise streaming inference to address the latency issue for practical usages. Note that this is the first attempt to fully implement end-to-end streaming audio synthesis using latent representations in VAE. We have made specific improvements to enhance the performance of streaming SVS using latent representations. Experimental results demonstrate that the proposed method achieves synthesized audio with high expressiveness and pitch accuracy in both streaming SVS and TTS tasks., Comment: Accepted by AAAI2025

We present photometric and spectroscopic observations of supernova (SN) 2014C, primarily emphasizing the initial month after the explosion at approximately daily intervals. During this time, it was classified as a Type Ib SN exhibiting a notably higher peak luminosity ($L_{\rm peak}\approx4.3\times10^{42}\rm erg\,s^{-1}$), a faster rise to brightness ($t_{\rm rise} \approx 11.6$ d), and a more gradual dimming ($\Delta m_{15}^{V} \approx 0.48$ mag) compared to typical SNe Ib. Analysis of the velocity evolution over the first $\sim$ 20 days after the explosion supports the view that the absorption near 6200\AA is due to high-velocity H$\alpha$ in the outer layers of the ejecta, indicating the presence of a small amount of hydrogen in the envelope of progenitor before the explosion. Assuming the peak luminosity is entirely attributed to radioactive decay, we estimate that 0.14 ${\rm M}_{\odot}$ of $^{56}$Ni was synthesized in the explosion. However, this amount of nickel could no longer maintain observed brightness approximately ten days after peak luminosity, suggesting additional energy sources beyond radioactive decay. This supplementary energy likely originates from interaction with the circumstellar medium (CSM). Consequently, the timing of the SN-CSM interaction in SN 2014C may occur much earlier than the emergence of IIn-like features during the nebular phase., Comment: 22 pages, 15 figures, accepted for publication in ApJ

Neural network force field models such as DeePMD have enabled highly efficient large-scale molecular dynamics simulations with ab initio accuracy. However, building such models heavily depends on the training data obtained by costly electronic structure calculations, thereby it is crucial to carefully select and label the most representative configurations during model training to improve both extrapolation capability and training efficiency. To address this challenge, based on the Kalman filter theory we propose the Kalman Prediction Uncertainty (KPU) to quantify uncertainty of the model's prediction. With KPU we design the Active Learning by KPU (ALKPU) method, which can efficiently select representative configurations that should be labelled during model training. We prove that ALKPU locally leads to the fastest reduction of model's uncertainty, which reveals its rationality as a general active learning method. We test the ALKPU method using various physical system simulations and demonstrate that it can efficiently coverage the system's configuration space. Our work demonstrates the benefits of ALKPU as a novel active learning method, enhancing training efficiency and reducing computational resource demands.

In this paper, a novel distributed optimization framework has been proposed. The key idea is to convert optimization problems into optimal control problems where the objective of each agent is to design the current control input minimizing the original objective function of itself and updated size for the future time instant. Compared with the existing distributed optimization problem for optimizing a sum of convex objective functions corresponding to multiple agents, we present a distributed optimization algorithm for multi-agents system based on the results from the maximum principle. Moreover, the convergence and superlinear convergence rate are also analyzed stringently.

The hairy black hole model provides a new theoretical framework for exploring phenomena in strong gravitational fields. This paper systematically investigates the influence of the hair parameter $\beta$ on the timelike geodesics of the regular hairy black hole, including the radius of the event horizon, the properties of bound orbits, and the characteristics of gravitational wave radiation over a single period. The study reveals that $\beta$ has a significant impact on the event horizon but only a minor effect on the innermost stable circular orbit(ISCO), the marginally bound orbit(MBO), and periodic orbits. Moreover, the trajectories of the periodic orbits are nearly identical to those of the Schwarzschild black hole. In addition, the parameter $\beta$ was constrained by simulating the precession observational data of the S2 star orbiting the supermassive black hole Sgr A*. The results indicate that the correction effects of $\beta$ comply with existing observational constraints, without providing stricter limitations. Furthermore, by considering periodic orbits as transitional orbits in the extreme-mass-ratio inspiral (EMRI) system, it is found that the presence of $\beta$ introduces subtle effects on the amplitude, phase, and period of the gravitational wave signal for a single orbit. Although these effects appear minor within a single cycle, they may accumulate into significant effects over long-term evolution. In the future, space-based gravitational wave detectors are expected to further investigate the properties of the hair parameter, enhancing our understanding of the spacetime structure and dynamical behavior of black holes.

Spike train classification has recently become an important topic in the machine learning community, where each spike train is a binary event sequence with \emph{temporal-sparsity of signals of interest} and \emph{temporal-noise} properties. A promising model for it should follow the design principle of performing intensive computation only when signals of interest appear. So such tasks use mainly Spiking Neural Networks (SNNs) due to their consideration of temporal-sparsity of spike trains. However, the basic mechanism of SNNs ignore the temporal-noise issue, which makes them computationally expensive and thus high power consumption for analyzing spike trains on resource-constrained platforms. As an event-driven model, an SNN neuron makes a reaction given any input signals, making it difficult to quickly find signals of interest. In this paper, we introduce an event-attention mechanism that enables SNNs to dynamically highlight useful signals of the original spike trains. To this end, we propose SkipSNN, which extends existing SNN models by learning to mask out noise by skipping membrane potential updates and shortening the effective size of the computational graph. This process is analogous to how people choose to open and close their eyes to filter the information they see. We evaluate SkipSNN on various neuromorphic tasks and demonstrate that it achieves significantly better computational efficiency and classification accuracy than other state-of-the-art SNNs., Comment: Published as a research paper at IEEE BigData 2024

Over the past two decades, descent methods have received substantial attention within the multiobjective optimization field. Nonetheless, both theoretical analyses and empirical evidence reveal that existing first-order methods for multiobjective optimization converge slowly, even for well-conditioned problems, due to the objective imbalances. To address this limitation, we incorporate curvature information to scale each objective within the direction-finding subproblem, introducing a scaled proximal gradient method for multiobjective optimization (SPGMO). We demonstrate that the proposed method achieves improved linear convergence, exhibiting rapid convergence in well-conditioned scenarios. Furthermore, by applying small scaling to linear objectives, we prove that the SPGMO attains improved linear convergence for problems with multiple linear objectives. Additionally, integrating Nesterov's acceleration technique further enhances the linear convergence of SPGMO. To the best of our knowledge, this advancement in linear convergence is the first theoretical result that directly addresses objective imbalances in multiobjective first-order methods. Finally, we provide numerical experiments to validate the efficiency of the proposed methods and confirm the theoretical findings.

The magnetic orientation of coronal mass ejections (CMEs) is of great importance to understand their space weather effects. Although many evidences suggest that CMEs can undergo significant rotation during the early phases of evolution in the solar corona, there are few reports that CMEs rotate in the interplanetary space. In this work, we use multi-spacecraft observations and a numerical simulation starting from the lower corona close to the solar surface to understand the CME event on 2021 December 4, with an emphatic investigation of its rotation. This event is observed as a partial halo CME from the back side of the Sun by coronagraphs, and reaches the BepiColombo spacecraft and the MAVEN/Tianwen-1 as a magnetic flux rope-like structure. The simulation discloses that in the solar corona the CME is approximately a translational motion, while the interplanetary propagation process evidences a gradual change of axis orientation of the CME's flux rope-like structure. It is also found that the downside and the right flank of the CME moves with the fast solar wind, and the upside does in the slow-speed stream. The different parts of the CME with different speeds generate the nonidentical displacements of its magnetic structure, resulting in the rotation of the CME in the interplanetary space. Furthermore, at the right flank of the CME exists a corotating interaction region (CIR), which makes the orientation of the CME alter, and also deviates from its route due to the CME. These results provide new insight on interpreting CMEs' dynamics and structures during their travelling through the heliosphere., Comment: Accepted By ApJ, 22 pages, 6 figures

As the role of variable renewables in electricity markets expands, new market products help system operators manage imbalances caused by uncertainty and variability. Whereas work in the last decade has focused on constructing demand curves for central procurement of those products, little attention has been paid to designing their settlement scheme and understanding the connections between the economic value of these products, the schedule of variable resources, and the cost of flexibility. In this article, we compare a new product called Flexibility Options, which addresses these gaps, with a traditional reserve product using a case study similar to the 2019 Texas (ERCOT) system. Our findings suggest that both products are equally effective in managing imbalances, but Flexibility Options have superior risk management properties and keep the system operator revenue adequate.

In the context of paid research studies and clinical trials, budget considerations often require patient sampling from available populations which comes with inherent constraints. We introduce the R package CDsampling, which is the first to our knowledge to integrate optimal design theories within the framework of constrained sampling. This package offers the possibility to find both D-optimal approximate and exact allocations for samplings with or without constraints. Additionally, it provides functions to find constrained uniform sampling as a robust sampling strategy when the model information is limited. To demonstrate its efficacy, we provide simulated examples and a real-data example with datasets embedded in the package and compare them with classical sampling methods. Furthermore, it revisits the theoretical results of the Fisher information matrix for generalized linear models (including regular linear regression model) and multinomial logistic models, offering functions for its computation.

This study focuses on transforming galaxy images between astronomical surveys, specifically enhancing images from the Sloan Digital Sky Survey (SDSS) and the Dark Energy Camera Legacy Survey (DECaLS) to achieve quality comparable to the Hyper Suprime-Cam survey (HSC). We proposed a hybrid model called Pix2WGAN, which integrates the pix2pix framework with the Wasserstein Generative Adversarial Network with Gradient Penalty (WGAN-GP) to convert low-quality observational images into high-quality counterparts. Our model successfully transformed DECaLS images into pseudo-HSC images, yielding impressive results and significantly enhancing the identification of complex structures, such as galaxy spiral arms and tidal tails, which may have been overlooked in the original DECaLS images. Moreover, Pix2WGAN effectively addresses issues like artifacts, noise, and blurriness in both source and target images. In addition to the basic Pix2WGAN model, we further developed an advanced architecture called Cascaded Pix2WGAN, which incorporates a multi-stage training mechanism designed to bridge the quality gap between SDSS and HSC images, demonstrating similarly promising outcomes. We systematically assessed the similarity between the model-generated pseudo-HSC images and actual HSC images using various metrics, including Root Mean Squared Error (RMSE), Peak Signal-to-Noise Ratio (PSNR), and Structural Similarity Index (SSIM), along with perceptual metrics such as Learned Perceptual Image Patch Similarity (LPIPS) and Fr\'echet Inception Distance (FID). The results indicate that images transformed by our model outperform both the original SDSS and DECaLS images across nearly all evaluation metrics. Our research is expected to provide significant technical support for astronomical data analysis, cross-survey image integration, and high-precision astrometry.

Accurate estimation of photometric redshifts (photo-$z$s) is crucial for cosmological surveys. Various methods have been developed for this purpose, such as template fitting methods and machine learning techniques, each with its own applications, advantages, and limitations. In this study, we propose a new approach that utilizes a deep learning model based on Recurrent Neural Networks (RNN) with Long Short-Term Memory (LSTM) to predict photo-$z$. Unlike many existing machine learning models, our method requires only flux measurements from different observed filters as input. The model can automatically learn the complex relationships between the flux data across different wavelengths, eliminating the need for manually extracted or derived input features, thereby providing precise photo-$z$ estimates. The effectiveness of our proposed model is evaluated using simulated data from the Chinese Space Station Telescope (CSST) sourced from the Hubble Space Telescope Advanced Camera for Surveys (HST-ACS) and the COSMOS catalog, considering anticipated instrument effects of the future CSST. Results from experiments demonstrate that our LSTM model, compared to commonly used template fitting and machine learning approaches, requires minimal input parameters and achieves high precision in photo-$z$ estimation. For instance, when trained on the same dataset and provided only with photometric fluxes as input features, the proposed LSTM model yields one-third of the outliers $f_{out}$ observed with a Multi-Layer Perceptron Neural Network (MLP) model, while the normalized median absolute deviation $\rm \sigma_{NMAD}$ is only two-thirds that of the MLP model. This study presents a novel approach to accurately estimate photo-$z$s of galaxies using photometric data from large-scale survey projects.

In this paper, we deal with multiobjective composite optimization problems, where each objective function is a combination of smooth and possibly non-smooth functions. We first propose a parameter-dependent conditional gradient method to solve this problem. The step size in this method requires prior knowledge of the parameters related to the H{\"o}lder continuity of the gradient of the smooth function. The convergence properties of this method are then established. Given that these parameters may be unknown or, if known, may not be unique, the first method may encounter implementation challenges or slow convergence. To address this, we further propose a parameter-free conditional gradient method that determines the step size using a local quadratic upper approximation and an adaptive line search strategy, eliminating the need for any problem-specific parameters. The performance of the proposed methods is demonstrated on several test problems involving the indicator function and an uncertainty function.

The Lobster Eye Imager for Astronomy (LEIA) detected a new X-ray transient on 2022 November 7, identified as a superflare event occurring on a nearby K-type giant star HD 251108. The flux increase was also detected in follow-up observations at X-ray, UV and optical wavelengths. The flare lasted for about 40 days in soft X-ray observations, reaching a peak luminosity of ~1.1 * 10^34 erg/s in 0.5-4.0 keV, which is roughly 60 times the quiescent luminosity. Optical brightening was observed for only one night. The X-ray light curve is well described by a double fast rise and exponential decay model, attributed to the cooling process of a loop arcade structure formed subsequent to the initial large loop with a half-length of ~1.9 * 10^12 cm. Time-resolved X-ray spectra were fitted by a four-temperature apec model (with three components being the quiescent background), showing significant evolution of plasma temperature and emission measure over time. The estimated energy released in the LEIA band is ~3 * 10^39 erg, suggesting that this is likely the most energetic X-ray stellar flare with the longest duration detected to date., Comment: published in ApJ, 15 pages, 7 figures, 8 tables