The LHCb vertex locator and displaced vertex trigger

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alignment of the LHCb Vertex Locator

LHCb will commence data taking as the first dedicated heavy flavour experiment at a hadron collider in 2008. A very high hit precision from its vertex detector (VELO) is essential to meet the tight requirements of vertex reconstruction in B-physics. The single hit precision of the VELO is better than 10 μm. However, the VELO is operated only 8 mm from the beam and must be retracted and reinsert...

متن کامل

Status and prospects of the LHCb Vertex Locator

The Vertex Locator of the LHCb experiment is a dedicated subdetector for the reconstruction of primary and secondary vertices in b-hadron decays. The vertex detector features two halves with 21 modules each, mounted on retractable bases. Each module consists of two half-disk silicon micro-strip sensors measuring hits in R and Φ coordinates. The strip pitch ranges from 40 to about 100 μm. A vacu...

متن کامل

The Argus Vertex Trigger

A fast second level trigger has been developed for the ARGUS experiment which recognizes tracks originating from the interaction region. The processor compares the hits in the ARGUS Micro Vertex Drift Chamber to 245760 masks stored in random access memories. The masks which are fully deened in three dimensions are able to reject tracks originating in the wall of the narrow beampipe of 10.5 mm r...

متن کامل

The robust vertex centdian location problem with interval vertex weights on general graphs

In this paper, the robust vertex centdian  location  problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max  regret criterion. This problem  is  investigated  with objective function contains $lambda$  and  a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...

متن کامل

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment

سال: 2000

ISSN: 0168-9002

DOI: 10.1016/s0168-9002(00)00015-2