CMS reconstruction improvement for the muon tracking by the RPC chambers

The contribution of Resistive Plate Chamber (RPC) to muon reconstruction in CMS has been studied on a sample of muons collected in proton-proton collisions at sqrt(s) = 7 TeV at the LHC in 2011. Muon reconstruction is performed using the all-silicon inner tracker and with up to four stations of gas-ionization muon detectors. Drift Tubes and Cathode Strip Chambers detect muons in the barrel and endcap regions, respectively, and are complemented by the RPC system. Measured distributions of reconstructed hits in the RPCs crossed by muons from Z decays with a transverse momentum pT above 20 GeV/c are well reproduced by the Monte Carlo simulation. From the samples of J/psi and Z events, the efficiencies for muons with and without the inclusion of the RPC hits in the muon track reconstruction are measured and compared with the simulation. Using RPC information in track reconstruction improves up to about 3% of offline reconstruction efficiency for the muons in the region of pT above 7 GeV/c, in good agreement with simulation.Comment: Presented by Minsuk Kim at the XI workshop on Resistive Plate Chambers and Related Detectors - RPC2012, INFN Laboratori Nazionali di Frascati Italy, February 5-10, 201

FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes

The popular method of enumerating the primes is the Sieve of Eratosthenes. It can be programmed very neatly in a lazy functional language, but runs rather slowly. A little-known alternative method is the Wheel Sieve, originally formulated as a fast imperative algorithm for obtaining all primes up to a given limit, assuming destructive access to a bit-array. This article describes functional variants of the wheel sieve that enumerate all primes as a lazy list

Structure of conflict graphs in constraint alignment problems and algorithms

We consider the constrained graph alignment problem which has applications in biological network analysis. Given two input graphs $G_1=(V_1,E_1), G_2=(V_2,E_2)$, a pair of vertex mappings induces an {\it edge conservation} if the vertex pairs are adjacent in their respective graphs. %In general terms The goal is to provide a one-to-one mapping between the vertices of the input graphs in order to maximize edge conservation. However the allowed mappings are restricted since each vertex from $V_1$ (resp. $V_2$) is allowed to be mapped to at most $m_1$ (resp. $m_2$) specified vertices in $V_2$ (resp. $V_1$). Most of results in this paper deal with the case $m_2=1$ which attracted most attention in the related literature. We formulate the problem as a maximum independent set problem in a related {\em conflict graph} and investigate structural properties of this graph in terms of forbidden subgraphs. We are interested, in particular, in excluding certain wheals, fans, cliques or claws (all terms are defined in the paper), which corresponds in excluding certain cycles, paths, cliques or independent sets in the neighborhood of each vertex. Then, we investigate algorithmic consequences of some of these properties, which illustrates the potential of this approach and raises new horizons for further works. In particular this approach allows us to reinterpret a known polynomial case in terms of conflict graph and to improve known approximation and fixed-parameter tractability results through efficiently solving the maximum independent set problem in conflict graphs. Some of our new approximation results involve approximation ratios that are function of the optimal value, in particular its square root; this kind of results cannot be achieved for maximum independent set in general graphs.Comment: 22 pages, 6 figure

On building 4-critical plane and projective plane multiwheels from odd wheels

We build unbounded classes of plane and projective plane multiwheels that are 4-critical that are received summing odd wheels as edge sums modulo two. These classes can be considered as ascending from single common graph that can be received as edge sum modulo two of the octahedron graph O and the minimal wheel W3. All graphs of these classes belong to 2n-2-edges-class of graphs, among which are those that quadrangulate projective plane, i.e., graphs from Gr\"otzsch class, received applying Mycielski's Construction to odd cycle.Comment: 10 page

Design and development of a pole climbing surveillance robot

The cost of installing, monitoring and servicing a fixed camera system can be high and not all areas are in need of constant surveying. The increase in crime in urban areas emphasizes the need for a more effective and efficient surveillance system, as a result could lead to fewer crimes. A temporary surveillance unit which is able to climb to gain an elevated view has great potential for both military and civilian application. This paper highlights how the patent pending climbing robotic system (PC-101) was developed to be used by London’s Metropolitan Police Forensic Department for analysing outdoor crime scenes especially that related to car accidents. When cars are involved in accidents in the Metropolitan area, depending on the scale of the incident, the road generally has to be shut off to traffic if there are serious casualties. Elevated images are required for cases which may be taken to court, which then the images are then used as evidence, therefore regulations on the quality and perspectives of the image have to be met. By climbing a range of existing street furniture such as street lamp post, a temporary platform eliminates the use of larger special vehicle which struggles to get to the crime scene as well as cuts down the duration of the road closure. 98% of London street lamps in the Metropolitan area are constructed out of steel structures which make the use of magnetic wheels for locomotion an ideal solution to the climbing problem. Once remote controlled to the top of the lamp post, the PC-101 makes use of its actuated camera arm/gimbal to take the required shot, which can be seen on the ground control unit. A surveillance tool of this sort can be used for many applications which include crowd/riot control, crime scene investigations, monitoring hostile environments and even the monitoring of nature within urban environment

Dynamics of mistuned radial turbine wheels

This paper presents investigations carried out at Holset into the dynamics of mistuned radial turbine wheels, including a literature review, a lumped parameter model, identification of the most responsive blade, distribution of the peak maximum order response and a method of mistiming identification