• 検索結果がありません。

graph 20v6 all 最近の更新履歴 radmonitor311 graph 20v6 all

N/A
N/A
Protected

Academic year: 2017

シェア "graph 20v6 all 最近の更新履歴 radmonitor311 graph 20v6 all"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

1.4

1.2

1.0

0.8

0.6

0.4

0.2

0.0

放射線量 �µ S v/ h (マ イ ク ロ シ ー ベ ル ト 毎時)

00:00 2011/3/16

12:00 00:00 2011/3/17

12:00 00:00 2011/3/18

12:00 00:00 2011/3/19

12:00 00:00 2011/3/20

12:00 00:00 2011/3/21

}

全国(福島県を除く)

宮城県(仙台)85km

茨城県(水戸)116km

栃木県(宇都宮)134km

群馬県(前橋)203km

埼玉県(さいたま)205km

都道府県別放射線量(文部科学省による調査)3月15−20日

数値データ:http://www.mext.go.jp/a_menu/saigaijohou/syousai/1303723.htm グラフ作成:東京大学・原子核理論チーム(佐々木、初田、永田、早田)

(注1)過去の平常値の範囲を黄色帯で表示

(注2)福島第一原発からの距離をkmで表している

(注3)福島県は詳細データを参照して下さい:

������http://www.mext.go.jp/a_menu/saigaijohou/syousai/1303726.htm

福島、茨城、栃木、群馬、

埼玉、宮城以外の41都道府県

参照

関連したドキュメント

Considering n ≥ 3, let us assign to the squares of the chessboard T n , corre- sponding to the vertices of Q(n), the numbers of the cells they belong.. Therefore, the squares

In [RS1] the authors study crossed product C ∗ –algebras arising from certain group actions on ˜ A 2 -buildings and show that they are generated by two families of partial

We then prove the existence of a long exact sequence involving the cohomology groups of a k-graph and a crossed product graph.. We finish with recalling the twisted k-graph C

In [13], some topological properties of solutions set for (FOSPD) problem in the convex case are established, and in [15], the compactness of the solutions set is obtained in

We can formulate this as an extremal result in two ways: First, for every graph G, among all bipartite graphs with a given number of edges, it is the graph consisting of disjoint

It is thus often the case that the splitting surface of a strongly irreducible Heegaard splitting of a graph manifold can’t be isotoped to be horizontal or pseudohorizontal in

Additionally, the set of limiting densities of minor-closed graph families is the closure of the set of densities of a certain family of finite graphs, the density- minimal graphs

Abstract The polycirculant conjecture states that every transitive 2-closed permuta- tion group of degree at least two contains a nonidentity semiregular element, that is, a