Results 51 to 60 of about 72,689,119 (258)

Precise determination of the mass of the Higgs boson and tests of compatibility of its couplings with the standard model predictions using proton collisions at 7 and 8$$\,\text {TeV}$$TeV

open access: yesEuropean Physical Journal C: Particles and Fields, 2015
Properties of the Higgs boson with mass near 125$$\,\text {GeV}$$GeV are measured in proton-proton collisions with the CMS experiment at the LHC. Comprehensive sets of production and decay measurements are combined.
V. Khachatryan   +499 more
semanticscholar   +1 more source

Study of the mass and spin-parity of the Higgs boson candidate via its decays to Z boson pairs. [PDF]

open access: yesPhysical Review Letters, 2012
A study is presented of the mass and spin-parity of the new boson recently observed at the LHC at a mass near 125 GeV. An integrated luminosity of 17.3 fb(-1), collected by the CMS experiment in proton-proton collisions at center-of-mass energies of 7 ...
S. Chatrchyan   +499 more
semanticscholar   +1 more source

Design, synthesis of imidazole scaffolds as an effective larvicidal agent against Etiella zinkenella and in vitro antibacterial and antifungal evaluation against Candida albicans with DFT calculations, molecular docking technique and theoretical biological potential

open access: yesResults in Chemistry
In this paper we have reported synthesis evaluation imidazole by solvent free multi component scaffolds (NEAT Reaction) by simple and very effective protocol. The characterization of compounds by 1H NMR, 13C NMR, Mass and IR spectral studies confirms the
Ankita M. Rayate   +7 more
doaj   +1 more source

Generalized 4-connectivity of hierarchical star networks

open access: yesOpen Mathematics, 2022
The connectivity is an important measurement for the fault-tolerance of a network. The generalized connectivity is a natural generalization of the classical connectivity. An SS-tree of a connected graph GG is a tree T=(V′,E′)T=\left(V^{\prime} ,E^{\prime}
Wang Junzhen, Zou Jinyu, Zhang Shumin
doaj   +1 more source

Recognizing Trees From Incomplete Decks

open access: yesJournal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.
ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley   +1 more source

Measurement of the properties of a Higgs boson in the four-lepton final state

open access: yes, 2014
Austrian Federal Ministry of Science and Research and the Austrian Science Fund; the Belgian Fonds de la Recherche Scientifique and Fonds voor Wetenschappelijk Onderzoek; the Brazilian Funding Agencies (CNPq, CAPES, FAPERJ, and FAPESP); the Bulgarian ...
S. Chatrchyan   +499 more
semanticscholar   +1 more source

Human γδ TCR Repertoires in Health and Disease

open access: yesCells, 2020
The T cell receptor (TCR) repertoires of γδ T cells are very different to those of αβ T cells. While the theoretical TCR repertoire diversity of γδ T cells is estimated to exceed the diversity of αβ T cells by far,
Alina Suzann Fichtner   +2 more
doaj   +1 more source

Packing Paths in Sparse Random Graphs

open access: yesRandom Structures &Algorithms, Volume 67, Issue 1, August 2025.
ABSTRACT We consider an algorithmic problem on the Erdős–Rényi random graph G∼G(n,p)$$ G\sim G\left(n,p\right) $$ with p=(1+ε)/n$$ p=\left(1+\varepsilon \right)/n $$ for some fixed constant ε>0$$ \varepsilon >0 $$. At the start of the algorithm, it is not disclosed which pairs of vertices are adjacent or not. In each step of the algorithm, we can query
Vesna Iršič Chenoweth   +2 more
wiley   +1 more source

Effects of Poly-Si Grain Boundary on Retention Characteristics under Cross-Temperature Conditions in 3-D NAND Flash Memory

open access: yesMicromachines, 2023
Electrical characteristics with various program temperatures (TPGM) in three-dimensional (3-D) NAND flash memory are investigated. The cross-temperature conditions of the TPGM up to 120 °C and the read temperature (TREAD) at 30 °C are used to analyze the
Ukju An   +6 more
doaj   +1 more source

THEORETICAL A‐GRAMMATISM: THE CASE FOR AN ELIMINATIVIST MINIMALISM

open access: yesStudia Linguistica, Volume 79, Issue 1, Page 62-90, April 2025.
Abstract This paper explores patterns of cross‐linguistic, intra‐linguistic and individual variation in the acceptability of sentences with extraction from islands, a classic object of attention of generative grammar. It asks which “competence” concept better fits the presented data.
Claudia Pañeda, Guillermo Lorenzo
wiley   +1 more source

Home - About - Disclaimer - Privacy