782 research outputs found

    Periodic Solutions for Circular Restricted 4-body Problems with Newtonian Potentials

    Full text link
    We study the existence of non-collision periodic solutions with Newtonian potentials for the following planar restricted 4-body problems: Assume that the given positive masses m1,m2,m3m_{1},m_{2},m_{3} in a Lagrange configuration move in circular obits around their center of masses, the sufficiently small mass moves around some body. Using variational minimizing methods, we prove the existence of minimizers for the Lagrangian action on anti-T/2 symmetric loop spaces. Moreover, we prove the minimizers are non-collision periodic solutions with some fixed wingding numbers

    Sparse Convolution for Approximate Sparse Instance

    Full text link
    Computing the convolution A⋆BA \star B of two vectors of dimension nn is one of the most important computational primitives in many fields. For the non-negative convolution scenario, the classical solution is to leverage the Fast Fourier Transform whose time complexity is O(nlog⁑n)O(n \log n). However, the vectors AA and BB could be very sparse and we can exploit such property to accelerate the computation to obtain the result. In this paper, we show that when βˆ₯A⋆Bβˆ₯β‰₯c1=k\|A \star B\|_{\geq c_1} = k and βˆ₯A⋆Bβˆ₯≀c2=nβˆ’k\|A \star B\|_{\leq c_2} = n-k holds, we can approximately recover the all index in suppβ‰₯c1(A⋆B)\mathrm{supp}_{\geq c_1}(A \star B) with point-wise error of o(1)o(1) in O(klog⁑(n)log⁑(k)log⁑(k/Ξ΄))O(k \log (n) \log(k)\log(k/\delta)) time. We further show that we can iteratively correct the error and recover all index in suppβ‰₯c1(A⋆B)\mathrm{supp}_{\geq c_1}(A \star B) correctly in O(klog⁑(n)log⁑2(k)(log⁑(1/Ξ΄)+log⁑log⁑(k)))O(k \log(n) \log^2(k) (\log(1/\delta) + \log\log(k))) time

    Learnable Community-Aware Transformer for Brain Connectome Analysis with Token Clustering

    Full text link
    Neuroscientific research has revealed that the complex brain network can be organized into distinct functional communities, each characterized by a cohesive group of regions of interest (ROIs) with strong interconnections. These communities play a crucial role in comprehending the functional organization of the brain and its implications for neurological conditions, including Autism Spectrum Disorder (ASD) and biological differences, such as in gender. Traditional models have been constrained by the necessity of predefined community clusters, limiting their flexibility and adaptability in deciphering the brain's functional organization. Furthermore, these models were restricted by a fixed number of communities, hindering their ability to accurately represent the brain's dynamic nature. In this study, we present a token clustering brain transformer-based model (TC-BrainTF\texttt{TC-BrainTF}) for joint community clustering and classification. Our approach proposes a novel token clustering (TC) module based on the transformer architecture, which utilizes learnable prompt tokens with orthogonal loss where each ROI embedding is projected onto the prompt embedding space, effectively clustering ROIs into communities and reducing the dimensions of the node representation via merging with communities. Our results demonstrate that our learnable community-aware model TC-BrainTF\texttt{TC-BrainTF} offers improved accuracy in identifying ASD and classifying genders through rigorous testing on ABIDE and HCP datasets. Additionally, the qualitative analysis on TC-BrainTF\texttt{TC-BrainTF} has demonstrated the effectiveness of the designed TC module and its relevance to neuroscience interpretations
    • …
    corecore