Minimum distance controlled tabular adjustment (CTA) is a recent perturbative technique of statistical disclosure control for tabular data. Given a table to be protected, CTA looks for the closest safe table, using some particular distance. We focus on the continuous formulation of CTA, without binary variables, which results in a convex optimization problem for distances L1, L2 and L∞. We also...

It is proved that a Musielak-Orlicz space LΦ of real valued functions which is isometric to a Hilbert space coincides with L2 up to a weight, that is Φ(u,t)= c(t)u2. Moreover it is shown that any surjective isometry between LΦ and L∞ is a weighted composition operator and a criterion for LΦ to be isometric to L∞ is presented. Isometries in complex function spaces have been studied successfully ...

For more than two decades, several continuous (and generally separable) penalties approximating (relaxing) the `0-pseudo norm have been proposed. Although some “good” properties for such penalties have been highlighted, the choice of one relaxation rather than another one remains unclear. One approach to compare them is to investigate their fidelity to the initial problem. In other words, do th...

Boelens, Petra G., Paul A. M. van Leeuwen, Cornelis H. C. Dejong, and Nicolaas E. P. Deutz. Intestinal renal metabolism of L-citrulline and L-arginine following enteral or parenteral infusion of L-alanyl-L-[2,N]glutamine or L-[2,N]glutamine in mice. Am J Physiol Gastrointest Liver Physiol 289: G679–G685, 2005. First published July 28, 2005; doi:10.1152/ajpgi.00026.2005.—Previously, we observed ...

The goal of the present paper is to study interference between French and English prosody. In order to study the influence of the prosody on the second language pronunciation, F0 slopes and vowel durations of the last syllables of prosodic groups were measured and analyzed in the pronunciation of French native speakers speaking French and English, and of English native speakers speaking English...

for a given graph $g=(v,e)$, let $mathscr l(g)={l(v) : vin v}$ be a prescribed list assignment. $g$ is $mathscr l$-$l(2,1)$-colorable if there exists a vertex labeling $f$ of $g$ such that $f(v)in l(v)$ for all $v in v$; $|f(u)-f(v)|geq 2$ if $d_g(u,v) = 1$; and $|f(u)-f(v)|geq 1$ if $d_g(u,v)=2$. if $g$ is $mathscr l$-$l(2,1)$-colorable for every list assignment $mathscr l$ with $|l(v)|geq k$ ...

We extend the known result that bilinear pseudo-differential operators with symbols in Hörmander class $$BS^{-n/2}_{0,0}(\mathbb {R}^n)$$ are bounded from $$L^2 \times L^2$$ to $$h^1$$ . show those also $$L^r $$ for every $$1< r\le 2$$ Moreover we give similar results symbol classes wider than of limited smoothness.