We define a transformation of models of additivefree propositional linear logic, closely related to de Paiva’s dialectica categories, but with a modified exponential based on Oliva’s dialectica interpretation of higher-order linear logic. As a result of this modification we obtain an elegant factorisation of dialectica models as linear-nonlinear adjunctions. From the point of view of game seman...

Previously, we introduced a duality transformation for Euler G– Frobenius algebras. Using this transformation, we prove that the simple A,D,E singularities and Pham singularities of coprime powers are mirror self– dual where the mirror duality is implemented by orbifolding with respect to the symmetry group generated by the grading operator and dualizing. We furthermore calculate orbifolds and ...

Bužek and Hillery proposed a universal quantum-copying machine (UQCM) (i.e., transformation) to analyze the possibility of cloning arbitrary states. The UQCM copies quantum-mechanical states with the quality of its output does not depend on the input. We propose a slightly different transformation to analyze a restricted set of input states. We impose the conditions (I) the density matrices of ...

In this paper, an efficient algorithm of logarithmic transformation to Hirota bilinear form of the KdV-type bilinear equation is established. In the algorithm, some properties of Hirota operator and logarithmic transformation are successfully applied, which helps to prove that the linear terms of the nonlinear partial differential equation play a crucial role in finding the Hirota bilinear form...

This note presents a trivial transformation that can eliminate many calls of the concatenate (or “append”) operator from a program. The general form of the transformation is well known, and one of the examples, transforming the reverse function, is a classic. However, so far as I am aware, this style of transformation has not previously been systematised in the way done here. The transformation...

Application scenarios such as legacy-data migration, ETL processes, data cleaning and data-integration require the transformation of input tuples into output tuples. Traditional approaches for implementing these data transformations enclose solutions as Persistent Stored Modules (PSM) executed by an RDBMS or transformation code using a commercial ETL tool. Neither of these solutions is easily m...

The Hamiltonian model of quantum error correction code in the literature is often constructed with the help of its stabilizer formalism. But there have been many known examples of nonadditive codes which are beyond the standard quantum error correction theory using the stabilizer formalism. In this paper, we suggest the other type of Hamiltonian formalism for quantum error correction code witho...

The success postulate of classic belief revision theory demands that after revising some beliefs with by information the new information is believed. However, this form of prioritized belief revision is not apt under many circumstances. Research in non-prioritized belief revision investigates forms of belief revision where success is not a desirable property. Herein, selective revision uses a t...

Linear optical networks are devices that turn classical incident modes by a linear transformation into outgoing ones. In general, the quantum version of such transformations may mix annihilation and creation operators. We derive a simple formula for an effective Hamiltonian generating the scattering operator of a general linear quantum network. Our formula shows how to compute the effective Ham...

In query-by-semantic-example image retrieval, images are ranked by similarity of semantic descriptors. These descriptors are obtained by classifying each image with respect to a pre-defined vocabulary of semantic concepts. In this work, we consider the problem of improving the accuracy of semantic descriptors through cross-modal regularization, based on auxiliary text. A cross-modal regularizer...