Results 121 to 130 of about 8,830,736 (317)
Resolving inconsistencies and redundancies in declarative process models
An approach for the automated detection of inconsistencies and redundancies in declarative process models is proposed.The solution to the problem is based upon the notion of product-automata monoid.The detection is made by checking the language emptiness
Claudio Di Ciccio +3 more
semanticscholar +1 more source
On resolving domination number of friendship graph and its operation
Let G = (V, E) be a simple, finite, and connected graph of order n. A dominating set D ⊆ V(G) such every vertex not in D is adjacent to at least one member of D.
S. Kurniawati +4 more
semanticscholar +1 more source
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
Hermitian geometry on resolvent set(I)
For a tuple $A=(A_1,\ A_2,\ ...,\ A_n)$ of elements in a unital Banach algebra ${\mathcal B}$, its projective joint spectrum $P(A)$ is the collection of $z\in {\mathbb C}^n$ such that $A(z)=z_1A_1+z_2A_2+\cdots +z_nA_n$ is not invertible. It is known that the ${\mathcal B}$-valued $1$-form $ _A(z)=A^{-1}(z)dA(z)$ contains much topological information ...
Douglas, Ronald G., Yang, Rongwei
openaire +2 more sources
Cell wall target fragment discovery using a low‐cost, minimal fragment library
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
Graphs with distinguishing sets of size k
The size of a resolving set R of a non-trivial connected graph Γ of order n ≥ 2 is the number of edges in the induced subgraph .The minimum cardinality of a resolving set of size k of graph Γ is called the metric dimension of size k, denoted by β(k)(Γ ...
Muhammad Naeem Azhar +3 more
doaj +1 more source
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
Investigating computational models of perceptual attack time [PDF]
The perceptual attack time (PAT) is the compensation for differing attack components of sounds, in the case of seeking a perceptually isochronous presentation of sounds. It has applications in scheduling and is related to, but not necessarily the same as,
Collins, Nick
core +2 more sources
Set-Valued Resolvent Equations and Mixed Variational Inequalities
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aslam, Noor Muhammad +2 more
openaire +1 more source
Structural biology of ferritin nanocages
Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley +1 more source

