Results 101 to 110 of about 13,257,834 (322)
IEEE Access, 2019 The identical parallel processors scheduling problem with no-idle time, release date, and delivery time is addressed in this paper. The problem considers a family of tasks that has to be processed by identical parallel processors without idle time.
Lotfi Hidri +2 more
doaj +1 more source
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source
A lower bound for approximating grundy numbering
Discrete Mathematics & Theoretical Computer Science, 2007 The grundy numbering of a graph is the maximum number of colors used by on-line first-fit coloring, under the worst order of arrival of vertices. The grundy numbering problem is to find this ordering.
Guy Kortsarz
doaj
Lower bounds for Buchsbaum* complexes
European Journal of Combinatorics, 2011 The class of $(d-1)$-dimensional Buchsbaum* simplicial complexes is studied. It is shown that the rank-selected subcomplexes of a (completely) balanced Buchsbaum* simplicial complex are also Buchsbaum*. Using this result, lower bounds on the $h$-numbers of balanced Buchsbaum* simplicial complexes are established. In addition, sharp lower bounds on the $
Browder, Jonathan, Klee, Steven
openaire +3 more sources
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
New results for generalized Hausdorff matrices
Journal of Inequalities and ApplicationsLet A = ( a n , k ) n , k ≥ 0 $A=(a_{n,k})_{n,k\geq 0}$ be a non-negative matrix. Denote by L p ( A ) $L_{p}(A)$ , the supremum of those ℓ, satisfying the following inequality ( ∑ n = 0 ∞ ( ∑ k = 0 ∞ a n , k x k ) p ) 1 p ≥ ℓ ( ∑ k = 0 ∞ x k p ) 1 p ( x ≥
Gholamreza Talebi
doaj +1 more source
Estimating reliability: A comparison of Cronbach's α, McDonald's ωt and the greatest lower bound
Social Sciences & Humanities Open, 2023 C. Malkewitz +3 more
semanticscholar +1 more source
A lower bound for Torelli-K-quasiconformal homogeneity [PDF]
, 2014 A closed hyperbolic Riemann surface M is said to be K-quasiconformally homogeneous if there exists a transitive family F of K-quasiconformal homeomorphisms.
Greenfield, Mark
core +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
A Lower Bound for Minimizing Waiting Time in Coexisting Virtual and Physical Worlds
IEEE AccessTo balance customer satisfaction across virtual and real-world interactions, we focus on enhancing service for dine-in customers at restaurants that typically prioritize online orders, such as those on Uber Eats.
Yu-Chuan Chen, Jen-Ya Wang
doaj +1 more source