This article describes a unique prosthetically driven protocol that uses computeraided engineering to develop sophisticated, scientific algorithms that guide the fabrication of a conversion denture using the AvaDent Digital Denture system (Global Dental Science). This system is combined with Nobel Clinician (Nobel Biocare) implant-planning software to optimize accuracy and to make it easier and...

We propose an approach to remodelling classical planning domains via the addition of macro operators and removal of original operators either for the domain as a whole or instance-by-instance. For the latter remodelling, we train a predictor to choose the best reformulation of the domain based on instance characteristic. In the domain level remodelling, we try find a fixed remodelling that work...

The Region Algebra is a set-at-a-time algebra for querying text regions. We show that satisfiability, inclusion, and equivalence testing of region algebra expressions are PSPACE-complete. This improves upon the previously known NP lower bounds and EXPTIME upper bounds.

Information and Communication Technology integration in education projects was first piloted in May 2012 at four supplementary education centres for adolescents in four villages of the Kandi block in the Murshidabad district of West Bengal. The purpose was to provide an opportunity for adolescents to interact, explore and authenticate their learning at school, using technology. The integrated a...

Three-dimensional representation to screen the adaptation process of individual dentures is presented. In the parametric analysis of electromyographic (EMG) signals, we have to deal with the complicated behavior of a lot of parameters in the time domain. We have employed the less-biased time varying AR model parameters estimated by locally quasi-stationary processing. Hence, we propose the time...

The complexity of the black-white pebbling game has remained an open problem for 30 years. In this paper we show that the black-white pebbling game is PSPACE-complete.

Kayles is the game, where two players alternately choose a vertex that has not been chosen before nor is adjacent to an already chosen vertex from a given graph. The last player that choses a vertex wins the game. We show, with help of Sprague-Grundy theory, that the problem to determine which player has a winning strategy for a given graph, can be solved in O(n3) time on interval graphs, on ci...

Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a set of domino tiles, each with two labeled square faces, and take turns connecting them into a growing chain of dominoes by matching identical faces. We show that singleplayer dominoes is in P, while multiplayer dominoes is hard: when players cooperate, the game is NP-complete, and when players c...