We present a hybrid singular spectrum analysis （SSA） and fuzzy entropy method to filter noisy nonlinear time series. With this approach, SSA decomposes the noisy time series into its constituent components including...We present a hybrid singular spectrum analysis （SSA） and fuzzy entropy method to filter noisy nonlinear time series. With this approach, SSA decomposes the noisy time series into its constituent components including both the deterministic behavior and noise, while fuzzy entropy automatically differentiates the optimal dominant components from the noise based on the complexity of each component. We demonstrate the effectiveness of the hybrid approach in reconstructing the Lorenz and Mackey--Class attractors, as well as improving the multi-step prediction quality of these two series in noisy environments.展开更多
Let d^(∗)_(k)(x)be the most likely common differences of arithmetic progressions of length k+1 among primes≤x.Based on the truth of Hardy–Littlewood Conjecture,we obtain that lim x→+∞d^(∗)_(k)(x)(x)=+∞uniformly i...Let d^(∗)_(k)(x)be the most likely common differences of arithmetic progressions of length k+1 among primes≤x.Based on the truth of Hardy–Littlewood Conjecture,we obtain that lim x→+∞d^(∗)_(k)(x)(x)=+∞uniformly in k,and every prime divides all sufficiently large most likely common differences.展开更多
文摘We present a hybrid singular spectrum analysis （SSA） and fuzzy entropy method to filter noisy nonlinear time series. With this approach, SSA decomposes the noisy time series into its constituent components including both the deterministic behavior and noise, while fuzzy entropy automatically differentiates the optimal dominant components from the noise based on the complexity of each component. We demonstrate the effectiveness of the hybrid approach in reconstructing the Lorenz and Mackey--Class attractors, as well as improving the multi-step prediction quality of these two series in noisy environments.
文摘Let d^(∗)_(k)(x)be the most likely common differences of arithmetic progressions of length k+1 among primes≤x.Based on the truth of Hardy–Littlewood Conjecture,we obtain that lim x→+∞d^(∗)_(k)(x)(x)=+∞uniformly in k,and every prime divides all sufficiently large most likely common differences.
