Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision dete...

In this paper, we introduce a fractional domination game arising from fractional domination problems on graphs and focus on its balancedness and concavity. We first characterize the core of the fractional domination game and show that its core is always non-empty taking use of dual theory of linear programming. Furthermore we study concavity of this game.

The aim of this study was to determine the validity of cervical vertebrae radiographic assessment to predict skeletal maturation. Left hand-wrist and lateral cephalometric radiographs of 958 Spanish children from 5 to 18 years of age were measured. On the left hand-wrist radiographs the classification of Grave and Brown was used to assess skeletal maturation. Cervical vertebrae maturation was e...

The Cauchy problem for the nonlinear one-dimensional sixth-order Boussinesq equation with logarithmic nonlinearity is concerned in this paper. Results of global existence and exponential growth solution are got framework potential well utilizing Galerkin method concavity at subcritical critical initial energy levels.

In this paper, we study an initial boundary value problem for a $p$-Laplacian hyperbolic equation with logarithmic nonlinearity. By combining the modified potential well method Galerkin method, existence of global weak solution is studied, and polynomial exponential decay estimation under certain conditions are also given. Moreover, by using concavity other techniques, obtain blow up results at...

This paper deals with the existence of solutions a p-biharmonic pseudo parabolic partial differential equation logarithmic nonlinearity in bounded domain. We prove global weak using Faedo-Galerkin method and applying concavity approach, that blow up at finite time. Further, we provide maximal limit for blow-up

Rouzbeh Amini1, PhD; Julie E whitcomb2, MS; Tiago S Prata3, MD Syril Dorairaj3, MD; Jeffrey M Liebmann3,4, MD; Robert Ritch3,5, MD; Victor H Barocas1, PhD 1Department of Biomedical Engineering, University of Minnesota, Minneapolis, Minnesota, USA 2Department of Mechanical Engineering, University of Minnesota, Minneapolis, Minnesota, USA 3Einhorn Clinical Research Center, New York Eye and Ear In...

Fast Approximate Convex Decomposition. (August 2012) Mukulika Ghosh, B.Tech, National Instrtitue of Technology, Durgapur Chair of Advisory Committee: Dr. Nancy M. Amato Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decom...

‎In this paper‎, ‎we consider the existence and uniqueness of the global solution for the sixth-order damped Boussinesq equation‎. ‎Moreover‎, ‎the finite-time blow-up of the solution for the equation is investigated by the concavity method‎.