Search results for "Databases"
showing 10 items of 937 documents
Increasing the Coverage of Medicinal Chemistry-Relevant Space in Commercial Fragments Screening
2014
Analyzing the chemical space coverage in commercial fragment screening collections revealed the overlap between bioactive medicinal chemistry substructures and rule-of-three compliant fragments is only ∼25%. We recommend including these fragments in fragment screening libraries to maximize confidence in discovering hit matter within known bioactive chemical space, while incorporation of nonoverlapping substructures could offer novel hits in screening libraries. Using principal component analysis, polar and three-dimensional substructures display a higher-than-average enrichment of bioactive compounds, indicating increasing representation of these substructures may be beneficial in fragment …
Using databases to improve the visibility of women’s contributions in STEM fields
2021
Las bases de datos son herramientas muy poderosas para simplificar la gestión y el acceso a la información, que han demostrado ser capacidades fundamentales en la era de la ciencia de datos. Actualmente, las bases de datos se utilizan ampliamente en muchas aplicaciones y campos diferentes. En este trabajo destacamos los beneficios que pueden aportar las bases de datos disponibles públicamente de mujeres profesionales que trabajan en los campos de la Ciencia, la Tecnología, la Ingeniería y las Matemáticas (CTIM) para superar el problema de la falta de diversidad y equidad de género en estos campos. Algunos ejemplos de bases de datos públicas en España se presentan en este trabajo. Se hace es…
Medication-related osteonecrosis of the jaw associated with implant and regenerative treatments : systematic review
2019
Background The aim of this study was to determine if the treatment with bisphosphonates other anti-resorptive and antiangiogenic agents influences the success of regenerative and / or implant treatments. Material and Methods We reviewed the literature from the last 5 years in the PubMed database, using the following words: “Sinus Floor Augmentation”[Mesh] OR “Dental Implants”[Mesh]) OR “Guided Tissue Regeneration”[Mesh]) AND “Osteonecrosis”[Mesh]. The articles were selected following the inclusion and exclusion criteria and were evaluated using the 22 items of the STROBE declaration. The following PICO clinical question was applied: Does the treatment with agents associated with drug osteon…
Dietary fiber and health outcomes: an umbrella review of systematic reviews and meta-analyses
2018
Background Several studies have suggested that higher consumption of dietary fiber is beneficial for a variety of health outcomes. However, many results have been inconclusive and, to our knowledge, there has been no attempt to systematically capture the breadth of outcomes associated with dietary fiber intake or to systematically assess the quality and the strength of the evidence on the associations of dietary fiber intake and different health outcomes or medical conditions. Objective The aim of this study was to describe the diverse health outcomes convincingly associated with dietary fiber consumption. Design This was an umbrella review of systematic reviews with meta-analysis of observ…
Indefinite integrals of special functions from hybrid equations
2019
Elementary linear first and second order differential equations can always be constructed for twice differentiable functions by explicitly including the function's derivatives in the definition of ...
A function whose graph has positive doubling measure
2014
We show that a doubling measure on the plane can give positive measure to the graph of a continuous function. This answers a question by Wang, Wen and Wen. Moreover we show that the doubling constant of the measure can be chosen to be arbitrarily close to the doubling constant of the Lebesgue measure.
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
New spaces of matrices with operator entries
2019
In this paper, we will consider matrices with entries in the space of operators $\mathcal{B}(H)$, where $H$ is a separable Hilbert space and consider the class of matrices that can be approached in the operator norm by matrices with a finite number of diagonals. We will use the Schur product with Toeplitz matrices generated by summability kernels to describe such a class and show that in the case of Toeplitz matrices it can be identified with the space of continuous functions with values in $\mathcal B(H)$. We shall also introduce matriceal versions with operator entries of classical spaces of holomorphic functions such as $H^\infty(\mathbb{D})$ and $A(\mathbb{D})$ when dealing with upper t…
The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group
2001
We consider order-generic queries, i.e., queries which commute with every order-preserving automorphism of a structure's universe. It is well-known that first-order logic has the natural order-generic collapse over the rational and the real ordered group for the class of dense order constraint databases (also known as finitely representable databases). I.e., on this class of databases over 〈Q, <〉 or 〈R, <〉, addition does not add to the expressive power of first-order logic for defining order-generic queries. In the present paper we develop a natural generalization of the notion of finitely representable databases, where an arbitrary (i.e. possibly infinite) number of regions is allowed. We …
Incremental termination proofs and the length of derivations
1991
Incremental termination proofs, a concept similar to termination proofs by quasi-commuting orderings, are investigated. In particular, we show how an incremental termination proof for a term rewriting system T can be used to derive upper bounds on the length of derivations in T. A number of examples show that our results can be applied to yield (sharp) low-degree polynomial complexity bounds.