Results 41 to 50 of about 39,180 (264)

Arterial Spin‐Labeling MRI at the Cortical‐CSF Interface: A Novel Biomarker in Alzheimer Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background/Objective Arterial spin‐labeling (ASL) MRI can measure perfusion signal adjacent to CSF spaces and may provide information regarding CSF‐adjacent water transport physiology. We developed an automated pipeline to extract cortical‐CSF interface (IF) perfusion for comparison between Alzheimer disease (AD) and cognitively normal ...
Mona Asghariahmadabad   +22 more
wiley   +1 more source

On the number of perfect matchings in random polygonal chains

open access: yesOpen Mathematics, 2023
Let GG be a graph. A perfect matching of GG is a regular spanning subgraph of degree one. Enumeration of perfect matchings of a (molecule) graph is interest in chemistry, physics, and mathematics.
Wei Shouliu   +3 more
doaj   +1 more source

Critical perfect graphs and perfect 3-chromatic graphs

open access: yesJournal of Combinatorial Theory, Series B, 1977
AbstractThis paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.
openaire   +2 more sources

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

open access: yesAdvanced Engineering Materials, EarlyView.
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice   +2 more
wiley   +1 more source

Perfect secure domination in graphs [PDF]

open access: yesCategories and General Algebraic Structures with Applications, 2017
Let $G=(V,E)$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus  S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that
S.V. Divya Rashmi   +3 more
doaj  

A Numerical–Experimental Approach for Multi‐Matrix Fiber‐Reinforced Plastics Characterization Using Finite Element Model Updating

open access: yesAdvanced Engineering Materials, EarlyView.
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora   +4 more
wiley   +1 more source

Decomposition of perfect graphs

open access: yesJournal of Combinatorial Theory, Series B, 1987
In this paper we describe general composition and decomposition schemes for perfect graphs, which covers almost all recent results in this area, e.g. the amalgam and the 2-amalgam split. Our approach is based on the consideration of induced cycles and their complements in perfect graphs (as opposed to the consideration of cycles for defining ...
openaire   +2 more sources

Is an Apple an Orange? A Large Language Model Benchmark for Candidate Term Extraction and Subclass Decisions Against Upper Ontologies in Engineering and Materials Science

open access: yesAdvanced Engineering Materials, EarlyView.
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch   +3 more
wiley   +1 more source

Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019
In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj   +1 more source

Recycling of NiTi Shape Memory Alloys: Fundamental and Technological Aspects of a Vacuum Induction Melting Processing Route

open access: yesAdvanced Engineering Materials, EarlyView.
The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy