Results 111 to 120 of about 53,148 (301)

Eigenspectrum bounds for semirandom matrices with modular and spatial structure for neural networks [PDF]

, 2015
The eigenvalue spectrum of the matrix of directed weights defining a neural network model is informative of several stability and dynamical properties of network activity.
Mrsic-Flogel, Thomas, Muir, Dylan R.
core   +1 more source

Alternating Direction Method of Multipliers for Sparse and Low-Rank Decomposition Based on Nonconvex Nonsmooth Weighted Nuclear Norm

IEEE Access, 2018
Sparse and low-rank decomposition (SLRD) poses a big challenge in many fields. The existing methods are used to solve SLRD problem via formulating approximations of sparse and low-rank matrices.
Zhenzhen Yang, Zhen Yang, Deren Han
doaj   +1 more source

Coagulative Granular Hydrogels with an Enzyme Catalyzed Fibrin Network for Endogenous Tissue Regeneration

Advanced Healthcare Materials, EarlyView.
Coagulative granular hydrogels are composed of packed thrombin‐functionalized microgels that catalyze the conversion of fibrinogen into a secondary fibrin network, filling the interstitial voids. This bio‐inspired approach stabilizes the biomaterial to match the robustness of bulk hydrogels without compromising injectability, mimicking the initial ...
Zhipeng Deng, Camila B. Tovani, Simona Bianco, Gianni Comandini, Aya Elghajiji, Mina Aleemardani, Roxana Moscalu, Jeremie Zappia, Bianca Fernandes, Olivia Annett, Chrissy L. Hammond, Jason Wong, Dave J. Adams, Fabrizio Scarpa, Michael R. Whitehouse, Annela M. Seddon, James P. K. Armstrong   +16 more
wiley   +1 more source

A program to reorder and solve sparse unsymmetric linear systems using the envelope method

, 1987
The envelope data structure and the Choleski based (bordering) method for the solution of symmetric sparse systems of linear equations have been extended by the authors to solve unsymmetric systems of linear equations.
Mitra, G, Tamiz, M, Judice, JJ
core  

Precision of methods for calculating identity-by-descent matrices using multiple markers [PDF]

, 2002
A rapid, deterministic method (DET) based on a recursive algorithm and a stochastic method based on Markov Chain Monte Carlo (MCMC) for calculating identity-by-descent (IBD) matrices conditional on multiple markers were compared using stochastic ...
Ricardo Pong-Wong, John A. Woolliams, Sørensen Anders, Woolliams John A, Pong-Wong, Ricardo, Windig, J.J., Sørensen, Anders, Anders Christian S�rensen, Jack J. Windig, Pong Wong, R., John A Woolliams, Jack J Windig, Windig Jack J, Anders Christian Sørensen, Pong-Wong, R.; id_orcid, Anders Sørensen, Windig, Jack, Woolliams, J.A., Woolliams, John, Anders Sørensen, Pong-Wong Ricardo, Sorensen, A.C.   +21 more
core   +1 more source

Storage Formats for Sparse Matrices in Java [PDF]

, 2005
Many storage formats (or data structures) have been proposed to represent sparse matrices. This paper presents a performance evaluation in Java comparing eight of the most popular formats plus one recently proposed specifically for Java (by Gundersen and Steihaug [6] Java Sparse Array) using the matrix-vector multiplication operation. © Springer-Verlag
Mikel Luján, Anila Usman, Patrick Hardie, T. L. Freeman, John R. Gurd   +4 more
openaire   +2 more sources

A Novel Decellularized Fibrocartilage Graft Promotes Tympanic Membrane Repair

Advanced Healthcare Materials, EarlyView.
An off‐the‐shelf decellularized porcine meniscus fibrocartilage graft (MEND) is engineered for pediatric tympanoplasty. Featuring a microchannel architecture that promotes host cell invasion, MEND rapidly closes tympanic membrane perforations and fully remodels in vivo, outperforming fascia and matching cartilage grafts while avoiding donor‐site ...
Paul M. Gehret, Ryan M. Friedman, Gautham Nair, Stephanie L. Fung, Dana D. Ragbirsingh, John Germiller, Riccardo Gottardi   +6 more
wiley   +1 more source

Riemannian Sparse Coding for Positive Definite Matrices [PDF]

, 2014
International audienceInspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an ...
Sra, Suvrit, Anoop Cherian, Cherian, A., Sra, S., Cherian, Anoop, Suvrit Sra   +5 more
core   +1 more source

Saliency Detection Using Sparse and Nonlinear Feature Representation

The Scientific World Journal, 2014
An important aspect of visual saliency detection is how features that form an input image are represented. A popular theory supports sparse feature representation, an image being represented with a basis dictionary having sparse weighting coefficient ...
Shahzad Anwar, Qingjie Zhao, Muhammad Farhan Manzoor, Saqib Ishaq Khan   +3 more
doaj   +1 more source

A Monte Carlo Evaluation of Weighted Community Detection Algorithms

Frontiers in Neuroinformatics, 2016
The past decade has been marked with a proliferation of community detection algorithms that aim to organize nodes (e.g., individuals, brain regions, variables) into modular structures that indicate subgroups, clusters, or communities.
Kathleen Gates, Teague Henry, Doug Steinley, Damien Fair   +3 more
doaj   +1 more source