Results 11 to 20 of about 50 (43)
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 +2 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
Bent and generalized bent Boolean functions [PDF]
, 2012 Mathematics Subject Classification (2000) 94A60 · 94C10 · 06E30The article of record as published may be found at http://dx.doi.org/10.1007/s10623-012-9622-5;In this paper, we investigate the properties of generalized bent functions defined on Zn2 with ...
Thor Martinsen +7 more
core +1 more source
On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes
Journal of Mathematical Cryptology, 2020 S-box is the basic component of symmetric cryptographic algorithms, and its cryptographic properties play a key role in security of the algorithms.
Zhou Yu, Mu Daoguang, Dong Xinfeng
doaj +1 more source
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
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 11, Page 679-684, 2001., 2001 For an arbitrary undirected graph G, we are designing a logical model for the Hamiltonian Cycle Problem (HCP), using tools of Boolean algebra only. The obtained model is a logic formulation of the conditions for the existence of the Hamiltonian cycle, and uses m Boolean variables, where m is the number of the edges of a graph.
Anatoly D. Plotnikov
wiley +1 more source