Results 11 to 20 of about 45,347 (259)

The hidden risk of round numbers and sharp thresholds in clinical practice [PDF]

open access: yesnpj Digital Medicine
Clinical decision-making often simplifies continuous risk data into discrete levels using round-number thresholds. These simplifications can distort risk assessments.
Benjamin J. Lengerich   +3 more
doaj   +2 more sources

Sharp thresholds for Ramsey properties

open access: yesForum of Mathematics, Sigma
In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as noncolourability of auxiliary hypergraphs.
Ehud Friedgut   +3 more
doaj   +3 more sources

Sharp entanglement thresholds in the logarithmic negativity of disjoint blocks in the transverse-field Ising chain

open access: yesNew Journal of Physics, 2018
Entanglement has developed into an essential concept for the characterization of phases and phase transitions in ground states of quantum many-body systems. In this work we use the logarithmic negativity to study the spatial entanglement structure in the
Younes Javanmard   +4 more
doaj   +2 more sources

Coding of mechanical pain by myelinated and unmyelinated nociceptors in human hairy skin [PDF]

open access: yesPAIN Reports
. Introduction:. In humans, cutaneous Aβ afferents are traditionally linked to discriminative touch, while pain is attributed to Aδ and C fibers. However, we previously identified thickly myelinated high-threshold mechanoreceptors (Aβ-HTMRs) that encode ...
Otmane Bouchatta   +9 more
doaj   +2 more sources

Ultraviolet B Treatment of the Forearm Alters Supraspinal Nociceptive Processing [PDF]

open access: yesPain Research and Management
Exposing the skin to high levels of ultraviolet B (UVB) radiation induces an inflammatory response that upregulates local nociceptive processing; this, in turn, facilitates protective responses to limit further injury.
Peter D. Drummond   +2 more
doaj   +2 more sources

Sensory Recovery After Free Muscle Flap Reconstruction—A Clinical Study of Protective and Discriminative Function of Free Gracilis and Latissimus Dorsi Muscle Flaps Without Neurotization [PDF]

open access: yesMedical Sciences
Background/Objectives: Free gracilis (GM) and latissimus dorsi muscle (LDM) flaps are reliable options for complex defect coverage, but long-term sensory outcomes remain underexplored.
Maximilian C. Stumpfe   +8 more
doaj   +2 more sources

Sharp threshold results for computational complexity [PDF]

open access: yesProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
We establish several “sharp threshold” results for computational complexity. For certain tasks, we can prove a resource lower bound of n c for c ≥ 1 (or obtain an efficient circuit-analysis algorithm for n c size), there is strong intuition that a similar result can be proved for larger functions of n, yet we can also prove that replacing “n c ...
Lijie Chen 0001   +2 more
openaire   +3 more sources

Sharp Thresholds in Random Simple Temporal Graphs [PDF]

open access: yesSIAM Journal on Computing, 2022
A graph whose edges only appear at certain points in time is called a temporal graph (among other names). Such a graph is temporally connected if each ordered pair of vertices is connected by a path which traverses edges in chronological order (i.e., a temporal path).
Arnaud Casteigts   +3 more
openaire   +3 more sources

A Sharp Threshold Phenomenon in String Graphs [PDF]

open access: yesDiscrete & Computational Geometry, 2021
AbstractA string graph is the intersection graph of curves in the plane. We prove that for every $$\epsilon >0$$ ϵ > 0 , if G is a string graph with n vertices such that the edge density of G is below $${1}/{4}-\epsilon $$
openaire   +4 more sources

A sharp threshold in proof complexity [PDF]

open access: yesProceedings of the thirty-third annual ACM symposium on Theory of computing, 2001
We give the first example of a sharp threshold in proof complexity. More precisely, we show that for any sufficiently small e>0 and Δ>2.28, random formulas consisting of (1-e)n 2-clauses and &Dgr n 3-clauses, which are known to be unsatisfiable almost certainly, almost certainly require resolution and Davis-Putnam proofs of unsatisfiability of ...
Dimitris Achlioptas   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy