In this work, growth and assembly of the micro polyhedral zinc oxide was performed using airbubble assisted Triton X100, as a templating agent. In absence of air bubbling in the reactionsystem the nano plate zinc oxide was synthesized. The prepared samples were characterized by Xraydiffraction (XRD), field emission scanning electron microscopy (FE-SEM) and UV-Visspectrop...

The thermal properties and rheological behaviors of polystyrene (PS)-based thermoplastics bearing polyhedral oligosilsesquioxane (POSS) were investigated with variation of isobutyl (iBu)-POSS weight percentage. The incorporation of POSS-group significantly decreases the glass transition temperature and the rubbery plateau modulus. These findings are attributed to an influence of the nanometer-s...

A realistic input model for polyhedral terrains was introduced in [16]. With this model, improved upper and lower bounds on the combinatorial complexity of visibility and distance structures on these terrains were obtained. In this paper, we perform experiments with realworld data to determine how realistic the assumptions of that input model are, by examining what the values of the model param...

Definition 0.2. For any two sets X and Y, let Map (X, Y) denote the set of all maps from X to Y. Define a K-vector space M by M = ⊕ n≥0 Map (Rn, K) (where each Map (Rn, K) becomes a K-vector space by pointwise addition and multiplication with scalars). We make M into a K-algebra, whose multiplication is defined as follows: For any n ∈ N, any m ∈ N, any f ∈ Map (Rn, K) and g ∈ Map (Rm, K), we de...

There is a long history of constructions of non-shellable triangulations of -dimensional (topological) balls. This paper gives a survey of these constructions, including Furch’s 1924 construction using knotted curves, which also appears in Bing’s 1962 survey of combinatorial approaches to the Poincaré conjecture, Newman’s 1926 explicit example, and M. E. Rudin’s 1958 non-shellable triangulation...

The Polyhedral Escape Problem for continuous linear dynamical systems consists of deciding, given an affine function f : R → R and a convex polyhedron P ⊂ R, whether, for some initial point x0 in P, the trajectory of the unique solution to the differential equation ẋ(t) = f(x(t)),x(0) = x0, t ≥ 0, is entirely contained in P. We show that this problem is decidable, by reducing it in polynomial t...

We prove that [n/2J vertex guards are always sufficient and sometimes necessary to guard the surface of an n-vertex polyhedral terrain. We also show that l(4n 4)/13J edge guards are sometimes necessary to guard the surface of an n-vertex polyhedral terrain. The upper bound on the number of edge guards is ln/3J (Everett and Rivera-Campo, 1994). Since both upper bounds are based on the four color...

We give combinatorial models for the homotopy type of complements elliptic arrangements (i.e., certain sets abelian subvarieties in a product curves). presentation fundamental group such spaces and, as an application, we treat case ordered configuration curves. Our are finite polyhedral CW complexes, and our tools choice acyclic categories (small without loops). As stepping stone, characterizat...

Parallel and heterogeneous computing are growing in audience thanks to the increased performance brought by ubiquitous manycores and GPUs. However, available programming models, like OPENCL or CUDA, are far from being straightforward to use. As a consequence, several automated or semi-automated approaches have been proposed to automatically generate hardware-level codes from high-level sequenti...