Introduction: Pharmacology is perceived as a volatile subject asit’s difficult to recall and recite the core of the subject. Enrichingthe learning environment through incorporation of a variety ofteaching and learning strategies and methods yields enhancedlearning. Crossword puzzles provide expansion of vocabulary,stimulate thinking capacity, boost confidence, and fasten up thelearning capacity...

Aggregated (S; s)models purport to provide a structural, microfounded and statistically robust explanation of aggregate investment ‡uctuations. In this paper I analyse these claims, present several empirical puzzles arising from the model and discuss how the model might be extended to account for these puzzles.

There are three astroparticle physics puzzles which fire the imagination: the origin of the " Great Positron Producer " in the galactic bulge, the nature of the gamma-ray bursts central engine and the mechanism of supernova explosions. We show that the mirror matter model has the potential to solve all three of these puzzles in one beautifully simple strike.

We proposed several strategies to improve the sparse optimization methods for solving Sudoku puzzles. Further, we defined a new difficult level for Sudoku. We tested our proposed methods on Sudoku puzzles data-set. Numerical results showed that we can improve the accurate recovery rate from 84%+ to 99%+ by the L1 sparse optimization method.

Heyawake is one of many recently popular Japanese pencil puzzles. We investigate the computational complexity of the problem of deciding whether a given puzzle instance has a solution or not. We show that Boolean gates can be emulated via Heyawake puzzles, and that it is possible to reduce the Boolean Satisfiability problem to Heyawake. It follows that the problem in question is NP-complete.

The goal of a 2D assembly puzzle is to arrange a given set of polygonal pieces in a way that they do not overlap and form a target polygonal silhouette. For example, there are over 5,000 Tangram assembly puzzles [4], and many more similar 2D assembly puzzles; see, e.g., [2]. A recent trend in the puzzle world is a relatively new type of 2D assembly puzzle which we call symmetric assembly puzzle...

We analyze the computational complexity of solving the three “temporal rift” puzzles in the recent popular video game Final Fantasy XIII-2. We show that the Tile Trial puzzle is NP-hard and we provide an efficient algorithm for solving the Crystal Bonds puzzle. We also show that slight generalizations of the Crystal Bonds and Hands of Time puzzles are NP-hard.

Cryptographic puzzles are moderately difficult problems that can be solved by investing non-trivial amounts of computation and/or storage. Devising models for cryptographic puzzles has only recently started to receive attention from the cryptographic community as a first step towards rigorous models and proofs of security of applications that employ them (e.g. Denial-of-service (DoS) resistance...