The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in a Euclidean space, may lead to slow convergence of the constructed sequence when that sequence enters some narrow “corridor” between two or more convex sets. A way to leave such corridor consists in taking a big step at different moments during the iteration, because in that way the monotoneous behaviour that is responsible for the slow convergence may be interrupted. In this paper we present a technique that may introduce interruption of the monotony for a sequential algorithm, but that at the same time guarantees convergence of the constructed sequence to a point in the intersection of the sets. We compare experimentally the behaviour concerning the speed of convergence of the new algorithm with that of an existing monotoneous algorithm.
A serine protease gene was cloned from the bumblebee, Bombus ignitus. The B. ignitus serine protease (BiSP) gene spans 1702 bp and consists of four introns and five exons coding for 250 amino acid residues. Southern blot analysis of genomic DNA suggested that BiSP gene is a single copy gene. The cDNA encoding BiSP was expressed as a 28-kDa polypeptide in baculovirus-infected insect cells and the recombinant BiSP showed activity in a protease enzyme assay. BiSP was specifically expressed in the midgut of B. ignitus queens, males, and workers, suggesting that the BiSP is a gut enzyme involved in the digestion of dietary proteins.
Let $\Omega $ be a bounded open set in $\mathbb R^n$, $n \geq 2$. In a well-known paper {\it Indiana Univ. Math. J.}, 20, 1077--1092 (1971) Moser found the smallest value of $K$ such that $$ \sup \bigg \{\int _{\Omega } \exp \Big (\Big (\frac {\left |f(x)\right |}K\Big )^{n/(n-1)}\Big )\colon f\in W^{1,n}_0(\Omega ),\|\nabla f\|_{L^n}\leq 1\bigg \}<\infty . $$ We extend this result to the situation in which the underlying space $L^n$ is replaced by the generalized Zygmund space $L^n\log ^{n-1}L \log ^{\alpha }\log L$ $(\alpha <n-1)$, the corresponding space of exponential growth then being given by a Young function which behaves like $\exp (\exp (t^{n/(n-1-\alpha )}))$ for large $t$. We also discuss the case of an embedding into triple and other multiple exponential cases.
Assume that $X$, $Y$ are continuous-path martingales taking values in $\mathbb R^\nu $, $\nu \geq 1$, such that $Y$ is differentially subordinate to $X$. The paper contains the proof of the maximal inequality $$ \|\sup _{t\geq 0} |Y_t| \|_1\leq 2\|\sup _{t\geq 0} |X_t| \|_1. $$ The constant $2$ is shown to be the best possible, even in the one-dimensional setting of stochastic integrals with respect to a standard Brownian motion. The proof uses Burkholder's method and rests on the construction of an appropriate special function.
We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance Laplacian spectral radius, the distance signless Laplacian spectral radius of an undirected graph or a digraph. These results are new or generalize some known results., Lihua You, Yujie Shu, Xiao-Dong Zhang., and Obsahuje seznam literatury
The theorem about the characterization of a GS-quasigroup by means of a commutative group in which there is an automorphism which satisfies certain conditions, is proved directly.