Results 71 to 80 of about 13,872 (307)

Conditional Expression Fault Classification and Repair Method of Aviation Control Software

open access: yesXibei Gongye Daxue Xuebao, 2020
Aviation control software has become the core control decision-making unit of the aviation system. The Boolean conditional expressions are the main parts of the branch and loop control logic of aviation control software.

doaj   +1 more source

T Cell Exhaustion in Cancer Immunotherapy: Heterogeneity, Mechanisms, and Therapeutic Opportunities

open access: yesAdvanced Science, EarlyView.
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

MGDP: Mastering a Generalized Depth Perception Model for Quadruped Locomotion

open access: yesAdvanced Science, EarlyView.
ABSTRACT Perception‐based Deep Reinforcement Learning (DRL) controllers demonstrate impressive performance on challenging terrains. However, existing controllers still face core limitations, struggling to achieve both terrain generality and platform transferability, and are constrained by high computational overhead and sensitivity to sensor noise.
Yinzhao Dong   +9 more
wiley   +1 more source

Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors [PDF]

open access: yes
Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘
Philip Meguire
core  

Ferroelectric Devices for In‐Memory and In‐Sensor Computing

open access: yesAdvanced Science, EarlyView.
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

Boundary Algebra: A Simpler Approach to Boolean Algebra and the Sentential Connectives [PDF]

open access: yes
Boundary algebra [BA] is a algebra of type , and a simplified notation for Spencer-Brown’s (1969) primary algebra. The syntax of the primary arithmetic [PA] consists of two atoms, () and the blank page, concatenation, and enclosure between ‘(‘ and ...
Philip Meguire
core  

Reasoning Boolean Operation for Modeling, Simulation and Fabrication of Heterogeneous Objects 417

open access: yes, 2000
An approach using reasoning Boolean operation to model heterogeneous object is presented. Algorithm in the reasoning Boolean operation consists of merging and extraction operation. This algorithm models heterogeneous object at multi-volume level.
Lin, F., Hu, X., Sun, W., Jiang, T.
core   +1 more source

Topology‐Enriched Toughness Enhancement in Quasi‐Periodic Metastructures Featuring Tailorable Strong‐Weak Network

open access: yesAdvanced Science, EarlyView.
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

The Sheffer stroke operation reducts of basic algebras

open access: yesOpen Mathematics, 2017
In this study, a term operation Sheffer stroke is presented in a given basic algebra 𝒜 and the properties of the Sheffer stroke reduct of 𝒜 are examined. In addition, we qualify such Sheffer stroke basic algebras.
Oner Tahsin, Senturk Ibrahim
doaj   +1 more source

Analysis of General Polygon Boolean Operation Algorithms

open access: yes, 2008
This thesis deals with general polygon boolean operation algorithms. Boolean operations are e.g. intersection, union or difference. A general polygon can be e.g. a selfinterecting polygon with inner hole. Clipping of polygons against a rectangular window
Daněk, Tomáš
core  

Home - About - Disclaimer - Privacy