Results 71 to 80 of about 5,251,527 (295)

A Secure Boolean-based Multi-Secret Image Sharing Scheme

open access: yes, 2014
Multiple secret images Boolean XORAn (n, n) multi-secret image sharing scheme shares n secret images among n shared images. In this type of schemes, n shared images can be used to recover all n secret images, but the loss of any shared image prevents the
陳建彰; 吳緯杰, 陳建彰
core   +1 more source

Using Inclusion / Exclusion to find Bent and Balanced Monomial Rotation Symmetric Functions

open access: yesJournal 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

Integration of Reconfigurable p‐Bit and 1R Crossbar Array for Memristive Probabilistic Computing

open access: yesAdvanced Science, EarlyView.
A memristive probabilistic computing system is demonstrated by integrating stochastic p‐bits based on volatile memristors with a 1R crossbar array encoding interaction weights. The system performs weighted‐sum operations across the array and updates p‐bits iteratively.
Keunho Soh   +7 more
wiley   +1 more source

An Isomorphism between Abstract Polyhedral Cones and Definite Boolean Functions [PDF]

open access: yes, 1999
Polyhedral cones can be represented by sets of linear inequalities that express inter-variable relationships. These inequalities express inter-variable relationships that are quantified by the ratios between the variable coefficients.
Benoy, Florence, King, Andy
core  

Method of restoring multivariable Boolean function from its derivative

open access: yesAdvanced Engineering Research, 2017
Introduction. Boolean functions of several variables are of paramount importance in the coding theory and cryptography. The compositions of these functions are used in a set of the symmetric cryptosystems; therewith, some error-control codes, such as ...
Alexander V. Mazurenko   +1 more
doaj   +1 more source

On Circuit Functionality in Boolean Networks

open access: yesBulletin of Mathematical Biology, 2013
It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp.
Comet, Jean-Paul   +9 more
openaire   +10 more sources

Self-Predicting Boolean Functions [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2018
A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is obtained from $X^{n}$ by independently flipping each coordinate with probability $δ$.
Weinberger, Nir, Shayevitz, Ofer
openaire   +4 more sources

Spatially Encoded Protocell Network for Non‐Cascaded Parallel Biocomputation

open access: yesAdvanced Science, EarlyView.
A non‐cascaded, hydrogel‐based proteinosome computational platform is developed, in which redox‐responsive proteinosomes serve as local computing units within a shared reaction–diffusion field. Reductant inputs, countered by an auxiliary glucose gradient, regulate spatially patterned proteinosome disruption, and generate population‐level boundaries ...
Shuqi Wu, Liangfei Tian
wiley   +1 more source

Boolean random networks: phase transition and connectivity [PDF]

open access: yes, 2023
openIn this thesis I introduce some random network models, with a particular focus on boolean random networks. After having provided the necessary theoretical background, several results related to two topics concerning boolean networks are discussed ...
SPISSO, GIOVANNI
core  

Transformations of Boolean Functions.

open access: yes, 2019
Boolean functions are characterized by the unique structure of their solution space. Some properties of the solution space, such as the possible existence of a solution, are well sought after but difficult to obtain. To better reason about such properties, we define transformations as functions that change one Boolean function to another while ...
Jeffrey M. Dudek, Dror Fried
openaire   +3 more sources

Home - About - Disclaimer - Privacy