نتایج جستجو برای: magic seeds

تعداد نتایج: 54469  

A R Montazerabadi A Takavar M H Zahmatkesh M Keshtkar,

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

Journal: :The American Mathematical Monthly 2012
John Lorch

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

2010
Andrei Derevianko

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

2008
Ebrahim Salehi Sin-Min Lee

For any kEN, a graph G = (V, E) is said to be ;:z k-magic if there exists a labeling Z: E( G) --+ ;:z k {OJ such that the induced vertex set labeling Z+: V (G) --+ ;:z k defined by Z+(v) = L Z(uv) uvEE(G) is a constant map. For a given graph G, the set of all kEN for which G is ;:z k-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper we will consider the func...

2008
Robert Wagner

Since 2004, the MAGIC γ-ray telescope has newly discovered 6 TeV blazars. The total set of 13 MAGIC-detected active galactic nuclei includes well-studied objects at other wavelengths like Markarian 501 and the giant radio galaxy M 87, but also the distant the flat-spectrum radio quasar 3C 279, and the newly discovered TeV γ-ray emitter S5 0716+71. In addition, also long-term and multi-wavelengt...

2012
Roger Hau Evan Plotkin Hung Tran

Magic: The Gathering (MTG, or Magic) is the oldest and most popular trading card game played today, due in part to the complex interplay of thousands of cards. In two-player games, each player constructs a "main" deck (referred to as simply 'deck' hereafter) which consists of 60 cards, allowing players to pursue an enormous number of strategies and card combinations. When experienced Magic play...

Journal: :Physical review letters 2010
Earl T Campbell Dan E Browne

Magic state distillation is an important primitive in fault-tolerant quantum computation. The magic states are pure nonstabilizer states which can be distilled from certain mixed nonstabilizer states via Clifford group operations alone. Because of the Gottesman-Knill theorem, mixtures of Pauli eigenstates are not expected to be magic state distillable, but it has been an open question whether a...

2005
Hong H. Liu En Y. Jiang Hai L. Bai Ping Wu Zhi Q. Li Chang Q. Sun

Using a virtual probe method in molecular dynamics approach, we have explored the growing process of atomic clusters by adding atoms in a one-by-one manner to a tetrahedron up to 50 atoms and found that the growing path repeats a process of split-then-merge chaining. The sequential chains merge in the vicinity of the ones with atoms of magic number and then diverge, meaning that, in the cluster...

Journal: :Australasian J. Combinatorics 2011
Ali Ahmad Muhammad Faisal Nadeem Imran Javaid Roslan Hasni

A graph G is called edge-magic if there exists a bijective function φ : V (G)∪E(G) → {1, 2,. .. , |V (G)|+ |E(G)|} such that φ(x)+φ(xy)+φ(y) is a constant c(φ) for every edge xy ∈ E(G); here c(φ) is called the valence of φ. A graph G is said to be super edge-magic if φ(V (G)) = {1, 2,. .. , |V (G)|}. The super edge-magic deficiency, denoted by μ s (G), is the minimum nonnegative integer n such ...

Journal: :J. Discrete Algorithms 2008
Kiki A. Sugeng Mirka Miller

Let G = (V,E) be a finite (non-empty) graph, where V and E are the sets of vertices and edges of G. An edge magic total labeling is a bijection α from V ∪E to the integers 1,2, . . . , n+e, with the property that for every xy ∈E, α(x)+α(y)+α(xy)= k, for some constant k. Such a labeling is called an a-vertex consecutive edge magic total labeling if α(V )= {a + 1, . . . , a + n} and a b-edge cons...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید