Results 31 to 40 of about 612 (219)
SPG4 and Dementia: Expanding the Clinical Spectrum
ABSTRACT Objective Hereditary spastic paraplegia (HSP) is a group of disorders characterized by progressive spasticity and lower limb weakness, with mutations in SPG4/SPAST being the most common cause. Detailed studies and clinical and molecular comparisons across different populations are missing.
Emanuele Panza +19 more
wiley +1 more source
A linear time algorithm to compute vertices that belong to all, some and no minimum dominating sets in a tree and its consequences [PDF]
We provide a linear time algorithm for determining the sets of vertices that belong to all, some and no minimum dominating sets of a tree, respectively, thus improving the quadratic time algorithm of Benecke and Mynhardt in 2008 [S.
Radosław Ziemann, Paweł Żyliński
doaj +1 more source
ABSTRACT Objectives Focal cortical dysplasia (FCD) is the most common etiology of drug‐resistant epilepsy in children. Focal to bilateral tonic–clonic seizures (FBTCS) mark a high risk of drug‐resistant epilepsy and involve thalamocortical circuitry in their generation and propagation.
Hua Xie +8 more
wiley +1 more source
Domination parameters of a graph with added vertex [PDF]
Let \(G=(V,E)\) be a graph. A subset \(D\subseteq V\) is a total dominating set of \(G\) if for every vertex \(y\in V\) there is a vertex \(x\in D\) with \(xy\in E\).
Maciej Zwierzchowski
doaj
Towards Defect Phase Diagrams: From Research Data Management to Automated Workflows
A research data management infrastructure is presented for the systematic integration of heterogeneous experimental and simulation data required for defect phase diagrams. The approach combines openBIS with a companion application for large‐object storage, automated metadata extraction, provenance tracking and federated data access, thereby supporting ...
Khalil Rejiba +5 more
wiley +1 more source
Review of Methods and Algorithms for Modelling Transportation Networks Based on Graph Theory
One of the best ways of modelling a transport network is to use a graph with vertices and edges. They represent nodes and arcs of such network respectively.
S. Guze
doaj +1 more source
Characterization of double domination subdivision number of trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maryam Atapour +2 more
openaire +1 more source
Multimodal Data‐Driven Microstructure Characterization
A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Weakly connected domination subdivision numbers
A set D of vertices in a graph G = (V, E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G.
openaire +1 more source
Optimization of the Production of Rubber Compounds Using Mathematical Models
Rubber compounds were mixed in a batch internal mixer, and symbolic regression was used to derive mathematical models linking recipe and process parameters to ram path, torque, and mixing quality (incorporation, dispersion, distribution). Subsequent optimization with evolutionary algorithms identified operating conditions that reduce specific energy ...
Anke Bardehle +7 more
wiley +1 more source

