Results 71 to 80 of about 446,887 (277)

Total Forcing and Zero Forcing in Claw-Free Cubic Graphs [PDF]

Graphs and Combinatorics, 2018
A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interval, a colored vertex with exactly one non-colored neighbor forces this non-colored neighbor to be colored.
Davila, Randy, Henning, Michael A.
openaire   +3 more sources

Prediction of Myasthenia Gravis Worsening: A Machine Learning Algorithm Using Wearables and Patient‐Reported Measures

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Myasthenia gravis (MG) is a rare disorder characterized by fluctuating muscle weakness with potential life‐threatening crises. Timely interventions may be delayed by limited access to care and fragmented documentation. Our objective was to develop predictive algorithms for MG deterioration using multimodal telemedicine data ...
Maike Stein, Haoqi Sun, Sophie Lehnerer, Lea Gerischer, Maximilian Mönch, Christian Meisel, Andreas Meisel, Pushpa Narayanaswami   +7 more
wiley   +1 more source

Performance analysis of linear precoders with imperfect channel covariance information for multicell system

The Journal of Engineering, 2020
Comparison and analysis of the regularised zero forcing precoder, rapid numerical algorithms-based precoder and the truncated polynomial expansion-based precoder are done for massive multiple-input multiple-output wireless system for multicell scenario ...
Emmanuel Mukubwa, Oludare A. Sokoya
doaj   +1 more source

Association of Corticospinal Tract Asymmetry With Ambulatory Ability After Intracerebral Hemorrhage

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Ambulatory ability after intracerebral hemorrhage (ICH) is important to patients. We tested whether asymmetry between ipsi‐ and contra‐lesional corticospinal tracts (CSTs) assessed by diffusion tensor imaging (DTI) is associated with post‐ICH ambulation.
Yasmin N. Aziz, Carl D. Langefeld, Mary E. Comeau, Miranda C. Marion, Tyler P. Behymer, Lee A. Gilkerson, Padmini Sekar, Weihong Yuan, Vivek Khandwala, Brady J. Williamson, Thomas Maloney, Achala Vagal, Pierce Boyne, Kari Dunning, Matthew L. Flaherty, Steven J. Kittner, Prachi Mehndiratta, Gunjan Y. Parikh, Michael L. James, David Roh, Fernando D. Testai, Farhaan S. Vahidy, James Thornton, Ranjit Bagga, Daniel Woo, Stacie L. Demel   +25 more
wiley   +1 more source

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, Isabella Dallasta, Ciaran Stone, Sophia Girgenti, Neda Gould, Rafael H. Llinas, Jonathan Z. Simon, Elisabeth Breese Marsh   +7 more
wiley   +1 more source

On the -forcing number: computational approach and exact values

Journal of Physics: Complexity
Zero forcing is a graph coloring process that is used to model spreading phenomena in real-world scenarios. It can also be viewed as a single-player combinatorial game on a graph, where the player’s goal is to select a subset of vertices of minimum ...
Aida Abiad, Maryam Moghaddas
doaj   +1 more source

Some product graphs with power dominating number at most 2

AKCE International Journal of Graphs and Combinatorics, 2021
Let S be a set of vertices of a graph G. Let be the set of vertices built from the closed neighborhood of S, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in then the remaining neighbor ...
Najibeh Shahbaznejad, Adel P. Kazemi, Ignacio M. Pelayo   +2 more
doaj   +1 more source

Zero Forcing in Claw-Free Cubic Graphs [PDF]

Bulletin of the Malaysian Mathematical Sciences Society, 2018
The zero forcing number of a simple graph, written $Z(G)$, is a NP-hard graph invariant which is the result of the zero forcing color change rule. This graph invariant has been heavily studied by linear algebraists, physicists, and graph theorist. It's broad applicability and interesting combinatorial properties have attracted the attention of many ...
Davila, Randy, Henning, Michael A.
openaire   +2 more sources

Predicting Epileptogenic Tubers in Patients With Tuberous Sclerosis Complex Using a Fusion Model Integrating Lesion Network Mapping and Machine Learning

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, Qi Wang, Suhui Kuang, Dezhi Cao, Ping Ding, Shaohui Zhang, Haihua Wei, Zhirong Wei, Jinshan Xu, Xinyu Huang, Bing Liu, Shuli Liang   +11 more
wiley   +1 more source

Recognizable Languages of k-Forcing Automata

Mathematical and Computational Applications
In this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs.
Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour, Manuel De la Sen   +3 more
doaj   +1 more source