Abstract We provide necessary conditions on Euclidean domains for inclusions $$W^{1,p(\cdot )}(\Omega ) \hookrightarrow L^{q(\cdot $$ W 1 , p ( · ) Ω <mml:mo...

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

Quantum circuits for basic mathematical functions such as the square root are required to implement scientific computing algorithms on quantum computers. Quantum circuits that are based on Clifford+T gates can be made fault tolerant in nature but the T gate is very costly to implement. As a result. reducing T-count has become an important optimization goal. Further, quantum circuits with many q...

Gaussian traffic models are capable of representing a broad variety of correlation structures, ranging from short-range dependent (e.g. Ornstein-Uhlenbeck type) to long-range dependent (e.g. fractional Brownian motion, with Hurst parameter H exceeding 1/2). This note focuses on queues fed by a large number (n) of Gaussian sources, emptied at constant service rate nc. In particular, we consider ...

‎in [u‎. ‎dempwolff‎, ‎on extensions of elementary abelian groups of order $2^{5}$ by $gl(5,2)$‎, ‎textit{rend‎. ‎sem‎. ‎mat‎. ‎univ‎. ‎padova}‎, ‎textbf{48} (1972)‎, ‎359‎ - ‎364.] dempwolff proved the existence of a group of the‎ ‎form $2^{5}{^{cdot}}gl(5,2)$ (a non split extension of the‎ ‎elementary abelian group $2^{5}$ by the general linear group‎ ‎$gl(5,2)$)‎. ‎this group is the second l...

Link reversal algorithms provide a simple mechanism for routing in communication networks whose topology is frequently changing, such as in mobile ad hoc networks. A link reversal algorithm routes by imposing a direction on each network link such that the resulting graph is a destination oriented DAG. Whenever a node loses routes to the destination, it reacts by reversing some (or all) of its i...