Results 61 to 70 of about 42,601 (304)
Data Recovery in Wireless Sensor Networks Based on Low Rank and Short-Term Stability
IEEE Access, 2019 The most effective way to reduce the energy consumption of energy-limited wireless sensor networks is to reduce the amount of data collected. However, this will increase the difficulty of data recovery.
Xiaochao Liu +3 more
doaj +1 more source
The nonsingular matrix completion problem
International Journal of Contemporary Mathematical Sciences, 2007 An n × n matrix is called a principally nonsingular matrix (NSmatrix) if all its principal minors are different from zero and it is called a totally nonsingular matrix (TNS-matrix) if all its minors are different from zero. In this paper, we are interested in the NS-matrix (TNSmatrix) completion problem: whether a partial NS-matrix (TNS-matrix) has a ...
J. R. Torregrosa +2 more
openaire +1 more source
Protocol for quantifying miRNA trafficking across the endosomal membrane
FEBS Open Bio, EarlyView.An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh +2 more
wiley +1 more source
A computational approach to aid clinicians in selecting anti-viral drugs for COVID-19 trials
Scientific Reports, 2021 The year 2020 witnessed a heavy death toll due to COVID-19, calling for a global emergency. The continuous ongoing research and clinical trials paved the way for vaccines.
Aanchal Mongia +3 more
doaj +1 more source
A matrix completion approach to linear index coding problem [PDF]
2014 IEEE Information Theory Workshop (ITW 2014), 2014 In this paper, a general algorithm is proposed for rate analysis and code design of linear index coding problems. Specifically a solution for minimum rank matrix completion problem over finite fields representing the linear index coding problem is devised in order to find the optimum transmission rate given vector length and size of the field.
Esfahanizadeh, Homa +2 more
openaire +3 more sources
Elevated Connectivity During Language Processing Is Associated With Cognitive Performance in SeLECTS
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Self‐Limited Epilepsy with Centrotemporal Spikes (SeLECTS) is associated with language impairments despite seizures originating in the motor cortex, suggesting aberrant cross‐network interactions. Here we tested whether functional connectivity in SeLECTS during language tasks predicts language performance.
Wendy Qi +8 more
wiley +1 more source
A connection between positive semidefinite and euclidean distance matrix completion problems [PDF]
, 1998 The positive semidefinite and Euclidean distance matrix completion problems have received a lot of attention in the literature. Results have been obtained for these two problems that are very similar in their formulations.
Laurent, Monique, Monique Laurent
core +1 more source
The P_0^+-matrix completion problem
The Electronic Journal of Linear Algebra, 2015 A real n by n matrix B is a P_0^+ -matrix if for each k in {1, 2, . . . , n} every k by k principal minor of B is nonnegative, and at least one k by k principal minor is positive. A digraph D is said to have P_0^+-completion if every partial P_0^+-matrix specifying D can be completed to a P_0^+ -matrix.
Bhaba Sarma, Kalyan Sinha
openaire +1 more source
Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif +17 more
wiley +1 more source
Convergence Analysis and Bilevel Optimization Algorithms for Matrix Completion Problems [PDF]
, 2021 The soft SVD is a robust matrix decomposition algorithm and a key component of matrix completion methods. However, computing the soft SVD for large sparse matrices is often impractical using conventional numerical methods for the SVD due to large memory
Mahendra Panagoda
core +2 more sources