Results 21 to 30 of about 13,845 (257)
Self assembly of model polymers into biological random networks
Computational and Structural Biotechnology Journal, 2021 The properties of biological networks, such as those found in the ocular lens capsule, are difficult to study without simplified models. Model polymers are developed, inspired by “worm-like” curve models, that are shown to spontaneously self assemble to ...
Matthew H.J. Bailey, Mark Wilson
doaj +1 more source
On m-ovoids of regular near polygons [PDF]
Designs, Codes and Cryptography, 2017 We generalise the work of Segre (1965), Cameron - Goethals - Seidel (1978), and Vanhove (2011) by showing that nontrivial $m$-ovoids of the dual polar spaces $DQ(2d, q)$, $DW(2d-1,q)$ and $DH(2d-1,q^2)$ ($d\ge 3$) are hemisystems. We also provide a more general result that holds for regular near polygons.
John Bamberg +2 more
openaire +3 more sources
Machine-assisted discovery of integrable symplectic mappings
Physical Review Research, 2023 We present a new automated method for finding integrable symplectic maps of the plane. These dynamical systems possess a hidden symmetry associated with an existence of conserved quantities, i.e., integrals of motion.
T. Zolkin, Y. Kharkov, S. Nagaitsev
doaj +1 more source
Searching for the closest-pair in a query translate
Journal of Computational Geometry, 2020 We consider a range-search variant of the closest-pair problem. Let $\varGamma$ be a fixed shape in the plane. We are interested in storing a given set of $n$ points in the plane in some data structure such that for any specified translate of $\varGamma$
Jie Xue +3 more
doaj +1 more source
Near polygons with a nice chain of sub-near polygons
Journal of Combinatorial Theory, Series A, 2004 A near polygon is a partial linear space \({\mathcal S}=({\mathcal P},{\mathcal L})\) with the property that for every point \(p\in {\mathcal P}\) and for every line \(L\in {\mathcal L}\) there exists a unique point on \(L\) nearest to \(p\). Here distances \(d(\cdot,\cdot)\) are measured in the collinearity graph \(\Gamma\). If \(n=\text{diam}(\Gamma)\
Bart De Bruyn, Pieter Vandecasteele
openaire +2 more sources
Brief communication: Rapid machine-learning-based extraction and measurement of ice wedge polygons in high-resolution digital elevation models [PDF]
The Cryosphere, 2019 We present a workflow for the rapid delineation and microtopographic characterization of ice wedge polygons within high-resolution digital elevation models.
C. J. Abolt +4 more
doaj +1 more source
Pulse Tripling Circuit and Twelve Pulse Rectifier Combination for Sinusoidal Input Current
IEEE Access, 2021 In this paper, a novel pulse tripling circuit (PTC) is suggested, to upgrade a polygon autotransformer 12-pulse rectifier (12-PR) to a 36-pulse rectifier (36-PR) with a low power rating.
Rohollah Abdollahi +3 more
doaj +1 more source
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment [PDF]
Discrete & Computational Geometry, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan Halperin, Micha Sharir
openaire +1 more source
Геодинамика и тектонофизика, 2022 Information is presented about the Bystrov vibroseismic landfill near Novosibirsk, which houses Large-Scale Research Facilities with no analogues in the world – powerful 50–100-ton vibration sources (GRV-50, CVM-100, CV-40).
V. M. Soloviev +4 more
doaj +1 more source
Some Extensions and Embeddings of Near Polygons [PDF]
Journal of Algebraic Combinatorics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cuypers, H., Meixner, T.
openaire +1 more source