The QUaD project will measure the cosmic microwave background’s polarization anisotropy from the South Pole beginning in early 2005. This thesis discusses the optical characterization of a single pixel in both the 100 GHz and 150 GHz spectral bands using the QUaD test bed. It describes the methods and results for measuring the pixel’s spectral response, polarization response, spatial response, ...

We present an intuitive pulse characterization method that provides an accurate and direct measurement of the spectral phase of ultrashort laser pulses. The method requires the successive imposition of a set of quadratic spectral phase functions on the pulses while recording the corresponding nonlinear spectra. The second-derivative of the unknown spectral phase can be directly visualized and e...

We provide a complete spectral characterization of the double commutation method for general Sturm-Liouville operators which inserts any finite number of prescribed eigenvalues into spectral gaps of a given background operator. Moreover, we explicitly determine the transformation operator which links the background operator to its doubly commuted version (resulting in extensions and considerabl...

A white-light spectral interferometric technique is used to retrieve a relative spectral phase and group delay of a multilayer mirror from the spectral interferograms recorded in a dispersive Michelson interferometer. The phase retrieval is based on the use of a windowed Fourier transform in the wavelength domain, and characterization of the multilayer mirror is completed by a three-step measur...

We show that the norm graph constructed in [13] with n vertices about 1 2n 2−1/t edges, which contains no copy of Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1.

In this paper we investigate the closure ~-* under substitution-composition of a family of graphs ~,, defined by a set Lr of forbidden configurations. We first prove that ~-* can be defined by a set L~* of forbidden subgraphs. Next, using a counterexample we show that ~* is not necessarily a finite set, even when .~ is finite. We then give a sufficient condition for ~* to be finite and a simple...

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...

We characterise t-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is h-perfect if and only if it is perfect.