Results 81 to 90 of about 1,981,084 (298)

Zero forcing parameters and minimum rank problems [PDF]

open access: yes, 2010
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by G.
Holst, van der, H.   +24 more
core   +1 more source

Neuropsychological and Educational Outcomes in Shwachman–Diamond Syndrome—A Report From the North American Shwachman–Diamond Syndrome Registry

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Shwachman–Diamond syndrome (SDS) is a rare autosomal recessive ribosomopathy characterized by bone marrow failure and multisystem involvement, with emerging evidence of associated neurocognitive impairment. Methods We conducted a retrospective study of 240 individuals with biallelic Shwachman–Bodian–Diamond syndrome (SBDS) mutations
Jane Koo   +11 more
wiley   +1 more source

Therapeutic Apheresis in Nigeria: A Multi‐Center Summary of Abstracts From the Inaugural Nigerian Society for Apheresis Scientific Meeting

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye   +33 more
wiley   +1 more source

The minimum rank problem for circulants

open access: yesLinear Algebra and its Applications, 2016
27 pages, 3 figures; to appear in Linear Algebra and its ...
Louis Deaett, Seth A. Meyer
openaire   +3 more sources

RESIDUAL FORCE MINIMUM RANK UPDATE METHOD FOR DAMAGE IDENTIFICATION OF SPACE TRUSS STRUCTURES

open access: yesJixie qiangdu, 2019
Based on the minimum rank damage identification method,a minimum rank update method is proposed to study the damage identification of space truss structures.
JIANG Ge, FENG XiaoDong
doaj  

Quantum-inspired algorithm for general minimum conical hull problems

open access: yesPhysical Review Research, 2020
A wide range of fundamental machine learning tasks that are addressed by the maximum a posteriori estimation can be reduced to a general minimum conical hull problem.
Yuxuan Du   +3 more
doaj   +1 more source

Experience With Performing Rheocarna Therapy via the Single‐Needle Method for Treatment of Chronic Limb‐Threatening Ischemia

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction This study investigated the safety and efficacy of single‐needle Rheocarna therapy for chronic limb‐threatening ischemia (CLTI) with wounds. Methods Six patients with CLTI involving ulcers unresponsive to revascularization underwent single‐needle Rheocarna treatment.
Yasutaka Yamauchi   +9 more
wiley   +1 more source

Words of Minimum Rank in Deterministic Finite Automata [PDF]

open access: yes, 2019
The rank of a word in a deterministic finite automaton is the size of the image of the whole state set under the mapping defined by this word. We study the length of shortest words of minimum rank in several classes of complete deterministic finite automata, namely, strongly connected and Eulerian automata. A conjecture bounding this length is known as
Kari, Jarkko   +2 more
openaire   +4 more sources

Construction of a Uniform Access Structure Using Minimum Independent Dominating Vertices [PDF]

open access: yesEngineering and Technology Journal, 2014
The most important technologies in modern society are the information security; it is founded to provide a protection to the transmitted data. Secret sharing scheme is one of the methods designated to protect the secret data. It is a method that allows a
KadhimA. Kadhim   +2 more
doaj   +1 more source

Linearly independent vertices and minimum semidefinite rank [PDF]

open access: yes, 2009
We study the minimum semidefinite rank of a graph using vector representations of the graph and of certain subgraphs. We present a sufficient condition for when the vectors corresponding to a set of vertices of a graph must be linearly independent in any
Narayan, Sivaram K.   +7 more
core   +1 more source

Home - About - Disclaimer - Privacy