Results 61 to 70 of about 358,125 (307)

Modular, Textile‐Based Soft Robotic Grippers for Agricultural Produce Handling

open access: yesAdvanced Robotics Research, EarlyView.
This article introduces textile‐based pneumatic grippers that transform simple textiles into robust bending actuators. Detailed experiments uncover how cut geometry and fabric selection shape performance. Successful handling of fragile agricultural items showcases the potential of textile robotics for safe, scalable automation in food processing and ...
Zeyu Hou   +4 more
wiley   +1 more source

Asymptotically optimal amplifiers for the Moran process [PDF]

open access: yesTheoretical Computer Science, 2019
We study the Moran process as adapted by Lieberman, Hauert and Nowak. This is a model of an evolving population on a graph or digraph where certain individuals, called "mutants" have fitness r and other individuals, called non-mutants have fitness 1. We focus on the situation where the mutation is advantageous, in the sense that r>1.
Leslie Ann Goldberg   +5 more
openaire   +4 more sources

Physics‐Constrained Constitutive Learning of Rate‐Limiting Timescales for Efficient Hydrogen‐Based Direct Reduction for Green Steel Making

open access: yesAdvanced Science, EarlyView.
A conversion‐resolved constitutive framework is developed for the hydrogen‐based direct reduction of iron oxide pellets. Effective reaction and transport timescales are inferred directly from measured trajectories and mapped against operating conditions, pellet architecture, and composition. The analysis reveals how late‐stage transport control emerges
Anurag Bajpai   +3 more
wiley   +1 more source

A Generative Neuro‐Symbolic AI for Protein Sequence Design

open access: yesAdvanced Science, EarlyView.
We introduce EffieDes, a neuro‐symbolic framework coupling deep learning‐based fitness landscape parameterization with exact automated reasoning. Unlike greedy sampling, EffieDes identifies sequences that globally optimize fitness while satisfying intricate design constraints.
Marianne Defresne   +12 more
wiley   +1 more source

Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production

open access: yesJournal of Applied Mathematics, 2013
This paper considers the m-machine flow shop scheduling problem with the no-wait constraint to minimize total completion time which is the typical model in steel production.
Huawei Yuan   +3 more
doaj   +1 more source

Volatile ZrO2 Antiferroelectric Tunnel Junctions for Rapid, Energy‐Efficient Physical Reservoir Computing

open access: yesAdvanced Science, EarlyView.
An antiferroelectric tunnel junction serves as a reservoir computing node, where field‐induced phase transitions and spontaneous ZrO2 relaxation deliver nonlinear fading memory. An In‐Ga‐Zn oxide interlayer enlarges the memory margin and multibit state richness.
Taegyu Kwon   +13 more
wiley   +1 more source

Estimating a Finite Population Mean Using Transformed Data in Presence of Random Nonresponse

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2020
Developing finite population estimators of parameters such as mean, variance, and asymptotic mean squared error has been one of the core objectives of sample survey theory and practice.
Nelson Kiprono Bii   +2 more
doaj   +1 more source

Learning Work Function via Implicit Reasoning on Electrostatic Potential Landscapes

open access: yesAdvanced Science, EarlyView.
StructPot‐CLR establishes a cross‐modal contrastive learning framework that aligns the crystal structures of 2D materials with plane‐averaged electrostatic potential landscapes for physically informed work‐function prediction. The model achieves an MAE of 0.265 eV and an R2 of 0.902 on the held‐out test set while accurately preserving key morphological
Haoyu Wan, Yue Wu, Tianhao Su, Deng Pan
wiley   +1 more source

Hodges-Lehmann Optimality for Testing Moment [PDF]

open access: yes
This paper studies the Hodges and Lehmann (1956) optimality of tests in a general setup. The tests are compared by the exponential rates of growth to one of the power functions evaluated at a fixed alternative while keeping the asymptotic sizes bounded ...
Ivan Canay, Taisuke Otsu
core  

Asymptotic optimal HEAPSORT algorithm

open access: yesTheoretical Computer Science, 1994
AbstractHeapsort algorithm HEAPSORT runs in a higher efficiency way. It has been improved to reduce the constant factor of the complexity. An asymptotic optimal heapsort algorithm is given in this paper. When the efficiency becomes the lowest, the constant factor of its complexity will not be more than 43.
Gu Xunrang, Zhu Yuzhang
openaire   +1 more source

Home - About - Disclaimer - Privacy