Results 21 to 30 of about 148,259 (301)

Planar Pol(o)arity [PDF]

open access: yesDevelopmental Cell, 2015
Asymmetric localization of planar cell polarity (PCP) proteins is essential for tissue integrity, but how asymmetric localization is regulated during cell division is not known. In this issue of Developmental Cell, Shrestha et al. (2015) show that mitotic Polo-like kinase 1 (Plk1) links internalization of PCP proteins to cell-cycle progression.
Sedzinski, Jakub, Wallingford, John
openaire   +2 more sources

The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs [PDF]

open access: yesLogical Methods in Computer Science, 2022
We study the problem of query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases over signatures of arity two. We focus on the class of queries closed under homomorphisms, or, equivalently, the infinite unions of ...
Antoine Amarilli, İsmail İlkan Ceylan
doaj   +1 more source

Dual Univariate Interpolatory Subdivision of Every Arity: Algebraic Characterization and Construction [PDF]

open access: yesJournal of Mathematical Analysis and Applications, 2019
A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise interpolants.
Lucia Romani, Alberto Viscardi
semanticscholar   +1 more source

Characteristic Sequence of Strongly Minimal Directed Single Graphs of 1-Arity

open access: yesComputation, 2022
In this paper, we will classify the strongly minimal directed single graphs of 1-arity by axiomatizing the theory of characteristic sequence of such a graph. Then we will show this theory is complete by using Łos-Vaught test. Complete theory is important
Abeer M. Albalahi
doaj   +1 more source

Universal Horn Sentences and the Joint Embedding Property [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2022
The finite models of a universal sentence $\Phi$ in a finite relational signature are the age of a structure if and only if $\Phi$ has the joint embedding property. We prove that the computational problem whether a given universal sentence $\Phi$ has the
Manuel Bodirsky   +2 more
doaj   +1 more source

Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width [PDF]

open access: yes, 2020
Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of local-consistency methods in ...
Wrona, Micha?
core   +3 more sources

Higher arity self-distributive operations in Cascades and their cohomology [PDF]

open access: yes, 2019
We investigate constructions of higher arity self-distributive operations, and give relations between cohomology groups corresponding to operations of different arities. For this purpose we introduce the notion of mutually distributive $n$-ary operations
M. Elhamdadi, M. Saito, E. Zappala
semanticscholar   +1 more source

Arity Shape of Polyadic Algebraic Structures [PDF]

open access: yesZurnal matematiceskoj fiziki, analiza, geometrii, 2017
Concrete two-set (module-like and algebra-like) algebraic structures are investigated from the viewpoint that the initial arities of all operations are arbitrary.
S. Duplij
semanticscholar   +1 more source

The arity gap of polynomial functions over bounded distributive lattices [PDF]

open access: yes, 2009
Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B is the minimum decrease in its essential arity when essential arguments of f are identified.
Couceiro, Miguel, Lehtonen, Erkko
core   +1 more source

Improving the efficiency of GP-GOMEA for higher-arity operators [PDF]

open access: yesAnnual Conference on Genetic and Evolutionary Computation
Deploying machine learning models into sensitive domains in our society requires these models to be explainable. Genetic Programming (GP) can offer a way to evolve inherently interpretable expressions.
Thalea Schlender   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy