The accreting millisecond X-ray pulsar SAX J1808.4–3658 shows peculiar low luminosity states known as “reflares” after the end of the main outburst. During this phase the X-ray luminosity of the source varies by up to three orders of magnitude in less than 1–2 days. The lowest X-ray luminosity observed reaches a value of 10 erg s 32 1 ~ , only a factor of a few brighter than its typical quiesce...

Some proposals in the network management area use XML to encode the information model and the managed variables instances. In this paper we present an SNMP to XML dynamic proxy implementation to translate the information retrieved from network devices using SNMP to an XML representation. The proxy developed use the translation support between information models found in the libsmi and a SAX par...

Recall that Janson showed if the edges of complete graph $K_n$ are assigned exponentially distributed independent random weights, then expected length a shortest path between fixed pair vertices is asymptotically equal to $(\log n)/n$. We consider analogous problems where have not only but also cost, and we interested in minimum-length structure whose total cost less than some budget. For sever...

Abstract A graph $H$ is common if the number of monochromatic copies in a 2-edge-colouring complete $K_n$ asymptotically minimised by random colouring. Burr and Rosta, extending famous conjecture Erdős, conjectured that every common. The conjectures Erdős Rosta were disproved Thomason Sidorenko, respectively, late 1980s. Collecting new examples graphs had not seen much progress since then, alth...

Status of this Memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited.

Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard. Distribution of this memo is unlimited. Abstract This memo suggests a straightforward approach towards describing SNMP-based agents.

We investigate the relationship between lowness for Schnorr randomness and Schnorr triviality. We show that a real is low for Schnorr randomness if and only if it is Schnorr trivial and hyperimmune free.

1 On the so–called Pell–Fermat equation 2 1.1 Examples of simple continued fractions . . . . . . . . . . . . . 2 1.2 Existence of integer solutions . . . . . . . . . . . . . . . . . . 5 1.3 All integer solutions . . . . . . . . . . . . . . . . . . . . . . . 6 1.4 On the group of units of Z[ √ D] . . . . . . . . . . . . . . . . . 8 1.5 Connection with rational approximation . . . . . . . . . . ....