Related papers: Refined Transfer
The one dimensional wave equation serves as a basic model for imaging modalities such as seismic which utilize acoustic data reflected back from a layered medium. In 1955 Peterson et al. described a single scattering approximation for the…
We discuss some of the mathematical properties of the fractional derivative defined by means of Fourier transforms. We first consider its action on the set of test functions $\Sc(\mathbb R)$, and then we extend it to its dual set,…
In this brief, we discuss the implementation of a third order semi-implicit differentiator as a complement of the recent work by the author that proposes an interconnected semi-implicit Euler double differentiators algorithm through Taylor…
Deep Learning architectures, and in particular Transformers, are conventionally viewed as a composition of layers. These layers are actually often obtained as the sum of two contributions: a residual path that copies the input and the…
Neural machine translation (NMT) models generally adopt an encoder-decoder architecture for modeling the entire translation process. The encoder summarizes the representation of input sentence from scratch, which is potentially a problem if…
Higher twist corrections refer to a certain class of contributions to hard processes in strong interactions that are suppressed by a power of the hard scale. This is a very broad field of research which is becoming more and more important…
We investigate refinement in the context of choreographies. We introduce refinable global choreographies allowing for the underspecification of protocols, whose interactions can be refined into actual protocols. Arbitrary refinements may…
This article is motivated by the need for better understanding of refined Riemann-Roch theorems and the behavior of the determinant of the cohomology. This poses a certain problem of functoriality and can be understood as that of giving…
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. For instance, the algorithms have been applied successively to…
In this paper, we present a refined version of the (classical) Stein inequality for the Fourier transform, elevating it to a new level of accuracy. Furthermore, we establish extended analogues of a more precise version of the Stein…
Tensor transpose is a higher order generalization of matrix transpose. In this paper, we use permutations and symmetry group to define? the tensor transpose. Then we discuss the classification and composition of tensor transposes.…
We discuss the recently developed method of refined absorption and how it is used to provide a new proof of the Existence Conjecture for combinatorial designs. This method can also be applied to resolve open problems in extremal and…
Transfer learning (TL) from pretrained deep models is a standard practice in modern medical image classification (MIC). However, what levels of features to be reused are problem-dependent, and uniformly finetuning all layers of pretrained…
Given a unipotent bundle of smooth manifolds we construct its secondary transfer map and show that this map determines the higher smooth torsion of the bundle. This approach to higher torsion provides a new perspective on some of its…
Session types capture precise protocol structure in concurrent programming, but do not specify properties of the exchanged values beyond their basic type. Refinement types are a form of dependent types that can address this limitation,…
We generalize Wagoner's representation of the automorphism group of a two-sided subshifts of finite type as the fundamental group of a certain CW-complex to groupoids having a certain refinement structure. This significantly streamlines the…
Inversion theorems of Wiener type are essential tools in analysis and number theory. We derive a weighted version of an inversion theorem of Wiener type for general Dirichlet series from that of Edwards from 1957, and we outline an…
The Fourier coefficient of a second order Eisenstein series is described as a shifted convolution sum. This description is used to obtain the spectral decomposition of and estimates for the shifted convolution sum.
We established a new method called Discrete Weierstrass Fourier Transform, a faster and more generalized Discrete Fourier Transform, to approximate discrete data. The theory of this method as well as some experiments are analyzed in this…
We present a new type system combining refinement types and the expressiveness of intersection type discipline. The use of such features makes it possible to derive more precise types than in the original refinement system. We have been…