Results 91 to 100 of about 55,028 (193)
An Examination of Task‐Evoked fMRI Data Processing in Functional Connectivity
Journal of Neuroscience Research, Volume 104, Issue 6, June 2026.In this work, we analyzed the preprocessing of task‐fMRI data to explore the contribution of the task information in connectomics towards a methodological consensus for preprocessing among task‐state connectivity studies. We investigated whether a task‐free connectivity can be inferred from task‐fMRI and examined its impact upon a clinical disorder ...
Alice Giubergia +8 more
wiley +1 more source
Strongly pancyclic and dual-pancyclic graphs
, 2009 Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C¯ and every nonspanning cycle C is almost contained in another ...
McKee, Terry
core +1 more source
The feasibility principle in community ecology
Oikos, Volume 2026, Issue 6, June 2026.The structure and function of ecological communities emerge from interactions among populations within specific environmental contexts. Yet we still lack general principles that explain how communities assemble, which patterns we should expect, and when transitions occur across diverse settings.
Serguei Saavedra
wiley +1 more source
Transient Porosity During Fluid‐Mineral Interaction. Part 1: In Situ 4D Tomography
Journal of Geophysical Research: Solid Earth, Volume 131, Issue 6, June 2026.Abstract Fluid‐induced mineral replacement reactions play a key role in controlling porosity generation and permeability evolution in geologic systems. However, the dynamic feedback between pore structure development and fluid transport remains poorly quantified. This study investigates the spatiotemporal evolution of reaction‐induced pore space in the
Hamed Amiri +7 more
wiley +1 more source
ChoCo: a Chord Corpus and a Data Transformation Workflow for Musical Harmony Knowledge Graphs. [PDF]
Sci Data, 2023 de Berardinis J +3 more
europepmc +1 more source
Neighborhood Subtree Intersection Graphs Are Strongly Chordal: A New Proof
, 2002 We give a new proof of a theorem of Tamir that the intersection matrix of two sets of neighborhood subtrees is totally balanced, or equivalently, that neighborhood subtree intersection graphs are strongly ...
Uri N. Peled
core
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
, 1996 Suppose G = (V, E) is a graph in which each maximal clique Ci is associated with an integer ri, where 0 ⩽ ri ⩽ ¦Ci¦. The generalized clique transversal problem is to determine the minimum cardinality of a subset D of V such that ¦D ∩ Ci¦ ⩾ ri for every ...
Maw-Shang, Chang +3 more
core +1 more source
Acta Physiologica, Volume 242, Issue 6, June 2026.ABSTRACT Aims The mechanism of isosmotic water reabsorption in the kidney proximal tubule, with a focus on the interaction between the lateral Na+/K+‐ATPase, apical water pathways mediated by AQP1 and SGLT1, and paracellular water flow through Claudin‐2. Methods A mathematical model of proximal tubular transport was used to compute coupled ion, solute,
Erik Hviid Larsen +1 more
wiley +1 more source
Journal of the American Ceramic Society, Volume 109, Issue 6, June 2026.ABSTRACT This paper presents a comprehensive study on the machining simulation of recrystallized silicon carbide (R‐SiC), with a focus on material failure mechanisms, numerical influences, tool kinematics, and frictional behavior. A representative volume of interest was derived from CT data, and a meshing algorithm for CT‐based structures was ...
Simon Unseld +4 more
wiley +1 more source
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
, 2007 A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo +3 more
core