Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Fast Algorithm for Computing the Fourier Spectrum of a Fractional Period
267
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The Fourier spectrum at a fractional period is often examined when extracting features from biological sequences and time series. It reflects the inner information structure of the sequences. A fractional period is not uncommon in time series. A typical example is the 3.6 period in protein sequences, which determines the $alpha$-helix secondary structure. Computing the spectrum of a fractional period offers a high-resolution insight into a time series. It has thus become an important approach in genomic analysis. However, computing Fourier spectra of fractional periods by the traditional Fourier transform is computationally expensive. In this paper, we present a novel, fast algorithm for directly computing the fractional period spectrum (FPS) of time series. The algorithm is based on the periodic distribution of signal strength at periodic positions of the time series. We provide theoretical analysis, deduction, and special techniques for reducing the computational costs of the algorithm. The analysis of the computational complexity of the algorithm shows that the algorithm is much faster than traditional Fourier transform. Our algorithm can be applied directly in computing fractional periods in time series from a broad of research fields. The computer programs of the FPS algorithm are available at https://github.com/cyinbox/FPS.
rate research
Read More
We present a new fast algorithm for computing the Boys function using nonlinear approximation of the integrand via exponentials. The resulting algorithms evaluate the Boys function with real and complex valued arguments and are competitive with previously developed algorithms for the same purpose.
In this paper, we show the following: the Hausdorff dimension of the spectrum of period-doubling Hamiltonian is bigger than $log alpha/log 4$, where $alpha$ is the Golden number; there exists a dense uncountable subset of the spectrum such that for each energy in this set, the related trace orbit is unbounded, which is in contrast with a recent result of Carvalho (Nonlinearity 33, 2020); we give a complete characterization for the structure of gaps and the gap labelling of the spectrum. All of these results are consequences of an intrinsic coding of the spectrum we construct in this paper.
The tile-based multiplayer game Mahjong is widely played in Asia and has also become increasingly popular worldwide. Face-to-face or online, each player begins with a hand of 13 tiles and players draw and discard tiles in turn until they complete a winning hand. An important notion in Mahjong is the deficiency number (a.k.a. shanten number in Japanese Mahjong) of a hand, which estimates how many tile changes are necessary to complete the hand into a winning hand. The deficiency number plays an essential role in major decision-making tasks such as selecting a tile to discard. This paper proposes a fast algorithm for computing the deficiency number of a Mahjong hand. Compared with the baseline algorithm, the new algorithm is usually 100 times faster and, more importantly, respects the agents knowledge about available tiles. The algorithm can be used as a basic procedure in all Mahjong variants by both rule-based and machine learning-based Mahjong AI.
We present a fast method for evaluating expressions of the form $$ u_j = sum_{i = 1,i ot = j}^n frac{alpha_i}{x_i - x_j}, quad text{for} quad j = 1,ldots,n, $$ where $alpha_i$ are real numbers, and $x_i$ are points in a compact interval of $mathbb{R}$. This expression can be viewed as representing the electrostatic potential generated by charges on a line in $mathbb{R}^3$. While fast algorithms for computing the electrostatic potential of general distributions of charges in $mathbb{R}^3$ exist, in a number of situations in computational physics it is useful to have a simple and extremely fast method for evaluating the potential of charges on a line; we present such a method in this paper, and report numerical results for several examples.
The question of whether there exists an approximation procedure to compute the resonances of any Helmholtz resonator, regardless of its particular shape, is addressed. A positive answer is given, and it is shown that all that one has to assume is that the resonator chamber is bounded and that its boundary is $mathcal C^2$. The proof is constructive, providing a universal algorithm which only needs to access the values of the characteristic function of the chamber at any requested point.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
