Results 61 to 70 of about 2,644,664 (312)
ISPC Criteria for Review of CRP II Pre-Proposals
The ISPC will follow the criteria listed in the Guidance document and analyze the proposed evolution of each CRP compared to the first set of proposals both in terms of its individual merit and its contribution to the SRF and the overall system ...
CGIAR Independent Science and Partnership Council
core
ABSTRACT Background Children with acute lymphoblastic leukemia (ALL) are at risk of severe outcomes from SARS‐CoV‐2 (SCV2). In the post‐pandemic context, where most children have been infected with SCV2, there are limited data on whether vaccination remains beneficial in children with ALL.
Janna R. Shapiro +11 more
wiley +1 more source
Some Results on the Independence Polynomial of Unicyclic Graphs
Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x)=∑k=0ns(G,k)xk$I(G,x) = \sum\nolimits_{k = 0}^n {s\left({G,k} \right)x^k }$, where s(
Oboudi Mohammad Reza
doaj +1 more source
Independent component analysis in spiking neurons
Although models based on independent component analysis (ICA) have been successful in explaining various properties of sensory coding in the cortex, it remains unclear how networks of spiking neurons using realistic plasticity rules can realize such ...
Cristina Savin +8 more
core +1 more source
Large neighborhood local search for the maximum set packing problem [PDF]
In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by a constant k. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee (k + 2)/3.
Sviridenko, Maxim +3 more
core +1 more source
ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
On equality in an upper bound for the acyclic domination number [PDF]
A subset \(A\) of vertices in a graph \(G\) is acyclic if the subgraph it induces contains no cycles. The acyclic domination number \(\gamma_a(G)\) of a graph \(G\) is the minimum cardinality of an acyclic dominating set of \(G\).
Vladimir Samodivkin
doaj
Families of k-independent sets
AbstractA collection F of sets is k-independent if for any selections A, B of k1 and k2 of its members with k1+k2=k, there are elements in all the members of A and not in the members of B. Bounds on the maximal size of k-independent families exponential in the total number of elements are obtained.
Daniel J. Kleitman, Joel H. Spencer
openaire +1 more source
ABSTRACT Background Neuromyelitis optica spectrum disorder (NMOSD) is a relapsing autoimmune disease of the central nervous system. High‐dose intravenous methylprednisolone (IVMP) is the standard first‐line therapy for acute attacks, although some patients remain refractory.
Wataru Horiguchi +5 more
wiley +1 more source
An unconstrained binary quadratic programming for the maximum independent set problem
For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary ...
Sidi Mohamed Douiri, Souad Elbernoussi
doaj

