102,056 research outputs found
Limits on WIMP cross-sections from the NAIAD experiment at the Boulby Underground Laboratory
No full textThe NAIAD experiment (NaI Advanced Detector) for WIMP dark matter searches at the Boulby Underground Laboratory (North Yorkshire, UK) ran from 2000 until 2003. A total of 44.9 kg × years of data collected with 2 encapsulated and 4 unencapsulated NaI(Tl) crystals with high light yield were included in the analysis. We present final results of this analysis carried out using pulse shape discrimination. No signal associated with nuclear recoils from WIMP interactions was observed in any run with any crystal. This allowed us to set upper limits on the WIMP–nucleon spin-independent and WIMP–proton spin-dependent cross-sections. The NAIAD experiment has so far imposed the most stringent constraints on the spin-dependent WIMP–proton cross-section
The Charged Particle Multiplicity at Center of Mass Energies from 900 GeV to 7 TeV Measured with the ATLAS Experiment at the Large Hadron Collider
No full textThe first measurements made by the ATLAS experiment at the LHC are presented. The charged particle multiplicity, its dependence on transverse momentum and pseudorapidity, and the relationship between mean transverse momentum and pseudorapidity are measured for events with at least one charged particle in the kinematic range |η| 500 MeV. The charged particle multiplicity distributions are measured at the three centre of mass energies at which protons have been collided in the LHC: 900 GeV, 2.36 TeV and 7 TeV. The results are compared to predictions from Monte Carlo models of proton-proton collisions. All models predicted a multiplicity at least 10% lower than was measured. They also failed to predict a sufficient increase in the multiplicity when the centre of mass energy increased from 900 GeV to 7 TeV. Updated models have already been produced using these data, which provide a significantly better description of the properties of proton-proton collisions at LHC energies
Bibliographie Hilarion G. Petzold 1958 – 2009 mit Anhang als Einführung
No full textDieses Archiv enthält die Gesamtbibliographie der Werke des Autors nebst einiger Texte „Über H. G. Petzold“ im Schlussteil der Bibliographie sowie einen Anhang mit einer Einführung in die Architektur des Werkes in seinem wissenslogischen Aufbau als Ausarbeitung seines „Tree of Science Modells“ (2007).This archive contains the complete bibliography of the author and some texts about H. G. Petzold, moreover an epilogue with an introduction to the architecture of the works in its epistemological structure and composition and as an elaborations of Petzold’s „Tree of Science Modell (2007).https://www.fpi-publikation.de/polyloge/01-2009-petzold-h-g-gesamtbibliographie-h-g-petzold-1958-2009-updating-november2009/peerReviewedpublishedVersio
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
Recommended from our members
3346: Samuel G. Freedman, author, 2013
No full textPhotograph of author Samuel G. Freedman, at NT Daily Slash meeting in the Mayborn School of Journalism at UNT
The Right to Strike under the United States Constitution: Theory, Practice, and Possible Implications for Canada
No full textAnswering critics of the Canadian Supreme Court's judgment in B.C. Health, the author argues that the Court laid the foundation for a principled and durable doctrine protecting constitutional labour rights, one that goes directly to the heart of the matter — the inequality of workers’ power in the employment relation. In the author’s view, two paths could lead from B.C. Health to the recognition of Charter protec- tion for a right to strike: one that treats the right as an accessory to col- lective bargaining, and one that upholds the right directly on the basis of the Charter values of equality and participation. The author supports the latter approach, contending that constitutional rights should be defined in relation to fundamental values, in a way that is not contingent on time-bound or fact-sensitive assessments about the role of strikes within a particular collective bargaining regime. Although a Charter right to strike may involve the courts in difficult choices about when to defer to legislative policy decisions, and courts may lack the institutional capac- ity to deal effectively with labour law issues, the author points out that judges can look to ILO standards for expert guidance. Noting that the U.S. experience in this area might be of considerable use to Canadians, the author concludes by providing an overview of American case law concerning a constitutional right to strike.Peer reviewe
G-Rank: Unsupervised Continuous Learn-to-Rank for Edge Devices in a P2P Network
No full textRanking algorithms in traditional search engines are powered by enormous training data sets that are meticulously engineered and curated by a centralized entity. Decentralized peer-to-peer (p2p) networks such as torrenting applications and Web3 protocols deliberately eschew centralized databases and computational architectures when designing services and features. As such, robust search-and-rank algorithms designed for such domains must be engineered specifically for decentralized networks, and must be lightweight enough to operate on consumer-grade personal devices such as a smartphone or laptop computer. We introduce G-Rank, an unsupervised ranking algorithm designed exclusively for decentralized networks. We demonstrate that accurate, relevant ranking results can be achieved in fully decentralized networks without any centralized data aggregation, feature engineering, or model training. Furthermore, we show that such results are obtainable with minimal data preprocessing and computational overhead, and can still return highly relevant results even when a user’s device is disconnected from the network. G-Rank is highly modular in design, is not limited to categorical data, and can be implemented in a variety of domains with minimal modification. The results herein show that unsupervised ranking models designed for decentralized p2p networks are not only viable, but worthy of further research.https://github.com/awrgold/G-RankComputer Scienc
- …
