A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Transformation ordering
[chapter]
1987
Lecture Notes in Computer Science
Preserved Fulltext
A transformation ordering is defined using two relations: a relation which transforms terms and a relation which ensures the well-foundedness of the ordering. ...
A B S T R A C T We define an ordering called transformation ordering which is useful for proving termination of rewriting systems. ...
Introduction We describe an ordering called transformation ordering for proving termination of rewriting systems. Let ¢ be a transformation, i.e. a mapping of terms onto terms. ...
doi:10.1007/3-540-17660-8_48
fatcat:4bz2brdpzvdrlftjgugezf2xni
Higher Order Context Transformations
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The higher order contexts are exploited using recursive form of a generalized context transformation. ...
The context transformation and generalized context transformation methods, we introduced recently, were able to reduce zero order entropy by exchanging digrams, and as a consequence, they were removing ...
space of generalized context transformations, is only of order |Σ| 2 . ...
arXiv:1701.01326v1
fatcat:b6zkbmsfnvg73nn6wbnypecw7m
Higher Order Linear Transformer
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
and extended to a second-order approximation of the softmax normalization. ...
Following up on the linear transformer part of the article from Katharopoulos et al., that takes this idea from Shen et al., the trick that produces a linear complexity for the attention mechanism is re-used ...
This initiates the singularity that will transform the world as we know it and therefore should be used with care. ...
arXiv:2010.14816v1
fatcat:a546bupxdve7hjle4vxqprwyli
On Cremona transformations of prime order
[article]
2004
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Every transformation of prime order ≥ 7 is conjugate to a linear automorphism. ...
Thus π is the de Jonquières transformation of order 3, a classical instance of birational transformation of P 2 (see e.g. [S-R], VII, 7.2). ...
arXiv:math/0402037v4
fatcat:36xxjorgxrbafl7y2jd53huhey
Right-orderable deck transformation groups
1976
Rocky Mountain Journal of Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
RIGHT-ORDERABLE DECK TRANSFORMATION GROUPS F. THOMAS FARRELL 0. Introduction. ...
Use G to denote n l (B, fo 0 )/p#^i ( E > e o)-Th en we identify G with the group of deck transformations as follows. Let T be a deck transformation and choose a path a from e 0 to T(e 0 ). ...
doi:10.1216/rmj-1976-6-3-441
fatcat:2gwwkcf4mzc25eud5hygubepx4
Stability of Order Preserving Transforms
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show that transforms that satisfy conditions which are weaker than order preserving transforms, are essentially close to the order preserving transforms on the mentioned structures. ...
The purpose of this paper is to show stability of order preserving/reversing transforms on the class of non-negative convex functions in R^n, and its subclass, the class of non-negative convex functions ...
We would like to show that order preserving transforms are stable, i.e. almost order preserving transforms are, in some sense, close to the order preserving transforms discussed above. ...
arXiv:1510.03914v1
fatcat:zmqgmdjw7nhapit6ybxipzyowi
Natural-ordered complex Hadamard transform
2010
Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In fact, it is shown that NCHT is a natural-ordered version of complex Hadamard transform whereas SCHT shows the sequency ordering. ...
This paper presents a new transform known as natural-ordered complex Hadamard transform (NCHT) which is derived from the Walsh-Hadamard transform (WHT) through the direct block matrix operation. ...
It is a natural-ordered version of complex Hadamard matrix while SCHT is a complex Hadamard transform with sequency ordering. ...
doi:10.1016/j.sigpro.2009.09.007
fatcat:k2s22uik5za6ph2oos2jtxeh2e
Progressive imaging: S-transform order
2004
ANZIAM Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The paper focuses on progressive transmission of ct or mr images, and introduces two general schemes that are built around information embedded in transforms of images. ...
A direct, a priori ordering of 93, parallel, ct slices of a head is obtained by successively finer sweepings of their natural subscript ordering to give a benchmark illustration. ...
Progressive imaging: Transform space ordering The general process of progressive transmission of images will first be illustrated using a simple "binary sweeping", a priori ordering scheme with a test ...
doi:10.21914/anziamj.v45i0.937
fatcat:m7qzdj7xh5ephl26dc5uwottdm
First-order definable string transformations
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we establish a transducer-logic correspondence for Courcelle's first-order definable string transformations. ...
By putting an aperiodicity restriction on the transition monoids, we define a class of streaming string transducers that captures exactly the class of first-order definable transformations. ...
Aperiodic String Transducers
First-order logic definable Transformations Courcelle [11] initiated the study of structure transformations using monadic second-order logic. ...
arXiv:1406.7824v1
fatcat:wfmenkcc4zfhjgs7s4p6cwm34q
KINETICS OF ORDER-DISORDER TRANSFORMATIONS
1977
Le Journal de Physique Colloques
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
-The order-disorder transformation in alloys is one of the simplest and best understood phase transitions. ...
To investigate the kinetics of order-disorder transformation based on a realistic model of binary alloys. 2. ...
doi:10.1051/jphyscol:1977769
fatcat:symefxyj2vb4zfhmgywk7gjtnm
A Higher Order Unscented Transform
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, introduce the higher order unscented transform (HOUT) which also matches any given skewness and kurtosis tensors. ...
The classical scaled unscented transform (SUT) matches the mean and covariance of a distribution. ...
Higher Order Unscented Transform. ...
arXiv:2006.13429v1
fatcat:xuqbadvc4rbivery2odrnai2uy
Transformers for Limit Order Books
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We introduce a new deep learning architecture for predicting price movements from limit order books. ...
The bid-side consists of buy orders and the ask-side consists of sell orders both containing price and volume for each order. ...
Experiments A limit order book (LOB) at time t is the set of all active orders in a market at time t. These orders consist of two sides; the bid-side and the ask-side. ...
arXiv:2003.00130v1
fatcat:4itahunojza3npoebh5osgyu7y
Partial Orders on Transformation Semigroups
2003
Monatshefte für Mathematik (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we extend that work to the semigroup P (X) of all partial transformations of X, compare ≤ with another 'natural' partial order on P (X), characterise the meet and join of these two orders ...
In 1986, Kowol and Mitsch studied properties of the so-called 'natural partial order' ≤ on T (X), the total transformation semigroup defined on a set X. ...
Compatible partial orders We say S is a transformation semigroup if it is a subsemigroup of P (X). ...
doi:10.1007/s00605-002-0546-4
fatcat:n3s2t6crcbay3htznelfrki3de
Binary block order Rouen Transform
2016
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
., Binary block order Rouen transform, Theoret. Comput. Sci. (2016), http://dx. ...
The original method by Burrows and Wheeler [BW94] is based on lexicographic order for general alphabets, and the transform is defined to be the last column of the ordered BWT matrix. ...
other new binary transforms to be defined using these orders for the BWT matrices. ...
doi:10.1016/j.tcs.2016.05.028
fatcat:pmagvgr6d5avvhedzlci3nvbqq
Regular order-preserving transformation semigroups
2000
Bulletin of the Australian Mathematical Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The semigroup OT(X) of all order-preserving total transformations of a finite chain X is known to be regular. ...
We also consider the corresponding idea for partial transformations of arbitrary chains and posets. ...
ORDER-PRESERVING TRANSFORMATIONS OF NON-CHAINS ...
doi:10.1017/s000497270001902x
fatcat:wcqwtr4plvcnrnihtxdq3ozmda
« Previous
Showing results 1 — 15 out of 5,605,211 results