The connection between four different approaches to quantization of the relativistic particle is studied: reduced phase space quantization, Dirac quantization, BRST quantization, and (BRST)-Fock quantization are each carried out. The connection to the BFV path integral in phase space is provided. In particular, it is concluded that that the full range of the lapse should be used in such path in...

We present a comparative study of GPU ray tracing implemented for two different types of ray-triangle intersection algorithms used with BVH (Bounding Volume Hierarchy) spatial data structure evaluated for performance on three static scenes. We study how number of triangles placed in a BVH leaf node affects rendering performance. We propose GPUoptimized SIMD ray-triangle intersection method eval...

We introduce a graphical method, likelihood-mapping, to visualize the phylogenetic content of a set of aligned sequences. The method is based on an analysis of the maximum likelihoods for the three fully resolved tree topologies that can be computed for four sequences. The three likelihoods are represented as one point inside an equilateral triangle. The triangle is partitioned in different reg...

Late Antiquity viewed from below: What a village and its papyri can add to the bigger picture - G. R. Ruffini 2018. Life in an Egyptian Village Antiquity: Aphrodito before after Islamic Conquest. Cambridge: Cambridge University Press. Pp. x + 233. 12 figures, 1 map. ISBN 978-1-107-10560-7. Volume 34 Issue

The Heilbronn problem for triangle[Wei] is defined as follows: place N points inside a triangle of unit area, so as to maximize the area of the smallest triangle obtained by choosing 3 points among N. Several authors worked towards finding lower bounds or optimal configurations of points. In this paper, we propose upper bounds for those problems, obtained by a method of automated theorem proving.

In this paper we describe a method for directly generating triangle strips from unstructured point clouds based on onion peeling triangulation (OPT). It is an iterative reconstruction of the convex hulls of point clouds in the 2D plane, and it uses pairs of subsequent layers to establish triangle strips. We compare the obtained triangulations with the results of Delaunay triangulations in terms...

An Apollonian configuration of circles is a collection of circles in the plane with disjoint interiors such that the complement of the interiors of the circles consists of curvilinear triangles. One well studied method of forming an Apollonian configuration is to start with three mutually tangent circles and fill a curvilinear triangle with a new circle, then repeat with each newly created curv...

Regarding the importance of ring spinning method among spinning systems, great potentials exist for research about on the improvement of the quality and properties of ring spun yarn. This study aims to improve yarn quality by changing the shape and dimensions of spinning triangle through forming a groove in the middle zone of the front darfting &#10roller with a curvature of 5 to 7 mm. For the ...

In this paper, we propose gated recurrent feature pyramid for the problem of learning object detection from scratch. Our approach is motivated by the recent work of deeply supervised object detector (DSOD) [24], but explores new network architecture that dynamically adjusts the supervision intensities of intermediate layers for various scales in object detection. The benefits of the proposed me...

In this paper we present an efficient method to compute the signed distance field for a large triangle mesh, which can run interactively with GPU accelerated. Restricted by absence of flexible pointer addressing on GPU, we design a novel multi-layer hash table to organize the voxel/triangle overlap pairs as two-tuples, such strategy provides an efficient way to store and access. Based on the ge...