Results 81 to 90 of about 41,749 (283)
Miniaturized Magnetic Tip Design for Endoluminal Vine Robot Navigation
Advanced Robotics Research, EarlyView.A magnetic tip mount is designed for a miniaturized 7 mm soft‐growing vine robot to enable wireless magnetic steering and onboard imaging, while preserving a 3 mm working channel. The internal–external ring magnets design balances magnetic attachment with low eversion pressure. Experiments demonstrate ±90° steering, 34 mm bending radius, and successful
Andrea Yanez Trujillo +4 more
wiley +1 more source
From Lab to Landscape: Environmental Biohybrid Robotics for Ecological Futures
Advanced Robotics Research, EarlyView.This Perspective explores environmental biohybrid robotics, integrating living tissues, microorganisms, and insects for operation in real‐world ecosystems. It traces the leap from laboratory experiments to forests, wetlands, and urban environments and discusses key challenges, development pathways, and opportunities for ecological monitoring and ...
Miriam Filippi
wiley +1 more source
K-Means Partitioned Space Path Planning (KPSPP) for Autonomous Robotic Harvesting
International Journal of Advanced Robotic Systems, 2015 A three-dimensional coverage path-planning algorithm is proposed for discrete harvesting machines. Although prior research has developed methods for coverage planning in continuous-crop fields, no such algorithm has been developed for discrete crops such
Christopher Vincent Meaclem +4 more
doaj +1 more source
Sensors, 2019 In this paper, we present a novel approach for reconstructing 3D geometry from a stream of images captured by a consumer-grade mobile RGB-D sensor. In contrast to previous real-time online approaches that process each incoming image in acquisition order,
Jaepung An +3 more
doaj +1 more source
Data-Oblivious Graph Algorithms in Outsourced External Memory
, 2014 Motivated by privacy preservation for outsourced data, data-oblivious external memory is a computational framework where a client performs computations on data stored at a semi-trusted server in a way that does not reveal her data to the server.
B Schieber +9 more
core +1 more source
Physics‐Embedded Neural Network: A Novel Approach to Design Polymeric Materials
Advanced Science, EarlyView.Traditional black‐box models for polymer mechanics rely solely on data and lack physical interpretability. This work presents a physics‐embedded neural network (PENN) that integrates constitutive equations into machine learning. The approach ensures reliable stress predictions, provides interpretable parameters, and enables performance‐driven, inverse ...
Siqi Zhan +8 more
wiley +1 more source
Easy identification of generalized common and conserved nested intervals
, 2013 In this paper we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of size |I|
de Montgolfier, Fabien +2 more
core +3 more sources
The Expected Performance of Traversal Algorithms in Binary Trees [PDF]
The Computer Journal, 1985 The paper compares expected performance measures for common traversal algorithms operating on threaded and unthreaded binary trees, under the assumption that the trees are selected from the distribution induced by random insertions. The results are shown to be similar to those derived in an earlier paper for binary trees selected from the uniform ...
openaire +2 more sources
Fabrication of High‐Density Multimodal Neural Probes Based on Heterogeneously Integrated CMOS
Advanced Science, EarlyView.A chiplet‐based methodology democratizes active neural probe development on standard bulk CMOS services. This yields the first probe combining high‐density electrophysiology (416 electrodes) with calcium imaging (832 photodiodes) and complete on‐chip signal processing across 13 shanks.
Ju Hee Mun +10 more
wiley +1 more source
Unveiling The Tree: A Convex Framework for Sparse Problems
, 2015 This paper presents a general framework for generating greedy algorithms for solving convex constraint satisfaction problems for sparse solutions by mapping the satisfaction problem into one of graph traversal on a rooted tree of unknown topology.
Lahlou, Tarek A., Oppenheim, Alan V.
core +1 more source