Upward Tau Air Showers from Earth

We estimate the rate of observable Horizontal and Upward Tau Air-Showers (HORTAUs, UPTAUS) considering both the Earth opacity and the finite size of the terrestrial atmosphere. We calculate the effective target volumes and masses for Tau air-showers emerging from the Earth. The resulting model-independent masses for satellite experiments such as EUSO may encompass at E_nu_tau = 10^19 eV a very large volume, V= 1020 km^3. Adopting simple power law neutrino fluxes, E^-2 and E^-1, calibrated to GZK-like and Z-Burst-like models, we estimate that at E= 10^19 eV nearly half a dozen horizontal shower events should be detected by EUSO in three years of data collection by the "guaranteed" GZK neutrino flux. We also find that the equivalent mass for an Earth outer layer made of rock is dominant compared to the water, contrary to simplified all-rock/all-water Earth models and previous Montecarlo simulations. Therefore we expect an enhancement of neutrino detection along continental shelves nearby the highest mountain chains, also given the better geometrical acceptance for Earth skimming neutrinos. The Auger experiment might reveal such a signature at E_nu= 10^{18} eV (with 26 events in 3 yr) towards the Andes, if the angular resolution at the horizon (both in azimuth and zenith) would reach an accuracy of nearly one degree needed to disentangle tau air showers from common UHECR. The number of events increases at lower energies; therefore we suggest an extension of the EUSO and Auger sensitivity down to (or even below) E_nu = 10^19 eV and E_nu = 10^18 eV respectively.Comment: New version resubmitted to ApJ on the 6th April 2004; 55 Pages,20 figures, major changes following referee reques

A nonmonotone GRASP

A greedy randomized adaptive search procedure (GRASP) is an itera- tive multistart metaheuristic for difficult combinatorial optimization problems. Each GRASP iteration consists of two phases: a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Repeated applications of the con- struction procedure yields different starting solutions for the local search and the best overall solution is kept as the result. The GRASP local search applies iterative improvement until a locally optimal solution is found. During this phase, starting from the current solution an improving neighbor solution is accepted and considered as the new current solution. In this paper, we propose a variant of the GRASP framework that uses a new “nonmonotone” strategy to explore the neighborhood of the current solu- tion. We formally state the convergence of the nonmonotone local search to a locally optimal solution and illustrate the effectiveness of the resulting Nonmonotone GRASP on three classical hard combinatorial optimization problems: the maximum cut prob- lem (MAX-CUT), the weighted maximum satisfiability problem (MAX-SAT), and the quadratic assignment problem (QAP)