In this study, we explored the relationship between ligand-induced regulation of surface delta opioid receptors and G protein activation. G protein activation was assessed with [(35)S]guanosine-5'-O-(3-thio)triphosphate (GTP gamma S) binding assays conducted at both 37 and 0 degrees C. Ligand-independent (constitutive) activity of the delta-receptor was readily observed when the [(35)S]GTP gamm...

In this paper, we investigate additive properties of generalized Drazin inverse for bounded linear operators. As an application present new conditions under which a 2 ? operator matrix has g-Drazin inverse. These extend the main results Dana and Yousefi (Int. J. Appl. Comput. Math., 4(2018), page 9), Yang Liu (J. 235(2011), 1412-1417) Sun et al. (Filomat, 30(2016), 3377-3388).

Given a tesselation of the plane, defined by a planar straightline graph G, we want to find a minimal set S of points in the plane, such that the Voronoi diagram associated with S ‘fits’ G. This is the Generalized Inverse Voronoi Problem (GIVP), defined in [12] and rediscovered recently in [3]. Here we give an algorithm that solves this problem with a number of points that is linear in the size...

We study Manin triples for a reductive Lie algebra, g. First, we generalize results of E. Karolinsky, on the classification of Lagrangian subalgebras (cf. KAROLINSKY E., A Classification of Poisson homogeneous spaces of a compact Poisson Lie group, Dokl. Ak. Nauk, 359 (1998), 13-15). Then we show that, if g is non commutative, one can attach , to each Manin triple in g , another one for a stric...

1. Basic Concepts and Facts (1.1) A semigroup is an ordered pair (G, ?) where G is a nonempty set and ? is a binary operation on G satisfying: (G1) a ? (b ? c) = (a ? b) ? c, ∀a, b, c ∈ G. A semigroup G is a monoid if it also satisfies: (G2) G has an element e (sometimes denoted by 1G, called the identity of G), such that e ? a = a ? e = a, ∀a ∈ G. A monoid is a group if (G3) below is satisfied...

Definition 1: An operation on a set G is a function ∗ : G×G→ G. Definition 2: A group is a set G which is equipped with an operation ∗ and a special element e ∈ G, called the identity, such that (i) the associative law holds: for every x, y, z ∈ G, x ∗ (y ∗ z) = (x ∗ y) ∗ z; (ii) e ∗ x = x = x ∗ e for all x ∈ G; (iii) for every x ∈ G, there is x′ ∈ G (so-called, inverse) with x ∗ x′ = e = x′ ∗ ...

(1.1) = inf f t > 0 j Bt g(t) g is exponentially distributed (i.e. has a density function f(t) = e t with t > 0 and > 0 ). This problem can be viewed as an inverse to the problem of finding a density function f of when g is given. Explicit solutions to the latter problem are known only in a limited number of special cases including linear or quadratic g . The law of is also known for a square-r...

For positive semidefinite matrices A and B, Ando and Zhan proved the inequalities |||f(A) + f(B)||| ≥ |||f(A + B)||| and |||g(A) + g(B)||| ≤ |||g(A + B)|||, for any unitarily invariant norm, and for any non-negative operator monotone f on [0,∞) with inverse function g. These inequalities have very recently been generalised to non-negative concave functions f and non-negative convex functions g,...