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

Pregnancy and delivery is one of the main causes in the female body weight alteration, especially with obesity. This alteration in body weight has a significant effect not only for a femine beauty standpoint, but also for more important reproductive functions in postpartum. For the actual condition of the maternal body weight alteration and its clinical significance, we made the various analysi...

Consider a system of linear algebraic equations with a nonsingular n by n matrix A. When solving this system with GMRES, the relative residual norm at the step k is bounded from above by the so called ideal GMRES approximation. This bound is sharp (it is attainable by the relative GMRES residual norm) in case of a normal matrix A, but it need not characterize the worstcase GMRES behavior if A i...

Let $A$ be a Noetherian ring, $I$ be an ideal of $A$ and $sigma$ be a semi-prime operation, different from the identity map on the set of all ideals of $A$. Results of Essan proved that the sets of associated prime ideals of $sigma(I^n)$, which denoted by $Ass(A/sigma(I^n))$, stabilize to $A_{sigma}(I)$. We give some properties of the sets $S^{sigma}_{n}(I)=Ass(A/sigma(I^n))setminus A_{sigma}(I...

We solve two open problems concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a left ideal or a suffix-closed language with n left quotients (that is, with state complexity n) is at most n n−1 + n − 1, and that of a two-sided ideal or a factor-closed language is at most n n−2 + (n − 2)2 n−2 + 1. Since these bounds are known to be reachable, this settles...

let $r$ be a commutative ring. the purpose of this article is to introduce a new class of ideals of r called weakly irreducible ideals. this class could be a generalization of the families quasi-primary ideals and strongly irreducible ideals. the relationships between the notions primary, quasi-primary, weakly irreducible, strongly irreducible and irreducible ideals, in different rings, has bee...

We prove the following result: Theorem. Every algebraic distributive lattice D with at most א1 compact elements is isomorphic to the ideal lattice of a von Neumann regular ring R. (By earlier results of the author, the א1 bound is optimal.) Therefore, D is also isomorphic to the congruence lattice of a sectionally complemented modular lattice L, namely, the principal right ideal lattice of R. F...

Authors who report ground reaction force (GRF), free moment (FM), and resultant joint moments usually normalize these variables by division normalization. Normalization parameters include body weight (BW), body weight x height (BWH), and body weight x leg length (BWL). The purpose of this study was to explore the appropriateness of division normalization, power curve normalization, and offset n...

in this paper, we define the notions of ultra and involution ideals in $bck$-algebras. then we get the relation among them and other ideals as (positive) implicative, associative, commutative and prime ideals. specially, we show that in a bounded implicative $bck$-algebra, any involution ideal is a positive implicative ideal and in a bounded positive implicative lower $bck$-semilattice, the not...