This paper describes the origin, design, and implementation of Smule's Magic Fiddle, an expressive musical instrument for the iPad. Magic Fiddle takes advantage of the physical aspects of the device to integrate game-like and pedagogical elements. We describe the origin of Magic Fiddle, chronicle its design process, discuss its integrated music education system, and evaluate the overall experie...

Children's magical explanations and beliefs were investigated in 2 studies. In Study 1, we first asked 4- and 5-year-old children to judge the possibility of certain object transformations and to suggest mechanisms that might accomplish them. We then presented several commonplace transformations (e.g., cutting a string) and impossible events (magic tricks). Prior to viewing these transformation...

The integration of EMST into the complete query-rewrite rule system enables us to eliminate the unnecessary complexity introduced by EMST in the query graph. EMST uses bcf adornments, can push equality and condition predicates, can push local and join predicates , adorns and transforms queries in one phase, can handle correlations, and is extensible. We have developed a cost-based heuristic to ...

A graph is called degree-magic if it admits a labelling of the edges by integers 1, 2, . . . , |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal to 1+|E(G)| 2 deg(v). Degree-magic graphs extend supermagic regular graphs. In this paper we characterize complete tripartite degree-magic graphs.

For any k ∈ N, a graph G = (V, E) is said to be Zk-magic if there exists a labeling l : E(G) → Zk − {0} such that the induced vertex set labeling l : V (G) → Zk defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. For a given graph G, the set of all k ∈ N for which G is Zk-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper we will consider the functional exte...

For any k ∈ N, a graph G = (V,E) is said to be Zk-magic if there exists a labeling l : E(G) −→ Zk − {0} such that the induced vertex set labeling l : V (G) −→ Zk defined by l(v) = ∑ u∈N(v) l(uv) is a constant map. For a given graph G, the set of all k ∈ Z+ for which G is Zk-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper we will consider trees whose diamet...

For any h ∈ IN , a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → ZZ h − {0} such that the induced vertex set labeling l : V (G) → ZZ h defined by l(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The null set of G is the set of all natural numbers h ∈ IN for which G admits a zero-sum h-magic labeling. In this pap...

Background: Polymer gel dosimeters combined with magnetic resonance imaging (MRI) can be used for dose verification of advanced radiation therapy techniques. However, the uncertainty of dose map measured by gel dosimeter should be known. The purpose of this study is to investigate the uncertainty related to calibration curve and MRI protocol for MAGIC (Methacrylic and Ascorbic acid in Gelatin I...

We introduce a family of magic squares, called linear magic squares, and show that any parallel linear sudoku solution of sufficiently large order can be relabeled so that all of its subsquares are linear magic. As a consequence, we show that if n has prime factorization p1 1 · · · p kt t and q = min{p k j j | 1 ≤ j ≤ t}, then there is a family of q(q − 1) mutually orthogonal magic sudoku solut...

Precision measurements and quantum-information processing with cold atoms may benefit from trapping atoms with specially engineered, “magic” optical fields. At the magic trapping conditions, the relevant atomic properties remain immune to strong perturbations by the trapping fields. Here we develop a theoretical analysis of magic trapping for especially valuable Zeeman-insensitive clock transit...