Jeff Tseng
University of Oxford
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Jeff Tseng.
Physical Review D | 2008
De-Chang Dai; E. Rizvi; Jeff Tseng; Dejan Stojkovic; Glenn D. Starkman; C. Issever
We present a comprehensive black-hole event generator, BlackMax, which simulates the experimental signatures of microscopic and Planckian black-hole production and evolution at the LHC in the context of brane world models with low-scale quantum gravity. The generator is based on phenomenologically realistic models free of serious problems that plague low-scale gravity, thus offering more realistic predictions for hadron-hadron colliders. The generator includes all of the black-hole gray-body factors known to date and incorporates the effects of black-hole rotation, splitting between the fermions, nonzero brane tension, and black-hole recoil due to Hawking radiation (although not all simultaneously). The generator can be interfaced with Herwig and Pythia. The main code can be downloaded from http://www-pnp.physics.ox.ac.uk/{approx}issever/BlackMax/blackmax.html.
international parallel and distributed processing symposium | 2005
Laura Gilbert; Jeff Tseng; Rhys A. Newman; Saeed Iqbal; Ronald Pepper; Onur Celebioglu; Jenwei Hsieh; Mark Cobban
The simulations used in the field of high energy physics are compute intensive and exhibit a high level of data parallelism. These features make such simulations ideal candidates for grid computing. We are taking as an example the GEANT4 detector simulation used for physics studies within the ATLAS experiment at CERN. One key issue in grid computing is that of network and system security, which can potentially inhibit the wide spread use of such simulations. Virtualization provides a feasible solution because it allows the creation of virtual compute nodes in both local and remote compute clusters, thus providing an insulating layer which can play an important role in satisfying the security concerns of all parties involved. However, it has performance implications. This study provides quantitative estimates of the virtualization and hyper-threading overhead for GEANT on commodity clusters. Results show that virtualization has less than 15% run-time overhead, and that the best run time (with the non-SMP licence of ESX VMware) is achieved by using one virtual machine per CPU. We also observe that hyper-threading does not provide an advantage in this application. Finally, the effect of virtualization on run-time, throughput, mean response time and utilization is estimated using simulations.
international parallel and distributed processing symposium | 2006
Laura Gilbert; Jeff Tseng; Rhys A. Newman; Saeed Iqbal; Ronald Pepper; Onur Celebioglu; Jenwei Hsieh; Victor Mashayekhi; Mark Cobban
The simulations used in the field of high energy physics are compute intensive and exhibit a high level of data parallelism. These features make such simulations ideal candidates for Grid computing. We are taking as an example the GEANT4 detector simulation used for physics studies within the ATLAS experiment at CERN. One key issue in Grid computing is that of network and system security, which can potentially inhibit the widespread use of such simulations. Virtualization provides a feasible solution because it allows the creation of virtual compute nodes in both local and remote compute clusters, thus providing an insulating layer which can play an important role in satisfying the security concerns of all parties involved. However, it has performance implications. This study provides quantitative estimates of the virtualization and hyper-threading overhead for GEANT on commodity clusters. Results show that virtualization has less than 15% run time overhead, and that the best run time (with the non-SMP license of ESX VMware) is achieved by using one virtual machine per CPU. We also observe that hyper-threading does not provide an advantage in this application. Finally, the effect of virtualization on run time, throughput, mean response time and utilization is estimated using simulations.
Physical Review D | 2013
Jeff Tseng; Hannah Mary Evans
We investigate a new sequential recombination algorithm which effectively subtracts background as it reconstructs the jet. We examine the new algorithms behavior in light of existing algorithms, and we find that in Monte Carlo comparisons, the new algorithms robustness against collision backgrounds is comparable to that of other jet algorithms when the latter have been augmented by further background subtraction techniques.
Journal of Physics G | 2016
B. Todd Huffman; Charles Jackson; Jeff Tseng
We describe a new hit-based
arXiv: High Energy Physics - Phenomenology | 2007
Christopher Dennis; Jeff Tseng; Muge Karagoz; Geraldine Servant
b
arXiv: High Energy Physics - Phenomenology | 2009
De-Chang Dai; E. Rizvi; Jeff Tseng; Dejan Stojkovic; Glenn D. Starkman; C. Issever
-tagging technique for high energy jets and study its performance with a Geant4-based simulation. The technique uses the fact that at sufficiently high energy a B meson or baryon can live long enough to traverse the inner layers of pixel detectors such as those in the ATLAS, ALICE, or CMS experiments prior to decay. By first defining a jet via the calorimeter, and then counting hits within that jet between pixel layers at increasing radii, we show it is possible to identify jets that contain
arXiv: High Energy Physics - Phenomenology | 2013
Jeff Tseng; Hannah Evans
b
arXiv: High Energy Physics - Experiment | 2017
B. Todd Huffman; Jeff Tseng; Thomas Russell
-quarks by detecting a jump in the number of hits. We show that the technique maintains its efficiency at energies beyond the range of conventional