Searcharxiv⌕ Search

arXiv subjects

A. J. Fernández

Publications and source records attributed to A. J. Fernández.

2 recordsLinked to original sources

TuMag: the tunable magnetograph for the Sunrise III mission

One of the instruments aboard the Sunrise III mission, the Tunable Magnetograph (TuMag), is a tunable imaging spectropolarimeter in visible wavelengths. It is designed to probe the vector magnetic field and the line-of-sight velocity of the photosphere and the lower chromosphere. The quasi-simultaneous observation of two spectral lines provides excellent diagnostic measurements of the magnetic and dynamic coupling in these layers. The key technologies employed for TuMag are an LCVR-based polarimeter and a solid, LiNbO3 Fabry-Pérot etalon as a spectrometer. However, it also incorporates several innovative features, such as home-made high-sensitivity scientific cameras and a double filter wheel. TuMag can sequentially observe any two out of the three spectral lines of Fe I at 525.02 and 525.06 nm and of Mg I at 517.3 nm. Laboratory measurements have demonstrated outstanding performance, including a wavefront root-mean-square error better than λ/13 for image quality, a full-width-at-half-maximum of 8.7 pm for the filtergraph transmission profile, and polarimetric efficiencies > 0.54. Here we report on the concept, design, calibration, and integration phases of the instrument, as well as on the data reduction pipeline.

astro-ph.IM↗

On the Cooperation of the Constraint Domains H, R and FD in CFLP

This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly higher-order functions, predicates, and the cooperation of different constraint domains equipped with their respective solvers, relying on a so-called Constraint Functional Logic Programming (CFLP) scheme. The implementation has been developed on top of the CFLP system TOY, supporting the cooperation of the three domains H, R and FD, which supply equality and disequality constraints over symbolic terms, arithmetic constraints over the real numbers, and finite domain constraints over the integers, respectively. The computational model has been proved sound and complete w.r.t. the declarative semantics provided by the $CFLP$ scheme, while the implemented system has been tested with a set of benchmarks and shown to behave quite efficiently in comparison to the closest related approach we are aware of. To appear in Theory and Practice of Logic Programming (TPLP)

cs.PL↗