نتایج جستجو برای: weak hyper k ideal
تعداد نتایج: 612764 فیلتر نتایج به سال:
After traumatic brain injury, extracellular K(+) in brain can dramatically increase. We studied the effects of increased K(+) on the isolated pressurized rat middle cerebral artery (MCA). MCAs (200-250 microm OD) were isolated, cannulated with glass micropipettes, and pressurized. K(+) was increased in the extraluminal bath using three paradigms: (1) isotonic K(+) (K(iso)) where increases in K(...
In this paper, we introduce the notion of fuzzy ideal,fuzzy weak ideal,fuzzy weakly prime left ideal and fuzzy prime left ideal system of a near-subtraction semigroup. We characterize fuzzy weak ideal and fuzzy ideal of a near-subtraction semigroup X through weak ideal and ideal of X respectively. We have shown that a fuzzy left ideal μ of a nearsubtraction semigroup X is a fuzzy weakly prime l...
Introduction. It is notoriously difficult to deduce anything about the structure of an ideal or scheme by directly examining its defining polynomials. A notable exception is that of monomial ideals. Combined with techniques for making fiat degenerations of arbitrary ideals into monomial ideals (typically, using Gr6bner bases), the theory of monomial ideals becomes a useful tool for studying gen...
In this paper, we introduce the hyper-star graph HS(n, k) as a new interconnection network, and discuss its properties such as faulttolerance, scalability, isomorphism, routing algorithm, and diameter. A hyper-star graph has merits when degree × diameter is used as a desirable quality measure of an interconnection network because it has a small degree and diameter. We also introduce a variation...
let s be a locally compact foundation semigroup with identity and be its semigroup algebra. let x be a weak*-closed left translation invariant subspace of in this paper, we prove that x is invariantly complemented in if and only if the left ideal of has a bounded approximate identity. we also prove that a foundation semigroup with identity s is left amenab...
Space filling curves provide several advantages for indexing spatial data. We look at the Z-curve ordering and discuss three algorithms for navigating and querying k-dimensional Z-curves. In k-dimensional space, a single hyper-’Z’-shape in a recursive Z-curve forms a hypercube with 2k quadrants. The first algorithm concerns efficient checking whether a given quadrant of a local hyper-’Z’ inters...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید