Color transformations are frequently embodied in look-up tables (LUTs) whose content is the result of computation performed on the basis of color measurements. Noise in color measurements and device output gives LUTs that result in lack of smoothness in color transitions. Smoothing of color LUTs is therefore typically performed, often with a significant loss of accuracy. This paper proposes a m...

Despite its benefit in a wide range of applications, data mining techniques also have raised a number of ethical issues. Some such issues include those of privacy, data security, intellectual property rights, and many others. In this paper, we address the privacy problem against unauthorized secondary use of information. To do so, we introduce a family of geometric data transformation methods (...

We present an algorithm for the decomposition of processes in a process algebraic framework. Decomposition, or the refinement of process substructure, is an important design principle in the top-down development of concurrent systems. In the approach that we follow the decomposition is based on a given partition of the actions of a system specification, such that for each partition class a subp...

We study the centraliser of locally compact group extensions of er-godic probability preserving transformations. New methods establishing ergodicity of group extensions are introduced, and new examples of squashable and non-coalescent group extensions are constructed. Smooth versions of some of the constructions are also given. §0 Introduction Let T be an ergodic probability preserving transfor...

The Fibonacci-to-Galois transformation is useful for reducing the propagation delay of feedback shift register-based stream ciphers and hash functions. In this paper, we extend it to handle Galois-to-Galois case as well as feedforward connections. This makes possible transforming Trivium stream cipher and increasing its keystream data rate by 27% without any penalty in area. The presented trans...

Transformation of data with any data model is an important activity to the database community. Specially in peer to peer(P2P) system, data transformation between two peers is a necessary task when data management is an issue. With the advent of XML as an widely used and adopted data representation and exchange format over the web, transformation of data in XML P2P systems is getting much intere...

Abstract A transformation of an ordered set M is isotone mapping into . By a representation semigroup S by transformations we mean homomorphism the , i.e. (since semigroup) from preserving operations. We prove that this type leads to “action” on and so introduce notion left operand over Also notions operator pseudoorder between operands show concept pseudoorders plays important role in study ho...

1. Introduction. In an earlier paper(2) by one of us, referred to hereafter as A.P.T., arc-preserving transformations were defined and studied in connection with an irreducibility condition on the transformation. It was shown, for example, that if A and B are compact locally connected metric continua which are cyclic (that is, without cut points) any single valued continuous arc-preserving and ...

The sequential circuit designed was Look-Ahead Transformation based LFSR in which a hardware complexity was present and it may limit their employ in many applications. The design of efficient LFSR for BCH encoder using TePLAT (Term Preserving Look-Ahead Transformation) overcame this limitation by opening the employ of minimizing the iteration bound and hardware complexity in wide range of appli...