Results 201 to 210 of about 7,440 (255)
Syntheses, Single-Crystal Structures, and Structural Chemistry of Hexafluoridouranates(V), <i>M</i>UF<sub>6</sub> (<i>M</i> = Li-Cs, Ag, Tl, H<sub>3</sub>O), and the Dodecafluoridodiuranate(V) Ba[U<sub>2</sub>F<sub>12</sub>]·1.36HF. [PDF]
Inorg ChemScheibe B, Wassermann TB, Kraus F.
europepmc +1 more source
Hierarchical assembly of a Ti<sub>24</sub> metal-organic polyhedron via kinetic trapping of intermediates. [PDF]
Nat CommunLi HZ, Yang CY, Gu C, Wang F, Zhang J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Pivoting in an Outcome Polyhedron
Journal of Global Optimization, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harold P. Benson, Erjiang Sun
openaire +1 more source
Shortest paths on a polyhedron
Proceedings of the sixth annual symposium on Computational geometry - SCG '90, 1990We present an algorithm for determining the shortest path between a source point and any destination point along the surface of a polyhedron (need not be convex). Our algorithm uses a new approach which deviates from the conventional “continuous Dijkstra” technique.
Jindong Chen, Yijie Han
openaire +1 more source
Polyhedrons and Quasi-polyhedrons
2015In elementary geometry, a polyhedron (plural polyhedra or polyhedrons) is a body in three dimensions with flat faces, straight edges and sharp corners or vertices. The word “polyhedron” comes from the Classical Greek as poly- (“many”) and -hedron (form of “base” or “seat”).
S. N. Krivoshapko, V. N. Ivanov
openaire +1 more source
Canadian Journal of Mathematics, 1983
1. Introduction. Let P be a polyhedron (i.e., a 3-dimensional polytope). A path in P is defined as a sequence of edges (x1, x2), …, (xi−1, xi), (xi, xi−1), …, (xn−1, xn) where (xi, xi+1) denotes the edge with endpoints Xi and Xi+1. Define the length |A| of a path A to be the number of edges of said path. The distance between any two vertices x and y of
openaire +1 more source
1. Introduction. Let P be a polyhedron (i.e., a 3-dimensional polytope). A path in P is defined as a sequence of edges (x1, x2), …, (xi−1, xi), (xi, xi−1), …, (xn−1, xn) where (xi, xi+1) denotes the edge with endpoints Xi and Xi+1. Define the length |A| of a path A to be the number of edges of said path. The distance between any two vertices x and y of
openaire +1 more source
Computing the integer points of a polyhedron [PDF]
ACM Communications in Computer Algebra, 2019 The integer points of polyhedral sets are of interest in many areas of mathematical sciences, see for instance the landmark textbooks of A. Schrijver [18] and A. Barvinok [3], as well as the compilation of articles [4]. One of these areas is the analysis and transformation of computer programs. For instance, integer programming [6] is used
Rui-Juan Jing, Marc Moreno Maza
openaire +1 more source
2015 IEEE 4th Global Conference on Consumer Electronics (GCCE), 2015
In this study, we developed an audio system that is made up of speaker system of regular polyhedron enclosure, and multi channel digital audio amplifier. The speaker system has loudspeaker units that are independently wired out of the enclosure, and are controlled independently. The amplifier can control their output timing and amplitudes independently
Mitsugu Suzuki +2 more
openaire +1 more source
In this study, we developed an audio system that is made up of speaker system of regular polyhedron enclosure, and multi channel digital audio amplifier. The speaker system has loudspeaker units that are independently wired out of the enclosure, and are controlled independently. The amplifier can control their output timing and amplitudes independently
Mitsugu Suzuki +2 more
openaire +1 more source
Characterization of polyhedron monotonicity
Computer-Aided Design, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. S. Ha, K. H. Yoo, James K. Hahn
openaire +1 more source