Improving Non-Cartesian MRI Reconstruction through Discontinuity Subtraction

Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesian k-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these problems by analyzing the principal point spread function (PSF) of non-Cartesian reconstruction and propose a leakage reduction reconstruction scheme based on discontinuity subtraction. Data fidelity in k-space is enforced during each iteration. Multidimensional nonuniform fast Fourier transform (NUFFT) algorithms are utilized to simulate the k-space samples as well as to reconstruct images. The proposed method is compared to the direct reconstruction method on computer-simulated phantoms and physical scans. Non-Cartesian sampling trajectories including 2D spiral, 2D and 3D radial trajectories are studied. The proposed method is found useful on reducing artifacts due to high image discontinuities. It also improves the quality of images reconstructed from undersampled data

Reverse spatial visual top-k query

With the wide application of mobile Internet techniques an location-based services (LBS), massive multimedia data with geo-tags has been generated and collected. In this paper, we investigate a novel type of spatial query problem, named reverse spatial visual top- $k$ query (RSVQ k ) that aims to retrieve a set of geo-images that have the query as one of the most relevant geo-images in both geographical proximity and visual similarity. Existing approaches for reverse top- $k$ queries are not suitable to address this problem because they cannot effectively process unstructured data, such as image. To this end, firstly we propose the definition of RSVQ k problem and introduce the similarity measurement. A novel hybrid index, named VR 2 -Tree is designed, which is a combination of visual representation of geo-image and R-Tree. Besides, an extension of VR 2 -Tree, called CVR 2 -Tree is introduced and then we discuss the calculation of lower/upper bound, and then propose the optimization technique via CVR 2 -Tree for further pruning. In addition, a search algorithm named RSVQ k algorithm is developed to support the efficient RSVQ k query. Comprehensive experiments are conducted on four geo-image datasets, and the results illustrate that our approach can address the RSVQ k problem effectively and efficiently

Protein-Protein Affinity Determination by Quantitative FRET Quenching.

The molecular dissociation constant, Kd, is a well-established parameter to quantitate the affinity of protein-protein or other molecular interactions. Recently, we reported the theoretical basis and experimental procedure for Kd determination using a quantitative FRET method. Here we report a new development of Kd determination by measuring the reduction in donor fluorescence due to acceptor quenching in FRET. A new method of Kd determination was developed from the quantitative measurement of donor fluorescence quenching. The estimated Kd values of SUMO1-Ubc9 interaction based on this method are in good agreement with those determined by other technologies, including FRET acceptor emission. Thus, the acceptor-quenched approach can be used as a complement to the previously developed acceptor excitation method. The new methodology has more general applications regardless whether the acceptor is an excitable fluorophore or a quencher. Thus, these developments provide a complete methodology for protein or other molecule interaction affinity determinations in solution

Unsupervised Opinion Summarisation in the Wasserstein Space

Opinion summarisation synthesises opinions expressed in a group of documents discussing the same topic to produce a single summary. Recent work has looked at opinion summarisation of clusters of social media posts. Such posts are noisy and have unpredictable structure, posing additional challenges for the construction of the summary distribution and the preservation of meaning compared to online reviews, which has been so far the focus of opinion summarisation. To address these challenges we present \textit{WassOS}, an unsupervised abstractive summarization model which makes use of the Wasserstein distance. A Variational Autoencoder is used to get the distribution of documents/posts, and the distributions are disentangled into separate semantic and syntactic spaces. The summary distribution is obtained using the Wasserstein barycenter of the semantic and syntactic distributions. A latent variable sampled from the summary distribution is fed into a GRU decoder with a transformer layer to produce the final summary. Our experiments on multiple datasets including Twitter clusters, Reddit threads, and reviews show that WassOS almost always outperforms the state-of-the-art on ROUGE metrics and consistently produces the best summaries with respect to meaning preservation according to human evaluations

Combining Hierachical VAEs with LLMs for clinically meaningful timeline summarisation in social media

We introduce a hybrid abstractive summarisation approach combining hierarchical VAE with LLMs (LlaMA-2) to produce clinically meaningful summaries from social media user timelines, appropriate for mental health monitoring. The summaries combine two different narrative points of view: clinical insights in third person useful for a clinician are generated by feeding into an LLM specialised clinical prompts, and importantly, a temporally sensitive abstractive summary of the user's timeline in first person, generated by a novel hierarchical variational autoencoder, TH-VAE. We assess the generated summaries via automatic evaluation against expert summaries and via human evaluation with clinical experts, showing that timeline summarisation by TH-VAE results in more factual and logically coherent summaries rich in clinical utility and superior to LLM-only approaches in capturing changes over time

TDCMR: Triplet-Based Deep Cross-Modal Retrieval for geo-multimedia data

Mass multimedia data with geographical information (geo-multimedia) are collected and stored on the Internet due to the wide application of location-based services (LBS). How to find the high-level semantic relationship between geo-multimedia data and construct efficient index is crucial for large-scale geo-multimedia retrieval. To combat this challenge, the paper proposes a deep cross-modal hashing framework for geo-multimedia retrieval, termed as Triplet-based Deep Cross-Modal Retrieval (TDCMR), which utilizes deep neural network and an enhanced triplet constraint to capture high-level semantics. Besides, a novel hybrid index, called TH-Quadtree, is developed by combining cross-modal binary hash codes and quadtree to support high-performance search. Extensive experiments are conducted on three common used benchmarks, and the results show the superior performance of the proposed method

Learning from real world data about combinatorial treatment selection for COVID-19

COVID-19 is an unprecedented global pandemic with a serious negative impact on virtually every part of the world. Although much progress has been made in preventing and treating the disease, much remains to be learned about how best to treat the disease while considering patient and disease characteristics. This paper reports a case study of combinatorial treatment selection for COVID-19 based on real-world data from a large hospital in Southern China. In this observational study, 417 confirmed COVID-19 patients were treated with various combinations of drugs and followed for four weeks after discharge (or until death). Treatment failure is defined as death during hospitalization or recurrence of COVID-19 within four weeks of discharge. Using a virtual multiple matching method to adjust for confounding, we estimate and compare the failure rates of different combinatorial treatments, both in the whole study population and in subpopulations defined by baseline characteristics. Our analysis reveals that treatment effects are substantial and heterogeneous, and that the optimal combinatorial treatment may depend on baseline age, systolic blood pressure, and c-reactive protein level. Using these three variables to stratify the study population leads to a stratified treatment strategy that involves several different combinations of drugs (for patients in different strata). Our findings are exploratory and require further validation

Tauroursodeoxycholic acid: a bile acid that may be used for the prevention and treatment of Alzheimer’s disease

Alzheimer’s disease (AD) is a prevalent neurodegenerative disease that has become one of the main factors affecting human health. It has serious impacts on individuals, families, and society. With the development of population aging, the incidence of AD will further increase worldwide. Emerging evidence suggests that many physiological metabolic processes, such as lipid metabolism, are implicated in the pathogenesis of AD. Bile acids, as the main undertakers of lipid metabolism, play an important role in the occurrence and development of Alzheimer’s disease. Tauroursodeoxycholic acid, an endogenous bile acid, has been proven to possess therapeutic effects in different neurodegenerative diseases, including Alzheimer’s disease. This review tries to find the relationship between bile acid metabolism and AD, as well as explore the therapeutic potential of bile acid taurocursodeoxycholic acid for this disease. The potential mechanisms of taurocursodeoxycholic acid may include reducing the deposition of Amyloid-β protein, regulating apoptotic pathways, preventing tau hyperphosphorylation and aggregation, protecting neuronal synapses, exhibiting anti-inflammatory properties, and improving metabolic disorders. The objective of this study is to shed light on the use of tauroursodeoxycholic acid preparations in the prevention and treatment of AD, with the aim of identifying effective treatment targets and clarifying various treatment mechanisms involved in this disease

Accelerate Multi-Agent Reinforcement Learning in Zero-Sum Games with Subgame Curriculum Learning

Learning Nash equilibrium (NE) in complex zero-sum games with multi-agent reinforcement learning (MARL) can be extremely computationally expensive. Curriculum learning is an effective way to accelerate learning, but an under-explored dimension for generating a curriculum is the difficulty-to-learn of the subgames -- games induced by starting from a specific state. In this work, we present a novel subgame curriculum learning framework for zero-sum games. It adopts an adaptive initial state distribution by resetting agents to some previously visited states where they can quickly learn to improve performance. Building upon this framework, we derive a subgame selection metric that approximates the squared distance to NE values and further adopt a particle-based state sampler for subgame generation. Integrating these techniques leads to our new algorithm, Subgame Automatic Curriculum Learning (SACL), which is a realization of the subgame curriculum learning framework. SACL can be combined with any MARL algorithm such as MAPPO. Experiments in the particle-world environment and Google Research Football environment show SACL produces much stronger policies than baselines. In the challenging hide-and-seek quadrant environment, SACL produces all four emergent stages and uses only half the samples of MAPPO with self-play. The project website is at https://sites.google.com/view/sacl-rl