نتایج جستجو برای: ideal multi

تعداد نتایج: 546705  

Journal: :journal of algebra and related topics 0
i. akray soran university

in this paper, we introduce a new generalization of weakly prime ideals called $i$-prime. suppose $r$ is a commutative ring with identity and $i$ a fixed ideal of $r$. a proper ideal $p$ of $r$ is $i$-prime if for $a, b in r$ with $ab in p-ip$ implies either $a in p$ or $b in p$. we give some characterizations of $i$-prime ideals and study some of its properties.  moreover, we give conditions  ...

2008
Thomas Lochmatter Alcherio Martinoli

We investigate the performance of three bio-inspired odor source localization algorithms used in non-cooperating multi-robot systems. Our performance metric is the distance overhead of the first robot to reach the source, which is a good measure for the speed of an odor source localization algorithm. Using the performance distribution of single-robot experiments, we calculate an ideal performan...

2018
KAILIANG WU CHI-WANG SHU

The density and pressure are positive physical quantities in magnetohydrodynamics (MHD). Design of provably positivity-preserving (PP) numerical schemes for ideal compressible MHD is highly desired, but remains a challenge especially in the multi-dimensional cases. In this paper, we develop uniformly high-order discontinuous Galerkin (DG) schemes which provably preserve the positivity of densit...

2013
Daniela I. Borissova Ivan C. Mustakerov

The paper describes an approach for defining of k-best night vision devices based on multi-criteria mixed-integer optimization modeling. The parameters of night vision devices are considered as criteria that have to be optimized. Using different user preferences for the relative importance between parameters different choice of k-best devices can be defined. An ideal device with all of its para...

2008
George M. Bergman G. M. Bergman

For P a poset or lattice, let Id(P ) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P ) = Id(P )−{∅}. This note obtains various results to the effect that Id(P ) is always, and id(P ) often, “essentially larger” than P. In the first vein, we find that a poset P admits no <-respecting map (and so in particular, no one-to-one isotone...

1975
RALPH FREESE

This paper shows that any compactly generated lattice is a subdirect product of subdirectly irreducible lattices which are complete and upper continuous. An example of a compactly generated lattice which cannot be subdirectly decomposed into subdirectly irreducible compactly generated lattices is given. In the case of an ideal lattice of a lattice L, the decomposition into subdirectly irreducib...

2013
HUANG SHOU - JIA

In view of multi-attribute decision-making problems with interval numbers in social economy and engineering system, this paper defines and analyzes the basic operational rule, normalized method, sequence comparison strategy, and the calculating formula for the distance of interval numbers and interval number sequence. It presents weighted TOPSIS decision-making model based on interval numbers o...

2007
Hoshang Heydari

We establish a relation between topological and quantum entanglement for a multi-qubit state by considering the unitary representations of the Artin braid group. We construct topological operators that can entangle multi-qubit state. In particular we construct operators that create quantum entanglement for multi-qubit states based on the Segre ideal of complex multi-projective space. We also in...

2007
Laurent Bonnasse-Gahot Jean-Pierre Nadal

Exploiting the analogy between exemplar models and population coding schemes, we characterize, by means of information theoretic tools, the efficiency of a large but finite population of cells coding for a discrete set of categories (e.g. vowels). The optimal code is shown to typically allocate more cells to class boundaries than to regions further apart. We then discuss the predicted perceptua...

Journal: :Des. Codes Cryptography 2014
Soon Sheng Ong Frédérique E. Oggier

We consider the problem of designing reliable and confidential lattice codes, known as wiretap lattice codes, for fast fading channels. We identify as code design criterion for finite lattice constellations a finite sum of inverse of algebraic norms, in fact the analogous for finite sums of the known criterion for infinite constellations, which motivates us to study totally real number fields w...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید