This paper presents an extension of the Tatoo compiler compiler that supports separate compilation of formal grammars. It allows the developer to define reusable libraries of grammars such as those of arithmetic expressions or of classical control operators. The aim of this feature is to simplify the development of domain specific languages especially for non specialists in grammar writing.

PIC is an interpretative command language which can be applied to digitized images. l t includes the major operations in the field of image processing. Today it is a collection of more than 90 commands for dataset management, Storage, simple image manipulation, histogram modification, gradient Operators, smoothing algorithms, fourier functions, arithmetic and Boolean operations and display

Three new theorems based on the generalized Carleson operators for the periodic Walsh-type wavelet packets have been established. An application of these theorems as convergence a.e. for the periodic Walsh-type wavelet packet expansion of block function with the help of summation by arithmetic means has been studied.

In this paper we present a new method for proving the existence of an eigenvalue below the essential spectrum for Sturm-Liouville operators with coefficients which are L1 perturbations of periodic functions. This method combines operator theory and “standard” numerical analysis with interval arithmetic analysis. We illustrate the method by showing that the SturmLiouville problem (SLP) consistin...

This paper presents an extension of the Tatoo compiler compiler that supports separate compilation and dynamic linking of formal grammars. It allows the developer to define reusable libraries of grammars such as those of arithmetic expressions or of classical control operators. The aim of this feature is to simplify the development of domain specific languages especially for non specialists in ...

in this paper, we determine the structure of the space of multipliers of the range of a composition operator cφ that induces by the conditional expectation between two lp() spaces.

Several systematic design approaches are known to be representatives of the techniques well adapted for testing sequential circuits (partial and full scan, LSSD ...). However in some cases, like for the test of on-line operators, ad-hoc DFT (design for testability) schemes become more suitable. Indeed, on-line arithmetic are used for high precision numbers resulting on high length operators. Th...

Floating-point arithmetic precision is limited in length the IEEE single (respectively double) precision format is 32-bit (respectively 64-bit) long. Extended precision formats can be up to 128-bit long. However some problems require a longer floating-point format, because of round-off errors. Such problems are usually solved in arbitrary precision, but round-off errors still occur and must be ...

We study the reverse mathematics of the principle stating that, for every property of finite character, every set has a maximal subset satisfying the property. In the context of set theory, this variant of Tukey’s lemma is equivalent to the axiom of choice. We study its behavior in the context of second-order arithmetic, where it applies to sets of natural numbers only, and give a full characte...