排序方式: 共有30条查询结果,搜索用时 15 毫秒
1.
Kochocki JA Allison WW Alner GJ Ambats I Ayres DS Balka LJ Barr GD Barrett WL Benjamin D Border P Brooks CB Cobb JH Cockerill DJ Coover K Courant H Dahlin B DasGupta U Dawson JW Edwards VW Fields TH Kirby-Gallagher LM Garcia-Garcia C Giles RH Goodman MC Heller K Heppelman S Hill N Hoftiezer JH Jankowski DJ Johns K Joyce T Kafka T Litchfield PJ Lopez FV Lowe M Mann WA Marshak ML May EN McMaster L Milburn RH Miller W Napier A Oliver WP Pearce GF Perkins DH Peterson EA Price LE Roback D Rosen DB 《Physical review D: Particles and fields》1990,42(9):2967-2973
2.
3.
M. Derrick D. Krakauer S. Magill B. Musgrave J. Repond J. Schlereth R. Stanek R. L. Talaga J. Thron F. Arzarello et al. 《Zeitschrift fur Physik C Particles and Fields》1995,65(3):379-398
The ZEUS detector has been used to measure the proton structure functionF
2. During 1993 HERA collided 26.7 GeV electrons on 820 GeV protons. The data sample corresponds to an integrated luminosity of 0.54 pb–1, representing a twenty fold increase in statistics compared to that of 1992. Results are presented for 7Q
2<>4 GeV2 andx values as low as 3×10–4. The rapid rise inF
2 asx decreases observed previously is now studied in greater detail and persists forQ
2 values up to 500 GeV2.supported by Worldlab, Lausanne, Switzerland 相似文献
4.
W. J. Thron 《Mathematische Zeitschrift》1958,70(1):310-344
Ohne ZusammenfassungThis research was supported by the United States Air Force under Contract No. AF 49 (638)-100 monitored by the AF Office of Scientific Research of the Air Research and Development Command. 相似文献
5.
6.
The adaptable chromatic number of a multigraph G, denoted χa(G), is the smallest integer k such that every edge labeling, τ, of G from [k] = {1, 2, …, k} permits a vertex coloring, σ, of G from [k] such that no edge e = uv has τ(e) = σ(u) = σ(v). Hell and Zhu proved that for any multigraph G with maximum degree Δ, the adaptable chromatic number is at most . We strengthen this to the asymptotically best possible bound of for any ?>0. © 2012 Wiley Periodicals, Inc. J Graph Theory 相似文献
7.
W. J. Thron 《Numerical Algorithms》1992,3(1):441-450
We show that if a function bounded in the unit disk gives rise to a limit periodic Schur algorithm with ||=1, d
n
,< then the function can be continued analytically to a meromorphic function in the entire plane except, possibly, for an essential singularity at z=–1. The lpS provides a very good approximation to the function.This research was supported in part by the US National Science Foundation under Grant DMS-9103141. 相似文献
8.
Longley NP Bode CR Border PM Courant H DeMuth DM Gray RN Johns K Kasahara SM Lowe MJ Marshak ML Miller WH Mualem L Peterson EA Roback DM Ruddick K Schmid DJ Schub MH Shupe MA Vassiliev V Villaume G Werkema SJ Ayres DS Fields TH Gallagher HM Goodman MC Lopez FV May EN Price LE Seidlein RV Thron JL Trost H Uretsky JL Allison WW Barr GD Brooks CB Cobb JH Giller GL Stassinakis A Thomson MA West N Wielgosz U Alner GJ Cockerill DJ Cotton RJ Garcia-Garcia C Litchfield PJ Pearce GF Ewen B Kafka T 《Physical review D: Particles and fields》1995,52(5):2760-2765
9.
10.