21. |
Clopper-Pearson bounds from HEP data cuts |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 104-106
B. A. Berg,
Preview
|
PDF (286KB)
|
|
摘要:
For the measurement ofNssignals inNevents rigorous confidence bounds on the true signal probabilitypexactwere established in a classical paper by Clopper and Pearson [Biometrica 26, 404 (1934)]. Here, their bounds are generalized to the HEP situation where cuts on the data tag signals with probabilityPsand background data with likelihoodPb<Ps.In particular, the method may be of interest in connection with the statistical analysis part of the ongoing Higgs search at the LEP experiments. The relevant Fortran code is available on the web. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405275
出版商:AIP
年代:1901
数据来源: AIP
|
22. |
Experimenting with rule induction algorithms in HEP data analysis |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 107-109
N. Stepanov,
Preview
|
PDF (372KB)
|
|
摘要:
The simple prototype rule induction system for the HEP analysis applications is presented. The feasibility of the approach is demonstrated on the benchmark classification task taken from the LHC physics. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405276
出版商:AIP
年代:1901
数据来源: AIP
|
23. |
Looking for instanton-induced processes at HERA using a multivariate technique based on range searching |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 110-112
T. Carli,
B. Koblitz,
Preview
|
PDF (312KB)
|
|
摘要:
We present a method to discriminate instanton-induced processes from standard DIS background based on Range Searching. This method offers fast and automatic scanning of a large number of variables for a combination of variables giving high signal to background ratio and the smallest theoretical and experimental uncertainties. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405277
出版商:AIP
年代:1901
数据来源: AIP
|
24. |
A self-organizing neural network for job scheduling in distributed systems |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 113-115
Harvey B. Newman,
Iosif C. Legrand,
Preview
|
PDF (456KB)
|
|
摘要:
The aim of this work is to describe a possible approach for the optimization of the job scheduling in large distributed systems, based on a self-organizing Neural Network. This dynamic scheduling system should be seen as adaptive middle layer software, aware of current available resources and making the scheduling decisions using the “past experience.” It aims to optimize job specific parameters as well as the resource utilization. The scheduling system is able to dynamically learn and cluster information in a large dimensional parameter space and at the same time to explore new regions in the parameters space. This self-organizing scheduling system may offer a possible solution to provide an effective use of resources for the off-line data processing jobs for future HEP experiments. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405278
出版商:AIP
年代:1901
数据来源: AIP
|
25. |
Tailorable software architectures in the accelerator control system environment |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 119-121
Igor Mejuev,
Akira Kumagai,
Eiichi Kadokura,
Preview
|
PDF (414KB)
|
|
摘要:
Tailoring is further evolution of an application after deployment in order to adapt it to requirements that were not accounted for in the original design. End-user tailorability has been extensively researched in applied computer science from HCl and software engineering perspectives. Tailorability allows coping with flexibility requirements, decreasing maintenance and development costs of software products. In general, dynamic or diverse software requirements constitute the need for implementing end-user tailorability in computer systems. In accelerator physics research the factor of dynamic requirements is especially important, due to frequent software and hardware modifications resulting in correspondingly high upgrade and maintenance costs. In this work we introduce the results of feasibility study on implementing end-user tailorability in the software for accelerator control system, considering the design and implementation of distributed monitoring application for 12 GeV KEK Proton Synchrotron as an example. The software prototypes used in this work are based on a generic tailoring platform (VEDICI), which allows decoupling of tailoring interfaces and runtime components. While representing a reusable application-independent framework, VEDICI can be potentially applied for tailoring of arbitrary compositional Web-based applications. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405279
出版商:AIP
年代:1901
数据来源: AIP
|
26. |
Online modeling of the Fermilab accelerators |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 122-124
Elliott S. McCrory,
Leo Michelotti,
Jean-Francois Ostiguy,
Preview
|
PDF (761KB)
|
|
摘要:
We have implemented access to beam physics models of the Fermilab accelerators and beamlines through the Fermilab control system. The models run on Unix workstations, communicating with legacy controls software through a front end redirection mechanism (the open access server), a relational database and a simple text-based protocol over TCP/IP. The clients and the server are implemented in object-oriented C++. We discuss limitations of our approach and the difficulties that arise from it. Some of the obstacles may be overcome by introducing a new layer of abstraction. To maintain compatibility with the next generation of accelerator control software currently under development at the laboratory, this layer would be implemented in Java. We discuss the implications of that choice. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405280
出版商:AIP
年代:1901
数据来源: AIP
|
27. |
A Beamline Matching application based on open source software |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 125-127
J.-F. Ostiguy,
Preview
|
PDF (444KB)
|
|
摘要:
An interactive Beamline Matching application has been developed using beamline and automatic differentiation class libraries. Various freely available components were used; in particular, the user interface is based on FLTK, a C++ toolkit distributed under the terms of the GNU Public License (GPL). The result is an application that compiles without modifications under both X-Windows and Win32 and offers the same look and feel under both operating environments. In this paper, we discuss some of the practical issues that were confronted and the choices that were made. In particular, we discuss object-based event propagation mechanisms, multithreading, language mixing and persistence. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405281
出版商:AIP
年代:1901
数据来源: AIP
|
28. |
Sleuth: A quasi-model-independent search strategy for new highpTphysics |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 128-129
B. Knuteson,
Preview
|
PDF (212KB)
|
|
摘要:
We present a quasi-model-independent search for the physics responsible for electroweak symmetry breaking. We define final states to be studied, and construct a rule that identifies a set of relevant variables for any particular final state. A new algorithm (“Sleuth”) searches for regions of excess in those variables and quantifies the significance of any detected excess. After demonstrating the sensitivity of the method, we apply it to the semi-inclusive channele&mgr;Xcollected in 108 pb−1ofpp¯collisions ats=1.8&hthinsp;TeVat the DO&slash; experiment during 1992–1996 at the Fermilab Tevatron. We find no evidence of new highpTphysics in this sample. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405282
出版商:AIP
年代:1901
数据来源: AIP
|
29. |
Fast tracking in hadron collider experiments |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 130-132
Nikos Konstantinidis,
Hans Drevermann,
Preview
|
PDF (454KB)
|
|
摘要:
We present two algorithms that, when used sequentially, can reduce the combinatorics before any track reconstruction in the high occupancy tracking environments of future hadron collider experiments. The first algorithm finds the z-position of the primary physics interaction; the second selects groups of hits consistent with tracks coming from this z-position, rejecting most pile-up/noise/ghost hits. We demonstrate with examples of simulated events from ATLAS at the LHC that the algorithms are flexible, robust and efficient and at the same time fast enough to be used at the second level trigger for filtering the data before applying any tracking algorithms. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405283
出版商:AIP
年代:1901
数据来源: AIP
|
30. |
More performance results and implementation of an object oriented track reconstruction model in different OO frameworks |
|
AIP Conference Proceedings,
Volume 583,
Issue 1,
1901,
Page 133-136
Irwin Gaines,
Sijin Qian,
Preview
|
PDF (343KB)
|
|
摘要:
This is an update of the report about an Object Oriented (OO) track reconstruction model, which was presented in the previous AIHENP'99 at Crete, Greece. The OO model for the Kalman filtering method has been designed for high energy physics experiments at high luminosity hadron colliders. It has been coded in the C++ programming language and successfully implemented into a few different OO computing environments of the CMS and ATLAS experiments at the future Large Hadron Collider at CERN. We shall report: (1) more performance result: (2) implementing the OO model into the new SW OO framework “Athena” of ATLAS experiment and some upgrades of the OO model itself. ©2001 American Institute of Physics.
ISSN:0094-243X
DOI:10.1063/1.1405284
出版商:AIP
年代:1901
数据来源: AIP
|