Search results for "Databases"
showing 10 items of 937 documents
The laparoscopic approach to Acute Mesenteric Ischemia is today unclear and less debated (AMI). There are in fact no clinical evidences on this parti…
2016
The laparoscopic approach to Acute Mesenteric Ischemia is today unclear and less debated (AMI). There are in fact no clinical evidences on this particular focus and only few articles can be found in several databases (pubmed, cochrane library, etc.), and the problem concerns both diagnostic and therapeutic utilization of the procedure. These considerations were already taken into account in 2012 EAES guidelines where the Grade of Recommendation (GoR) of laparoscopy in AMI was low in both diagnostic and therapeutic aspects. According to the new Oxford Classification [1], the use of laparoscopy in patients with suspicious or diagnosed AMI presents a weak GoR.
Una nuova acquisizione iconografica per la ricostruzione della tribuna di Antonello Gagini nella Cattedrale di Palermo
2022
La recente digitalizzazione di un dipinto di anonimo siciliano nelle collezioni del Museo de Historia di Madrid e il suo inserimento nei database del patrimonio culturale spagnolo ed europeo ha consentito di riportare all’attenzione della comunità scientifica un’importante raffigurazione pittorica della tribuna di Antonello Gagini nella Cattedrale di Palermo. Dopo avere ripercorso le principali fonti documentarie ed iconografiche relative alla tribuna, viene qui presentata l’opera oggi a Madrid, che fornisce un prezioso riscontro alle fonti fin qui note.
An improved quantum query algorithm for computing AND Boolean function
2010
We consider the quantum query model for computing Boolean functions. The definition of the function is known, but a black box contains the input X = (x 1 , x 2 , …, x n ). Black box can be accessed by querying x i values. The goal is to develop an algorithm, which would compute the function value for arbitrary input using as few queries to the black box as possible. We present two different quantum query algorithms for computing the basic Boolean function — logical AND of two bits. Both algorithms use only one query to determine the function value. Correct answer probability for the first algorithm is 80%, but for the second algorithm it is 90%. To compute this function with the same probab…
Efficient evaluation for a subset of recursive queries
1991
Abstract We consider the efficient evaluation of recursive queries in logic databases where the queries are expressed using a Datalog program (function-free Horn-clause program) that contains only regularly or linearly recursive predicates. Using well-known results on graph traversal, we develop an efficient algorithm for evaluating relations defined by a binary-chain program. We also present a transformation by which the evaluation of a subset of queries involving nonbinary relations can be reduced to the evaluation of binary-chain queries. This transformation is guided by the choice of bound arguments in the query, and the bindings are propagated through the program so that in the evaluat…
A Problem Structuring Method
1991
Given a formal definition of problem and a formal definition of system, the equivalence between both concepts is studied. Considering a problem as a 3-tuple , where D is the set of possible data, R is the set of possible results, and P the set of conditions of the problem, classes of problems are constructed as combinations of types of data, types of results and types of conditions. For example, data can be either literal or numerical, either with uncertainty or not; conditions can be determined by rules, tables, equations, it may have uncertainty, etc. As a case of application it is outlined how some of the most common problems (knowledge representation, search, reasoning and planning, etc…
Multiple Usage of Random Bits in Finite Automata
2012
Finite automata with random bits written on a separate 2-way readable tape can recognize languages not recognizable by probabilistic finite automata. This shows that repeated reading of random bits by finite automata can have big advantages over one-time reading of random bits.
Query automata
1999
A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document databases. We want to understand how the natural and well-studied computation model of tree automata can be used to compute such queries. We define a query automaton (QA) as a deterministic two-way finite automaton over trees that has the ability to select nodes depending on the state and the label at those nodes. We study QAs over ranked as well as over unranked trees. Unranked trees differ from ranked ones in that there is no bound on the num…
Gibbs equation in the nonlinear nonequilibrium thermodynamics of dilute nonviscous gases
2003
AbstractThis paper deals with the derivation of the Gibbs equation for a nonviscous gas in the presence of heat flux. The analysis aims to shed some light on the physical interpretation of thermodynamic potentials far from equilibrium. Two different definitions for the chemical potential and thermodynamic pressure far from equilibrium are introduced: nonequilibrium chemical potential and nonequilibrium thermodynamic pressure at constant heat flux q and nonequilibrium chemical potential and nonequilibrium thermodynamic pressure at constant J = Vq, where V is the specific volume.
A two miRNA classifier differentiates follicular thyroid carcinomas from follicular thyroid adenomas.
2015
The inherent diagnostic limitations of thyroid fine needle aspiration (FNA), especially in the "indeterminate" category, can be partially overcome by molecular analyses. We aimed at the identification of miRNAs that could be used to improve the discrimination of indeterminate FNAs. miRNA expression profiling was performed for 17 follicular carcinomas (FTCs) and 8 follicular adenomas (FAs). The microarray results underwent cross-comparison using three additional microarray data sets. Candidate miRNAs were validated by qPCR in an independent set of 32 FTCs and 46 FAs. Sixty-eight differentially expressed miRNAs were identified. Thirteen miRNAs could be confirmed by cross comparison. A two-miR…
Unveiling distribution patterns of freshwater phytoplankton by a next generation sequencing based approach.
2012
The recognition and discrimination of phytoplankton species is one of the foundations of freshwater biodiversity research and environmental monitoring. This step is frequently a bottleneck in the analytical chain from sampling to data analysis and subsequent environmental status evaluation. Here we present phytoplankton diversity data from 49 lakes including three seasonal surveys assessed by next generation sequencing (NGS) of 16S ribosomal RNA chloroplast and cyanobacterial gene amplicons and also compare part of these datasets with identification based on morphology. Direct comparison of NGS to microscopic data from three time-series showed that NGS was able to capture the seasonality in…