The full basis theorem does not imply analytic wellordering

A finite support product of ${\omega }_1$ clones of Jensen's minimal ${\Pi }_2^1$ singleton forcing is used to define a model in which any non-empty analytically definable set of reals contains an analytically definable real (the full basis theorem), but there is no analytically definable wellordering of the reals.     

Stability of O3 + N2, O3 + O2 and O3 + CO2 double hydrates: DFT study

1. Download : Download high-res image (151KB)
2. Download : Download full-size image

     

Approximation of bandlimited functions

Many signals encountered in science and engineering are approximated well by bandlimited functions. We provide suitable error bounds for the approximation of bandlimited functions by linear combinations of certain special functions—the prolate spheroidal wave functions of order 0. The coefficients in the approximating linear combinations are given explicitly via appropriate quadrature formulae.     

Room temperature Ni-catalyzed reduction of aryl tosylates by borane hydrides

Mild Ni-catalyzed homogeneous reductions of aryl tosylates are described for the first time. The catalytic system Ni(PPh₃)₂Cl₂ and PCy₃ is shown to be general for hydrogenolysis of a wide range of tosylates, including hindered, deactivated, heterocyclic, and bifunctional examples.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

Phase local approximation (PhaseLa) technique for phase unwrap from noisy data.

The local polynomial approximation (LPA) is a nonparametric regression technique with pointwise estimation in a sliding window. We apply the LPA of the argument of cos and sin in order to estimate the absolute phase from noisy wrapped phase data. Using the intersection of confidence interval (HCI) algorithm, the window size is selected as adaptive pointwise varying. This adaptation gives the phase estimate with the accuracy close to optimal in the mean squared sense. For calculations, we use a Gauss-Newton recursive procedure initiated by the phase estimates obtained for the neighboring points. It enables tracking properties of the algorithm and its ability to go beyond the principal interval [-pi, pi] and to reconstruct the absolute phase from wrapped phase observations even when the magnitude of the phase difference takes quite large values. The algorithm demonstrates a very good accuracy of the phase reconstruction which on many occasion overcomes the accuracy of the state-of-the-art algorithms developed for noisy phase unwrap. The theoretical analysis produced for the accuracy of the pointwise estimates is used for justification of the HCI adaptation algorithm.