It is known that LOG – EXP transform based image compression algorithm proposed by S.C.Huang, L.G.Chen and H.C.Chang offers high Compression Ratio (CR) and high image quality compared to JPEG for any specified value of Peak-Signal to Noise Ratio (PSNR). In this paper, a modified LOG – EXP transform based image compression algorithm obtained by using arithmetic coding in the place of Huffman cod...

For non-monotonic reasoning, explicit orderings over formulae offer an important solution to problems such as ‘multiple extensions’. However, a criticism of such a solution is that it is not clear, in general, from where the orderings should be obtained. Here we show how orderings can be derived from statistical information about the domain which the formulae cover. For this we provide an overv...

In this paper, we generalize a result by Berman and Billig on weight modules over Lie algebras with polynomial multiplication. More precisely, we show that a highest weight module with an exp-polynomial “highest weight” has finite dimensional weight spaces. We also get a class of irreducible weight modules with finite dimensional weight spaces over generalized Virasoro algebras which do not occ...

We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean gameG determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean circuit games in [1]. 1 Preliminaries We will be using the encoding of [2] to replicate the proof of [1]. A familiarity with [2] will make the proof much easier t...

These notes give a brief and basic introduction to some central aspects concerning transformations and symmetries in quantum mechanics. Examples discussed include translations in space and time, as well as rotations. Translations in space are also called spatial translations, and sometimes even just " translations " for short, with " spatial " left implicit. To introduce the concept, let us con...

We show that if $$N \geq {\rm exp}({\rm exp} (k^{O(1)})))$$ , then any k-colouring of the primes are less than N contains a monochromatic solution to $$p_1 - p_2 = p_3 -1$$ .

It is shown that, with respect to a random oracle, EXP \ P=poly and EXP ? P=poly do not have resource-bounded measure zero in EXP:

Abstract Let $X \subset \mathbb{C}^{n}$ be an algebraic variety, and let $\Lambda a discrete subgroup whose real complex spans agree. We describe the topological closure of image $X$ in $\mathbb{C}^{n} / \Lambda $, thereby extending result Peterzil–Starchenko case when $ is cocompact. also obtain similar extension $X\subset \mathbb{R}^{n}$ definable o-minimal structure with no restrictions on a...

Every model of I∆0 is the tally part of a model of the stringlanguage theory Th-FO (a main feature of which consists in having induction on notation restricted to certain AC sets). We show how to “smoothly” introduce in Th-FO the binary length function, whereby it is possible to make exponential assumptions in models of Th-FO. These considerations entail that every model of I∆0 + ¬exp is a prop...