Results 21 to 30 of about 254,738 (273)

Wireless Sensor Network-Based Rigid Body Localization for NLOS Parameter Estimation

open access: yesSensors, 2022
In wireless sensor network (WSN)-based rigid body localization (RBL) systems, the non-line-of-sight (NLOS) propagation of the wireless signals leads to severe performance deterioration.
Pengwu Wan   +3 more
doaj   +1 more source

RECTILINEAR AND BROWNIAN MOTION FROM A RANDOM POINT IN A CONVEX REGION

open access: yesImage Analysis and Stereology, 2011
A particle is projected from a point P in a subset E of a convex region H to a point Q in a uniformly random direction. The probability that Q lies in the interior of H at time t is obtained for two types of motion of the particle, rectilinear (i.e ...
Peter Ehlers, Ernest Enns, Tak Fung
doaj   +1 more source

Relative convex body in Euclidean and hyperbolic spaces [PDF]

open access: yesDelta Journal of Science, 2017
This paper is to generalize the concept of convex body to the so called relative convexbody in Euclidean space 𝐸􀯡 . Some geometrical and topological properties for this kind of sets arediscussed. Some properties of the central projection map(Beltrami map)
Doaa Mohammed El-sayed   +2 more
doaj   +1 more source

CONVEX BODIES AND GAUSSIAN PROCESSES

open access: yesImage Analysis and Stereology, 2011
For several decades, the topics of the title have had a fruitful interaction. This survey will describe some of these connections, including the GB/GC classification of convex bodies, Ito-Nisio singularities from a geometric viewpoint, Gaussian ...
Richard A Vitale
doaj   +1 more source

On the volume of sections of a convex body by cones [PDF]

open access: yes, 2016
Let $K$ be a convex body in $\mathbb R^n$. We prove that in small codimensions, the sections of a convex body through the centroid are quite symmetric with respect to volume.
Fradelizi, Matthieu   +2 more
core   +2 more sources

Covering the Boundary of Special Convex Bodies with Smaller Homothetic Copies

open access: yesJournal of Harbin University of Science and Technology, 2019
For Hadwiger conjecture that the least number c(K) of translates of the interior of K needed to cover K is at most 2n, according to the fact that c(K) equals the least number of smaller homothetic copies of K with the same homothetic ratio needed to ...
JI Dong-hai, Lv De-jing, MA Ze-min
doaj   +1 more source

COMPARATIVE PRECISION OF THE PIVOTAL ESTIMATORS OF PARTICLE SIZE

open access: yesImage Analysis and Stereology, 2011
The pivotal estimators of the surface area and the volume of a generic "particle" are based on a point sampled test line on an isotropic pivotal plane through a fixed point called the pivotal point.
Luis M Cruz-Orive
doaj   +1 more source

Evaluating bone quality and asymmetrical aplasia of the thoracic vertebral body in Lenke 1A adolescent idiopathic scoliosis using hounsfield units

open access: yesFrontiers in Surgery, 2022
Study DesignRetrospective analysis.ObjectiveTo evaluate bone quality and investigate asymmetrical development of the thoracic vertebral body in adolescent idiopathic scoliosis (AIS) based on Hounsfield unit (HU) measurements obtained from computed ...
Taiqiu Chen   +11 more
doaj   +1 more source

Starshaped locally convex hypersurfaces with prescribed curvature and boundary [PDF]

open access: yes, 2015
In this paper we find strictly locally convex hypersurfaces in $\mathbb{R}^{n+1}$ with prescribed curvature and boundary. The main result is that if the given data admits a strictly locally convex radial graph as a subsolution, we can find a radial graph
Su, Chenyang
core   +3 more sources

On convex body chasing [PDF]

open access: yesDiscrete & Computational Geometry, 1993
Given a metric space \((S,\rho)\), and a sequence of regions \(F_ i\), \(i=1,\dots,n\), say the plane \(R^ 2\) and a sequence of convex sets, one is supposed to design an algorithm producing a path \(x_ i\), \(i=1,\dots,n\), \(x_ i\in F_ i\), minimizing the cost \(\sum^{n- 1}_{i=1}\rho(x_ i,x_{i+1})\).
Joel Friedman, Nathan Linial
openaire   +2 more sources

Home - About - Disclaimer - Privacy