Refactoring is an essential approach toward improving the internal structure of a software system while preserving its external behavior. Traditional refactoring techniques have focused on the implementation stage, with source code as the primary artifact of the refactoring process. However, a recent trend is to apply the concepts of refactoring to higher levels of abstraction. Consequently, mo...

This paper aims to reveal the relationship between the minimum L2-sensitivity of state-space digital filters and the Gramian-preserving frequency transformation. To this end, we first give a prototype low-pass state-space filter in such a manner that its structure becomes the minimum L2-sensitivity structure. Then we apply the Gramian-preserving (LP-LP) frequency transformation with a tunable p...

The Compositional Interchange Format (CIF), is a modeling formalism for hybrid systems, that aims to establishing interoperability of a wide range of tools by means of model transformations to and from CIF. UPPAAL is a very successful tool for the specification and analysis of timed systems. It is interesting, both from a theoretical and a practical perspective, to be able to translate CIF mode...

Extraction Transformation Load plays an important phase in development of data warehouse due its complexity of selecting data from different location and having different structures. The recent industry of data warehouse is driven by Privacy Preserving Data Mining which ensures privacy of sensitive information during Mining and is a requirement of most Data Bases. Current approaches to modellin...

We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid {M ∈ N | det M = ±1} = {M ∈ N | MEM = ±E}, where E = ( 0 1 −1 0 ). We prove that in case of exchange of t...

In this paper, we give a characterization of strongly Jordan zero-product preserving maps on normed algebras as a generalization of  Jordan zero-product preserving maps. In this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly Jordan zero-product preserving maps are completely different. Also, we prove that the direct p...