Results 51 to 60 of about 71,660 (280)

Additive Manufacturing of Patient‐Specific Intracranial Aneurysm Cell Culture Models

open access: yesAdvanced Materials Technologies, EarlyView.
Patient‐specific intracranial aneurysm models were fabricated using chocolate moulding, 3D printed water‐soluble cores, and direct resin 3D printing. Moulding PDMS around sacrificial cores made of chocolate or 3D printed water‐soluble resin yielded accurate, expandable, and endothelializable models that outperformed resin‐based approaches.
Chloe M. de Nys   +6 more
wiley   +1 more source

Equivariant Semidefinite Lifts of Regular Polygons [PDF]

open access: yesMathematics of Operations Research, 2017
Given a polytope P ⊂ ℝn, we say that P has a positive semidefinite lift (psd lift) of size d if one can express P as the projection of an affine slice of the d × d positive semidefinite cone. Such a representation allows us to solve linear optimization problems over P using a semidefinite program of size d and can be useful in practice when d is much ...
Hamza Fawzi   +2 more
openaire   +5 more sources

Nonlocomotory Robotic Strategies for Dynamic Rotation Control in Terrestrial Robots: A Review

open access: yesAdvanced Robotics Research, EarlyView.
Terrestrial robots increasingly require rapid body rotation to maintain stability and agility in complex environments. This review shows nonlocomotory rotational control strategies that operate without ground contact, including reaction wheels, tails, bars, limbs, and thrusters.
Y. Liang   +14 more
wiley   +1 more source

An isoperimetric problem for point interactions

open access: yes
We consider Hamiltonian with $N$ point interactions in $\R^d, d=2,3,$ all with the same coupling constant, placed at vertices of an equilateral polygon $\PP_N$. It is shown that the ground state energy is locally maximized by a regular polygon.
Abramowitz M S   +9 more
core   +2 more sources

Improving the Robustness of Visual Teach‐and‐Repeat Navigation Using Drift Error Correction and Event‐Based Vision for Low‐Light Environments

open access: yesAdvanced Robotics Research, EarlyView.
Visual teach‐and‐repeat (VTR) navigation allows robots to learn and follow routes without building a full metric map. We show that navigation accuracy for VTR can be improved by integrating a topological map with error‐drift correction based on stereo vision.
Fuhai Ling, Ze Huang, Tony J. Prescott
wiley   +1 more source

Ergodicity of polygonal slap maps [PDF]

open access: yes
Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon.
Del Magno, Gianluigi   +3 more
core   +1 more source

Packing ovals in optimized regular polygons [PDF]

open access: yesJournal of Global Optimization, 2019
Submitted for publication November ...
Frank J. Kampas   +2 more
openaire   +2 more sources

Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion

open access: yesAdvanced Robotics Research, EarlyView.
A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza   +3 more
wiley   +1 more source

A Symposium on the Fair Trade Laws: Part IV: Indirect Methods of Evading the Fair Trade Laws [PDF]

open access: yes
In this paper, we build infinitely many non-radial sign-changing solutions to the critical problem (P)−Δu=|u|[Formula presented]u, in Ω,u=0, on ∂Ω on the annulus Ω:=x∈RN ...
Aubin   +31 more
core   +1 more source

When is a polygon circumscribing a regular polygon again regular?

open access: yes, 1993
Let \({\mathcal A}\) be a regular \(n\)-gon with vertices \(A_ 1,A_ 2,\ldots,A_ n\) and edge-length =1, which is inscribed in \({\mathcal P}\), an \(n\)-gon with vertices \(P_ 1,P_ 2,\ldots,P_ n\), in such a way that \(A_ 1P_ 1=A_ 2P_ 2=\cdots=A_ nP_ n\). The main results of this paper are given in the following theorem. Theorem 1. If \(n=3\) or 4 or \(
Bennish, J., Gau, Y.D.
openaire   +2 more sources

Home - About - Disclaimer - Privacy