著者

宮森 潤 芳賀 昭 角張 泰之 佐藤 文博 松木 英敏 佐藤 忠邦

出版者

公益社団法人日本磁気学会

雑誌

Journal of the Magnetics Society of Japan (ISSN:18822932)

巻号頁・発行日

vol.33, no.2, pp.110-113, 2009-03-01

被引用文献数

1 1

---

The Contactless Power Station (CLPS) is a cordless power supply system that makes use of electromagnetic induction generated by means of coils. We propose a desktop design for CLPS, using spiral coils, because it is convenient to be able to charge the batteries of a digital still camera, a cellular phone, and a PC on single desk. The primary coil are arranged so that the coupling factor becomes 0, since it is inconvenient for the primary coils to be excited by each other. However, when the primary coils are synchronized and driven, the magnetic flux interferes with the electric power transmission. Attention was paid to changing each phase on the primary coils. As a result, when the phase was moved, stabilization of the output voltage was confirmed. Therefore, if the primary coils are suitably arranged, the power transmission pad can stabilize electric power transmission everywhere.

著者

青砥 清一 相澤 正雄

出版者

津田塾大学紀要委員会

雑誌

津田塾大学紀要 (ISSN:02877805)

巻号頁・発行日

no.42, pp.217-237, 2010-03

著者

セルバンテス 岡村 一

出版者

熊本学園大学

雑誌

熊本学園大学文学・言語学論集 (ISSN:13410229)

巻号頁・発行日

vol.19, no.1, pp.158-122, 2012-06

著者

中川 久定

出版者

京都大學文學部

雑誌

京都大學文學部研究紀要 (ISSN:04529774)

巻号頁・発行日

vol.15, pp.119-355, 1975-03-31

---

この論文は国立情報学研究所の学術雑誌公開支援事業により電子化されました。

著者

白土 康代

出版者

別府史談会

雑誌

別府史談

巻号頁・発行日

no.24, pp.75-87, 2011-03 (Released:2011-07-27)

巻号頁・発行日

1644

---

宣明暦は唐の長慶2年(822)に作られた暦で、日本では平安時代の貞観4年(862)に採用され、貞享元年(1684)まで800年以上にわたり使用された。展示本はこれを寛永21年(1644)に刊行したもののうち、第1巻のみの端本である。巻1には挿絵が3図はいっており、初刷りのみに墨のほか朱の版彩がある(ほかに巻5にも色刷3図あり)。我が国の色刷り本のうちでも、刊年が明らかなものとしては、寛永4年(1627)序刊の『塵功記』に次ぐものとして知られ、印刷文化史上貴重な資料である。初刷りの伝本は少ない。

著者

山川 基 小笠原 真

出版者

就実大学, 就実短期大学

雑誌

就実論叢 (ISSN:02859548)

巻号頁・発行日

no.41, pp.83-98, 2011

著者

山川 基 小笠原 真

出版者

就実大学

雑誌

就実論叢 (ISSN:02859548)

巻号頁・発行日

no.41, pp.83-98, 2011

出版者

文事堂

巻号頁・発行日

1888

出版者

活版舎

巻号頁・発行日

vol.明治6年, 1872

出版者

北畠茂兵衞 (製本)

巻号頁・発行日

vol.明治6年, 1872

著者

桐村 豪文

出版者

京都大学大学院教育学研究科

雑誌

京都大学大学院教育学研究科紀要 (ISSN:13452142)

巻号頁・発行日

vol.58, pp.101-113, 2012-04-27

---

It may be true that improving student outcomes is the ultimate purpose of all educational policymakers and educational researchers. Improving the effectiveness of the intervention, which involves an educational program, a product, a practice, or a policy aimed at improving student outcomes is a typical purpose to be accomplished. However, it should be noted that this study addressed the question "how and why can you say that intervention X caused the outcome Y?" or "what gives assurance that intervention X caused the outcome Y?" and not "did intervention X cause the outcome Y?" That is, the purpose of this study was not to discuss the effectiveness itself but pave the way for discussing the effectiveness. The target of this paper is the methodology used in the Comprehensive School Reform Quality Center report, which evaluated and rated the effectiveness of models used by the schools in the Comprehensive School Reform program. The characteristic of the methodology is a Randomized Controlled Trial (RCT), which is the "gold standard" for evidence-based policies in the USA. This paper demonstrates why the methodology is superior to the econometric methodology based on the theory of Cartwright.

著者

伊藤 美千代

出版者

順天堂大学

雑誌

研究活動スタート支援

巻号頁・発行日

2009

---

本研究では、全国規模の無記名自記式質問紙調査により、炎症性腸疾患患者の職業発達の実態を明らかにした。難病をもちながら働くための職業発達は「無理なく働ける仕事内容、職場の選択」「症状や障害による仕事遂行への影響」「職場における困難への対処法の存在」など12項目の因子から構成され、それぞれの因子が地域における就労支援や家族支援、頼りに出来る人の存在などの環境要因と関連を有していた。

著者

真田貫道 著

出版者

北信郷土叢書刊行会

巻号頁・発行日

1935

出版者

刊

巻号頁・発行日

vol.第624-626,

著者

伊藤 博道

巻号頁・発行日

2012

---

筑波大学博士 (医学) 学位論文・平成24年4月30日授与 (甲第6281号)

著者

Iwamoto Mitsugu Koga Hiroki Yamamoto Hirosuke

出版者

IEEE

雑誌

IEEE transactions on information theory (ISSN:00189448)

巻号頁・発行日

vol.58, no.9, pp.6194-6206, 2012-09

被引用文献数

1

---

Coding theorems on a $(2,2)$-threshold scheme with an opponent are discussed in an asymptotic setup, where the opponent tries to impersonate one of the two participants. A situation is considered where $n$ secrets $S^{n}$ from a memoryless source is blockwisely encoded to two shares and the two shares are decoded to $S^{n}$ with permitting negligible decoding error. We introduce correlation level of the two shares and characterize the minimum attainable rates of the shares and a uniform random number for realizing a $(2, 2)$-threshold scheme that is secure against the impersonation attack by the opponent. It is shown that if the correlation level between the two shares equals to $ell geq 0$, the minimum attainable rates coincide with $H(S)+ell $, where $H(S)$ denotes the entropy of the source, and the maximum attainable exponent of the success probability of the impersonation attack equals to $ell $. It is also shown that a simple scheme using an ordinary $(2,2)$-threshold scheme attains all the bounds as well.

著者

OMOTE Kazumasa KATO Kazuhiko

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E93.D, no.5, pp.1080-1086, 2010-05

---

In key-recovery methods using smart cards, a user can recover the disk encryption key in cooperation with the system administrator, even if the user has lost the smart card including the disk encryption key. However, the disk encryption key is known to the system administrator in advance in most key-recovery methods. Hence user's disk data may be read by the system administrator. Furthermore, if the disk encryption key is not known to the system administrator in advance, it is difficult to achieve a key authentication.In this paper, we propose a scheme which enables to recover the disk encryption key when the user's smart card is lost. In our scheme, the disk encryption key is not preserved anywhere and then the system administrator cannot know the key before key-recovery phase. Only someone who has a user's smart card and knows the user's password can decrypt that user's disk data. Furthermore, we measured the processing time required for user authentication in an experimental environment using a virtual machine monitor. As a result, we found that this processing time is short enough to be practical.

著者

TAKAHASHII Tsubasa KITAGAWA Hiroyuki WATANABE Keita

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E93.D, no.6, pp.1403-1413, 2010-06

被引用文献数

1 2

---

Social bookmarking services have recently made it possible for us to register and share our own bookmarks on the web and are attracting attention. The services let us get structured data: (URL, Username, Timestamp, Tag Set). And these data represent user interest in web pages. The number of bookmarks is a barometer of web page value. Some web pages have many bookmarks, but most of those bookmarks may have been posted far in the past. Therefore, even if a web page has many bookmarks, their value is not guaranteed. If most of the bookmarks are very old, the page may be obsolete. In this paper, by focusing on the timestamp sequence of social bookmarkings on web pages, we model their activation levels representing current values. Further, we improve our previously proposed ranking method for web search by introducing the activation level concept. Finally, through experiments, we show effectiveness of the proposed ranking method.

著者

SUZUKI Nobutaka

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E93.D, no.8, pp.2198-2212, 2010-08

被引用文献数

1 3

---

DTDs are continuously updated according to changes in the real world. Let t be an XML document valid against a DTD D, and suppose that D is updated by an update script s. In general, we cannot uniquely “infer” a transformation of t from s, i.e., we cannot uniquely determine the elements in t that should be deleted and/or the positions in t that new elements should be inserted into. In this paper, we consider inferring K optimum transformations of t from s so that a user finds the most desirable transformation more easily. We first show that the problem of inferring K optimum transformations of an XML document from an update script is NP-hard even if K = 1. Then, assuming that an update script is of length one, we show an algorithm for solving the problem, which runs in time polynomial of