Results 71 to 80 of about 409,696 (282)

Association of Corticospinal Tract Asymmetry With Ambulatory Ability After Intracerebral Hemorrhage

open access: yesAnnals 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   +25 more
wiley   +1 more source

Asymptotic RZF cooperative beamforming algorithm based on energy efficiency

open access: yesTongxin xuebao, 2019
A low complexity asymptotic regularized zero forcing cooperative beamforming algorithm based on energy efficiency in heterogeneous massive MIMO system was proposed,aiming at the problem that the current multi-flow regularization zero forcing beamforming ...
Yinghui ZHANG   +3 more
doaj   +2 more sources

Privacy Profiles and Amplification by Subsampling

open access: yesThe Journal of Privacy and Confidentiality, 2020
Differential privacy provides a robust quantifiable methodology to measure and control the privacy leakage of data analysis algorithms. A fundamental insight is that by forcing algorithms to be randomized, their privacy leakage can be characterized by ...
Borja Balle   +2 more
doaj   +1 more source

2-distance Zero Forcing Sets in Graphs

open access: yesEuropean Journal of Pure and Applied Mathematics
In this paper, we introduce new concept in graph theory called 2-distance zero forcing. We give some properties of this new parameter and investigate its connections with other parameters such as zero forcing and hop domination. We show that 2-distance zero forcing and hop domination (respectively, zero forcing parameter) are incomparable. Moreover, we
Javier Hassan   +2 more
openaire   +1 more source

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals 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

Optimal Power Control and Load Balancing for Uplink Cell-Free Multi-User Massive MIMO

open access: yesIEEE Access, 2018
In this paper, we consider the problem of power control and load balancing in the uplink of the cell-free (CF) multi-user (MU) massive multiple-input multiple-output system.
Tien Hoa Nguyen   +3 more
doaj   +1 more source

Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs

open access: yes, 2019
This paper presents new complexity and non-approximation results concerning two color propagation problems, namely Power Edge Set and Zero Forcing Set. We focus on cubic graphs, exploiting their structural properties to improve and refine previous results.
Cazals, Pierre   +4 more
openaire   +2 more sources

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

open access: yesAnnals 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

Exploring the influence of graph operations on zero forcing sets

open access: yesDiscrete Mathematics
Zero forcing in graphs is a coloring process where a colored vertex can force its unique uncolored neighbor to be colored. A zero forcing set is a set of initially colored vertices capable of eventually coloring all vertices of the graph. In this paper, we focus on the numbers $z(G; i)$, which is the number of zero forcing sets of size $i$ of the graph
Menon, Krishna, Singh, Anurag
openaire   +3 more sources

Zero Forcing sets and Power Dominating sets of cardinality at most 2

open access: yes, 2019
Let $S$ be a set of vertices of a graph $G$. Let $cl(S)$ be the set of vertices built from $S$, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in $cl(S)$, then the remaining neighbor is also in $cl(S)$. A set $S$ is called a zero forcing set of $G$ if $cl(S)=V(G)$.
Shahbaznejad, Najibeh   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy