Learning log is defined as a digital record of what learners have learned in their daily lives using ubiquitous technologies. By using the ubiquitous learning system named SCROLL(System for Capturing and Remining Of Learning Logs), learners can save what they have learned in their daily lives with photo, such as location (latitude and longitude), learning place, and date and time of creation as a learning log. Although learners have many opportunities to learn words and meanings of objects with taking a photo in their daily lives, SCROLL is not implemented functions for supporting language learning with object and text detection. Therefore, this paper proposes a ubiquitous learning system to support language learning with object and text detection technologies.

The representation by computer systems of Chinese characters is an ongoing issue: it is still impossible to use some of them on a computer. Several encoding solutions have been proposed over the years, with most notably two approaches: the unifying approach followed by Unicode which aims at covering all the glyphs known to mankind, and the non-unifying approach followed by "local" encodings such as Shift-JIS and EUC-JP in the case of Japanese. In previous works, we have proposed an unrestricted character encoding for Japanese (UCEJ) so as to address the issues faced by the other encodings. In this paper, we propose a refinement to the realisation method of the character database on which UCEJ is based, and then show the applicability of the UCEJ encoding. To this end, we first describe a proof of concept UCEJ application (viewer and converter) and finally quantitatively compare UCEJ against Unicode with respect to memory size requirements. Not only does UCEJ features essential improvements over Unicode regarding the code structure and features overall, but we show that the induced memory size overhead can be almost eliminated under certain conditions.

An (n, k)-star graph Sn, k is a promising topology for interconnection networks of parallel processing systems because it inherits the merits of a star graph while providing various network sizes. In this study, we propose a fault-tolerant routing algorithm that establishes a fault-free path between any pair of non-faulty nodes in an Sn, k with faulty nodes by using limited global information called safety vectors. In addition, we carried out a computer experiment to verify its effectiveness.

In a parallel processing system, a pancake graph is one of the superior topologies for interconnection network because of the small diameter and the high degree. In previous research, fault-tolerant routing using restricted global information called safety levels in a pancake graph was proposed. But there are some rooms for improvement. Therefore, we propose a fault-tolerant routing algorithm based on improved safety levels to attain higher reach ability. In addition, we estimated the proposed method in time and space complexities, and carried out a computer experiment to verify its effectiveness.

Due to its simplicity, the hypercube topology is popular as interconnection network of parallel systems. However, due to physical restrictions of the number of links per node, this topology is no more satisfactory in the context of modern supercomputing. Effectively, today massively parallel systems, such as the Fujitsu K computer, connect hundreds of thousands of nodes (705 024 nodes for the K, connected according to a six-dimensional torus network). Focusing on degree reduction, a variation of the hypercube topology called hierarchical cubic networks (HCNs) was described. An HCN contains almost half of the number of edges of an hypercube of the same size, and additionally, its diameter is also smaller. We describe in this paper a set-to-set disjoint paths routing algorithm in an HCN (n), finding between two disjoint sets of nodes at most n+1 mutually node-disjoint paths of lengths at most 6n+3 in O(n2log n) time.

The perfect hierarchical hypercube (HHC) interconnection network has been introduced in the literature recently. An HHC can connect many nodes while retaining a low degree and a small diameter. It is thus a suitable topology for interconnection networks of massively parallel systems. We describe in this paper an algorithm solving the set-to-set disjoint-path routing problem in perfect HHCs. In an HHC2m+m, given two sets of m+1 nodes S and D, the proposed algorithm can find m+1 node-disjoint paths between the nodes of S and the nodes of D of lengths at most (m+1) (2m + m + 4) + 3 in O(m2 22m) time complexity.

Hypercubes are a simple topology frequently used as interconnection network of parallel systems. However, hypercubes connecting a significant number of nodes also have an impractically high number of edges. To address this issue, Ghose and Desai introduced a new topology, hierarchical cubic networks, containing almost half many edges than a hypercube of the same size. In this paper, we describe a node-to-set disjoint-path routing algorithm in a hierarchical cubic network HCN(n) finding node-disjoint paths between one source node and k (k≤n+1) destination nodes in O(knlog k) time complexity. Generated paths have lengths of at most 3n+k+3.

The perfect hierarchical hypercube (HHC) interconnection network, also known as the cube-connected cube, was introduced as a topology for large parallel computers. One of its interesting properties is that it can connect many nodes while retaining a small diameter and a low degree. The first node-to-set disjoint-path routing algorithm in perfect HHCs was previously introduced by Bossard et al. [(2011) Node-to-Set Disjoint-Path Routing in Perfect Hierarchical Hypercubes. Proc. 11th Int. Conf. Computational Science, Tsukuba, Japan, June 1–3. Elsevier, Amsterdam]. In this paper, we propose a novel solution to the node-to-set disjoint-path routing problem in HHC. Inside a (2m + m)-dimensional HHC, we shall describe an algorithm that can find disjoint paths between a source node and at most m + 1 destination nodes of maximum length O(2m), significantly shorter than the maximum path length O(m2m) of Bossard et al. [(2011) Node-to-Set Disjoint-Path Routing in Perfect Hierarchical Hypercubes. Proc. 11th Int. Conf. Computational Science, Tsukuba, Singapore, June 1–3. Elsevier, Amsterdam].

In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set disjoint-paths routing in metacube. Metacube is a cluster-based, hypercube-like interconnection network that can connect a huge number of nodes with small amount of links per node. An metacube MC(k, m) has 22km+knodes and m + k links per node. For an MC(k, m) and two sets of nodes S and T of size m+k, the algorithm finds m + k disjoint paths, si→ tj, 1 ≤ i, j ≤ m + k, si∈ S,tj∈ T, in O((m + k)(2km) log(m + k)) time. The length of the paths is at most (m + 1)2k+ (2k + 1)(⌈1g(m + k)⌉ + ⌊1g 2(m + k)⌋ +1) if (k = 2 and m ≥ 3) or (k = 3 and m ≥ 2) or (k >; 3). In other cases, the length of the paths is at most (k + 1)(m2k+ m + k).

The metacube interconnection network introduced a few years ago has some very interesting properties: it has a short diameter similar to the hypercube, and its degree is much lower than that of a hypercube of the same size. In this paper, we describe an efficient algorithm for finding disjoint paths between one source node and at most m+k target nodes in a metacube MC(k, m) excluding MC(*, 1), MC(2, 2), MC(3, 2) and MC(3, 3). We show that we can find m+k disjoint paths between the source node and the m+k targets of length at most metacube diameter plus (k + 4) with time complexity of order of metacube degree times its diameter.

In our project, we are developing a system that helps learners in vocabulary acquirement. In the system, learners can create their own materials for mobile learning, and they can also exchange their materials. This paper focuses on a sub system, SIGMA, to share and exchange materials among learners. In addition, SIGMA enables learners to give evaluation scores and comments to all learning materials stored in the system. In this paper, we will discuss the management policy of the system based on the reliability of the evaluation scores given by the learners to select appropriate materials. From the result of our experiment, we concluded that the evaluation scores have some reliability but an instructor should guide the learners.

In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set routing in a dual-cube. A dual-cube is a hypercube-like interconnection network with about half of links per node compared with the hypercube containing equal number of nodes. For a dual-cube Dnwith n links per node, the algorithm finds n disjoint paths, node sirarrtj(1 les i, j les n), siisin S, tj isin T, in O (n2log n) time and the maximum length of the paths is bounded by 3n + 3.

In this study, we proposed and implemented "MultiPod", an online educational system for learning foreign words. This system is based on iPods and it uses word learning materials of very short movies. Each learning material consists of a 5-second moving image that corresponds to the word to be learned, its spelling, and its pronunciation. We conducted an evaluation experiment with ten subjects in which we compared the learning method based on our system against the traditional paper-and-pen method. By the t-test for the results, we proved that there is a significant difference between the long-term effectiveness of MultiPod and that of the paper-and- pen method.

This paper presents development of a Web-based visual simulator with communication support and its application to computer architecture education. The simulator written in Java has equipped visualization and communication support for real education. The former is designed to show how a computer works graphically and helps learners to understand basic computer architecture visually. The latter is realized with a built-in e-mail function. It allows learners to send question e-mails with a snapshot of simulator's execution to instructors. They receive such question e-mails and then redo to verify the execution of learners' simulators. With these supporting equipments, learners and their instructors can share suitable information between their simulators.

Disjoint paths problems have attracted much attention due to its numerous applications in fault-tolerant routing. The pairwise disjoint paths problem is one of them. In this paper, we propose an algorithm for the pairwise disjoint paths problem in an pancake graph. The algorithm can find k disjoint paths in an n-pancake graph where k les [n/2]. The k disjoint paths can be constructed in O(kn) time and the maximum path length is bounded by [5n/3] + 6.

In this paper, we propose efficient algorithms that find disjoint paths for node-to-node and node-to-set routing in pancake graphs. For an n-pancake graph, the algorithms can find n - 1 disjoint paths of small maximum length with optimal time complexity. That is, the n - 1 paths can be constructed in O(n2) time and the maximum length is bounded by 5n/3 + 6

A pancake graph was proposed as a topology for interconnection networks of parallel computers, and it has a merit that it can connect many nodes with small diameter and small degree. However, the number of nodes in a pancake graph must be equal to the factorial of an integer, which causes a demerit that it lacks incremental expandability. Hence, in this paper, we propose a graph, an incomplete pancake graph, that is obtained by deleting some of sub graphs of a pancake graph, and we give algorithms for the problems of the simple routing, the Hamiltonian cycle, the Hamiltonian path, and the container in incomplete pancake graphs

A bubble-sort graph is a variant of Cayley graphs and it is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, we focus on nth bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between arbitrary two nodes in the complexity of polynomial order of n which is the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of path lengths after proving the correctness of the algorithm. Moreover, we report the results of computer experiment to evaluate average performance of the algorithm.

Recently various mobile stations become widely available due to the advance of communication and computer technologies. Because of the mobility of terminal devices and the bandwidth limitation of wireless networks, it is difficult to apply traditional error recovery schemes for fixed networks to mobile network environments directly. So, several recovery schemes for mobile environments have been proposed. They are improved versions of the backward recoveries, especially the checkpointing and the message logging. However these schemes consider either the total cost or the recovery time. In this paper we propose two new schemes which consider both of the cost and the time.