Results 41 to 50 of about 1,012,550 (289)
Generalized Petersen graphs and Kronecker covers [PDF]
The family of generalized Petersen graphs $G(n,k)$, introduced by Coxeter et al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. The
Matjaž Krnc, Tomaž Pisanski
doaj +1 more source
Circle packing in regular polygons
We study the packing of a large number of congruent and non-overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of N densely packed circles inside a regular polygon, and we have carried out intensive numerical experiments spanning several polygons (the largest number of sides ...
openaire +2 more sources
Monolithic UV‐ozone oxidation of Ta forms an ultrathin Ta2O5/TaOx bilayer enabling resistive switching with a vertical defect gradient. A stoichiometric surface layer over an oxygen‐deficient sublayer promotes localized filament nucleation near the top interface, enabling low‐voltage operation, and reduced cycle‐to‐cycle variability.
Seunghoon Yang +11 more
wiley +1 more source
UNFOLDED REGULAR AND SEMI-REGULAR POLYHEDRA
This paper proposes a presentation unfolding regular and semi-regular polyhedra. Regular polyhedra are convex polyhedra whose faces are regular and equal polygons, with the same number of sides, and whose polyhedral angles are also regular and equal ...
Elena Ionita +2 more
doaj +4 more sources
Here, we establish a low‐dose liquid‐phase electron microscopy workflow for real‐time observation of biological processes in hydrated conditions. Beam damage is reduced by imaging only 20% of the pixels and reconstructing the complete image using an inpainting algorithm.
Luco Rutten +7 more
wiley +1 more source
Random Polygons and Estimations of π
In this paper, we study the approximation of π through the semiperimeter or area of a random n-sided polygon inscribed in a unit circle in ℝ2. We show that, with probability 1, the approximation error goes to 0 as n → ∞, and is roughly sextupled when ...
Xu Wen-Qing, Meng Linlin, Li Yong
doaj +1 more source
When is a polygon circumscribing a regular polygon again regular?
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
Dense tactile streams from across the humanoid body converge on collide in a central wiring and data bottleneck. By relocating computation closer to and then into the skin itself, near‐ and in‐sensor architectures, together with neuromorphic computing, chart a path toward perception‐native electronic skin, in which the conversion of stimulus into ...
Mijin Kim +6 more
wiley +1 more source
Fair Share of Regular Polygon Pizzas
In his article we show how to fair share a regular polygon pizza with p sides between n people The first cut point F on the boundary is given and, as in round pizzas, the cuts are done from the center C to the boundary of the regular polygon; The Proof ...
Bortolossi, Humberto José
core
Metallic dimer antennas on top of the phase‐change material Ge3Sb2Te6 are addressed with laser pulses, resulting in inhomogeneous crystallization. A self‐consistent multiphysics model is employed to simulate the crystallization and to understand the resulting shift of the antenna resonance.
Luis Schüler +7 more
wiley +1 more source

