Results 81 to 90 of about 36,413 (311)
Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms
Starting with the fundamental work of D.E.Muller in 1954, the polynomial representations of Boolean functions are widely investigated in connection with the theory of coding and for the synthesis of circuits of digital devices.
A.S. Baliuk
doaj +1 more source
T Cell Exhaustion in Cancer Immunotherapy: Heterogeneity, Mechanisms, and Therapeutic Opportunities
T cell exhaustion limits immunotherapy efficacy. This article delineates its progression from stem‐like to terminally exhausted states, governed by persistent antigen, transcription factors, epigenetics, and metabolism. It maps the exhaustion landscape in the TME and proposes integrated reversal strategies, providing a translational roadmap to overcome
Yang Yu +7 more
wiley +1 more source
Analysis of Boolean Functions [PDF]
Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods.
openaire +2 more sources
The inhibitory immune checkpoints HLA‐G and CD47 are expressed on certain tumor types and inhibit immune cells in the tumor microenvironment. DSP216 binds specifically to cancer cells expressing both HLA‐G and CD47, and blocks their inhibitory signaling.
Lisa J. Jacob +12 more
wiley +1 more source
The Complexity of the Representation of Multiple-Output Boolean Functions
This paper considers cost of logic circuits that implement Boolean functions. The realization of Boolean functions is considered in the class of reversible logic circuits.
S. Vinokurov, A. Frantseva
doaj
Ferroelectric Devices for In‐Memory and In‐Sensor Computing
Inspired by biological systems, in‐memory and in‐sensor computing overcome von Neumann bottlenecks. Ferroelectric devices can mimic synaptic functions and sense stimuli like light or force, therefore are ideal for these paradigms. This review introduces the ferroelectric devices applied for in‐memory and in‐sensor computing, covering their structures ...
Hong Fang +5 more
wiley +1 more source
A quasi‐periodic Dart‐Kite (QDK) metastructure with a golden‐ratio‐constrained strong–weak bond network simultaneously enhances strength, toughness, and damage tolerance. Its distributed topology enables predictable, tailorable crack paths for precise fracture control and stable mechanics, demonstrating a high‐performance, controllable architecture ...
Tianyu Gao +3 more
wiley +1 more source
Here Boolean functions are considered as functions from an \(n\)-dimensional vector space over a 2-element field to the field. A Boolean function is normal if and only if it is constant on an affine subspace of dimension \([n/2]\). This paper gives some characterizations of normality and relationships with other classes such as resilient functions ...
openaire +1 more source
Symmetry groups of boolean functions
We prove that every abelian permutation group, but known exceptions, is the symmetry group of a boolean function. This solves the problem posed in the book by Clote and Kranakis. In fact, our result is proved for a larger class of groups, namely, for all groups contained in direct sums of regular groups.
Mariusz Grech, Andrzej Kisielewicz 0001
openaire +3 more sources
Strain‐Modulated Reconfigurable Optical Information Processing in Flexible Graphene/PDMS
Graphene/PDMS—a stable, mechanically robust, and highly tunable flexible composite, exhibits excellent strain‐tunability. The spatial self‐phase modulation (SSPM) effect can be reversibly and continuously modulated by strain. A strain‐gated optical switch can be constructed, thereby realizing reconfigurable optical logic gates and reversible switching ...
Zexin Cui +13 more
wiley +1 more source

