Results 221 to 230 of about 164,535 (282)
A trust‐region funnel algorithm for gray‐box optimization
Abstract Gray‐box optimization, where parts of optimization problems are represented by algebraic models while others are treated as black‐box models lacking analytic derivatives, remains a challenge. Trust‐region (TR) methods provide a robust framework for gray‐box problems through local reduced models (RMs) for black‐box components, but they are ...
Gul Hameed +4 more
wiley +1 more source
Brain's geometries for movements and beauty judgments. A contribution of topos geometries. [PDF]
Bennequin D, Berthoz A.
europepmc +1 more source
This study introduces an asymptotic analysis to elucidate the multi‐scale transport mechanisms driving the relaxation dynamics in GITT experiments on composite Si‐C/graphite electrodes. The approach not only enhances physical understanding of coupled lithium transport mechanisms but also establishes a base for redesigning GITT protocols to achieve more
E. Jane, M. Higuera, F. Varas
wiley +1 more source
ABSTRACT Computational mechanics is inherently complex, as the underlying physical processes evolve in three spatial dimensions and time. Thus, intuitive visualizations in traditional lecture notes or on blackboards are challenging. This motivates the use of animation software to illustrate time‐dependent three‐dimensional phenomena, which complement ...
Moritz Flaschel
wiley +1 more source
Distributed Fiber-Optic Shape Sensing with Endpoint Error Compensation: Theory and Experimental Validation. [PDF]
Rossi L +6 more
europepmc +1 more source
ABSTRACT This paper presents a novel cable‐climbing mechanism: the Collaborative Climbing Robot Squad (CCRobot‐S), a variant of Reconfigurable Cable‐Driven Parallel Robots (R‐CDPR), specifically designed for the inspection and maintenance of stay cables.
Zhenliang Zheng +4 more
wiley +1 more source
Effect of gravity and variable thermal conductivity in a thermoelastic half space with dual phase lag model. [PDF]
Bajaj S +3 more
europepmc +1 more source
ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley +1 more source
Tensor Changepoint Detection and Eigenbootstrap
ABSTRACT Tensor data consisting of multivariate outcomes over the items and across the subjects with longitudinal and cross‐sectional dependence are considered. A completely distribution‐free and tweaking‐parameter‐free detection procedure for changepoints at different locations is designed, which does not require training data.
Michal Pešta +2 more
wiley +1 more source

