Bu ara?t?rmada, ilkokullarda çal??an s?n?f ö?retmenlerinin “tecrübe ettikleri” ve “idealde” okulda e?itim olgusuna yönelik görü?lerinin ortaya ç?kar?lmas? amaçlanm??t?r. Ara?t?rma Osmaniye Merkez ilçesindeki 10 ilkokulda görev yapan 174 ö?retmeniyle gerçekle?tirilmi?tir. Ö?retmenlerin tecrübe edilen idealde e?itime görü?lerini zihinsel alg?lar olan metaforlar yoluyla ç?karmak amac?yla veriler, ...

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  ...

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...

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...

Let R be a commutative ring with identity. Let φ : I(R) → I(R) ∪ {∅} be a function where I(R) denotes the set of all ideals of R. A proper ideal Q of R is called φ-primary if whenever a, b ∈ R, ab ∈ Q−φ(Q) implies that either a ∈ Q or b ∈ √ Q. So if we take φ∅(Q) = ∅ (resp., φ0(Q) = 0), a φ-primary ideal is primary (resp., weakly primary). In this paper we study the properties of several genera...

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...

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...