Highlights in Neutrino and Astroparticle Physics

The main highlights from the papers presented at this workshop are briefly reviewed and discussed in a general context.Comment: 15 pages, 14 Encapsulated Postscript figures, uses espcrc2.sty. Talk given at the Sixth Topical Seminar on Neutrino and Astroparticle Physics, San Miniato, Italy, 17-21 May 199

BTZ gems inside regular Born-Infeld black holes

The regular black hole solution arising as a spherically symmetric vacuum solution of Born-Infeld gravity possesses an asymptotic interior structure which is very well described by a four-dimensional generalization of the non-rotating BTZ metric. According to this picture no singularity exists, and instead, infalling observers experience a constant curvature manifold as they travel towards future null infinity. This is characterized by the BTZ event horizon. The exterior structure of the black hole is also studied, and it is shown that it corresponds to the Schwarzschild solution provided the black hole mass is not too small. In this way, the regular black hole state can be seen as a spacetime which connects two constant curvature asymptotic spaces, namely, the flat Minkowski spacetime in the outside region, and the locally AdS constant negative curvature one characterizing the BTZ-like asymptotic interior.Fil: Böhmer, Christian G.. University College London; Estados UnidosFil: Fiorini, Franco Luis. Comision Nacional de Energia Atomica. Gerencia D/area Invest y Aplicaciones No Nucleares. Gerencia de Des. Tec. y Proyectos Especiales. Departamento de Ingenieria En Telecomunicaciones; Argentina. Comisión Nacional de Energía Atómica. Gerencia del Área de Energía Nuclear. Instituto Balseiro; Argentina. Comisión Nacional de Energía Atómica. Centro Atómico Bariloche; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Patagonia Norte; Argentin

On the Complexity of an Unregulated Traffic Crossing

The steady development of motor vehicle technology will enable cars of the near future to assume an ever increasing role in the decision making and control of the vehicle itself. In the foreseeable future, cars will have the ability to communicate with one another in order to better coordinate their motion. This motivates a number of interesting algorithmic problems. One of the most challenging aspects of traffic coordination involves traffic intersections. In this paper we consider two formulations of a simple and fundamental geometric optimization problem involving coordinating the motion of vehicles through an intersection. We are given a set of $n$ vehicles in the plane, each modeled as a unit length line segment that moves monotonically, either horizontally or vertically, subject to a maximum speed limit. Each vehicle is described by a start and goal position and a start time and deadline. The question is whether, subject to the speed limit, there exists a collision-free motion plan so that each vehicle travels from its start position to its goal position prior to its deadline. We present three results. We begin by showing that this problem is NP-complete with a reduction from 3-SAT. Second, we consider a constrained version in which cars traveling horizontally can alter their speeds while cars traveling vertically cannot. We present a simple algorithm that solves this problem in $O(n \log n)$ time. Finally, we provide a solution to the discrete version of the problem and prove its asymptotic optimality in terms of the maximum delay of a vehicle

The VPN problems with concave costs

Only recently Goyal, Olver and Shepherd (Proc. STOC, 2008) proved that the symmetric Virtual Private Network Design (sVPN) problem has the tree routing property, namely, that there always exists an optimal solution to the problem whose support is a tree. Combining this with previous results by Fingerhut, Suri and Turner (J. Alg., 1997) and Gupta, Kleinberg, Kumar, Rastogi and Yener (Proc. STOC, 2001), sVPN can be solved in polynomial time. In this paper we investigate an APX-hard generalization of sVPN, where the contribution of each edge to the total cost is proportional to some non-negative, concave and non-decreasing function of the capacity reservation. We show that the tree routing property extends to the new problem, and give a constant-factor approximation algorithm for it. We also show that the undirected uncapacitated single-source minimum concave-cost flow problem has the tree routing property when the cost function has some property of symmetry

Nucleon decay and atmospheric neutrinos in the Mont Blanc experiment

In the NUSEX experiment, during 2.8 years of operation, 31 fully contained events have been collected; 3 among them are nucleon decay candidates, while the others have been attributed to upsilon interactions. Limits on nucleon lifetime and determinations of upsilon interaction rates are presented