Search results for "Olea"
showing 10 items of 493 documents
Separations in Query Complexity Based on Pointer Functions
2015
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree of NAND gates of depth $k$, which achieves $R_0(f) = O(D(f)^{0.7537\ldots})$. We show this is false by giving an example of a total boolean function $f$ on $n$ bits whose deterministic query complexity is $\Omega(n/\log(n))$ while its zero-error randomized query complexity is $\tilde O(\sqrt{n})$. We further show that the quantum query complexity of the same function is $\tilde O(n^{1/4})$, giving the first example of a total function with a super-quadra…
Exact quantum algorithms have advantage for almost all Boolean functions
2014
It has been proved that almost all $n$-bit Boolean functions have exact classical query complexity $n$. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all $n$-bit Boolean functions can be computed by an exact quantum algorithm with less than $n$ queries. More exactly, we prove that ${AND}_n$ is the only $n$-bit Boolean function, up to isomorphism, that requires $n$ queries.
Superlinear advantage for exact quantum algorithms
2012
A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N inputs bits requires $N$ queries classically but can be computed with N/2 queries by an exact quantum algorithm. We present the first example of a Boolean function f(x_1, ..., x_N) for which exact quantum algorithms have superlinear advantage over the deterministic algorithms. Any deterministic algorithm that computes our function must use N qu…
Sensitivity versus block sensitivity of Boolean functions
2010
Determining the maximal separation between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory. We construct a sequence of Boolean functions with bs(f) = 1/2 s(f)^2 + 1/2 s(f). The best known separation previously was bs(f) = 1/2 s(f)^2 due to Rubinstein. We also report results of computer search for functions with at most 12 variables.
Forrelation
2014
We achieve essentially the largest possible separation between quantum and classical query complexities. We do so using a property-testing problem called Forrelation, where one needs to decide whether one Boolean function is highly correlated with the Fourier transform of a second function. This problem can be solved using 1 quantum query, yet we show that any randomized algorithm needs Ω(√(N)log(N)) queries (improving an Ω(N[superscript 1/4]) lower bound of Aaronson). Conversely, we show that this 1 versus Ω(√(N)) separation is optimal: indeed, any t-query quantum algorithm whatsoever can be simulated by an O(N[superscript 1-1/2t])-query randomized algorithm. Thus, resolving an open questi…
An extension of the algebra of sets
1973
We shall explain the aim which leads us in the construction of an extended system of the algebra of sets1. The symbol 1. {*:?(*)} denoting the set of these and only these elements of domain of the variable x which satisfy the propositional condition (propositional function or form) ?9 (x)" is in com? mon use nowadays, so that it is adopted in school courses of mathematics in many countries, and in Poland as well. This condition will be said to define the set 1. However, if we admit propositional conditions which are meaningless for some values of their variables then we encounter some difficulties connected with the ex? pression 1. The formulae 2. {x : 9 (*)} = {x : 9 (*)}' 3. {x : 9 (s) v …
Effects of the benzodiazepine receptor agonist midazolam and antagonist flumazenil on 5-hydroxytryptamine release from guinea-pig intestine in vitro
1990
Isolated segments of the guinea-pig small intestine and the guinea-pig stomach were vascularly perfused and the release of 5-hydroxytryptamine (5-HT) and 5-hydroxyindoleacetic acid into the portal venous effluent determined by high pressure liquid chromatography with electrochemical detection. Test substances were applied intraarterially. The benzodiazepine receptor agonist, midazolam, concentration-dependently increased (by 58%, at 1 nmol/l) and decreased (by 32%, at 100 nmol/l) the release of 5-HT from small intestine preparations. Both effects were blocked by the benzodiazepine receptor antagonist flumazenil (10 nmol/l) The stimulatory effect of midazolam was also abolished in the presen…
THE USE OF LACTOBACILLUS PENTOSUS 1MO TO SHORTEN THE DEBITTERING PROCESS TIME OF BLACK TABLE OLIVES (CV. ITRANA AND LECCINO): A PILOT-SCALE APPLICATI…
2006
Fifty lactobacilli isolated from black table olive brines were evaluated for their salt tolerance, resistance to oleuropein and verbascoside, and ability to grow in modified filter-sterilized brines. A strain of Lactobacillus pentosus was selected and used as a starter to ferment, in pilot plant, black olives (Itrana and Leccino cv.) in brines modified for pH, carbohydrate, and growth factor concentrations, at 28 degrees C. The temperature-controlled fermentation of Leccino cv. olives resulted in obtaining ready-to-eat, high-quality table olives in a reduced-time process. HPLC analysis of phenolic compounds from fermented olives showed a decrease of oleuropein, a glucoside secoiridoid respo…
An innovative method to produce green table olives based on "pied de cuve" technology
2015
The technology of “pied de cuve” (PdC) is applied in food process only to produce wines with an enriched community of pro-technological yeasts. PdC promotes the growth of the desirable microbial strains in a small volume of grape must acting as a starter inoculums for higher volumes. The aim of the present work was to investigate the use of partially fermented brines, a technology known as PdC, developed with lactic acid bacteria (LAB) on the microbiological, chemical and sensory characteristics of green fermented table olives during two consecutive campaigns. The experimental plan included two trials based on different PdCs: trial A, PdC obtained with Lactobacillus pentosus OM13; trial B, …
Lipolytic activity of the yeast species associated with the fermentation/storage phase of ripe olive processing.
2010
9 páginas, 4 figuras, 5 tablas.-- El Pdf del artículo es la copia de autor.