搜索结果：fasting

This paper revisits the design and optimization of parallel fast finite impulse response (FIR) filters using polyphase decomposition and iterated fast FIR algorithms (FFAs). Parallel FIR filtering enhances computational efficiency and throughput in digital signal processing (DSP) applications by enabling the simultaneous processing of multiple input samples. We revisit a prior approach to design of fast parallel filter architectures by using the iterated FFA approach where the same primitive filter, such as 2-parallel, is iterated to design the fast parallel filter. In this paper, we present yet another novel iterated fast parallel FIR filter, referred to as the fast hybrid filter. The hybrid filter iterates a transposed 2-parallel fast FIR filter in all the inner layers and a direct-form 2-parallel fast FIR filter in the outermost layer, resulting in reduced hardware complexity. Such an iterated hybrid approach has not been presented before. We show that the hybrid fast parallel filters require less number of additions compared to prior approaches.

The radiative mechanism of coherent radio emission has remained an enigma since the discovery of pulsars, even the emergence of fast radio bursts (FRBs), which exhibit similarities to the single-pulse behavior of pulsars and have opened a new view for deciphering the long-standing mystery. Besides tremendous efforts in modelling, advanced facilities matter for solving the problem. The authors review the observational breakthroughs from the Five-hundred-meter Aperture Spherical radio Telescope (FAST), which are providing pivotal insights to unravel the underlying physics of pulsars and FRBs. This study offers a novel perspective in the era when pulsars meet FRBs, and further investigations are encouraged to utilize the highly sensitive telescope, the FAST.

The advancement of vision-only Bird's-Eye-View (BEV) perception, a core paradigm for cost-effective autonomous driving, is hindered by the long-standing fundamental trade-off between perception accuracy and on-device deployment efficiency. In this work, we introduce Fast-BEV++, a BEV perception framework that resolves this tension through two fundamental design principles: Fast by Algorithm and Deployable by Design. By decomposing the core view transformation module into a hardware-oriented standard Index-Gather-Reshape pipeline, Fast-BEV++ eliminates dependencies on custom kernels while achieving no less than 3 times speedup over the Fast-BEV baseline across mainstream edge platforms. Empirically, Fast-BEV++ establishes a new state-of-the-art result of 0.488 NDS on the nuScenes 3D object detection benchmark, simultaneously delivering real-time inference at more than 134 FPS via our acceleration design. In particular, our integrated, learnable depth module yields consistent performance gains, maintaining the highest accuracy among comparable methods. Overall, this inherently decomposed architecture enables seamless real-time deployment across diverse production-grade automotive pla

In audio classification, developing efficient and robust models is critical for real-time applications. Inspired by the design principles of MobileViT, we present FAST (Fast Audio Spectrogram Transformer), a new architecture that combines convolutional neural networks (CNNs) and transformers to capitalize on the strengths of both. FAST integrates the local feature extraction efficiencies of CNNs with the global context modeling capabilities of transformers, resulting in a model that is powerful yet lightweight, well-suited to a real-time or mobile use case. Additionally, we incorporate Lipschitz continuous attention mechanisms to improve training stability and accelerate convergence. We evaluate FAST on the ADIMA dataset, a multilingual corpus towards real-time profanity and abuse detection, as well as on the more traditional AudioSet. Our results show that FAST achieves state-of-the-art performance on both the ADIMA and AudioSet classification tasks and in some cases surpasses existing benchmarks while using up to 150x fewer parameters.

Microquasars are the compact objects generally including accreting black holes which produce relativistic jets. The physical mechanisms of jet launching, collimation, and acceleration are poorly understood. Microquasars show strong variability in multi-wavelength observations. In X-rays, the sources show the fast variation features down to millisecond time scales, with the prominent quasiperiodic oscillations (QPOs) around 0.1 Hz - tens of Hz in light curves, however, physical origin of QPOs is still uncertain. FAST as the largest radio telescope provides the opportunity to study fast variability of both radio flux and polarization in microquasars. In the FAST observations from 2020 - 2022, we reported the first evidence of radio subsecond quasi-periodic oscillations of GRS 1915+105, providing the direct link between QPOs and the dynamics of relativistic jets. These QPOs with the centroid frequency around 5 Hz are transient, accompanied with strong evolution of the spectral index. Combined with multiwavelength observations, we discuss the possible physical models to produce radio QPOs in BH systems: the helical motion of jet knots or precession of the jet base. In near future, high

We present FAST-Splat for fast, ambiguity-free semantic Gaussian Splatting, which seeks to address the main limitations of existing semantic Gaussian Splatting methods, namely: slow training and rendering speeds; high memory usage; and ambiguous semantic object localization. We take a bottom-up approach in deriving FAST-Splat, dismantling the limitations of closed-set semantic distillation to enable open-set (open-vocabulary) semantic distillation. Ultimately, this key approach enables FAST-Splat to provide precise semantic object localization results, even when prompted with ambiguous user-provided natural-language queries. Further, by exploiting the explicit form of the Gaussian Splatting scene representation to the fullest extent, FAST-Splat retains the remarkable training and rendering speeds of Gaussian Splatting. Precisely, while existing semantic Gaussian Splatting methods distill semantics into a separate neural field or utilize neural models for dimensionality reduction, FAST-Splat directly augments each Gaussian with specific semantic codes, preserving the training, rendering, and memory-usage advantages of Gaussian Splatting over neural field methods. These Gaussian-spec

Context: Interferometric imaging is algorithmically and computationally challenging as there is no unique inversion from the measurement data back to the sky maps, and the datasets can be very large. Many imaging methods already exist, but most of them focus either on the accuracy or the computational aspect. Aims: This paper aims to reduce the computational complexity of the Bayesian imaging algorithm resolve, enabling the application of Bayesian imaging for larger datasets. Methods: By combining computational shortcuts of the CLEAN algorithm with the Bayesian imaging algorithm resolve we developed an accurate and fast imaging algorithm which we name fast-resolve. Results: We validate the accuracy of the presented fast-resolve algorithm by comparing it with results from resolve on VLA Cygnus A data. Furthermore, we demonstrate the computational advantages of fast-resolve on a large MeerKAT ESO 137-006 dataset which is computationally out of reach for resolve. Conclusions: The presented algorithm is significantly faster than previous Bayesian imaging algorithms, broadening the applicability of Bayesian interferometric imaging. Specifically for the single channel VLA Cygnus A datase

Parameter efficient finetuning methods like low-rank adaptation (LoRA) aim to reduce the computational costs of finetuning pretrained Language Models (LMs). Enabled by these low-rank settings, we propose an even more efficient optimization strategy: Fast Forward, a simple and effective approach to accelerate large segments of training. In a Fast Forward stage, we repeat the most recent optimizer step until the loss stops improving on a tiny validation set. By alternating between regular optimization steps and Fast Forward stages, Fast Forward provides up to an 87\% reduction in FLOPs and up to an 81\% reduction in train time over standard SGD with Adam. We validate Fast Forward by finetuning various models on different tasks and demonstrate that it speeds up training without compromising model performance. Additionally, we analyze when and how to apply Fast Forward.

This paper proposes FAST-LIVO2: a fast, direct LiDAR-inertial-visual odometry framework to achieve accurate and robust state estimation in SLAM tasks and provide great potential in real-time, onboard robotic applications. FAST-LIVO2 fuses the IMU, LiDAR and image measurements efficiently through an ESIKF. To address the dimension mismatch between the heterogeneous LiDAR and image measurements, we use a sequential update strategy in the Kalman filter. To enhance the efficiency, we use direct methods for both the visual and LiDAR fusion, where the LiDAR module registers raw points without extracting edge or plane features and the visual module minimizes direct photometric errors without extracting ORB or FAST corner features. The fusion of both visual and LiDAR measurements is based on a single unified voxel map where the LiDAR module constructs the geometric structure for registering new LiDAR scans and the visual module attaches image patches to the LiDAR points. To enhance the accuracy of image alignment, we use plane priors from the LiDAR points in the voxel map (and even refine the plane prior) and update the reference patch dynamically after new images are aligned. Furthermore,

The Five-hundred-meter Aperture Spherical Radio Telescope (FAST) Core Array is a proposed extension of FAST, integrating 24 secondary 40-m antennas implanted within 5 km of the FAST site. This original array design will combine the unprecedented sensitivity of FAST with a high angular resolution (4.3" at a frequency of 1.4 GHz), thereby exceeding the capabilities at similar frequencies of next-generation arrays such as the Square Kilometre Array Phase 1 or the next-generation Very Large Array. This article presents the technical specifications of the FAST Core Array, evaluates its potential relatively to existing radio telescope arrays, and describes its expected scientific prospects. The proposed array will be equipped with technologically advanced backend devices, such as real-time signal processing systems. A phased array feed receiver will be mounted on FAST to improve the survey efficiency of the FAST Core Array, whose broad frequency coverage and large field of view (FOV) will be essential to study transient cosmic phenomena such as fast radio bursts and gravitational wave events, to conduct surveys and resolve structures in neutral hydrogen galaxies, to monitor or detect pul

We present FAST, an optimization framework for fast additive segmentation. FAST segments piecewise constant shape functions for each feature in a dataset to produce transparent additive models. The framework leverages a novel optimization procedure to fit these models $\sim$2 orders of magnitude faster than existing state-of-the-art methods, such as explainable boosting machines \citep{nori2019interpretml}. We also develop new feature selection algorithms in the FAST framework to fit parsimonious models that perform well. Through experiments and case studies, we show that FAST improves the computational efficiency and interpretability of additive models.

Probabilistic graphical models (PGMs) serve as a powerful framework for modeling complex systems with uncertainty and extracting valuable insights from data. However, users face challenges when applying PGMs to their problems in terms of efficiency and usability. This paper presents Fast-PGM, an efficient and open-source library for PGM learning and inference. Fast-PGM supports comprehensive tasks on PGMs, including structure and parameter learning, as well as exact and approximate inference, and enhances efficiency of the tasks through computational and memory optimizations and parallelization techniques. Concurrently, Fast-PGM furnishes developers with flexible building blocks, furnishes learners with detailed documentation, and affords non-experts user-friendly interfaces, thereby ameliorating the usability of PGMs to users across a spectrum of expertise levels. The source code of Fast-PGM is available at https://github.com/jjiantong/FastPGM.

3D Multi-Object Tracking (MOT) captures stable and comprehensive motion states of surrounding obstacles, essential for robotic perception. However, current 3D trackers face issues with accuracy and latency consistency. In this paper, we propose Fast-Poly, a fast and effective filter-based method for 3D MOT. Building upon our previous work Poly-MOT, Fast-Poly addresses object rotational anisotropy in 3D space, enhances local computation densification, and leverages parallelization technique, improving inference speed and precision. Fast-Poly is extensively tested on two large-scale tracking benchmarks with Python implementation. On the nuScenes dataset, Fast-Poly achieves new state-of-the-art performance with 75.8% AMOTA among all methods and can run at 34.2 FPS on a personal CPU. On the Waymo dataset, Fast-Poly exhibits competitive accuracy with 63.6% MOTA and impressive inference speed (35.5 FPS). The source code is publicly available at https://github.com/lixiaoyu2000/FastPoly.

Motivated by applications to mathematical biology, we study the averaging problem for slow-fast systems, {\em in the case in which the fast dynamics is a stochastic process with multiple invariant measures}. We consider both the case in which the fast process is decoupled from the slow process and the case in which the two components are fully coupled. We work in the setting in which the slow process evolves according to an Ordinary Differential Equation (ODE) and the fast process is a continuous time Markov Process with finite state space and show that, in this setting, the limiting (averaged) dynamics can be described as a random ODE (that is, an ODE with random coefficients.) Keywords. Multiscale methods, Processes with multiple equilibria, Averaging, Collective Navigation, Interacting Piecewise Deterministic Markov Processes.

In this letter, we report the discovery of a fast neutral hydrogen outflow in SDSS J145239.38+062738.0, a merging radio galaxy containing an optical type I active galactic nuclei (AGN). This discovery was made through observations conducted by the Five-hundred-meter Aperture Spherical radio Telescope (FAST) using redshifted 21-cm absorption. The outflow exhibits a blueshifted velocity likely up to $\sim-1000\,\rm km\,s^{-1}$ with respect to the systemic velocity of the host galaxy with an absorption strength of $\sim -0.6\,\rm mJy\,beam^{-1}$ corresponding to an optical depth of 0.002 at $v=-500\,\rm km\,s^{-1}$. The mass outflow rate ranges between $2.8\times10^{-2}$ and $3.6\, \rm M_\odot \, yr^{-1}$, implying an energy outflow rate ranging between $4.2\times10^{39}$ and $9.7\times10^{40}\rm\,erg\,s^{-1}$, assuming 100 K $<T_{\rm s}<$ 1000 K. Plausible drivers of the outflow include the star bursts, the AGN radiation, and the radio jet, the last of which is considered the most likely culprit according to the kinematics. By analysing the properties of the outflow, the AGN, and the jet, we find that if the HI outflow is driven by the AGN radiation, the AGN radiation seems not

In this paper we generalize the Fenichel theory for attracting critical/slow manifolds to fast-reaction systems in infinite dimensions. In particular, we generalize the theory of invariant manifolds for fast-slow partial differential equations in standard form to the case of fast reaction terms. We show that the solution of the fast-reaction system can be approximated by the corresponding slow flow of the limit system. Introducing an additional parameter that stems from a splitting in the slow variable space, we construct a family of slow manifolds and we prove that the slow manifolds are close to the critical manifold. Moreover, the semi-flow on the slow manifold converges to the semi-flow on the critical manifold. Finally, we apply these results to an example and show that the underlying assumptions can be verified in a straightforward way.