The amino acid sequence of the light chain of bovine protein C was determined by sequenator analysis of the carboxymethylated light chain and fragments obtained by cyanogen bromide treatment, tryptic digestion after blocking of lysine residues, and cleavage with 2-(2-nitrophenylsulfenyl)-3-methyl-3-bromoindolenine (BNPS-skatole). The sequence was (in the standard one-letter code) A-N-S-F-L-X-X-...

• An inequality constrained optimization problem is an optimization problem in which the constraint set D can be represented as D = U ∩ {x ∈ R | h(x) ≥ 0}, where h : R → R. We refer to the functions h = (h1, . . . , hl) as inequality constraints. • An optimization problem with mixed constraints is an optimization problem in which the constraint set D can be represented as D = U ∩ {x ∈ R | g(x) ...

In this paper, we determine the $L^p(\mathbb{R})\times L^q(\mathbb{R})\rightarrow L^r(\mathbb{R})$ boundedness of bilinear Hilbert transform $H_{\gamma}(f,g)$ along a convex curve $\gamma$ $$H_{\gamma}(f,g)(x):=\mathrm{p.\,v.}\int_{-\infty}^{\infty}f(x-t)g(x-\gamma(t)) \,\frac{\textrm{d}t}{t},$$ where $p$, $q$, and $r$ satisfy $\frac{1}{p}+\frac{1}{q}=\frac{1}{r}$, $r>\frac{1}{2}$, $p>1$, $q>1$...

Let R be a ring with center Z and I a nonzero ideal of R. An additive mapping F : R → R is called a generalized derivation of R if there exists a derivation d : R → R such that F xy F x y xd y for all x, y ∈ R. In the present paper, we prove that if F x, y ± x, y for all x, y ∈ I or F x ◦ y ± x ◦ y for all x, y ∈ I, then the semiprime ring R must contains a nonzero central ideal, provided d I /...

ψ(x) + λ : ψ(x) := “ − ∂ 2 ∂t2 + (−∆3 + m) ” 1 2 Ẇ (x), (1.1) x ≡ (t, ~x) ∈ R × R, where ∆d is the d-dimensional Laplace operator, W is an isonormal Gaussian process on R , λ ≥ 0 is some given number and : ψ : is the cubic Wick power of ψ. In order to understand an importance and a motivation of the setting of (1,1), we start with the review of (1.2) below for general d ∈ N, which has been cons...

For a graph G and a set D ⊆ V (G), define Nr[x] = {xi ∈ V (G) : d(x, xi) ≤ r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] ∩ D. D is known as an r-identifying code if for every vertex x, Dr(x) 6= ∅, and for every pair of vertices x and y, x 6= y ⇒ Dr(x) 6= Dr(y). The various applications of these codes include attack sensor placement in networks and fault detection/localization...

Throughout this paper, R will represent an associative ring with center Z(R). A ring R is n-torsion free, where n > 1 is an integer, in case nx = 0, x ∈ R implies x = 0. As usual the commutator xy− yx will be denoted by [x, y]. We will use basic commutator identities [xy,z] = [x,z]y + x[y,z] and [x, yz] = [x, y]z+ y[x,z]. Recall that a ring R is prime if aRb = (0) implies that either a = 0 or b...

A central limit theorem for stochastic recursive sequences of topical operators. Abstract Let (A n) n∈N be a stationary sequence of topical (i.e. isotone and ad-ditively homogeneous) operators. Let x(n, x 0) be defined by x(0, x 0) = x 0 and x(n + 1, x 0) = A n x(n, x 0). It can modelize a wide range of systems including train or queuing networks, job-shop, timed digital circuits or parallel pr...

Theorems on the Fredholm alternative and well-posedness of the Darboux problem ∂2u(t, x) ∂t ∂x = `(u)(t, x) + q(t, x), u(t, x0) = φ(t) for t ∈ [a, b], u(t0, x) = ψ(x) for x ∈ [c, d] are established, where ` : C(D;R) → L(D;R) is a linear bounded operator, q ∈ L(D;R), t0 ∈ [a, b], x0 ∈ [c, d], φ : [a, b]→ R, ψ : [c, d]→ R are absolutely continuous functions, and D = [a, b] × [c, d]. New sufficien...