Search results for "ALK"

Medicinal alkaloid as a sex pheromone

1997

Bioaccessibility and decomposition of cylindrospermopsin in vegetables matrices after the application of an in vitro digestion model.

2018

Research on the human exposure to Cylindrospermopsin (CYN) via consumption of contaminated food is of great interest for risk assessment purposes. The aim of this work is to evaluate for the first time the CYN bioaccessibility in contaminated vegetables (uncooked lettuce and spinach, and boiled spinach) after an in vitro digestion model, including the salivar, gastric and duodenal phases and, colonic fermentation under lactic acid bacteria. The results obtained showed that the digestion processes are able to diminish CYN levels, mainly in the colonic phase, especially in combination with the boiling treatment, decreasing CYN levels in a significant way. Moreover, the potential decomposition…

EXTRACELLULAR VESCICLES DERIVED FROM GUT MICROBIOTA IN INFLAMMATORY BOWEL DISEASE AND COLORECTAL CANCER

2021

The human gut microbiome encompasses inter alia, the myriad bacterial species that create the optimal host-micro-organism balance essential for normal metabolic and immune function. Various lines of evidence suggest that dys-regulation of the microbiota-host interaction is linked to pathologies such as inflammatory bowel disease (IBD) and colorectal cancer (CRC). Extracellular vesicles (EVs), found in virtually all body fluids and produced by both eukaryotic cells and bacteria are involved in cell-cell communication and crosstalk mechanisms, such as the immune response, barrier function and intestinal flora. This review highlights advancements in knowledge of the functional role that EVs ma…

Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations

2016

The running time of a quantum walk search algorithm depends on both the structure of the search space graph and the configuration of marked locations. While the first dependence has been studied in a number of papers, the second dependence remains mostly unstudied. We study search by quantum walks on the two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. The original paper analyses one and two marked locations only. We move beyond two marked locations and study the behaviour of the algorithm for an arbitrary configuration of marked locations. In this paper, we prove two results showing the importance of how the marked locations are arranged. First, we present tw…

Exceptional Configurations of Quantum Walks with Grover’s Coin

2016

We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation -- Grover's diffusion transformation -- has a wide class of exceptional configurations of marked locations, for which the probability of finding any of the marked locations does not grow over time. This extends the class of known exceptional configurations; until now the only known such configuration was the "diagonal construction" by [AR08].

Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification

2013

We study search by quantum walk on a finite two dimensional grid. The algorithm of Ambainis, Kempe, Rivosh [AKR05] uses \(O(\sqrt{N \log{N}})\) steps and finds a marked location with probability O(1 / logN) for grid of size \(\sqrt{N} \times \sqrt{N}\). This probability is small, thus [AKR05] needs amplitude amplification to get Θ(1) probability. The amplitude amplification adds an additional \(O(\sqrt{\log{N}})\) factor to the number of steps, making it \(O(\sqrt{N} \log{N})\).

Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions

2007

For any AND-OR formula of size N, there exists a bounded-error N1/2+o(1)-time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximately balanced," formulas can be evaluated in O(radicN) queries, which is optimal. It follows that the (2-o(1))th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.

Span programs for functions with constant-sized 1-certificates

2012

Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the element distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph. We propose a solution for the same problems using span programs. The span program is a computational model equivalent to the quantum query algorithm in its strength, and yet very different in its outfit. We prove the power of our approach by designing a quantum algorithm for the triangle problem with query complexity O(n35/27) that is better than O(n13/10) of the best p…

Fractional master equations and fractal time random walks

1995

Fractional master equations containing fractional time derivatives of order 0\ensuremath{\le}1 are introduced on the basis of a recent classification of time generators in ergodic theory. It is shown that fractional master equations are contained as a special case within the traditional theory of continuous time random walks. The corresponding waiting time density \ensuremath{\psi}(t) is obtained exactly as \ensuremath{\psi}(t)=(${\mathit{t}}^{\mathrm{\ensuremath{\omega}}\mathrm{\ensuremath{-}}1}$/C)${\mathit{E}}_{\mathrm{\ensuremath{\omega}},\mathrm{\ensuremath{\omega}}}$(-${\mathit{t}}^{\mathrm{\ensuremath{\omega}}}$/C), where ${\mathit{E}}_{\mathrm{\ensuremath{\omega}},\mathrm{\ensuremat…

Random Walks on Weighted Graphs of Groups

2019

Let X be a locally finite simplicial tree without terminal vertices, and let X = ∣X∣1 be its geometric realisation. Let Γ be a nonelementary discrete subgroup of Aut(X).