著者

水野 尚之

出版者

京都大学総合人間学部英語部会

雑誌

英文学評論 (ISSN:04208641)

巻号頁・発行日

vol.72, pp.79-98, 2000-02

著者

福島 啓之

出版者

東京大学大学院総合文化研究科附属グローバル地域研究機構アメリカ太平洋地域研究センター

雑誌

アメリカ太平洋研究 (ISSN:13462989)

巻号頁・発行日

vol.12, pp.79-95, 2012-03

---

寄稿論文

著者

吉本 篤子

出版者

東京大学大学院教育学研究科基礎教育学研究室

雑誌

研究室紀要 (ISSN:02857766)

巻号頁・発行日

vol.37, pp.67-79, 2011-06

---

研究論文

著者

堀川 徹

出版者

東洋史研究會

雑誌

東洋史研究 (ISSN:03869059)

巻号頁・発行日

vol.45, no.3, pp.593-593, 1986-12-31

著者

坂本 良輔

出版者

東京大学大学院新領域創成科学研究科環境学研究系環境システム学専攻

巻号頁・発行日

2011-03-24

---

報告番号: ; 学位授与年月日: 2011-03-24 ; 学位の種別: 修士 ; 学位の種類: 修士(環境学) ; 学位記番号: 修創域第3927号 ; 研究科・専攻: 新領域創成科学研究科環境学研究系環境システム学専攻

著者

中川 久定

出版者

京都大學文學部

雑誌

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

巻号頁・発行日

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

---

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

著者

桐村 豪文

出版者

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

雑誌

京都大学大学院教育学研究科紀要 (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.

著者

伊藤 博道

巻号頁・発行日

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

著者

NAKATANI Takako HORI Shouzo UBAYASHI Naoyasu KATAMINE Keiichi HASHIMOTO Masaaki

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E93.D, no.8, pp.2182-2189, 2010-08

被引用文献数

1 2

---

Requirements changes sometimes cause a project to fail. A lot of projects now follow incremental development processes so that new requirements and requirements changes can be incorporated as soon as possible. These processes are called integrated requirements processes, which function to integrate requirements processes with other developmental processes. We have quantitatively and qualitatively investigated the requirements processes of a specific project from beginning to end. Our focus is to clarify the types of necessary requirements based on the components contained within a certain portion of the software architecture. Further, each type reveals its typical requirements processes through its own rationale. This case study is a system to manage the orders and services of a restaurant. In this paper, we introduce the case and categorize its requirements processes based on the components of the system and the qualitative characteristics of ISO-9126. We could identify seven categories of the typical requirements process to be managed and/or controlled. Each category reveals its typical requirements processes and their characteristics. The case study is our first step of practical integrated requirements engineering.

著者

ADNAN SATO Mitsuhisa

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E95-D, no.6, pp.1565-1576, 2012-06

被引用文献数

2

---

Lazy-task creation is an efficient method of overcoming the overhead of the grain-size problem in parallel computing. Work stealing is an effective load balancing strategy for parallel computing. In this paper, we present dynamic work stealing strategies in a lazy-task creation technique for efficient fine-grain task scheduling. The basic idea is to control load balancing granularity depending on the number of task parents in a stack. The dynamic-length strategy of work stealing uses run-time information, which is information on the load of the victim, to determine the number of tasks that a thief is allowed to steal. We compare it with the bottommost first work stealing strategy used in StackThread/MP, and the fixed-length strategy of work stealing, where a thief requests to steal a fixed number of tasks, as well as other multithreaded frameworks such as Cilk and OpenMP task implementations. The experiments show that the dynamic-length strategy of work stealing performs well in irregular workloads such as in UTS benchmarks, as well as in regular workloads such as Fibonacci, Strassen's matrix multiplication, FFT, and Sparse-LU factorization. The dynamic-length strategy works better than the fixed-length strategy because it is more flexible than the latter; this strategy can avoid load imbalance due to overstealing.

著者

OHKAWA Yasuhiro FUKUI Kazuhiro

出版者

電子情報通信学会

雑誌

IEICE transactions on information and systems (ISSN:09168532)

巻号頁・発行日

vol.E95.D, no.6, pp.1619-1627, 2012-06

被引用文献数

13 3

---

This paper proposes a method for recognizing hand-shapes by using multi-viewpoint image sets. The recognition of a hand-shape is a difficult problem, as appearance of the hand changes largely depending on viewpoint, illumination conditions and individual characteristics. To overcome this problem, we apply the Kernel Orthogonal Mutual Subspace Method (KOMSM) to shift-invariance features obtained from multi-viewpoint images of a hand. When applying KOMSM to hand recognition with a lot of learning images from each class, it is necessary to consider how to run the KOMSM with heavy computational cost due to the kernel trick technique. We propose a new method that can drastically reduce the computational cost of KOMSM by adopting centroids and the number of images belonging to the centroids, which are obtained by using k-means clustering. The validity of the proposed method is demonstrated through evaluation experiments using multi-viewpoint image sets of 30 classes of hand-shapes.

著者

Komain PIBULYAROJANA KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E80.B, no.1, pp.116-126, 1997-01

---

Banyan networks are used in multiprocessor computer applications for an ATM switching. In this paper, we study the continuous blocking of the the first n-stage which makes the performance of the banyan networks decrease. We use the 2-dilated banyan networks into the banyan networks to remove the the continuous blocking of the the first n-stage. We call the new networks as the hybrid dilated banyan networks. We explain how to analyze the throughput of this networks at each stage. Based on the analysis of input rate and output rate at each stage, we can design the hybrid dilated banyan networks with the desirable output rate. The result of analysis shows the hybrid dilated banyan networks have higher performance and feasibility than the banyan networks.

著者

PIBULYAROJANA Komain KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E80.B, no.12, pp.1816-1818, 1997-12

---

Many switching networks are currently designed to support ATM architectures. In this letter, we propose the performance improvement of a network called hybrid dilated banyan network with bypasses at the stage of 4×2 re-arrangeable output switch. Our letter also includes the performance analysis of the improved hybrid dilated banyan network.

著者

CHEN Hongbing KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E81.B, no.1, pp.45-57, 1998-01

---

The Optimal Packet Length (OPL) in packet-switched communication systems has been studied in the literature from various aspects. In this paper, we consider the trade-off between packet length and data transmission delay in a high-speed communication system. To simplify the analysis of the mean data transmission de[ay, the model is limited to a point-to-point communication system, in which each node complies with the OSI reference model. In order to study the relationship between the OPL and the number of modules performing each protocol, two model communication systems are discussed. In one each node contains two layered protocol modules, and in the other three. Moreover, for both models, the mean data transmission delay is analyzed for two cases depending on whether or not the DLC layer or the network layer performs retransmissions. After studying the OPL which minimizes the mean data transmission delay in each case, we discuss the relationships between the OPLs and the various protocol parameters.

著者

SUN Zhenqiang KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E82.B, no.9, pp.1432-1438, 1999-09

---

This paper presents the generator polynomial matrices and the upper bound on the constraint length of punctured convolutional codes (PCCs), respectively. By virtue of these properties, we provide the puncturing realizations of the good known nonsystematic and systematic high rate CCs.

著者

PIBULYAROJANA Komain KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E83.B, no.7, pp.1474-1487, 2000-07

---

Banyan networks and their improved switches such as 2-dilated banyan networks are usually constructed by a self-routing mechanism, and provide a high multiplexing transmission capacity to ATM networks.Due to cell blocking in the switching elements in these banyan networks, however, cell loss is occurred and then the throughput of each network is decreased.To improve this problem, we have introduced bypasses to the original and the 2-dilated banyan networks.This paper focuses on the position of the bypasses in these banyan networks and proposes the one-bypass-connection methods in order to minimize cell transfer delay caused by the bypasses.We also analyze output rate of each network and show that the bypass method gives network designers flexible selections for network performance and transfer delay.