Alignment procedure of the LHCb Vertex Detector

LHCb is one of the four main experiments of the Large Hadron Collider (LHC) project, which will start at CERN in 2008. The experiment is primarily dedicated to B-Physics and hence requires precise vertex reconstruction. The silicon vertex locator (VELO) has a single hit precision of better than 10 micron and is used both off-line and in the trigger. These requirements place strict constraints on its alignment. Additional challenges for the alignment arise from the detector being retracted between each fill of the LHC and from its unique circular disc r/phi strip geometry. This paper describes the track based software alignment procedure developed for the VELO. The procedure is primarily based on a non-iterative method using a matrix inversion technique. The procedure is demonstrated with simulated events to be fast, robust and to achieve a suitable alignment precision.Comment: accepted for publication in NIM

LHCb VELO software alignment, Part III: the alignment of the relative sensor positions

The LHCb Vertex Locator contains 42 silicon sensor modules. Each module has two silicon sensors. A method for determining the relative alignment of the silicon sensors within each module from data is presented. The software implementation details are discussed. Monte-Carlo simulation studies are described that demonstrate an alignment precision of 1.3 micron is obtained in the sensor plane

Do television and electronic games predict children's psychosocial adjustment? Longitudinal research using the UK Millennium Cohort Study

Background: Screen entertainment for young children has been associated with several aspects of psychosocial adjustment. Most research is from North America and focuses on television. Few longitudinal studies have compared the effects of TV and electronic games, or have investigated gender differences. Purpose: To explore how time watching TV and playing electronic games at age 5 years each predicts change in psychosocial adjustment in a representative sample of 7 year-olds from the UK. Methods: Typical daily hours viewing television and playing electronic games at age 5 years were reported by mothers of 11 014 children from the UK Millennium Cohort Study. Conduct problems, emotional symptoms, peer relationship problems, hyperactivity/inattention and prosocial behaviour were reported by mothers using the Strengths and Difficulties Questionnaire. Change in adjustment from age 5 years to 7 years was regressed on screen exposures; adjusting for family characteristics and functioning, and child characteristics. Results: Watching TV for 3 h or more at 5 years predicted a 0.13 point increase (95% CI 0.03 to 0.24) in conduct problems by 7 years, compared with watching for under an hour, but playing electronic games was not associated with conduct problems. No associations were found between either type of screen time and emotional symptoms, hyperactivity/inattention, peer relationship problems or prosocial behaviour. There was no evidence of gender differences in the effect of screen time. Conclusions: TV but not electronic games predicted a small increase in conduct problems. Screen time did not predict other aspects of psychosocial adjustment. Further work is required to establish causal mechanisms

Effect on smoking quit rate of telling patients their lung age: the Step2quit randomised controlled trial

Objective To evaluate the impact of telling patients their estimated spirometric lung age as an incentive to quit smoking.Design Randomised controlled trial.Setting Five general practices in Hertfordshire, England.Participants 561 current smokers aged over 35.Intervention All participants were offered spirometric assessment of lung function. Participants in intervention group received their results in terms of "lung age" (the age of the average healthy individual who would perform similar to them on spirometry). Those in the control group received a raw figure for forced expiratory volume at one second (FEV1). Both groups were advised to quit and offered referral to local NHS smoking cessation services.Main outcome measures The primary outcome measure was verified cessation of smoking by salivary cotinine testing 12 months after recruitment. Secondary outcomes were reported changes in daily consumption of cigarettes and identification of new diagnoses of chronic obstructive lung disease.Results Follow-up was 89%. Independently verified quit rates at 12 months in the intervention and control groups, respectively, were 13.6% and 6.4% (difference 7.2%, P=0.005, 95% confidence interval 2.2% to 12.1%; number needed to treat 14). People with worse spirometric lung age were no more likely to have quit than those with normal lung age in either group. Cost per successful quitter was estimated at 280 pound ((euro) 365, $556). A new diagnosis of obstructive lung disease was made in 17% in the intervention group and 14% in the control group; a total of 16% (89/561) of participants.Conclusion Telling smokers their lung age significantly improves the likelihood of them quitting smoking, but the mechanism by which this intervention achieves its effect is unclear.Trial registration National Research Register N0096173751

Generalizing Boolean Satisfiability I: Background and Survey of Existing Work

This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper is a survey of the work underlying ZAP, and discusses previous attempts to improve the performance of the Davis-Putnam-Logemann-Loveland algorithm by exploiting the structure of the problem being solved. We examine existing ideas including extensions of the Boolean language to allow cardinality constraints, pseudo-Boolean representations, symmetry, and a limited form of quantification. While this paper is intended as a survey, our research results are contained in the two subsequent articles, with the theoretical structure of ZAP described in the second paper in this series, and ZAP's implementation described in the third

Generalizing Boolean Satisfiability II: Theory

This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-Loveland inference procedure to this broader setting, and show that earlier computational improvements are either subsumed or left intact by the new method. The third paper in this series discusses ZAPs implementation and presents experimental performance results

Multimegawatt MPD thruster design considerations

Performance and lifetime requirements for multimegawatt magnetoplasmadynamic (MPD) thrusters were used to establish a baseline 2.5 MW thruster design. The chamber surface power deposition resulting from current conduction, plasma and surface radiation, and conduction from the hot plasma was then evaluated to establish the feasibility of thruster operation. It was determined that state of the art lithium heat pipes were adequate to cool the anode electrode, and that the liquid hydrogen propellant could be used to cool the applied field magnet, cathode, and backplate. Unresolved issues having an impact of thruster design are discussed to help focus future research

Truck Driver Training Using Simulation in England

The UK Department for Transport, on behalf of the Road Haulage Modernisation Fund, has established a research programme to determine the potential role of synthetic training in both ab initio license acquisition and also skills development in experienced drivers. TRL and EADS Dornier are commissioning an advanced full-motion-base truck simulator and developing bespoke courseware. The potential benefit of the system will be evaluated through a structured programme of training over 600 drivers. This paper reviews the current legislative framework in the UK and the European Union and discusses potential changes that will impact the training market. The paper then discusses the outline of the research programme and the technical capability of the system being develope

Generalizing Boolean Satisfiability III: Implementation

This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal has been to define a representation in which this structure is apparent and can be exploited to improve computational performance. The first paper surveyed existing work that (knowingly or not) exploited problem structure to improve the performance of satisfiability engines, and the second paper showed that this structure could be understood in terms of groups of permutations acting on individual clauses in any particular Boolean theory. We conclude the series by discussing the techniques needed to implement our ideas, and by reporting on their performance on a variety of problem instances