Search results for "Gari"
showing 10 items of 716 documents
Influence of packaging on the aroma stability of strawberry syrup during shelf life
2001
Different types of packaging (glass bottle, PVC, and PET) were compared for the preservation of aroma quality of a strawberry syrup during shelf life. Esters, alcohols, and aldehydes were analyzed by solid-phase micro-extraction (SPME) and solvent extraction. During storage, hydrolysis of esters in acids and alcohols led to a modification of the aroma profile which can be explained by the replacement of “fruity” and “fresh” notes by “dairy note” in the syrup. Aroma compounds that are responsible for fruity notes, such as methyl cinnamate, methyl anthranilate, and methyl dihydrojasmonate, were strongly reduced after 90 days. This could be explained by a selective interaction of these compoun…
Combined effect of solvent content, temperature and pH on the chromatographic behaviour of ionisable compounds. III: Considerations about robustness
2009
Abstract We previously reported a model able to predict the retention time of ionisable compounds as a function of the solvent content, temperature and pH [J. Chromatogr. A 1163 (2007) 49]. The model was applied further, developing an optimisation of the resolution based on the peak purity concept [J. Chromatogr. A 1193 (2008) 117]. However, we left aside an important issue: we did not consider incidental overlaps caused by shifts in the predicted peak positions, owing either to uncertainties in the source data, modelling errors, or the practical implementation in the chromatograph of the optimal mobile phase (or any other). These shifts can ruin the predicted separation, since they can eas…
Error analysis and performance of different retention models in the transference of data from/to isocratic/gradient elution.
2003
The transferability of retention data among isocratic and gradient RPLC elution modes is studied. For this purpose, 16 beta-blockers were chromatographed under both isocratic and gradient elution with acetonitrile-water mobile phases. Taking into account the elution mode where the experimental data come from, and the mode where the retention should be predicted, the following combinations are possible: isocratic predictions from (i) isocratic or (ii) gradient experimental designs; and gradient predictions from (iii) isocratic or (iv) gradient data. Each of these possibilities was checked using three retention models that relate the logarithm of the retention factor: (a) linearly and (b) qua…
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
2012
We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to the adjacency matrix. Under the promise that G either contains T as a subgraph or does not contain T…
Analytic extension of non quasi-analytic Whitney jets of Roumieu type
1997
Let (Mr)r∈ℕ0 be a logarithmically convex sequence of positive numbers which verifies M0 = 1 as well as Mr≥ 1 for every r ∈ ℕ and defines a non quasi-analytic class. Let moreover F be a closed proper subset of ℝn. Then for every function ƒ on ℝn belonging to the non quasi-analytic (Mr)-class of Roumieu type, there is an element g of the same class which is analytic on ℝnF and such that Dα ƒ(x) = Dαg(x) for every σ ∈ ƒ0n SBAP and x ∈ F.
Integer Complexity: Experimental and Analytical Results II
2015
We consider representing natural numbers by expressions using only 1’s, addition, multiplication and parentheses. Let \( \left\| n \right\| \) denote the minimum number of 1’s in the expressions representing \(n\). The logarithmic complexity \( \left\| n \right\| _{\log } \) is defined to be \({ \left\| n \right\| }/{\log _3 n}\). The values of \( \left\| n \right\| _{\log } \) are located in the segment \([3, 4.755]\), but almost nothing is known with certainty about the structure of this “spectrum” (are the values dense somewhere in the segment?, etc.). We establish a connection between this problem and another difficult problem: the seemingly “almost random” behaviour of digits in the ba…
Computing the Kekulé structure count for alternant hydrocarbons
2002
A fast computer algorithm brings computation of the permanents of sparse matrices, specifically, molecular adjacency matrices. Examples and results are presented, along with a discussion of the relationship of the permanent to the Kekule structure count. A simple method is presented for determining the Kekule structure count of alternant hydrocarbons. For these hydrocarbons, the square of the Kekule structure count is equal to the permanent of the adjacency matrix. In addition, for alternant structures the adjacency matrix for N atoms can be written in such a way that only an N/2 × N/2 matrix need be evaluated. The Kekule structure count correlates with topological indices. The inclusion of…
Quantum Algorithm for Dyck Language with Multiple Types of Brackets
2021
We consider the recognition problem of the Dyck Language generalized for multiple types of brackets. We provide an algorithm with quantum query complexity \(O(\sqrt{n}(\log n)^{0.5k})\), where n is the length of input and k is the maximal nesting depth of brackets. Additionally, we show the lower bound for this problem which is \(\varOmega (\sqrt{n}c^{k})\) for some constant c.
Forbidden Factors and Fragment Assembly
2001
In this paper methods and results related to the notion of minimal forbidden words are applied to the fragment assembly problem. The fragment assembly problem can be formulated, in its simplest form, as follows: reconstruct a word w from a given set I of substrings (fragments ) of a word w . We introduce an hypothesis involving the set of fragments I and the maximal length m(w) of the minimal forbidden factors of w . Such hypothesis allows us to reconstruct uniquely the word w from the set I in linear time. We prove also that, if w is a word randomly generated by a memoryless source with identical symbol probabilities, m(w) is logarithmic with respect to the size of w . This result shows th…
Tally languages accepted by alternating multitape finite automata
1997
We consider k-tape 1-way alternating finite automata (k-tape lafa). We say that an alternating automaton accepts a language L\(\subseteq\)(Σ*)k with f(n)-bounded maximal (respectively, minimal) leaf-size if arbitrary (respectively, at least one) accepting tree for any (w1, w2,..., wk) ∈ L has no more than $$f\mathop {(\max }\limits_{1 \leqslant i \leqslant k} \left| {w_i } \right|)$$ leaves. The main results of the paper are the following. If k-tape lafa accepts language L over one-letter alphabet with o(log n)-bounded maximal leaf-size or o(log log n)-bounded minimal leaf-size then the language L is semilinear. Moreover, if a language L is accepted with o(log log(n))-bounded minimal (respe…