Subset Warping: Rubber Sheeting with Cuts

Image warping, often referred to as "rubber sheeting" represents the deformation of a domain image space into a range image space. In this paper, a technique is described which extends the definition of a rubber-sheet transformation to allow a polygonal region to be warped into one or more subsets of itself, where the subsets may be multiply connected. To do this, it constructs a set of "slits" in the domain image, which correspond to discontinuities in the range image, using a technique based on generalized Voronoi diagrams. The concept of medial axis is extended to describe inner and outer medial contours of a polygon. Polygonal regions are decomposed into annular subregions, and path homotopies are introduced to describe the annular subregions. These constructions motivate the definition of a ladder, which guides the construction of grid point pairs necessary to effect the warp itself

Charm-pair Rescattering Mechanism for Charmonium Production in High-energy Collisions

A new mechanism for heavy quarkonium production in high-energy collisions called the "s-channel cut" was proposed in 2005 by Lansberg, Cudell, and Kalinovsky. We identify this mechanism physically as the production of a heavy quark and anti-quark that are on-shell followed by their rescattering to produce heavy quarkonium. We point out that in the NRQCD factorization formalism this rescattering mechanism is a contribution to the color-singlet model term at next-to-next-to-leading order in perturbation theory. Its leading contribution to the production rate can be calculated without introducing any additional phenomenological parameters. We calculate the charm-pair rescattering (or s-channel cut) contribution to the production of J/psi at the Tevatron and compare it to estimates by Lansberg et al. using phenomenological models. This contribution competes with the leading-order term in the color-singlet model at large transverse momentum but is significantly smaller than the next-to-leading-order term. We conclude that charm-pair rescattering is not a dominant mechanism for charmonium production in high-energy collisions.Comment: 12 pages, 10 figure

Gluon fragmentation into quarkonium at next-to-leading order using FKS subtraction

We present the calculation at next-to-leading order (NLO) in alpha_s of the fragmentation function of a gluon into heavy quarkonium in the color-octet spin-singlet S-wave channel. To calculate the real NLO corrections, we adapt a subtraction scheme introduced by Frixione, Kunszt, and Signer. Ultraviolet and infrared divergences in the real NLO corrections are calculated analytically by evaluating the phase-space integrals of the subtraction terms using dimensional regularization. The subtracted phase-space integrals are then evaluated in 4 space-time dimensions. The divergences in the virtual NLO corrections are also calculated analytically. After renormalization, all the divergences cancel. The NLO corrections significantly increase the fragmentation probability for a gluon into the spin-singlet quarkonium states eta_c and eta_b.Comment: 52 pages, 6 figure

TWO METHODS TO GENERATE CENTERED DISTRIBUTIONS CONTROLLING SKEWNESS AND KURTOSIS COEFFICIENTS

Whatever the econometric model which we study; any simulation requires a perfectly definite DGP. Thus, even if all software can generate standard normal distributions, we need methods not programmed to control higher moments. For all these methods, we need to estimate the parameters connected to the desired values of the higher moments. Within the framework of Monte Carlo experiments, the computing times of this estimate are then not very important. Indeed, once these parameters estimated, we can re-use them and the computing time of simulations does not suffer from it. On the other hand, for a parametric bootstrap which would consider the first four moments, the computing time is then multiplied by the number of desired simulations. So we understand the importance to provide a method which makes it possible to find the parameters attached to the first four estimated moments as quickly as possible. So, we must trade off between speed and possibilities of the method. The goal of this paper is to provide two new methods which control these first four moments and to compare their speed with that of the already existing methods.Skewness, kurtosis, simulations, econometrics

Asymptotic refinements of bootstrap tests in a linear regression model ; A CHM bootstrap using the first four moments of the residuals

We consider linear regression models and we suppose that disturbances are either Gaussian or non Gaussian. Then, by using Edgeworth expansions, we compute the exact errors in the rejection probability (ERPs) for all one-restriction tests (asymptotic and bootstrap) which can occur in these linear models. More precisely, we show that the ERP is the same for the asymptotic test as for the classical parametric bootstrap test it is based on as soon as the third cumulant is nonnul. On the other side, the non parametric bootstrap performs almost always better than the parametric bootstrap. There are two exceptions. The first occurs when the third and fourth cumulants are null, in this case parametric and non parametric bootstrap provide exactly the same ERPs, the second occurs when we perform a t-test or its associated bootstrap (parametric or not) in the models y =μ+u and y=ax+u where the disturbances have nonnull kurtosis coefficient and a skewness coefficient equal to zero. In that case, the ERPs of any test (asymptotic or bootstrap) we perform are of the same order.Finally, we provide a new parametric bootstrap using the first four moments of the distribution of the residuals which is as accurate as a non parametric bootstrap which uses these first four moments implicitly. We will introduce it as the parametric bootstrap considering higher moments (CHM), and thus, we will speak about the CHM parametric bootstrapNon parametric bootstrap, Parametric Bootstrap, Cumulants, Skewness, kurtosis.

On the closure of the tame automorphism group of affine three-space

We provide explicit families of tame automorphisms of the complex affine three-space which degenerate to wild automorphisms. This shows that the tame subgroup of the group of polynomial automorphisms of \C^3 is not closed, when the latter is seen as an infinite dimensional algebraic group.tomorphism group of affine three-spac

High-level synthesis under I/O Timing and Memory constraints

The design of complex Systems-on-Chips implies to take into account communication and memory access constraints for the integration of dedicated hardware accelerator. In this paper, we present a methodology and a tool that allow the High-Level Synthesis of DSP algorithm, under both I/O timing and memory constraints. Based on formal models and a generic architecture, this tool helps the designer to find a reasonable trade-off between both the required I/O timing behavior and the internal memory access parallelism of the circuit. The interest of our approach is demonstrated on the case study of a FFT algorithm

Running real time distributed simulations under Linux and CERTI

This paper presents some experiments and some results to enforce real time distributed simulations in accordance with the High Level Architecture (HLA). Simulations were run by using CERTI, an open source middleware, as the Run Time Infrastructure (RTI). Models were distributed over computers under various available versions of the 2.6 Linux kernel. Studies and experiments relied on a real case study. The chosen case study was the simulation of an "in formation" flight of observation satellites. This case study brings up some real applicative needs in real time distributed simulations and real configurations of simulators and models. Two simulations of "in formation" flight of satellites were studied. The study consisted in modeling the behaviour of the simulators and in running these models by using various kernel or middleware operating mechanisms and services. Time measurements were performed at each test giving some results on the ability of the simulation to meet its real time requirements