Results 31 to 40 of about 728,251 (279)

Finite Element Analysis for the Stationary Navier–Stokes Equations with Mixed Boundary Conditions

Mathematics
This paper studies the stationary incompressible Navier-Stokes equations with mixed boundary conditions using a velocity-pressure finite element formulation.
Ya Cui, Qingfang Liu, Jia Liu
doaj   +1 more source

SPICE-ML Algorithm for Direction-of-Arrival Estimation

Sensors, 2019
Sparse iterative covariance-based estimation, an iterative direction-of-arrival approach based on covariance fitting criterion, can simultaneously estimate the angle and power of incident signal.
Yu Zheng, Lutao Liu, Xudong Yang
doaj   +1 more source

Topological Value Iteration Algorithms

, 2011
Value iteration is a powerful yet inefficient algorithm for Markov decision processes (MDPs) because it puts the majority of its effort into backing up the entire state space, which turns out to be unnecessary in many cases. In order to overcome this problem, many approaches have been proposed.
Dai, P., Mausam, Weld, D. S., Goldsmith, J.   +3 more
openaire   +3 more sources

Tumor mutational burden as a determinant of metastatic dissemination patterns

Molecular Oncology, EarlyView.
This study performed a comprehensive analysis of genomic data to elucidate whether metastasis in certain organs share genetic characteristics regardless of cancer type. No robust mutational patterns were identified across different metastatic locations and cancer types.
Eduardo Candeal, Andrea Moreno‐Manuel, Miguel Salvadó‐Pertierra, Cristina Santos‐Vivas, Rebeca Sanz‐Pamplona   +4 more
wiley   +1 more source

Iterative Receivers for Large-Scale MIMO Systems With Finite-Alphabet Simplicity-Based Detection

IEEE Access, 2020
In this paper, we consider large-scale MIMO systems and we define iterative receivers which use the simplicity-based detection algorithm referred to as Finite Alphabet Simplicity (FAS) algorithm.
Zahran Hajji, Karine Amis, Abdeldjalil Aissa El Bey   +2 more
doaj   +1 more source

RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells

FEBS Open Bio, EarlyView.
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour, Christine Volmert, Valentina Piano   +2 more
wiley   +1 more source

Iterative Algorithms for Nonexpansive Mappings [PDF]

Fixed Point Theory and Applications, 2007
AbstractWe suggest and analyze two new iterative algorithms for a nonexpansive mapping T in Banach spaces. We prove that the proposed iterative algorithms converge strongly to some fixed point of T.
Yao Yonghong, Liou Yeong-Cheng
openaire   +3 more sources

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

Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints

, 2008
Regularization of ill-posed linear inverse problems via $\ell_1$ penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an $\ell_1$ penalized functional is via an iterative soft-
A. Chambolle, A. Cohen, A. Cohen, A. Cohen, A. Cohen, B. Efron, C. Canuto, D.L. Donoho, D.L. Donoho, D.L. Donoho, D.L. Donoho, D.L. Donoho, D.L. Donoho, E. Candès, E.J. Candès, E.J. Candès, E.J. Candès, G. Teschke, H. Rauhut, H.W. Engl, I. Daubechies, I. Daubechies, I. Daubechies, I. Loris, Ignace Loris, Ingrid Daubechies, J.-L. Starck, J.-L. Starck, L.M. Brègman, M. Fornasier, M. Fornasier, M. Fornasier, M. Fornasier, M.A.T. Figueiredo, M.A.T. Figueiredo, Massimo Fornasier, O. Christensen, P.L. Combettes, R. Ramlau, S. Dahlke, S. Dahlke, S. Dahlke, S. Mallat, S. Wolfram, Y.I. Alber   +44 more
core   +2 more sources

Iterative thresholding algorithms

Applied and Computational Harmonic Analysis, 2008
The article provides a variational formulation for hard and firm thresholding. A related functional can be used to regularize linear inverse problems by sparsity constraints. It is shown that a damped hard or firm thresholded Landweber iteration converges to its minimizer.
Fornasier, Massimo, Rauhut, Holger
openaire   +2 more sources