Results 1 to 10 of about 135 (40)
Cooperative Boolean systems with generically long attractors II [PDF]
Advances in Differential Equations, 2013 The purpose of this paper is to investigate to what extent cooperativity, that is, the absence of negative interactions, in Boolean networks with synchronous updating, imposes limits on chaos-like properties that are possible in such systems.
W. Just, Maciej Malicki
semanticscholar +5 more sources
Approximate modularity: Kalton's constant is not smaller than 3 [PDF]
, 2020 Kalton and Roberts [Trans. Amer. Math. Soc., 278 (1983), 803--816] proved that there exists a universal constant $K\leqslant 44.5$ such that for every set algebra $\mathcal{F}$ and every 1-additive function $f\colon \mathcal{F}\to \mathbb R$ there exists
Gnacik, Michal +2 more
core +3 more sources
Infant Mental Health Journal: Infancy and Early Childhood, Volume 44, Issue 5, Page 705-719, September 2023., 2023 Abstract We report on two preliminary evaluations of a group intervention, targeting vulnerable infants and their mothers within the first 6‐months postpartum. The Mother–Baby Nurture® program aims to strengthen the developing infant–mother attachment relationship by increasing maternal mentalizing.
Sharon Cooke +2 more
wiley +1 more source
Using Inclusion / Exclusion to find Bent and Balanced Monomial Rotation Symmetric Functions
Journal of Mathematical Cryptology, 2021 There are many cryptographic applications of Boolean functions. Recently, research has been done on monomial rotation symmetric (MRS) functions which have useful cryptographic properties.
Reid Elizabeth M.
doaj +1 more source
On the confusion coefficient of Boolean functions
Journal of Mathematical Cryptology, 2021 The notion of the confusion coefficient is a property that attempts to characterize confusion property of cryptographic algorithms against differential power analysis. In this article, we establish a relationship between the confusion coefficient and the
Zhou Yu +4 more
doaj +1 more source
Ordered dynamics in biased and cooperative Boolean networks
Advances in Differential Equations, 2013 This paper contributes to the theoretical analysis of the qualitative behavior of two types of Boolean networks: biased and cooperative ones. A Boolean network is biased if at least a specified fraction of its regulatory functions returns one Boolean ...
W. Just, G. Enciso
semanticscholar +2 more sources
On the algebraic immunity of multiplexer Boolean functions
Journal of Mathematical Cryptology, 2022 A multiplexer generator is a device that accepts two or more inputs and based on some logic sends one of them as output. In a special case when inputs to a multiplexer generator are 2k{2}^{k} bits and one of them is selected according to the value of a ...
Mishra Prasanna R., Pandey Shashi Kant
doaj +1 more source
Reliability of systems with dependent components based on lattice polynomial description [PDF]
, 2011 Reliability of a system is considered where the components' random lifetimes may be dependent. The structure of the system is described by an associated "lattice polynomial" function. Based on that descriptor, general framework formulas are developed and
Alexander Dukhovny +4 more
core +2 more sources
Computing subsignatures of systems with exchangeable component lifetimes [PDF]
, 2014 The subsignatures of a system with continuous and exchangeable component lifetimes form a class of indexes ranging from the Samaniego signature to the Barlow-Proschan importance index.
Marichal, Jean-Luc
core +2 more sources
STABILITY ANALYSIS OF SWITCHED DISCRETE TIME-DELAY SYSTEMS WITH CONVEX POLYTOPIC UNCERTAINTIES
, 2014 This article is concerned with robust stability of switched discrete time-delay systems with convex polytopic uncertainties. The system to be considered is subject to interval time-varying delays, which allows the delay to be a fast time-varying function
M. Rajchakit, G. Rajchakit
semanticscholar +1 more source