Spin-lattice interactions of ions with unfilled F-shells measured by ESR in uniaxially stressed crystals

Spin-lattice interactions of ions with unfilled F-shells measured by electron spin resonance in uniaxially stressed crystal

On the irreversibility of entanglement distillation

We investigate the irreversibility of entanglement distillation for a symmetric d-1 parameter family of mixed bipartite quantum states acting on Hilbert spaces of arbitrary dimension d x d. We prove that in this family the entanglement cost is generically strictly larger than the distillable entanglement, such that the set of states for which the distillation process is asymptotically reversible is of measure zero. This remains true even if the distillation process is catalytically assisted by pure state entanglement and every operation is allowed, which preserves the positivity of the partial transpose. It is shown, that reversibility occurs only in cases where the state is quasi-pure in the sense that all its pure state entanglement can be revealed by a simple operation on a single copy. The reversible cases are shown to be completely characterized by minimal uncertainty vectors for entropic uncertainty relations.Comment: 5 pages, revtex

Direct one-phonon spin-lattice relaxation times for Nd sup 3 plus and U sup 3 plus ions in CaF sub 2 in sites of tetragonal symmetry

Phonon spin-lattice relaxation times for uranium and neodymium ions in calcium fluorid

Spin-lattice Interaction in Ruby Measured by ESR in Uniaxially Stressed Crystals

Spin-lattice Hamiltonian determined for chromium ions in ruby single crystal

Very high quality image restoration by combining wavelets and curvelets

We outline digital implementations of two newly developed multiscale representation systems, namely, the ridgelet and curvelet transforms. We apply these digital transforms to the problem of restoring an image from noisy data and compare our results with those obtained via well established methods based on the thresholding of wavelet coefficients. We develop a methodology to combine wavelets together these new systems to perform noise removal by exploiting all these systems simultaneously. The results of the combined reconstruction exhibits clear advantages over any individual system alone. For example, the residual error contains essentially no visually intelligible structure: no structure is lost in the reconstruction

Probabilistic Reconstruction in Compressed Sensing: Algorithms, Phase Diagrams, and Threshold Achieving Matrices

Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make less measurements than what was considered necessary to record a signal, enabling faster or more precise measurement protocols in a wide range of applications. Using an interdisciplinary approach, we have recently proposed in [arXiv:1109.4424] a strategy that allows compressed sensing to be performed at acquisition rates approaching to the theoretical optimal limits. In this paper, we give a more thorough presentation of our approach, and introduce many new results. We present the probabilistic approach to reconstruction and discuss its optimality and robustness. We detail the derivation of the message passing algorithm for reconstruction and expectation max- imization learning of signal-model parameters. We further develop the asymptotic analysis of the corresponding phase diagrams with and without measurement noise, for different distribution of signals, and discuss the best possible reconstruction performances regardless of the algorithm. We also present new efficient seeding matrices, test them on synthetic data and analyze their performance asymptotically.Comment: 42 pages, 37 figures, 3 appendixe

Adaptive density estimation for stationary processes

We propose an algorithm to estimate the common density $s$ of a stationary process $X_1,...,X_n$. We suppose that the process is either $\beta$ or $\tau$-mixing. We provide a model selection procedure based on a generalization of Mallows' $C_p$ and we prove oracle inequalities for the selected estimator under a few prior assumptions on the collection of models and on the mixing coefficients. We prove that our estimator is adaptive over a class of Besov spaces, namely, we prove that it achieves the same rates of convergence as in the i.i.d framework

Neural networks and separation of Cosmic Microwave Background and astrophysical signals in sky maps

The Independent Component Analysis (ICA) algorithm is implemented as a neural network for separating signals of different origin in astrophysical sky maps. Due to its self-organizing capability, it works without prior assumptions on the signals, neither on their frequency scaling, nor on the signal maps themselves; instead, it learns directly from the input data how to separate the physical components, making use of their statistical independence. To test the capabilities of this approach, we apply the ICA algorithm on sky patches, taken from simulations and observations, at the microwave frequencies, that are going to be deeply explored in a few years on the whole sky, by the Microwave Anisotropy Probe (MAP) and by the {\sc Planck} Surveyor Satellite. The maps are at the frequencies of the Low Frequency Instrument (LFI) aboard the {\sc Planck} satellite (30, 44, 70 and 100 GHz), and contain simulated astrophysical radio sources, Cosmic Microwave Background (CMB) radiation, and Galactic diffuse emissions from thermal dust and synchrotron. We show that the ICA algorithm is able to recover each signal, with precision going from 10% for the Galactic components to percent for CMB; radio sources are almost completely recovered down to a flux limit corresponding to $0.7\sigma_{CMB}$, where $\sigma_{CMB}$ is the rms level of CMB fluctuations. The signal recovering possesses equal quality on all the scales larger then the pixel size. In addition, we show that the frequency scalings of the input signals can be partially inferred from the ICA outputs, at the percent precision for the dominant components, radio sources and CMB.Comment: 15 pages; 6 jpg and 1 ps figures. Final version to be published in MNRA

Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors

Penalized regression is an attractive framework for variable selection problems. Often, variables possess a grouping structure, and the relevant selection problem is that of selecting groups, not individual variables. The group lasso has been proposed as a way of extending the ideas of the lasso to the problem of group selection. Nonconvex penalties such as SCAD and MCP have been proposed and shown to have several advantages over the lasso; these penalties may also be extended to the group selection problem, giving rise to group SCAD and group MCP methods. Here, we describe algorithms for fitting these models stably and efficiently. In addition, we present simulation results and real data examples comparing and contrasting the statistical properties of these methods