Search results for " General"
showing 10 items of 33759 documents
“Sweet” ionic liquid gels: materials for sweetening of fuels
2018
The search for new materials to be used in desulfurisation (sweetening) of fuels is one of the main topics of current research. In this paper, we explored the possibility of using supramolecular gels obtained from the gelation of ionic liquid binary mixtures. Indeed, some ionic liquids are generally known as efficient extraction phases for desulfurisation of fuels. In rare cases, one of their main drawbacks is their partial solubility in the fuel, leading to contamination. Then, their immobilisation due to the formation of a gelatinous network may be a challenge. Ionic liquid gels were obtained by mixing certain [NTf2]−-based ionic liquids (solvents) with the ones of gluconate-based ionic l…
Common fixed points of g-quasicontractions and related mappings in 0-complete partial metric spaces
2012
Abstract Common fixed point results are obtained in 0-complete partial metric spaces under various contractive conditions, including g-quasicontractions and mappings with a contractive iterate. In this way, several results obtained recently are generalized. Examples are provided when these results can be applied and neither corresponding metric results nor the results with the standard completeness assumption of the underlying partial metric space can. MSC:47H10, 54H25.
Neurons derived from P19 embryonic carcinoma cells as a platform for biosensor applications - optimisation and characterisation
2007
Variable time amplitude amplification and quantum algorithms for linear algebra problems
2012
Quantum amplitude amplification is a method of increasing a success probability of an algorithm from a small epsilon>0 to Theta(1) with less repetitions than classically. In this paper, we generalize quantum amplitude amplification to the case when parts of the algorithm that is being amplified stop at different times. We then apply the new variable time amplitude amplification to give two new quantum algorithms for linear algebra problems. Our first algorithm is an improvement of Harrow et al. algorithm for solving systems of linear equations. We improve the running time of the algorithm from O(k^2 log N) to O(k log^3 k log N) where k is the condition number of the system of equations. …
Computer Science Meets Ecology (Dagstuhl Seminar 17091)
2017
This report summarizes the program and main outcomes of the Dagstuhl Seminar 17091 entitled ``Computer Science Meets Ecolog''. Ecology is a discipline that poses many challenging problems involving big data collection, provenance and integration, as well as difficulties in data analysis, prediction and understanding. All these issues are precisely the arena where computer science is concerned. The seminar motivation was rooted in the belief that ecology could largely benefit from modern computer science. The seminar attracted scientists from both fields who discussed important topics in ecology (e.g. botany, animal science, biogeochemistry) and how to approach them with machine learning, co…
FO^2 with one transitive relation is decidable
2013
We show that the satisfiability problem for the two-variable first-order logic, FO^2, over transitive structures when only one relation is required to be transitive, is decidable. The result is optimal, as FO^2 over structures with two transitive relations, or with one transitive and one equivalence relation, are known to be undecidable, so in fact, our result completes the classification of FO^2-logics over transitive structures with respect to decidability. We show that the satisfiability problem is in 2-NExpTime. Decidability of the finite satisfiability problem remains open.
Extensions and corona decompositions of low-dimensional intrinsic Lipschitz graphs in Heisenberg groups
2020
This note concerns low-dimensional intrinsic Lipschitz graphs, in the sense of Franchi, Serapioni, and Serra Cassano, in the Heisenberg group $\mathbb{H}^n$, $n\in \mathbb{N}$. For $1\leq k\leq n$, we show that every intrinsic $L$-Lipschitz graph over a subset of a $k$-dimensional horizontal subgroup $\mathbb{V}$ of $\mathbb{H}^n$ can be extended to an intrinsic $L'$-Lipschitz graph over the entire subgroup $\mathbb{V}$, where $L'$ depends only on $L$, $k$, and $n$. We further prove that $1$-dimensional intrinsic $1$-Lipschitz graphs in $\mathbb{H}^n$, $n\in \mathbb{N}$, admit corona decompositions by intrinsic Lipschitz graphs with smaller Lipschitz constants. This complements results that…
Discrete spectral incoherent solitons in nonlinear media with noninstantaneous response
2011
International audience; We show theoretically that nonlinear optical media characterized by a finite response time may support the existence of discrete spectral incoherent solitons. The structure of the soliton consists of three incoherent spectral bands that propagate in frequency space toward the low-frequency components in a discrete fashion and with a constant velocity. Discrete spectral incoherent solitons do not exhibit a confinement in the space-time domain, but exclusively in the frequency domain. The kinetic theory describes in detail all the essential properties of discrete spectral incoherent solitons: A quantitative agreement has been obtained between simulations of the kinetic…
Инфинитезимальная проблема центра на нулевых циклах и гипотеза композиции
2021
Изучается аналог классической инфинитезимальной проблемы центра на плоскости для нулевых циклов. Для этого случая определяется функция смещения и доказывается, что она тождественно равна нулю тогда и только тогда, когда деформация имеет композиционный фактор. Иными словами, гипотеза композиции верна в этом случае, в отличие от тангенциальной проблемы центра для нулевых циклов. Приводятся примеры применения результатов.