let r be a prime ring with extended centroid c, h a generalized derivation of r and n ⩾ 1 a xed integer. in this paper we study the situations: (1) if (h(xy))n = (h(x))n(h(y))n for all x; y 2 r; (2) obtain some related result in case r is a noncommutative banach algebra and h is continuous or spectrally bounded.

In this paper, we introduce the new notion of strongly J-clean rings associated with polynomial identity g(x) = 0, as a generalization of strongly J-clean rings. We denote strongly J-clean rings associated with polynomial identity g(x) = 0 by strongly g(x)-J-clean rings. Next, we investigate some properties of strongly g(x)-J-clean.

chiral pyrrolidines and pyrrolizidines with spirooxindole ring systems are the central skeletons for numerous alkaloids and pharmacologically important compounds. gelesmine, pseudotabersonine, formosanine, isoformosanine, morroniside and mitraphylline are some of the alkaloids containing spirooxindole ring systems. derivatives of spirooxindole find very wide biological applications as anti micr...

We track multiple human subjects using ultra-wide band (UWB) radar based on their target signatures. To resolve the correspondence problem, the use of CLEAN algorithm is proposed. Walking two human subjects are measured by UWB radar. The feasibility of classification is investigated using the suggested method.

in this paper we define a new type of rings ”almost powerhermitian rings” (a generalization of almost hermitian rings) and establish several sufficient conditions over a ring r such that, every regular matrix admits a diagonal power-reduction.

Flip-Flop_1: Firstly, the old flip-flop construction that we choose to implement is the classic single edge triggered flip-flop (SETFF) which is shown in FIGURE 10.24 in the book " CMOS VLSI Design A Circuits and Systems Perspective " 4th Edition. The figure is shown below. Fig A-1 Resettable Flip-Flop The schematic that we construct is shown as follows: Fig A-2 Resettable Flip-Flop Schematic T...

We prove a relationship between the Cleaning problem and the Balanced Vertex– Ordering problem, namely that the minimum total imbalance of a graph equals twice the brush number of a graph. This equality has consequences for both problems. On one hand, it allows us to prove the NP-completeness of the Cleaning problem, which was conjectured by Messinger et al. [7]. On the other hand, it also enab...