Introduction: Computed tomography (CT) has numerous applications in clinical procedures but its main problem is its high radiation dose to the patients compared to other imaging modalities using x-ray. CT delivers approximately high doses to the nearby tissues due to the scattering effect, fan beam (beam divergence) and limited collimator efficiency. The radiation dose from multi-slice scanners...

We introduce the notion of magic functions of a general domain in C and show that the set of magic functions of a given domain is an intrinsic complex-geometric object. We determine the set of magic functions of the symmetrised bidisc G, and thereby find all automorphisms of G and a formula for the Carathéodory distance on G.

Let G be a subdivision of a ladder graph. In this paper we study magic evaluation with type (1, 1, 1) for a given any general ladder graph G. We prove that subdivided ladder admits magic evaluation having type (1, 1, 1). We also prove such a subdivision admits consecutive magic evaluation having type (1, 1, 0). AMS (MOS) Subject Classification Codes: 05C78

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...