2 resultados para HR-CS GF AAS

em Universidade Complutense de Madrid


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present simultaneous and continuous observations of the Hα, Hβ, He I D_3, Na I D_1,D_2 doublet and the Ca II H&K lines for the RS CVn system HR 1099. The spectroscopic observations were obtained during the MUSICOS 1998 campaign involving several observatories and instruments, both echelle and long-slit spectrographs. During this campaign, HR 1099 was observed almost continuously for more than 8 orbits of 2^d.8. Two large optical flares were observed, both showing an increase in the emission of Hα, Ca II H K, Hβ and He I D_3 and a strong filling-in of the Na I D_1, D_2 doublet. Contemporary photometric observations were carried out with the robotic telescopes APT-80 of Catania and Phoenix-25 of Fairborn Observatories. Maps of the distribution of the spotted regions on the photosphere of the binary components were derived using the Maximum Entropy and Tikhonov photometric regularization criteria. Rotational modulation was observed in Hα and He I D_3 in anti-correlation with the photometric light curves. Both flares occurred at the same binary phase (0.85), suggesting that these events took place in the same active region. Simultaneous X-ray observations, performed by ASM on board RXTE, show several flare-like events, some of which correlate well with the observed optical flares. Rotational modulation in the X-ray light curve has been detected with minimum flux when the less active G5 V star was in front. A possible periodicity in the X-ray flare-like events was also found.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.