A generalization of Ekeland's variational principle by using the τ-distance with its applications.
Ontology highlight
ABSTRACT:
SUBMITTER: Farajzadeh AP
PROVIDER: S-EPMC5544817 | biostudies-other | 2017
REPOSITORIES: biostudies-other
Similar Datasets
Project description:For scale-free networks with degrees following a power law with an exponent τ ∈ (2, 3), the structures of motifs (small subgraphs) are not yet well understood. We introduce a method designed to identify the dominant structure of any given motif as the solution of an optimization problem. The unique optimizer describes the degrees of the vertices that together span the most likely motif, resulting in explicit asymptotic formulas for the motif count and its fluctuations. We then classify all motifs into two categories: motifs with small and large fluctuations.
| S-EPMC6494877 | biostudies-other
Project description:The PRM dataset corresponds to the raw data files supporting the comparison between conventional database search using Mascot and spectral matching strategy (Figure 3). The PRM and DDA raw data files support the comparison between these two acquisition methods using the spectral matching strategy to corroborate the identity of the peptides (Figure 4D). The data were generated from the triplicate analyses of a dilution series of 778 SIL peptides spiked in a yeast tryptic digest at concentrations ranging from 50 amol/µL to 37 fmol/µL.
2016-05-09 | PXD003781 | Pride
Project description:PurposeAlzheimer's disease (AD) studies revealed that abnormal deposition of tau spreads in a specific spatial pattern, namely Braak stage. However, Braak staging is based on post mortem brains, each of which represents the cross section of the tau trajectory in disease progression, and numerous studies were reported that do not conform to that model. This study thus aimed to identify the tau trajectory and quantify the tau progression in a data-driven approach with the continuous latent space learned by variational autoencoder (VAE).MethodsA total of 1080 [18F]Flortaucipir brain positron emission tomography (PET) images were collected from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database. VAE was built to compress the hidden features from tau images in latent space. Hierarchical agglomerative clustering and minimum spanning tree (MST) were applied to organize the features and calibrate them to the tau progression, thus deriving pseudo-time. The image-level tau trajectory was inferred by continuously sampling across the calibrated latent features. We assessed the pseudo-time with regard to tau standardized uptake value ratio (SUVr) in AD-vulnerable regions, amyloid deposit, glucose metabolism, cognitive scores, and clinical diagnosis.ResultsWe identified four clusters that plausibly capture certain stages of AD and organized the clusters in the latent space. The inferred tau trajectory agreed with the Braak staging. According to the derived pseudo-time, tau first deposits in the parahippocampal and amygdala, and then spreads to the fusiform, inferior temporal lobe, and posterior cingulate. Prior to the regional tau deposition, amyloid accumulates first.ConclusionThe spatiotemporal trajectory of tau progression inferred in this study was consistent with Braak staging. The profile of other biomarkers in disease progression agreed well with previous findings. We addressed that this approach additionally has the potential to quantify tau progression as a continuous variable by taking a whole-brain tau image into account.
| S-EPMC9250490 | biostudies-literature
Project description:The measurement of distance between two objects is generalized to the case where the objects are no longer points but are one-dimensional. Additional concepts such as nonextensibility, curvature constraints, and noncrossing become central to the notion of distance. Analytical and numerical results are given for some specific examples, and applications to biopolymers are discussed.
| S-EPMC1986585 | biostudies-literature
Project description:We consider Riemann mappings from bounded Lipschitz domains in the plane to a triangle. We show that in this case the Riemann mapping has a linear variational principle: It is the minimizer of the Dirichlet energy over an appropriate affine space. By discretizing the variational principle in a natural way we obtain discrete conformal maps which can be computed by solving a sparse linear system. We show that these discrete conformal maps converge to the Riemann mapping in [Formula: see text], even for non-Delaunay triangulations. Additionally, for Delaunay triangulations the discrete conformal maps converge uniformly and are known to be bijective. As a consequence we show that the Riemann mapping between two bounded Lipschitz domains can be uniformly approximated by composing the discrete Riemann mappings between each Lipschitz domain and the triangle.
| S-EPMC6338830 | biostudies-other
Project description:We introduce a discrete-time variational principle inspired by the quantum clock originally proposed by Feynman and use it to write down quantum evolution as a ground-state eigenvalue problem. The construction allows one to apply ground-state quantum many-body theory to quantum dynamics, extending the reach of many highly developed tools from this fertile research area. Moreover, this formalism naturally leads to an algorithm to parallelize quantum simulation over time. We draw an explicit connection between previously known time-dependent variational principles and the time-embedded variational principle presented. Sample calculations are presented, applying the idea to a hydrogen molecule and the spin degrees of freedom of a model inorganic compound, demonstrating the parallel speedup of our method as well as its flexibility in applying ground-state methodologies. Finally, we take advantage of the unique perspective of this variational principle to examine the error of basis approximations in quantum dynamics.
| S-EPMC3799300 | biostudies-literature
Project description:Within a fully microscopic setting, we derive a variational principle for the non-equilibrium steady states of chemical reaction networks, valid for time-scales over which chemical potentials can be taken to be slowly varying: at stationarity the system minimizes a global function of the reaction fluxes with the form of a Hopfield Hamiltonian with hebbian couplings, that is explicitly seen to correspond to the rate of decay of entropy production over time. Guided by this analogy, we show that reaction networks can be formally re-cast as systems of interacting reactions that optimize the use of the available compounds by competing for substrates, akin to agents competing for a limited resource in an optimal allocation problem. As an illustration, we analyze the scenario that emerges in two simple cases: that of toy (random) reaction networks and that of a metabolic network model of the human red blood cell.
| S-EPMC3397975 | biostudies-literature
Project description:The establishment of CRISPR/Cas9 (clustered regularly interspaced short palindromic repeats/CRISPR-associated protein 9) technology for eukaryotic gene editing opened up new avenues not only for the analysis of gene function but also for therapeutic interventions. While the original methodology allowed for targeted gene disruption, recent technological advancements yielded a rich assortment of tools to modify genes and gene expression in various ways. Currently, clinical applications of this technology fell short of expectations mainly due to problems with the efficient and safe delivery of CRISPR/Cas9 components to living organisms. The targeted in vivo delivery of therapeutic nucleic acids and proteins remain technically challenging and further limitations emerge, for instance, by unwanted off-target effects, immune reactions, toxicity, or rapid degradation of the transfer vehicles. One approach that might overcome many of these limitations employs extracellular vesicles as intercellular delivery devices. In this review, we first introduce the CRISPR/Cas9 system and its latest advancements, outline major applications, and summarize the current state of the art technology using exosomes or microvesicles for transporting CRISPR/Cas9 constituents into eukaryotic cells.
| S-EPMC8200053 | biostudies-literature
Project description:AI is becoming ubiquitous, revolutionizing many aspects of our lives. In surgery, it is still a promise. AI has the potential to improve surgeon performance and impact patient care, from post-operative debrief to real-time decision support. But, how much data is needed by an AI-based system to learn surgical context with high fidelity? To answer this question, we leveraged a large-scale, diverse, cholecystectomy video dataset. We assessed surgical workflow recognition and report a deep learning system, that not only detects surgical phases, but does so with high accuracy and is able to generalize to new settings and unseen medical centers. Our findings provide a solid foundation for translating AI applications from research to practice, ushering in a new era of surgical intelligence.
| S-EPMC7747564 | biostudies-literature
Project description:Automatic differentiation (AD) is a powerful tool that allows calculating derivatives of implemented algorithms with respect to all of their parameters up to machine precision, without the need to explicitly add any additional functions. Thus, AD has great potential in quantum chemistry, where gradients are omnipresent but also difficult to obtain, and researchers typically spend a considerable amount of time finding suitable analytical forms when implementing derivatives. Here, we demonstrate that AD can be used to compute gradients with respect to any parameter throughout a complete quantum chemistry method. We present DiffiQult, a Hartree-Fock implementation, entirely differentiated with the use of AD tools. DiffiQult is a software package written in plain Python with minimal deviation from standard code which illustrates the capability of AD to save human effort and time in implementations of exact gradients in quantum chemistry. We leverage the obtained gradients to optimize the parameters of one-particle basis sets in the context of the floating Gaussian framework.
| S-EPMC5968443 | biostudies-literature