| 1. |
- Marconi, A., et al.
(författare)
-
ANDES, the high resolution spectrograph for the ELT : science case, baseline design and path to construction
- 2022
-
Ingår i: GROUND-BASED AND AIRBORNE INSTRUMENTATION FOR ASTRONOMY IX. - : SPIE - International Society for Optical Engineering. - 9781510653504 - 9781510653498
-
Konferensbidrag (refereegranskat)abstract
- The first generation of ELT instruments includes an optical-infrared high resolution spectrograph, indicated as ELT-HIRES and recently christened ANDES (ArmazoNes high Dispersion Echelle Spectrograph). ANDES consists of three fibre-fed spectrographs (UBV, RIZ, YJH) providing a spectral resolution of similar to 100,000 with a minimum simultaneous wavelength coverage of 0.4-1.8 mu m with the goal of extending it to 0.35-2.4 mu m with the addition of a K band spectrograph. It operates both in seeing- and diffraction-limited conditions and the fibre-feeding allows several, interchangeable observing modes including a single conjugated adaptive optics module and a small diffraction-limited integral field unit in the NIR. Its modularity will ensure that ANDES can be placed entirely on the ELT Nasmyth platform, if enough mass and volume is available, or partly in the Coude room. ANDES has a wide range of groundbreaking science cases spanning nearly all areas of research in astrophysics and even fundamental physics. Among the top science cases there are the detection of biosignatures from exoplanet atmospheres, finding the fingerprints of the first generation of stars, tests on the stability of Nature's fundamental couplings, and the direct detection of the cosmic acceleration. The ANDES project is carried forward by a large international consortium, composed of 35 Institutes from 13 countries, forming a team of more than 200 scientists and engineers which represent the majority of the scientific and technical expertise in the field among ESO member states.
|
|
| 2. |
- Casolino, M., et al.
(författare)
-
Cosmic-ray observations of the heliosphere with the PAMELA experiment
- 2006
-
Ingår i: Astrophysics. - : Elsevier BV. ; , s. 1848-1852
-
Konferensbidrag (refereegranskat)abstract
- The PAMELA experiment is a multi-purpose apparatus built around a permanent magnet spectrometer, with the main goal of studying in detail the antiparticle component of cosmic rays. The apparatus will be carried in space by means of a Russian satellite, due to launch in 2005, for a three year-long mission. The characteristics of the detectors composing the instrument, alongside the long lifetime of the mission and the orbital characteristics of the satellite, will allow to address several items of cosmic-ray physics. In this paper, we will focus on the solar and heliospheric observation capabilities of PAMELA.
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
- Fekete, Sandor P., et al.
(författare)
-
Computing Nonsimple Polygons of Minimum Perimeter
- 2016
-
Ingår i: EXPERIMENTAL ALGORITHMS, SEA 2016. - Cham : SPRINGER INT PUBLISHING AG. - 9783319388502 - 9783319388519 ; , s. 134-149
-
Konferensbidrag (refereegranskat)abstract
- We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP) asks for a (not necessarily simply connected) polygon with shortest possible boundary length. Even though the closely related problem of finding a minimum cycle cover is polynomially solvable by matching techniques, we prove how the topological structure of a polygon leads to NP-hardness of the MPP. On the positive side, we show how to achieve a constant-factor approximation. When trying to solve MPP instances to provable optimality by means of integer programming, an additional difficulty compared to the TSP is the fact that only a subset of subtour constraints is valid, depending not on combinatorics, but on geometry. We overcome this difficulty by establishing and exploiting additional geometric properties. This allows us to reliably solve a wide range of benchmark instances with up to 600 vertices within reasonable time on a standard machine. We also show that using a natural geometry-based sparsification yields results that are on average within 0.5% of the optimum.
|
|
| 9. |
|
|
