Results 71 to 80 of about 148,474 (293)
Improved Time Complexities for Learning Boolean Networks
Existing algorithms for learning Boolean networks (BNs) have time complexities of at least O(N · n0:7(k+1)), where n is the number of variables, N is the number of samples and k is the number of inputs in Boolean functions.
Chee Keong Kwoh, Yun Zheng
doaj +1 more source
Designing and optimizing cost functions and energy landscapes is a problem encountered in many fields of science and engineering. These landscapes and cost functions can be embedded and annealed in experimentally controllable spin Hamiltonians.
Biamonte, J. D. +2 more
core +1 more source
Sub‐Unit‐Cell Logic Governs Transport in TPMS Architectures
ABSTRACT Next‐generation energy, thermal, and chemical systems require architectures capable of highly efficient transport across multiple length scales. Triply periodic minimal surfaces (TPMS), first conceptualized in 1865, offer inherently scalable geometries with exceptional transport potential, yet mechanistic links between topology and performance
Haozhang Zhong +16 more
wiley +1 more source
Tunable stochastic memristors for energy-efficient encryption and computing
Information security and computing, two critical technological challenges for post-digital computation, pose opposing requirements – security (encryption) requires a source of unpredictability, while computing generally requires predictability.
Kyung Seok Woo +6 more
doaj +1 more source
MGDP: Mastering a Generalized Depth Perception Model for Quadruped Locomotion
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
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 detailed study of a set of combined acceleration methods is presented with the objective of accelerating the solid rocket motor grain burnback simulation based on the level set method.
Ran Wei +3 more
doaj +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
Reconstructing Classical Algebras via Ternary Operations
Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified using ternary operations.
Jorge P. Fatelo, Nelson Martins-Ferreira
doaj +1 more source
Information and logical transformations in Schaeffer and Pierce Bases in Maple [PDF]
One of the tasks of synthesis and analysis of the functioning of combinational devices is the representation of a Boolean function in various bases. The absolute completeness of the use and implementation of various transformations of Boolean functions ...
Olenev Aleksandr +3 more
doaj +1 more source

