scholarly journals Fullerene Nanoarchitectonics: Rich Possibilities in Organized Structures from Zero-Dimensional Unit

Oleoscience ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 221-225
Author(s):  
Katsuhiko ARIGA ◽  
Lok Kumar SHRESTHA
Keyword(s):  
Sensors ◽  
2021 ◽  
Vol 21 (9) ◽  
pp. 2939
Author(s):  
Yong Hong ◽  
Jin Liu ◽  
Zahid Jahangir ◽  
Sheng He ◽  
Qing Zhang

This paper provides an efficient way of addressing the problem of detecting or estimating the 6-Dimensional (6D) pose of objects from an RGB image. A quaternion is used to define an object′s three-dimensional pose, but the pose represented by q and the pose represented by -q are equivalent, and the L2 loss between them is very large. Therefore, we define a new quaternion pose loss function to solve this problem. Based on this, we designed a new convolutional neural network named Q-Net to estimate an object’s pose. Considering that the quaternion′s output is a unit vector, a normalization layer is added in Q-Net to hold the output of pose on a four-dimensional unit sphere. We propose a new algorithm, called the Bounding Box Equation, to obtain 3D translation quickly and effectively from 2D bounding boxes. The algorithm uses an entirely new way of assessing the 3D rotation (R) and 3D translation rotation (t) in only one RGB image. This method can upgrade any traditional 2D-box prediction algorithm to a 3D prediction model. We evaluated our model using the LineMod dataset, and experiments have shown that our methodology is more acceptable and efficient in terms of L2 loss and computational time.


1992 ◽  
Vol 46 (3) ◽  
pp. 479-495 ◽  
Author(s):  
Stephen Joe ◽  
David C. Hunt

A lattice rule is a quadrature rule used for the approximation of integrals over the s-dimensional unit cube. Every lattice rule may be characterised by an integer r called the rank of the rule and a set of r positive integers called the invariants. By exploiting the group-theoretic structure of lattice rules we determine the number of distinct lattice rules having given invariants. Some numerical results supporting the theoretical results are included. These numerical results are obtained by calculating the Smith normal form of certain integer matrices.


10.37236/1951 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Michael Gnewuch

The extreme or unanchored discrepancy is the geometric discrepancy of point sets in the $d$-dimensional unit cube with respect to the set system of axis-parallel boxes. For $2\leq p < \infty$ we provide upper bounds for the average $L^p$-extreme discrepancy. With these bounds we are able to derive upper bounds for the inverse of the $L^\infty$-extreme discrepancy with optimal dependence on the dimension $d$ and explicitly given constants.


2019 ◽  
Vol 53 (3) ◽  
pp. 987-1003 ◽  
Author(s):  
Claudio Canuto ◽  
Ricardo H. Nochetto ◽  
Rob P. Stevenson ◽  
Marco Verani

Both practice and analysis of p-FEMs and adaptive hp-FEMs raise the question what increment in the current polynomial degree p guarantees a p-independent reduction of the Galerkin error. We answer this question for the p-FEM in the simplified context of homogeneous Dirichlet problems for the Poisson equation in the two dimensional unit square with polynomial data of degree p. We show that an increment proportional to p yields a p-robust error reduction and provide computational evidence that a constant increment does not.


1995 ◽  
Vol 140 ◽  
pp. 151-166
Author(s):  
Shigeo Kawai

In this paper we consider the following problem: Given a smooth function K on the n-dimensional unit sphere Sn(n ≥ 3) with its canonical metric g0, is it possible to find a pointwise conformal metric which has K as its scalar curvature? This problem was presented by J. L. Kazdan and F. W. Warner. The associated problem for Gaussian curvature in dimension 2 had been presented by L. Nirenberg several years before.


1966 ◽  
Vol 9 (05) ◽  
pp. 557-562 ◽  
Author(s):  
H. L. Abbott

For positive integral n let Cn denote the n-dimensional unit cube with vertices (δ1, δ2,…, δn) where δi = 0 or 1 for i=1, 2,…, n. Call two vertices of Cn adjacent if the distance between them is 1.


Sign in / Sign up

Export Citation Format

Share Document