Results 61 to 70 of about 214,409 (272)

Risk of Retinopathy Associated with Long‐Term Use of Hydroxychloroquine in Patients with Rheumatic Diseases: A Systematic Review and Meta‐Analysis

open access: yesArthritis Care &Research, EarlyView.
Objective We aimed to estimate the prevalence and cumulative incidence of hydroxychloroquine retinopathy (HCQ‐R) and its risk factors among patients receiving long‐term HCQ with rheumatic diseases through a systematic review and meta‐analysis of observational studies that used spectral‐domain optical coherence tomography (SD‐OCT) for screening ...
Narsis Daftarian   +4 more
wiley   +1 more source

Multiple instance learning tracking method with local sparse representation

open access: yesIET Computer Vision, 2013
When objects undergo large pose change, illumination variation or partial occlusion, most existed visual tracking algorithms tend to drift away from targets and even fail in tracking them.
Chengjun Xie   +4 more
doaj   +1 more source

Adaptive Linear Programming Decoding of Polar Codes

open access: yes, 2014
Polar codes are high density parity check codes and hence the sparse factor graph, instead of the parity check matrix, has been used to practically represent an LP polytope for LP decoding.
Siegel, Paul H., Taranalli, Veeresh
core   +1 more source

Harnessing Fungal Biowelding for Constructing Mycelium‐Engineered Materials

open access: yesAdvanced Engineering Materials, EarlyView.
Mycelium‐bound composites (MBCs) offer low‐carbon alternatives for construction, yet interfacial bonding remains a critical challenge. This review examines fungal biowelding as a biocompatible adhesive, elucidating mycelium‐mediated interfacial mechanisms and their role in material assembly. Strategies to optimize biowelding are discussed, highlighting
Xue Brenda Bai   +2 more
wiley   +1 more source

Domain Decomposition Based High Performance Parallel Computing\ud [PDF]

open access: yes, 2009
The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers.
Khaitan, Siddhartha   +1 more
core   +1 more source

On the Lightweight Potential of Laser Additive Manufactured NiTi Triply Periodic Minimal Sheet Lattices

open access: yesAdvanced Engineering Materials, EarlyView.
This study explores the lightweight potential of laser additive‐manufactured NiTi triply periodic minimal surface sheet lattices. It systematically investigates the effects of relative density and unit cell size on surface quality, deformation recovery, compression behavior, and energy absorption.
Haoming Mo   +3 more
wiley   +1 more source

Fault-tolerant gates via homological product codes [PDF]

open access: yesQuantum, 2019
A method for the implementation of a universal set of fault-tolerant logical gates is presented using homological product codes. In particular, it is shown that one can fault-tolerantly map between different encoded representations of a given logical ...
Tomas Jochym-O'Connor
doaj   +1 more source

Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes

open access: yes, 2017
In this paper, we consider the mixture of sparse linear regressions model. Let ${\beta}^{(1)},\ldots,{\beta}^{(L)}\in\mathbb{C}^n$ be $ L $ unknown sparse parameter vectors with a total of $ K $ non-zero coefficients.
Chen, Yudong   +3 more
core   +1 more source

Sparse Topical Coding

open access: yes, 2011
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic topic models, STC relaxes the normalization constraint of admixture proportions and the constraint of defining a normalized likelihood function.
Zhu, Jun, Xing, Eric P.
openaire   +2 more sources

Sparse Subspace Clustering via Group Sparse Coding [PDF]

open access: yesProceedings of the 2013 SIAM International Conference on Data Mining, 2013
We propose in this paper a novel sparse subspace clustering method that regularizes sparse subspace representation by exploiting the structural sharing between tasks and data points via group sparse coding. We derive simple, provably convergent, and computationally efficient algorithms for solving the proposed group formulations.
Budhaditya Saha   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy