Results 31 to 40 of about 13,845 (257)

Characterizations of the Suzuki tower near polygons [PDF]

open access: yesDesigns, Codes and Cryptography, 2016
20 pages; some revisions based on referee reports; added more references; added remarks 1.4 and 1.5; corrected typos; improved the overall ...
Anurag Bishnoi, Bart De Bruyn
openaire   +3 more sources

The structure of near polygons with quads [PDF]

open access: yesGeometriae Dedicata, 1983
We develop a structure theory for near polygons with quads. Main results are the existence of sub 2j-gons for 2jd and the nonexistence of regular sporadic 2d-gons for d4 with s>1 and t 2>1 and t 3t 2(t 2+1).
Brouwer, A.E., Wilbrink, H.A.
openaire   +2 more sources

Perimeter Modes of Nanomechanical Resonators Exhibit Quality Factors Exceeding 10^{9} at Room Temperature

open access: yesPhysical Review X, 2022
Systems with low mechanical dissipation are extensively used in precision measurements such as gravitational wave detection, atomic force microscopy, and quantum control of mechanical oscillators via optomechanics and electromechanics.
Mohammad J. Bereyhi   +6 more
doaj   +1 more source

Impact of recreational transformation of soil physical properties on micromolluscs in an urban park

open access: yesBiosystems Diversity, 2021
The paper assesses the effect of transformation of soil physical properties on the abundance of micromolluscs in the conditions of an urban park. The studies were carried out in Novooleksandrivskiy Park (Melitopol, Ukraine).
V. S. Budakova   +5 more
doaj   +1 more source

Near polygons and Fischer spaces [PDF]

open access: yesGeometriae Dedicata, 1994
The concept of near polygon was introduced by \textit{E. Shult} and \textit{A. Yanushka} [Geom. Dedicata 9, 1-72 (1980; Zbl 0433.51008)] as a tool in the study of systems of lines in a Euclidean space. In this paper, the authors construct some infinite families of near polygons, and classify near hexagons with lines of length 3 and with quads.
A.E. Brouwer (Andries)   +3 more
openaire   +3 more sources

An inequality for regular near polygons

open access: yesEuropean Journal of Combinatorics, 2005
Let $G$ denote a near-polygon distance-regular graph with diameter $d\geq 3$, valency $k$ and intersection numbers $a_1>0$, $c_2>1$. Let $θ_1$ denote the second largest eigenvalue for the adjacency matrix of $G$. We show $θ_1$ is at most $(k-a_1-c_2)/(c_2-1)$.
Paul M. Terwilliger, Chih-Wen Weng
openaire   +2 more sources

Direct Investment Casting For Pattern Developed By Desktop 3D Printer

open access: yesMATEC Web of Conferences, 2017
Development of RP technologies has encouraged rapid study on portable 3D Printer in which there are varieties of portable 3D printer machines in market.
Marwah O.M.F.   +5 more
doaj   +1 more source

Performance analysis of the working surface of the rails from test batches on the Test Loop of JSC “VNIIZhT”

open access: yesВестник Научно-исследовательского института железнодорожного транспорта, 2018
The monitoring of railway rails damage on the railway network of the JSC “Russian Railways” as well as operational and polygon tests are conducted with the purpose of assessing the impact of operating conditions on the intensity of rails damage ...
M. Yu. Khvostik   +3 more
doaj   +1 more source

The geodesic Fréchet distance between two curves bounding a simple polygon

open access: yesJournal of Computational Geometry
The Fréchet distance is a popular similarity measure that is well understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved significantly, even in ...
Thijs van der Horst   +3 more
doaj   +1 more source

Results and perspectives of tectonomagnetic investigations in the Western Antarctic

open access: yesAnnals of Geophysics, 2009
The results of long-term (1998-2005 yrs.) tectonomagnetic investigations in the Western Antarctic near the location<br />of Ukrainian Antarctic Station «Academic Vernadsky» are reviewed.
Ihor O. Chobotok   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy