Results 171 to 180 of about 1,850 (259)
The impact of multiple representations on students' understanding of vector field concepts: Implementation of simulations and sketching activities into lecture-based recitations in undergraduate physics. [PDF]
Front PsycholHahn L, Klein P.
europepmc +1 more source
Journal of Applied Philosophy, EarlyView.ABSTRACT Philosophical accounts of long‐term goals focus predominantly on the rationality of perseverance, examining when agents should persist despite evidence of failure. Arguably, these accounts consider that giving up is devoid of value. Conversely, this article argues that giving up has a different epistemic function: generating information about ...
Mario I. Juarez‐Garcia
wiley +1 more source
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
On a Clique‐Building Game of Erdős
Journal of Graph Theory, EarlyView.ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
Spontaneous Epidural Haematoma and Sigmoid Sinus Thrombosis due to Pyogenic Mastoiditis in Children: A Case Report. [PDF]
Case Rep Infect DisFermeli D +8 more
europepmc +1 more source
Linear Versus Centred Colouring via Pseudogrids
Journal of Graph Theory, EarlyView.ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose +4 more
wiley +1 more source
Robust Low-Complexity WMMSE Precoding Under Imperfect CSI with Per-Antenna Power Constraints. [PDF]
Sensors (Basel)Guo Z, Sen V, Deng H.
europepmc +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT In this paper we define a degree for ends of infinite digraphs. The well‐definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree.
Matthias Hamann, Karl Heuer
wiley +1 more source
HyperGen: Compact and Efficient Genome Sketching using Hyperdimensional Vectors. [PDF]
BioinformaticsXu W, Hsu PK, Moshiri N, Yu S, Rosing T.
europepmc +1 more source
Journal of Magnetic Resonance Imaging, EarlyView.ABSTRACT Background Motion can degrade image quality during Ultrashort Time‐to‐Echo (UTE) pulmonary MRI and is particularly prevalent in patients with lung disease. Comprehensive assessment of the impact of motion compensation techniques on image quality and clinical interpretation is needed.
Abhilash S. Kizhakke Puliyakote +9 more
wiley +1 more source