41,781 research outputs found
B. G. Stephens and friends
No full text"B.G. Stephens D.F. Studeman, J.G. Spiers G.A. Gear C.C. Stirling A.H. Waller E.G. Graham H.M.A.S. Deloraine [1942-1945]"B.G. Stephens, D.F. Studeman, J.G. Spiers, G.A. Gear, C.C. Stirling, A.H. Waller, E.G. Graham, His Majesty's Australian Ship Deloraine [1942-1945]Date:199
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Backdraft: a Lossless Virtual Switch that Prevents the Slow Receiver Problem
No full textVirtual switches, used for end-host networking, drop packets when the receiving application is not fast enough to consume them. This is called the slow receiver problem, and it is important because packet loss hurts tail communication latency and wastes CPU cycles, resulting in application-level performance degradation. Further, solving this problem is challenging because application throughput is highly variable over short timescales as it depends on workload, memory contention, and OS thread scheduling. This paper presents Backdraft, a new lossless virtual switch that addresses the slow receiver problem by combining three new components: (1) Dynamic Per-Flow Queuing (DPFQ) to prevent HOL blocking and provide on-demand memory usage; (2) Doorbell queues to reduce CPU overheads; (3) A new overlay network to avoid congestion spreading. We implemented Backdraft on top of BESS and conducted experiments with real applications on a 100 Gbps cluster with both DCTCP and Homa, a state-of-the-art congestion control scheme. We show that an application with Backdraft can achieve up to 20x lower tail latency at the 99th percentile
THE TRANSITION OF MOLECULAR OXYGEN
No full textAuthor Institution: Research School of Physical Sciences and Engineering, The Australian National University; Molecular Physics Laboratory, SRI InternationalThe origin of the intensity of the transition of molecular oxygen, first observed recently by Eppink et al. [J. Chem. Phys. 108, 1305 (1998).], is discussed. It is shown that the transition borrows its intensity principally from the dipole-allowed transition, through spin-orbit mixing between the and states. Estimated continuum photoabsorption cross sections and discrete oscillator strengths for the system are presented
Observations of Bºs→ψ(2S)η and Bº(s)→ψ(2S)π+π- decays
No full textFirst observations of the B0s
→ψ(2S)η, B0 →ψ(2S)π
+
π
− and B0s
→ψ(2S)π
+
π
− decays are made
using a dataset corresponding to an integrated luminosity of 1.0 fb−1 collected by the LHCb experiment in
proton–proton collisions at a centre-of-mass energy of
√
s = 7 TeV. The ratios of the branching fractions
of each of the ψ(2S) modes with respect to the corresponding J/ψ decays are
B(B0s
→ψ(2S)η)
÷
B(B0s
→J/ψη)
= 0.83± 0.14 (stat)±0.12 (syst) ±0.02 (B),
;
B(B0→ψ(2S)π
+
π
−
)
÷
B(B0→J/ψπ
+
π
−
)
= 0.56± 0.07 (stat)±0.05 (syst)± 0.01 (B),
;
B(B0s
→ψ(2S)π
+
π
−
)
÷
B(B0s
→J/ψπ
+
π
−
)
= 0.34± 0.04 (stat)±0.03 (syst)± 0.01 (B),
where the third uncertainty corresponds to the uncertainties of the dilepton branching fractions of the J/ψ
and ψ(2S) meson decays
The Grothendieck-Cousin complex on G/B x G/B
No full textIn his 1978 paper, The Grothendieck-Cousin complex of an induced representation, G. Kempf computes the Cousin complex corresponding to an induced representation of a reductive algebraic group G. His technique uses the geometry of the homogeneous space G/B, B being a Borel subgroup of G. The complex gives a resolution by B-modules, which easily yields the Weyl character formula.Instead of considering G/B, we analyze the analagous situation for . The Cousin complex corresponding to an induced representation in this case consists of G-modules. We are able to study the terms of the complex by exploiting parallels between the B-action on G/B and the G-action on --there is a natural one-to-one correspondence between the orbits of these actions. Our work here is greatly simplified by reducing to the affine situation and applying the theory of A-G modules. We construct a spectral sequence relating the terms of the complexes. Finally, an application to the theory of D-modules is given.Made available in DSpace on 2011-05-07T12:16:39Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9624402.pdf: 1986051 bytes, checksum: 9df74b5e3a422835a14febe4643a2b31 (MD5)
Previous issue date: 1995Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:39:02Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:16:21-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
G (A, B)-labeling of cacti over groups
No full text© 2016 Author(s). Let G be a group with nonempty subsets A and B. The graph G(A, B) is the simple graph obtained by deleting all loops from the graph whose vertex set is A and where vertices x and y are adjacent if and only if there is a b B such that xb = y or yb = x. In this paper, we present realizations of some cacti as G(A, B)\u27s
Callimachus and the Atthidographers
No full textAfter tracing a history of the modern studies about Atthidography since Wilamowitz, the paper examines the role of some authors of local chronicles devoted to Athens and Attica (Atthidographers) in Callimachus' poetry, especially in the "Aetia" and "Hecale"
Measurement of the ratio of branching fractions B(B0→K∗0γ )/B(B0s→φγ ) and the directCP asymmetry inB 0→K∗0γ
No full textThe ratio of branching fractions of the radiative B decays B0→K⁎0γ and B0s→ϕγ has been measured using an integrated luminosity of 1.0 fb−1 of pp collision data collected by the LHCb experiment at a centre-of-mass energy of s√=7TeV. The value obtained is
B(B0→K⁎0γ)B(B0s→ϕγ)=1.23±0.06(stat.)±0.04(syst.)±0.10(fs/fd),
where the first uncertainty is statistical, the second is the experimental systematic uncertainty and the third is associated with the ratio of fragmentation fractions fs/fd. Using the world average value for B(B0→K⁎0γ), the branching fraction B(B0s→ϕγ) is measured to be (3.5±0.4)×10−5.
The direct CP asymmetry in B0→K⁎0γ decays has also been measured with the same data and found to be
ACP(B0→K⁎0γ)=(0.8±1.7(stat.)±0.9(syst.))%.
Both measurements are the most precise to date and are in agreement with the previous experimental results and theoretical expectations
Search for exclusive b → u transitions in hadronic decays of B mesons involving Ds+ and Ds*+ mesons
No full textcomplete author list:
Alexander J.; Bebek C.; Berkelman K.; Bloom K.; Browder T.; Cassel D.; Cho H.; Coffman D.; Drell P.; Ehrlich R.; Garcia-Sciveres M.; Geiser B.; Gittelman B.; Gray S.; Hartill D.; Heltsley B.; Jones C.; Jones S.; Kandaswamy J.; Katayama N.; Kim P.; Kreinick D.; Ludwig G.; Masui J.; Mevissen J.; Mistry N.; Ng C.; Nordberg E.; Patterson J.; Peterson D.; Riley D.; Salman S.; Sapper M.; Würthwein F.; Avery P.; Freyberger A.; Rodriguez J.; Stephens R.; Yelton J.; Cinabro D.; Henderson S.; Kinoshita K.; Liu T.; Saulnier M.; Wilson R.; Yamamoto H.; Bergfeld T.; Eisenstein B.; Gollin G.; Ong B.; Palmer M.; Selen M.; Thaler J.; Sadoff A.; Ammar R.; Ball S.; Baringer P.; Bean A.; Besson D.; Coppage D.; Copty N.; Davis R.; Hancock N.; Kelly M.; Kwak N.; Lam H.; Kubota Y.; Lattery M.; Nelson J.; Patton S.; Perticone D.; Poling R.; Savinov V.; Schrenk S.; Wang R.; Alam M.; Kim I.; Nemati B.; O'Neill J.; Severini H.; Sun C.; Zoeller M.; Crawford G.; Daubenmier C.; Fulton R.; Fujino D.; Gan K.; Honscheid K.; Kagan H.; Kass R.; Lee J.; Malchow R.; Morrow F.; Skovpen Y.; Sung M.; White C.; Butler F.; Fu X.; Kalbfleisch G.; Ross W.; Skubic P.; Snow J.; Wang P.; Wood M.; Brown D.; Fast J.; McIlwain R.; Miao T.; Miller D.; Modesitt M.; Payne D.; Shibata E.; Shipsey I.; Wang P.; Battle M.; Ernst J.; Kwon Y.; Roberts S.; Thorndike E.; Wang C.; Dominick J.; Lambrecht M.; Sanghera S.; Shelkov V.; Skwarnicki T.; Stroynowski R.; Volobouev I.; Wei G.; Zadorozhny P.; Artuso M.; He D.; Goldberg M.; Horwitz N.; Kennett R.; Mountain R.; Moneti G.; Muheim F.; Mukhin Y.; Playfer S.; Rozen Y.; Stone S.; Thulasidas M.; Vasseur G.; Zhu G.; Bartelt J.; Csorna S.; Egyed Z.; Jain V.; Akerib D.; Barish B.; Chadha M.; Chan S.; Cowen D.; Eigen G.; Miller J.; O'Grady C.; Urheim J.; Weinstein A.; Acosta D.; Athanas M.; Masek G.; Paar H.; Gronberg J.; Kutschke R.; Menary S.; Morrison R.; Nakanishi S.; Nelson H.; Nelson T.; Richman J.; Ryd A.; Tajima H.; Schmidt D.; Sperka D.; Witherell M.; Procario M.; Yang S.; Balest R.; Cho K.; Daoudi M.; Ford W.; Johnson D.; Lingel K.; Lohner M.; Rankin P.; Smith J.; Alexander J.; Alexander J.P
- …
