401 research outputs found

    A Counterexample for the Principal Eigenvalue of An Elliptic Operator with Large Advection

    Full text link
    There are numerous studies focusing on the convergence of the principal eigenvalue λ(s)\lambda(s) as s+s\to+\infty corresponding to the elliptic eigenvalue problem \begin{align*} -\Delta\varphi(x)-2s\mathbf{v}\cdot\nabla\varphi(x)+c(x)\varphi(x)=\lambda(s)\varphi(x),\quad x\in \Omega, \end{align*} where Ω\Omega is a bounded domain and the advection term v\mathbf{v} under some certain restrictions. In this paper, we construct an infinitely oscillating gradient advection term v=m(x)C1(Ω)\mathbf{v}=\nabla m(x)\in C^1(\Omega) such that the principal eigenvalue λ(s)\lambda(s) does not converge as s+s\to+\infty. As far as we know, this is the first result that guarantee the non-convergence of the principal eigenvalue

    DiffPrep: Differentiable Data Preprocessing Pipeline Search for Learning over Tabular Data

    Full text link
    Data preprocessing is a crucial step in the machine learning process that transforms raw data into a more usable format for downstream ML models. However, it can be costly and time-consuming, often requiring the expertise of domain experts. Existing automated machine learning (AutoML) frameworks claim to automate data preprocessing. However, they often use a restricted search space of data preprocessing pipelines which limits the potential performance gains, and they are often too slow as they require training the ML model multiple times. In this paper, we propose DiffPrep, a method that can automatically and efficiently search for a data preprocessing pipeline for a given tabular dataset and a differentiable ML model such that the performance of the ML model is maximized. We formalize the problem of data preprocessing pipeline search as a bi-level optimization problem. To solve this problem efficiently, we transform and relax the discrete, non-differential search space into a continuous and differentiable one, which allows us to perform the pipeline search using gradient descent with training the ML model only once. Our experiments show that DiffPrep achieves the best test accuracy on 15 out of the 18 real-world datasets evaluated and improves the model's test accuracy by up to 6.6 percentage points.Comment: Published at SIGMOD 202

    Deep Imaging of the HCG 95 Field.I.Ultra-diffuse Galaxies

    Full text link
    We present a detection of 89 candidates of ultra-diffuse galaxies (UDGs) in a 4.9 degree2^2 field centered on the Hickson Compact Group 95 (HCG 95) using deep gg- and rr-band images taken with the Chinese Near Object Survey Telescope. This field contains one rich galaxy cluster (Abell 2588 at zz=0.199) and two poor clusters (Pegasus I at zz=0.013 and Pegasus II at zz=0.040). The 89 candidates are likely associated with the two poor clusters, giving about 50 - 60 true UDGs with a half-light radius re>1.5r_{\rm e} > 1.5 kpc and a central surface brightness μ(g,0)>24.0\mu(g,0) > 24.0 mag arcsec2^{-2}. Deep zz'-band images are available for 84 of the 89 galaxies from the Dark Energy Camera Legacy Survey (DECaLS), confirming that these galaxies have an extremely low central surface brightness. Moreover, our UDG candidates are spread over a wide range in grg-r color, and \sim26% are as blue as normal star-forming galaxies, which is suggestive of young UDGs that are still in formation. Interestingly, we find that one UDG linked with HCG 95 is a gas-rich galaxy with H I mass 1.1×109M1.1 \times 10^{9} M_{\odot} detected by the Very Large Array, and has a stellar mass of M1.8×108M_\star \sim 1.8 \times 10^{8} MM_{\odot}. This indicates that UDGs at least partially overlap with the population of nearly dark galaxies found in deep H I surveys. Our results show that the high abundance of blue UDGs in the HCG 95 field is favored by the environment of poor galaxy clusters residing in H I-rich large-scale structures.Comment: Published in Ap

    Rethinking Similarity Search: Embracing Smarter Mechanisms over Smarter Data

    Full text link
    In this vision paper, we propose a shift in perspective for improving the effectiveness of similarity search. Rather than focusing solely on enhancing the data quality, particularly machine learning-generated embeddings, we advocate for a more comprehensive approach that also enhances the underpinning search mechanisms. We highlight three novel avenues that call for a redefinition of the similarity search problem: exploiting implicit data structures and distributions, engaging users in an iterative feedback loop, and moving beyond a single query vector. These novel pathways have gained relevance in emerging applications such as large-scale language models, video clip retrieval, and data labeling. We discuss the corresponding research challenges posed by these new problem areas and share insights from our preliminary discoveries

    Retinal Fundus Image Registration via Vascular Structure Graph Matching

    Get PDF
    Motivated by the observation that a retinal fundus image may contain some unique geometric structures within its vascular trees which can be utilized for feature matching, in this paper, we proposed a graph-based registration framework called GM-ICP to align pairwise retinal images. First, the retinal vessels are automatically detected and represented as vascular structure graphs. A graph matching is then performed to find global correspondences between vascular bifurcations. Finally, a revised ICP algorithm incorporating with quadratic transformation model is used at fine level to register vessel shape models. In order to eliminate the incorrect matches from global correspondence set obtained via graph matching, we proposed a structure-based sample consensus (STRUCT-SAC) algorithm. The advantages of our approach are threefold: (1) global optimum solution can be achieved with graph matching; (2) our method is invariant to linear geometric transformations; and (3) heavy local feature descriptors are not required. The effectiveness of our method is demonstrated by the experiments with 48 pairs retinal images collected from clinical patients

    Emotional brain network decoded by biological spiking neural network

    Get PDF
    IntroductionEmotional disorders are essential manifestations of many neurological and psychiatric diseases. Nowadays, researchers try to explore bi-directional brain-computer interface techniques to help the patients. However, the related functional brain areas and biological markers are still unclear, and the dynamic connection mechanism is also unknown.MethodsTo find effective regions related to different emotion recognition and intervention, our research focuses on finding emotional EEG brain networks using spiking neural network algorithm with binary coding. We collected EEG data while human participants watched emotional videos (fear, sadness, happiness, and neutrality), and analyzed the dynamic connections between the electrodes and the biological rhythms of different emotions.ResultsThe analysis has shown that the local high-activation brain network of fear and sadness is mainly in the parietal lobe area. The local high-level brain network of happiness is in the prefrontal-temporal lobe-central area. Furthermore, the α frequency band could effectively represent negative emotions, while the α frequency band could be used as a biological marker of happiness. The decoding accuracy of the three emotions reached 86.36%, 95.18%, and 89.09%, respectively, fully reflecting the excellent emotional decoding performance of the spiking neural network with self- backpropagation.DiscussionThe introduction of the self-backpropagation mechanism effectively improves the performance of the spiking neural network model. Different emotions exhibit distinct EEG networks and neuro-oscillatory-based biological markers. These emotional brain networks and biological markers may provide important hints for brain-computer interface technique exploration to help related brain disease recovery

    Epigenetics in ovarian cancer: premise, properties, and perspectives.

    Get PDF
    Malignant ovarian tumors bear the highest mortality rate among all gynecological cancers. Both late tumor diagnosis and tolerance to available chemical therapy increase patient mortality. Therefore, it is both urgent and important to identify biomarkers facilitating early identification and novel agents preventing recurrence. Accumulating evidence demonstrates that epigenetic aberrations (particularly histone modifications) are crucial in tumor initiation and development. Histone acetylation and methylation are respectively regulated by acetyltransferases-deacetylases and methyltransferases-demethylases, both of which are implicated in ovarian cancer pathogenesis. In this review, we summarize the most recent discoveries pertaining to ovarian cancer development arising from the imbalance of histone acetylation and methylation, and provide insight into novel therapeutic interventions for the treatment of ovarian carcinoma

    Melatonin, a Full Service Anti-Cancer Agent: Inhibition of Initiation, Progression and Metastasis

    Get PDF
    There is highly credible evidence that melatonin mitigates cancer at the initiation, progression and metastasis phases. In many cases, the molecular mechanisms underpinning these inhibitory actions have been proposed. What is rather perplexing, however, is the large number of processes by which melatonin reportedly restrains cancer development and growth. These diverse actions suggest that what is being observed are merely epiphenomena of an underlying more fundamental action of melatonin that remains to be disclosed. Some of the arresting actions of melatonin on cancer are clearly membrane receptor-mediated while others are membrane receptor-independent and involve direct intracellular actions of this ubiquitously-distributed molecule. While the emphasis of melatonin/cancer research has been on the role of the indoleamine in restraining breast cancer, this is changing quickly with many cancer types having been shown to be susceptible to inhibition by melatonin. There are several facets of this research which could have immediate applications at the clinical level. Many studies have shown that melatonin’s co-administration improves the sensitivity of cancers to inhibition by conventional drugs. Even more important are the findings that melatonin renders cancers previously totally resistant to treatment sensitive to these same therapies. Melatonin also inhibits molecular processes associated with metastasis by limiting the entrance of cancer cells into the vascular system and preventing them from establishing secondary growths at distant sites. This is of particular importance since cancer metastasis often significantly contributes to death of the patient. Another area that deserves additional consideration is related to the capacity of melatonin in reducing the toxic consequences of anti-cancer drugs while increasing their efficacy. Although this information has been available for more than a decade, it has not been adequately exploited at the clinical level. Even if the only beneficial actions of melatonin in cancer patients are its ability to attenuate acute and long-term drug toxicity, melatonin should be used to improve the physical wellbeing of the patients. The experimental findings, however, suggest that the advantages of using melatonin as a co-treatment with conventional cancer therapies would far exceed improvements in the wellbeing of the patients.Shun-Fa Yang, Grant #CHS-2016-E-002-Y2
    corecore