Results 51 to 60 of about 36,413 (311)

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  

Low‐Profile, High‐Gain GRIN RF Lenses via Multi‐Material Vat Photopolymerization

open access: yesAdvanced Functional Materials, EarlyView.
We investigate the opportunity of leveraging multi‐material vat photopolymerization printing to manufacture intricate lenses exhibiting permittivity gradients that can increase signal gain in transmitted radiofrequency signals in the X‐ and Ku‐bands. Lenses produced with more distinct low‐loss materials (up to 5) can deliver an 18 dB signal gain with a
Lawrence Romangsuriat   +3 more
wiley   +1 more source

Extended algebraic immunity of symmetric Boolean function

open access: yesTongxin xuebao, 2014
Boolean functions with optimal algebraic immunity play an important role in stream ciphers.Based on the univariate polynomial representation of Boolean functions,a construction of Boolean functions with maximum extended algebraic immunity (EAI) is ...
Gao-fei WU   +3 more
doaj   +2 more sources

Construction of the optimal algebraic immunity Boolean functions with correlation immunity from transformation RSBFs

open access: yesMATEC Web of Conferences, 2016
In this paper, we discuss the effect of the cryptographic properties of translation transformation rotation symmetric Boolean functions. On construction of rotation symmetric Boolean functions with the optimal algebraic immunity, we construct correlation
Huang Jinglian
doaj   +1 more source

Low-Latency Boolean Functions and Bijective S-boxes

open access: yesIACR Transactions on Symmetric Cryptology, 2022
In this paper, we study the gate depth complexity of (vectorial) Boolean functions in the basis of {NAND, NOR, INV} as a new metric, called latency complexity, to mathematically measure the latency of Boolean functions.
Shahram Rasoolzadeh
doaj   +1 more source

Learning and Searching Pseudo-Boolean Surrogate Functions from Small Samples [PDF]

open access: yes, 2020
When searching for input configurations that optimise the output of a system, it can be useful to build a statistical model of the system being optimised.
Swingler, Kevin
core   +1 more source

Neuromorphic Electronics for Intelligence Everywhere: Emerging Devices, Flexible Platforms, and Scalable System Architectures

open access: yesAdvanced Materials, EarlyView.
The perspective presents an integrated view of neuromorphic technologies, from device physics to real‐time applicability, while highlighting the necessity of full‐stack co‐optimization. By outlining practical hardware‐level strategies to exploit device behavior and mitigate non‐idealities, it shows pathways for building efficient, scalable, and ...
Kapil Bhardwaj   +8 more
wiley   +1 more source

Deep Learning Inverse Design of Phase‐Change Reconfigurable Terahertz Metadevices for Multidimensional Secure Communication

open access: yesAdvanced Materials, EarlyView.
A deep learning inverse‐design framework is established to create versatile reconfigurable terahertz metadevices. By synergizing deep learning with phase‐change materials, this approach enables on‐demand customization of multidimensional electromagnetic responses.
Yisheng Dong   +11 more
wiley   +1 more source

A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions

open access: yesAxioms, 2019
In this paper, we present four product operations to construct cryptographic boolean functions from smaller ones with predictable Walsh spectrum. A lot of cryptographic properties of boolean functions can be presented by their Walsh spectrum.
Modjtaba Ghorbani   +3 more
doaj   +1 more source

On generalized Boolean functions i

open access: yesDiscrete Mathematics, 1981
AbstractIn this paper we introduce the concept of generalized Boolean function. Such a function has its arguments and values in a Boolean algebra and can be written in a manner similar to the canonical disjunctive form, but instead of the product of simple or complemented variables, the product of values of certain functions is used.
openaire   +2 more sources

Home - About - Disclaimer - Privacy