Results 131 to 140 of about 1,003,319 (338)
Fabrication‐Directed Entanglement for Designing Chiral and Anisotropic Metamaterial Foams
Advanced Engineering Materials, EarlyView.This work introduces fabrication‐directed entanglement (FDE), combining viscous thread printing and topology optimization to program entangled foams with spatially patterned stiffness. By tuning coil density, FDE enables anisotropy, programmable Poisson's ratio, and chirality in foams.
Daniel Revier +3 more
wiley +1 more source
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Journal of Mathematical and Fundamental Sciences, 2014 The computation time in adiabatic quantum computing (AQC) is determined by the time limit of the adiabatic evolution, which in turn depends on the evolution path. In this research we have used the variational method to find an optimized path.
Jusak Sali Kosasih +2 more
doaj +1 more source
The homotopy method revisited: Computing solution paths of $\ell _1$-regularized problems [PDF]
, 2017 Björn Bringmann +3 more
openalex +1 more source
Advanced Engineering Materials, EarlyView.This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
Computing Minimum Time Paths With Bounded Acceleration [PDF]
, 2013 Stewart D. Johnson
openalex +1 more source
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think [PDF]
, 2020 Jean-Romain Luttringer +5 more
openalex +1 more source
Target-Oriented Teaching Path Planning with Deep Reinforcement Learning for Cloud Computing-Assisted Instructions [PDF]
, 2022 Tengjie Yang +3 more
openalex +1 more source
Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]
, 2005 We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Ekkehard Köhler +2 more
openaire +1 more source
Advanced Engineering Materials, EarlyView.Freeze‐drying of layered silicate is the key to get coatings with superior gas barrier. Freeze‐drying of layered silicates modified with dodecylamine (DDA) is a highly effective technique for the preparation of barrier pigments that significantly mitigate the permeation of oxygen, water vapor, and hydrogen through polymer films containing these ...
Joshua Lommes +4 more
wiley +1 more source
Orthophoto Classification for UGV Path Planning using Heterogeneous Computing
International Journal of Advanced Robotic Systems, 2013 We have developed a system that uses aerial imagery for improving unmanned ground vehicle navigation capabilities. The current article focuses on the viability of using heterogeneous computing architecture for improving system performance in terms of ...
Robert Hudjakov, Mart Tamre
doaj +1 more source