Optical calibration hardware for the Sudbury Neutrino Observatory

The optical properties of the Sudbury Neutrino Observatory (SNO) heavy water Cherenkov neutrino detector are measured in situ using a light diffusing sphere ("laserball"). This diffuser is connected to a pulsed nitrogen/dye laser via specially developed underwater optical fibre umbilical cables. The umbilical cables are designed to have a small bending radius, and can be easily adapted for a variety of calibration sources in SNO. The laserball is remotely manipulated to many positions in the D2O and H2O volumes, where data at six different wavelengths are acquired. These data are analysed to determine the absorption and scattering of light in the heavy water and light water, and the angular dependence of the response of the detector's photomultiplier tubes. This paper gives details of the physical properties, construction, and optical characteristics of the laserball and its associated hardware.Comment: 17 pages, 8 figures, submitted to Nucl. Inst. Meth.

An explicit height bound for the classical modular polynomial

For a prime m, let Phi_m be the classical modular polynomial, and let h(Phi_m) denote its logarithmic height. By specializing a theorem of Cohen, we prove that h(Phi_m) <= 6 m log m + 16 m + 14 sqrt m log m. As a corollary, we find that h(Phi_m) <= 6 m log m + 18 m also holds. A table of h(Phi_m) values is provided for m <= 3607.Comment: Minor correction to the constants in Theorem 1 and Corollary 9. To appear in the Ramanujan Journal. 17 pages

Finding largest small polygons with GloptiPoly

A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices $n$. Many instances are already solved in the literature, namely for all odd $n$, and for $n=4, 6$ and 8. Thus, for even $n\geq 10$, instances of this problem remain open. Finding those largest small polygons can be formulated as nonconvex quadratic programming problems which can challenge state-of-the-art global optimization algorithms. We show that a recently developed technique for global polynomial optimization, based on a semidefinite programming approach to the generalized problem of moments and implemented in the public-domain Matlab package GloptiPoly, can successfully find largest small polygons for $n=10$ and $n=12$. Therefore this significantly improves existing results in the domain. When coupled with accurate convex conic solvers, GloptiPoly can provide numerical guarantees of global optimality, as well as rigorous guarantees relying on interval arithmetic

Casimir force on a piston

We consider a massless scalar field obeying Dirichlet boundary conditions on the walls of a two-dimensional L x b rectangular box, divided by a movable partition (piston) into two compartments of dimensions a x b and (L-a) x b. We compute the Casimir force on the piston in the limit L -> infinity. Regardless of the value of a/b, the piston is attracted to the nearest end of the box. Asymptotic expressions for the Casimir force on the piston are derived for a << b and a >> b.Comment: 10 pages, 1 figure. Final version, accepted for publication in Phys. Rev.

Online Makespan Minimization with Parallel Schedules

In online makespan minimization a sequence of jobs $\sigma = J_1,..., J_n$ has to be scheduled on $m$ identical parallel machines so as to minimize the maximum completion time of any job. We investigate the problem with an essentially new model of resource augmentation. Here, an online algorithm is allowed to build several schedules in parallel while processing $\sigma$. At the end of the scheduling process the best schedule is selected. This model can be viewed as providing an online algorithm with extra space, which is invested to maintain multiple solutions. The setting is of particular interest in parallel processing environments where each processor can maintain a single or a small set of solutions. We develop a (4/3+\eps)-competitive algorithm, for any 0<\eps\leq 1, that uses a number of 1/\eps^{O(\log (1/\eps))} schedules. We also give a (1+\eps)-competitive algorithm, for any 0<\eps\leq 1, that builds a polynomial number of (m/\eps)^{O(\log (1/\eps) / \eps)} schedules. This value depends on $m$ but is independent of the input $\sigma$. The performance guarantees are nearly best possible. We show that any algorithm that achieves a competitiveness smaller than 4/3 must construct $\Omega(m)$ schedules. Our algorithms make use of novel guessing schemes that (1) predict the optimum makespan of a job sequence $\sigma$ to within a factor of 1+\eps and (2) guess the job processing times and their frequencies in $\sigma$. In (2) we have to sparsify the universe of all guesses so as to reduce the number of schedules to a constant. The competitive ratios achieved using parallel schedules are considerably smaller than those in the standard problem without resource augmentation

Hard Instances of the Constrained Discrete Logarithm Problem

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the set. Motivated by cryptographic applications, we study sets with succinct representation for which the constrained DLP is hard. We draw on earlier results due to Erd\"os et al. and Schnorr, develop geometric tools such as generalized Menelaus' theorem for proving lower bounds on the complexity of the constrained DLP, and construct sets with succinct representation with provable non-trivial lower bounds

Extreme Ultra-Violet Spectroscopy of the Lower Solar Atmosphere During Solar Flares

The extreme ultraviolet portion of the solar spectrum contains a wealth of diagnostic tools for probing the lower solar atmosphere in response to an injection of energy, particularly during the impulsive phase of solar flares. These include temperature and density sensitive line ratios, Doppler shifted emission lines and nonthermal broadening, abundance measurements, differential emission measure profiles, and continuum temperatures and energetics, among others. In this paper I shall review some of the advances made in recent years using these techniques, focusing primarily on studies that have utilized data from Hinode/EIS and SDO/EVE, while also providing some historical background and a summary of future spectroscopic instrumentation.Comment: 34 pages, 8 figures. Submitted to Solar Physics as part of the Topical Issue on Solar and Stellar Flare

A measurement of the tau mass and the first CPT test with tau leptons

We measure the mass of the tau lepton to be 1775.1+-1.6(stat)+-1.0(syst.) MeV using tau pairs from Z0 decays. To test CPT invariance we compare the masses of the positively and negatively charged tau leptons. The relative mass difference is found to be smaller than 3.0 10^-3 at the 90% confidence level.Comment: 10 pages, 4 figures, Submitted to Phys. Letts.

A Measurement of the Product Branching Ratio f(b->Lambda_b).BR(Lambda_b->Lambda X) in Z0 Decays

The product branching ratio, f(b->Lambda_b).BR(Lambda_b->Lambda X), where Lambda_b denotes any weakly-decaying b-baryon, has been measured using the OPAL detector at LEP. Lambda_b are selected by the presence of energetic Lambda particles in bottom events tagged by the presence of displaced secondary vertices. A fit to the momenta of the Lambda particles separates signal from B meson and fragmentation backgrounds. The measured product branching ratio is f(b->Lambda_b).BR(Lambda_b->Lambda X) = (2.67+-0.38(stat)+0.67-0.60(sys))% Combined with a previous OPAL measurement, one obtains f(b->Lambda_b).BR(Lambda_b->Lambda X) = (3.50+-0.32(stat)+-0.35(sys))%.Comment: 16 pages, LaTeX, 3 eps figs included, submitted to the European Physical Journal

WW Production Cross Section and W Branching Fractions in e+e- Collisions at 189 GeV

From a data sample of 183 pb^-1 recorded at a center-of-mass energy of roots = 189 GeV with the OPAL detector at LEP, 3068 W-pair candidate events are selected. Assuming Standard Model W boson decay branching fractions, the W-pair production cross section is measured to be sigmaWW = 16.30 +- 0.34(stat.) +- 0.18(syst.) pb. When combined with previous OPAL measurements, the W boson branching fraction to hadrons is determined to be 68.32 +- 0.61(stat.) +- 0.28(syst.) % assuming lepton universality. These results are consistent with Standard Model expectations.Comment: 22 pages, 5 figures, submitted to Phys. Lett.