Results 71 to 80 of about 419,100 (266)
A Worst Case Performance Analysis of Approximated Zero Forcing Vectoring for DSL Systems
Information, 2018 In this paper we introduce a Gaussian approximation for the achievable downstream bit rate per user in modern broadband and ultra-broadband digital subscriber loop-based access systems.
Franco Mazzenga, Romeo Giuliano
doaj +1 more source
Zero Forcing Sets and Bipartite Circulants [PDF]
, 2010 In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties.
Meyer, Seth A.
core
On the complexity of the positive semidefinite zero forcing number
Linear Algebra and its Applications, 2016 The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast-mixed searching, which implies some NP-completeness results for the zero forcing problem.
Meagher, Karen +2 more
openaire +3 more sources
Minimum rank and failed zero forcing number of graphs
, 2022 20 pages, 3 ...
Abara, Ma. Nerissa M. +1 more
openaire +2 more sources
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Accurate localization of epileptogenic tubers (ETs) in patients with tuberous sclerosis complex (TSC) is essential but challenging, as these tubers lack distinct pathological or genetic markers to differentiate them from other cortical tubers.
Tinghong Liu +11 more
wiley +1 more source
On the zero forcing number of some Cayley graphs [PDF]
Algebraic structures and their applications, 2017 Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices ...
Vatandoost, Ebrahim +1 more
openaire +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective People with epilepsy (PWE) may experience cognitive deficits but fail to undergo formal evaluation. This study compares cognitive status between PWE and healthy controls in the West African Republic of Guinea. Methods A cross‐sectional, case–control study was conducted in sequential recruitment phases (July 2024–July 2025) at Ignace ...
Maya L. Mastick +14 more
wiley +1 more source
Applying an Ethical Lens to the Treatment of People With Multiple Sclerosis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT The practice of neurology requires an understanding of clinical ethics for decision‐making. In multiple sclerosis (MS) care, there are a wide range of ethical considerations that may arise. These involve shared decision‐making around selection of a disease‐modifying therapy (DMT), risks and benefits of well‐studied medications in comparison to
Methma Udawatta, Farrah J. Mateen
wiley +1 more source
Computing the zero forcing number for generalized Petersen graphs
Journal of Algebra Combinatorics Discrete Structures and Applications, 2020 Let $G$ be a simple undirected graph with each vertex colored either white or black, $ u $ be a black vertex of $ G, $ and exactly one neighbor $ v $ of $ u $ be white. Then change the color of $ v $ to black. When this rule is applied, we say $ u $ forces $ v, $ and write $ u \rightarrow v $. A $zero\ forcing\ set$ of a graph $ G$ is a subset $Z$
Saeedeh RASHİDİ +2 more
openaire +4 more sources