Results 11 to 20 of about 367 (158)

Network topology and interaction logic determine states it supports [PDF]

npj Systems Biology and Applications
In this review paper we summarize a recent progress on the problem of describing range of dynamics supported by a network. We show that there is natural connection between network models consisting of collections of multivalued monotone boolean functions
Tomáš Gedeon
doaj   +2 more sources

On the Lyapunov Exponent of Monotone Boolean Networks ^†

Mathematics, 2020
Boolean networks are discrete dynamical systems comprised of coupled Boolean functions. An important parameter that characterizes such systems is the Lyapunov exponent, which measures the state stability of the system to small perturbations.
Ilya Shmulevich
doaj   +1 more source

Multi-Angle Fast Neural Tangent Kernel Classifier

Applied Sciences, 2022
Multi-kernel learning methods are essential kernel learning methods. Still, the base kernel functions in most multi-kernel learning methods only with select kernel functions with shallow structures, which are weak for large-scale uneven data.
Yuejing Zhai, Zhouzheng Li, Haizhong Liu
doaj   +1 more source

Complementing ODE-Based System Analysis Using Boolean Networks Derived from an Euler-Like Transformation. [PDF]

PLoS ONE, 2015
In this paper, we present a systematic transition scheme for a large class of ordinary differential equations (ODEs) into Boolean networks. Our transition scheme can be applied to any system of ODEs whose right hand sides can be written as sums and ...
Claudia Stötzel, Susanna Röblitz, Heike Siebert   +2 more
doaj   +1 more source

Locally monotone Boolean and pseudo-Boolean functions [PDF]

Discrete Applied Mathematics, 2012
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean ...
Miguel Couceiro, Jean-Luc Marichal, Tamás Waldhauser   +2 more
openaire   +4 more sources

Parameterized Games and Parameterized Automata [PDF]

Electronic Proceedings in Theoretical Computer Science, 2018
We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter value to 0 and branching depending on whether 0 has been reached.
Arno Pauly
doaj   +1 more source

Sparse juntas on the biased hypercube [PDF]

TheoretiCS
We give a structure theorem for Boolean functions on the $p$-biased hypercube which are $\epsilon$-close to degree $d$ in $L_2$, showing that they are close to sparse juntas.
Irit Dinur, Yuval Filmus, Prahladh Harsha   +2 more
doaj   +1 more source

De Morgan Functions and Free De Morgan Algebras

Demonstratio Mathematica, 2014
It is commonly known that the free Boolean algebra on n free generators is isomorphic to the Boolean algebra of Boolean functions of n variables. The free bounded distributive lattice on n free generators is isomorphic to the bounded lattice of monotone ...
Movsisyan Yu. M., Aslanyan V. A., Manoogian Alex   +2 more
doaj   +1 more source

Counting self-dual monotone Boolean functions [PDF]

Journal of Integer Sequences, 2023
Zaprezentowano kilka algorytmów zliczających samodualne monotoniczne funkcje boolowskie.
Bartłomiej Pawelski, Andrzej Szepietowski   +1 more
openaire   +2 more sources

Proof complexity of positive branching programs [PDF]

Logical Methods in Computer Science
We investigate the proof complexity of systems based on positive branching programs, i.e. non-deterministic branching programs (NBPs) where, for any 0-transition between two nodes, there is also a 1-transition.
Anupam Das, Avgerinos Delkos
doaj   +1 more source