9 0 0 0 OA 添付地図

出版者
日本地図学会
雑誌
地図 (ISSN:00094897)
巻号頁・発行日
vol.32, no.2, pp.AP1-AP2, 1994-06-30 (Released:2011-07-19)
著者
軍令部 編
出版者
内閣印刷局朝陽会
巻号頁・発行日
vol.上巻, 1934
著者
坪谷善四郎 編
出版者
博文館
巻号頁・発行日
vol.第1輯, 1906
著者
Miyo Nakade Hitomi Takeuchi Nozomi Taniwaki Teruki Noji Tetsuo Harada
出版者
日本生理人類学会
雑誌
Journal of PHYSIOLOGICAL ANTHROPOLOGY (ISSN:18806791)
巻号頁・発行日
vol.28, no.5, pp.239-245, 2009-09-30 (Released:2009-10-10)
参考文献数
32
被引用文献数
16 34

Tryptophan (Trp) intake at breakfast promotes morning-typed circadian typology and higher sleep quality in Japanese children aged 0–6 yrs (Harada et al., 2007). This effect may be accelerated by morning exposure to sunlight, which has not yet been tested. This study aimed to investigate such an effect in Japanese children. In May, 2006, an integrated questionnaire was administered to 0–6-year-old children attending one of 12 kindergartens. 906 parents answered the questionnaire for their children and themselves (response rate: 67.4%). The integrated questionnaire included the revised version for children of the Morningness-Eveningness (M-E) Questionnaire and questions on sleep, nutritional balance, mental health, and sunlight exposure. Analysis was made on data from 744 children aged 2–6 (385 girls, 359 boys) whose average M-E score was 20.6±3.46. Children who had breakfast at regular times tended to be more morning-typed and were less frequently angry (p=0.001) and depressed (p=0.007). Children who had nutritionally well-balanced breakfasts tended to be more morning-typed (p<0.001), and woke up and fell asleep at earlier times (p<0.001). Children with higher protein intake tended to have higher M-E scores (p<0.001) and earlier bedtime and wake-up time (p=0.003). Children exposed to sunlight for 30–60 min on their way to kindergarten showed more distinctive shifting-effects to morning-type with protein intake than those exposed to sunlight for less than 20 min (p=0.006). A well-balanced breakfast might be a strong zeitgeber for circadian oscillators of children, and the morning-type driving effect of protein intake could be accelerated by morning exposure to sunlight.
著者
真野 浩
出版者
国立研究開発法人 科学技術振興機構
雑誌
情報管理 (ISSN:00217298)
巻号頁・発行日
vol.60, no.6, pp.391-402, 2017-09-01 (Released:2017-09-01)
参考文献数
4

ウェアラブルデバイスや制御機器,センサー,スマートフォン,スマート家電などインターネットに接続する情報機器が急速に拡大し,これらを称してIoT(Internet of Things)時代の到来が広くうたわれている。しかしながら,現在普及しつつあるIoT産業の多くは,サービスとデバイスが密に結合した垂直統合型にとどまっており,本来インターネットのもつ自律分散,相互接続による創造的な産業革新を引き起こすには至っていない。そこで,開かれた真のIoTを実現するには,デバイスに依存しない自律分散型相互接続と,接続される情報のオーナーシップ,価値の配分,プライバシー,公平性を確保する仕組みが必要となる。本稿では,これらの課題を解決し,スケーラビリティーのある新しい情報流通交換の仕組みとして,オープンなデータ取引市場を実現する取り組みについて概説する。
著者
落合 延孝
出版者
群馬大学
雑誌
群馬大学社会情報学部研究論集 (ISSN:13468812)
巻号頁・発行日
vol.11, pp.267-301, 2004-03-31

This paper describes historical situations of Mito's masterless samurai and Kouzuke county, from the document of Kyouwa-Irai-Shinbunki written by Shinzo Morimura.
著者
Tom Altman Yoshihide Igarashi
出版者
一般社団法人情報処理学会
雑誌
Journal of Information Processing (ISSN:18826652)
巻号頁・発行日
vol.12, no.2, pp.154-158, 1989-08-25

We study sequential and parallel algorithms on roughly sorted sequences. A sequence a = (a_l a_2 . . . a_n) is k-sorted if for all 1&les;i j&les;n i<j- k implies a_i&les;a_j. We first show a real-time algorithm for determining if a given sequence is k-sorted and an O(n)-time algorithm for finding the smallest k for a given sequence to be k-sorted. Next we give two sequential algorithms that merge two k-sorted sequences to form a k-sorted sequence and completely sort a k-sorted sequence. Their running times are O(n) and O(n log k) respectively. Finally parallel versions of the complete-sorting algorithm are presented. Their parallel running times are O(f(2k) 1og k) where f(t) is the computing time of an algorithm used for finding the median among t elements.We study sequential and parallel algorithms on roughly sorted sequences. A sequence a = (a_l, a_2, . . . , a_n) is k-sorted if for all 1&les;i,j&les;n,i<j- k implies a_i&les;a_j. We first show a real-time algorithm for determining if a given sequence is k-sorted and an O(n)-time algorithm for finding the smallest k for a given sequence to be k-sorted. Next, we give two sequential algorithms that merge two k-sorted sequences to form a k-sorted sequence and completely sort a k-sorted sequence. Their running times are O(n) and O(n log k), respectively. Finally, parallel versions of the complete-sorting algorithm are presented. Their parallel running times are O(f(2k) 1og k), where f(t) is the computing time of an algorithm used for finding the median among t elements.