Super-WZNW with reductions to supersymmetric and fermionic integrable models

A systematic construction for an action describing a class of supersymmetric integrable models as well as for pure fermionic theories is discussed in terms of the gauged WZNW model associated to half integer graded affine Kac-Moody algebras. Explicit examples of the N = 1. 2 super-sinh(sine)-Gordon models are discussed in detail. Pure fermionic theories arises for cosets sl(p, 1)/sl(p) circle times u(1) when a maximal kernel condition is fulfilled. The integrability condition for such models is discussed and it is shown that the simplest example when p = 2 (cads to the constrained Bukhvostov-Lipatov, Thirring, scalar massive and pseudo-scalar massless Gross-Neveu models. (C) 2009 Published by Elsevier B.V.

Generalized Perk-Schultz models: solutions of the Yang-Baxter equation associated with quantized orthosymplectic superalgebras

The Perk-Schultz model may be expressed in terms of the solution of the Yang-Baxter equation associated with the fundamental representation of the untwisted affine extension of the general linear quantum superalgebra U-q (gl(m/n)], with a multiparametric coproduct action as given by Reshetikhin. Here, we present analogous explicit expressions for solutions of the Yang-Baxter equation associated with the fundamental representations of the twisted and untwisted affine extensions of the orthosymplectic quantum superalgebras U-q[osp(m/n)]. In this manner, we obtain generalizations of the Perk-Schultz model.

Supersymmetry of Affine Toda Models as Fermionic Symmetry Flows of the Extended mKdV Hierarchy

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Tau-functions and dressing transformations for zero-curvature affine integrable equations

The solutions of a large class of hierarchies of zero-curvature equations that includes Toda- and KdV-type hierarchies are investigated. All these hierarchies are constructed from affine (twisted or untwisted) Kac-Moody algebras g. Their common feature is that they have some special vacuum solutions corresponding to Lax operators lying in some Abelian (up to the central term) subalgebra of g; in some interesting cases such subalgebras are of the Heisenberg type. Using the dressing transformation method, the solutions in the orbit of those vacuum solutions are constructed in a uniform way. Then, the generalized tau-functions for those hierarchies are defined as an alternative set of variables corresponding to certain matrix elements evaluated in the integrable highest-weight representations of g. Such definition of tau-functions applies for any level of the representation, and it is independent of its realization (vertex operator or not). The particular important cases of generalized mKdV and KdV hierarchies as well as the Abelian and non-Abelian affine Toda theories are discussed in detail. © 1997 American Institute of Physics.

Gaiotto duality for the twisted A(2N-1) series

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Some twisted results

The Drinfeld twist for the opposite quasi-Hopf algebra, H-COP, is determined and is shown to be related to the (second) Drinfeld twist on a quasi-Hopf algebra. The twisted form of the Drinfeld twist is investigated. In the quasi-triangular case, it is shown that the Drinfeld u-operator arises from the equivalence of H-COP to the quasi-Hopf algebra induced by twisting H with the R-matrix. The Altschuler-Coste u-operator arises in a similar way and is shown to be closely related to the Drinfeld u-operator. The quasi-cocycle condition is introduced and is shown to play a central role in the uniqueness of twisted structures on quasi-Hopf algebras. A generalization of the dynamical quantum Yang-Baxter equation, called the quasi-dynamical quantum Yang-Baxter equation, is introduced.

Twisted Edwards curves revisited

This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a wide range of applications. Notably, the new addition algorithm uses for suitably selected curve constants. In comparison, the fastest point addition algorithms for (twisted) Edwards curves stated in the literature use . It is also shown that the new addition algorithm can be implemented with four processors dropping the effective cost to . This implies an effective speed increase by the full factor of 4 over the sequential case. Our results allow faster implementation of elliptic curve scalar multiplication. In addition, the new point addition algorithm can be used to provide a natural protection from side channel attacks based on simple power analysis (SPA).

Elliptic curves, group law, and efficient computation

This thesis is about the derivation of the addition law on an arbitrary elliptic curve and efficiently adding points on this elliptic curve using the derived addition law. The outcomes of this research guarantee practical speedups in higher level operations which depend on point additions. In particular, the contributions immediately find applications in cryptology. Mastered by the 19th century mathematicians, the study of the theory of elliptic curves has been active for decades. Elliptic curves over finite fields made their way into public key cryptography in late 1980’s with independent proposals by Miller [Mil86] and Koblitz [Kob87]. Elliptic Curve Cryptography (ECC), following Miller’s and Koblitz’s proposals, employs the group of rational points on an elliptic curve in building discrete logarithm based public key cryptosystems. Starting from late 1990’s, the emergence of the ECC market has boosted the research in computational aspects of elliptic curves. This thesis falls into this same area of research where the main aim is to speed up the additions of rational points on an arbitrary elliptic curve (over a field of large characteristic). The outcomes of this work can be used to speed up applications which are based on elliptic curves, including cryptographic applications in ECC. The aforementioned goals of this thesis are achieved in five main steps. As the first step, this thesis brings together several algebraic tools in order to derive the unique group law of an elliptic curve. This step also includes an investigation of recent computer algebra packages relating to their capabilities. Although the group law is unique, its evaluation can be performed using abundant (in fact infinitely many) formulae. As the second step, this thesis progresses the finding of the best formulae for efficient addition of points. In the third step, the group law is stated explicitly by handling all possible summands. The fourth step presents the algorithms to be used for efficient point additions. In the fifth and final step, optimized software implementations of the proposed algorithms are presented in order to show that theoretical speedups of step four can be practically obtained. In each of the five steps, this thesis focuses on five forms of elliptic curves over finite fields of large characteristic. A list of these forms and their defining equations are given as follows: (a) Short Weierstrass form, y2 = x3 + ax + b, (b) Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1, (c) Twisted Hessian form, ax3 + y3 + 1 = dxy, (d) Twisted Edwards form, ax2 + y2 = 1 + dx2y2, (e) Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1, These forms are the most promising candidates for efficient computations and thus considered in this work. Nevertheless, the methods employed in this thesis are capable of handling arbitrary elliptic curves. From a high level point of view, the following outcomes are achieved in this thesis. - Related literature results are brought together and further revisited. For most of the cases several missed formulae, algorithms, and efficient point representations are discovered. - Analogies are made among all studied forms. For instance, it is shown that two sets of affine addition formulae are sufficient to cover all possible affine inputs as long as the output is also an affine point in any of these forms. In the literature, many special cases, especially interactions with points at infinity were omitted from discussion. This thesis handles all of the possibilities. - Several new point doubling/addition formulae and algorithms are introduced, which are more efficient than the existing alternatives in the literature. Most notably, the speed of extended Jacobi quartic, twisted Edwards, and Jacobi intersection forms are improved. New unified addition formulae are proposed for short Weierstrass form. New coordinate systems are studied for the first time. - An optimized implementation is developed using a combination of generic x86-64 assembly instructions and the plain C language. The practical advantages of the proposed algorithms are supported by computer experiments. - All formulae, presented in the body of this thesis, are checked for correctness using computer algebra scripts together with details on register allocations.

Speckle reduction in optical coherence tomography imaging by affine-motion image registration

Signal-degrading speckle is one factor that can reduce the quality of optical coherence tomography images. We demonstrate the use of a hierarchical model-based motion estimation processing scheme based on an affine-motion model to reduce speckle in optical coherence tomography imaging, by image registration and the averaging of multiple B-scans. The proposed technique is evaluated against other methods available in the literature. The results from a set of retinal images show the benefit of the proposed technique, which provides an improvement in signal-to-noise ratio of the square root of the number of averaged images, leading to clearer visual information in the averaged image. The benefits of the proposed technique are also explored in the case of ocular anterior segment imaging.

Hessian-based affine adaptation of salient local image features

Affine covariant local image features are a powerful tool for many applications, including matching and calibrating wide baseline images. Local feature extractors that use a saliency map to locate features require adaptation processes in order to extract affine covariant features. The most effective extractors make use of the second moment matrix (SMM) to iteratively estimate the affine shape of local image regions. This paper shows that the Hessian matrix can be used to estimate local affine shape in a similar fashion to the SMM. The Hessian matrix requires significantly less computation effort than the SMM, allowing more efficient affine adaptation. Experimental results indicate that using the Hessian matrix in conjunction with a feature extractor that selects features in regions with high second order gradients delivers equivalent quality correspondences in less than 17% of the processing time, compared to the same extractor using the SMM.

An exploration of affine group laws for elliptic curves

Several forms of elliptic curves are suggested for an efficient implementation of Elliptic Curve Cryptography. However, a complete description of the group law has not appeared in the literature for most popular forms. This paper presents group law in affine coordinates for three forms of elliptic curves. With the existence of the proposed affine group laws, stating the projective group law for each form becomes trivial. This work also describes an automated framework for studying elliptic curve group law, which is applied internally when preparing this work.

Performance assessment in a heat exchanger tube fitted with double counter twisted tape inserts

The present study explored the effects of the double counter twisted tapes on heat transfer and fluid friction characteristics in a heat exchanger tube. The double counter twisted tapes were used as counter-swirl flow generators in the test section. The experiments were performed with double counter twisted tapes of four different twist ratios (y = 1.95, 3.85, 5.92 and 7.75) using air as the testing fluid in a circular tube turbulent flow regime where the Reynolds number was varied from 6950 to 50,050. The experimental results demonstrated that the Nusselt number, friction factor and thermal enhancement efficiency were increased with decreasing twist ratio. The results also revealed that the heat transfer rate in the tube fitted with double counter twisted tape was significantly increased with corresponding increase in pressure drop. In the range of the present work, heat transfer rate and friction factor were obtained to be around 60 to 240% and 91 to 286% higher than those of the plain tube values, respectively. The maximum thermal enhancement efficiency of 1.34 was achieved by the use of double counter twisted tapes at constant blower power. In addition, the empirical correlations for the Nusselt number, friction factor and thermal enhancement efficiency were also developed, based on the experimental data.

A polarized, twisted, ethylene: structure of methyl 2-(1,3-dimethyl-2-imidazolidinylidene)-3-oxobutyrate dihydrate, C10H16N2O3.2H2O

Mr = 248, monoclinic, P21/n, a = 12.028 (2), b=7.168(2), c= 15.187(5)A, fl=91.88(2) °, Z= 4, V= 1308.6,~3, Din= 1.26, Dx= 1.263 Mgm -3, 2 (Cu Ka) = 1.5418 .A, g = 0.86 mm -1, F(000) = 536, T= 293 K. Final R = 5.6% for 2120 observed reflexions. Owing to the push-pull effect, the C=C bond distance is as long as 1.464 (2)/k with the twist angle about the bond 62.6.