Although research shows that videogames have a positive impact on the majority of players, concerns remain about situations in which videogame play becomes disordered and harmful. Drawing self-determination theory dualistic model passion based previous non-videogame domains, we sought to explore extent need satisfaction outside (in general life) as well from predicted orientation. We also aimed...

We introduce a new local search algorithm for satisfiability problems. Usual approaches focus uniformly on unsatisfied clauses. The new method works by picking uniformly random variables in unsatisfied clauses. A Variable-based Focused Metropolis Search (V-FMS) is then applied to random 3-SAT. We show that it is quite comparable in performance to the clause-based FMS. Consequences for algorithm...

OBJECTIVES To assess the use of an acellular collagen matrix (Pelvicol, Bard Medical, Covington, GA, USA), a successful agent for reconstructive surgery, for enhancing penile girth. PATIENTS AND METHODS Between June and December 2011, 18 patients (mean age 24 years, range 19-38) had their penis augmented with Pelvicol; the mean (range) penile circumference was 9.2 (7-13) cm before treatment. ...

We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, while satisfied by a “perfect” solution, may be left unsatisfied in an approximate extended answer set. Approximations improve as the number of unsatisfied constraints decreases. We show how the framework can also capture the class...

The choice of the variable to flip in the Walksat family procedures is always random in that it is selected from a randomly chosen unsatisfied clause c. This choice in Novelty or R-Novelty heuristics also contains some determinism in that the variable to flip is always limited to the two best variables in c. In this paper, we first propose a diversification parameter for Novelty (or R-Novelty) ...

During local search, clauses may frequently be satisfied or falsified. Modern SLS algorithms often exploit the falsifying history of clauses to select a variable to flip, together with variable properties such as score and age. The score of a variable x refers to the decrease in the number of unsatisfied clauses if x is flipped. The age of x refers to the number of steps done since the last tim...