The digoxigenin derivative N-hydroxysuccinimidyl digoxigenin-3-O-methylcarbonyl-epsilon-aminocaproate (HDMA) has been shown to covalently label the ouabain binding site of the Na,K-ATPase epsilon subunit [Antolovic et al. (1995) Eur. J. Biochem. 227, 61-67]. In the present study we observed both, labeling and inactivation of the activity, of wild type Na,K-ATPase overexpressed in Xenopus oocyte...

We examine energy spectra, fluxes, and transfers of two-dimensional forced incompressible turbulence with linear drag in the energy range, and find marked departures from 5/3 law and the idea of locality. Any attempt to bring the system into the "ideal cascade state" would result either in spectral (bulge) or flux distortion. We corroborate this observation by DNS (spectral code) and eddy-dampe...

24-hour samples of pm1 (submicron particles, aerodynamic diameters ≤1 μm) and pm2.5(fine particles, aerodynamic diameters ≤ 2.5 μm) were collected at a quasi-rural area in racibórz (1 january-30 june 2011). the samples were analysed for carbon (organic and elemental), water-soluble ions (na+,nh4 +, k+, mg2+, ca2+, cl-, no3 -, so4 2-) and concentrations of 21 elements with a carbon analyser (sun...

In the directed Steiner tree (DST) problem, we are given an $n$-vertex edge-weighted graph, a root $r$, and collection of $k$ terminal nodes. Our goal is to find minimum-cost subgraph that contains path from $r$ every terminal. We present $O(\log^2 k/\log\log{k})$-approximation algorithm for DST runs in quasi-polynomial time, i.e., time $n^{{poly}\log (k)}$. By assuming projection game conjectu...

We consider a well-studied generalization of the maximum clique problem which is defined as follows. Given graph G on n vertices and fixed parameter $$d\ge 1$$ , in diameter-bounded subgraph (MaxDBS for short) goal to find (vertex) diameter at most d. For $$d=1$$ this equivalent thus it NP-hard approximate within factor $$n^{1-\epsilon }$$ any $$\epsilon >0$$ . Moreover, known that, 2$$ MaxDBS ...

We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use previous rapidly reversing the order along a path. Given nearest-neighbor interactions on path length $n$, we show that there exists constant $\epsilon \approx 0.034$ such quantum routing time is at most $(1-\epsilon)n$, whereas any swap-based protocol needs least $n-1$. Th...