Tomoo Sumida
Toyo University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Tomoo Sumida.
annual acis international conference on computer and information science | 2010
Takaaki Goto; Tomoo Sumida; Tadaaki Kirishima; Takeo Yaku; Kensei Tsuchida
We have been developing a software development environment using the program diagram “Hichart”. In our research, we have implemented a graphical editor for Hichart. We add new features and capabilities to the editor, including calculation of a cyclomatic complexity and generation of SVG files for a given Hichart diagram. In this paper, we present a method of automatically generating a SVG file for a given program diagram based on attribute graph grammars. The thus obtained SVG file can animate a process of calculating a cyclomatic complexity of a given Hichart diagram on any readily available Web browsers. We also describe an automatic generation of a SVG file which can be displayed when diagrams are aesthetically drawn.
international conference on parallel and distributed systems | 2005
Tomoo Sumida; Katsuyoshi Ito
This paper describes on a protocol named NBT (NBT: non-ordered block transfer) which efficiently transfers large-capacity stored files, and is applicable in a pure IP network. Ordinary file transfer is performed on unicast basis. However, the unicast wastes bandwidth by sending the same large-capacity file to each request, when plural download-requests are simultaneously made. NBT has been proposed to alleviate this problem. Since the original NBT adopts ATM as a multicast scheme, the network domain in which the NBT can be used is restricted. As the solution, adoption of explicit multicast (XCAST) is proposed as a multicast scheme, resulting in a flexible NBT. The proposed system is especially effective when the server frequently transfers large capacity files.
software engineering, artificial intelligence, networking and parallel/distributed computing | 2012
Tadaaki Kirishima; Tomoo Sumida; Yasunori Shiono; Goto Takaaki; Takeo Yaku; Tetsuro Nishino; Kensei Tsuchida
We investigate sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we present efficient algorithms that provide narrower placement satisfying given amorphous conditions. In intractable conditions, we propose a constraint-based algorithm for drawing tree-structured diagrams with a minimum-width by limiting the number of cells. Our results provide a criterion for deciding under given conditions, whether to use procedural or constraint-based algorithms to draw a tree-structured diagram.
annual acis international conference on computer and information science | 2010
Tomoo Sumida; Takaaki Goto; Katsuyoshi Ito; Kensei Tsuchida
Internet-related technology has made remarkable progress in the past years, and the main problem is the increase in bandwidth required for delivery of large-capacity files. To solve this problem, we describe a protocol named Non-ordered Block Transfer on Explicit Multi-Unicast (NBT on XCAST). The purpose of this protocol is to save network bandwidth and to reduce server load in delivering large-capacity stored files. In addition, it is necessary to perform simulation for evaluating and reviewing the new protocol. Therefore, we propose a method for visualizing NBT on XCAST protocol. The purpose of this approach is to understand the status of the whole network system with NBT on XCAST. In this visualization method, vertices and edges represent client and routers and communication lines, respectively.
annual acis international conference on computer and information science | 2017
Tomoo Sumida; Hiroyuki Suzuki; Sho Sei Shun; Kazuhito Omaki; Takaaki Goto; Kensei Tsuchida
Information technology has been advancing in many countries. In their daily lives, people encounter computerized systems in many situations and often take their operation for granted. If a system failure occurs temporarily, it is disadvantageous for the system operator and the user. The use of distributed and parallel processing systems has increased the prevalence of software failures due to resource sharing among processes. The purpose of this study is to verify the presence or absence of deadlock by using the validator called FDR for the processes of the LEGO® MINDSTORMS® EV3 robot while it climbs stairs.
international conference on computational science | 2015
Toshihiro Yoshizumi; Yasunori Shiono; Tomoo Sumida; Mitsuhiro Namekawa; Kensei Tsuchida
We propose a new method to analyze human relations and mental process through touch interface dynamically. There is a sociometry analysis that applies the fuzzy graph an approach to clearly express the measurement and evaluation of the structure of human relationships. The analysis conditions are not constant in the analysis of human relationships, and not in addition to performing the analysis by trial and error for that. Previously in the study, in the relationship such as between the groups, it has not been studied the individual relationships analysis in the groups. Similarly, it has never been also studied to analyze the human relationships dynamically. We propose a method to dynamically the human relationships by intuitive operation through the touch interface. In this paper, we describe our principle of the sociometry analysis that using the fuzzy graph, the our method through the touch interface, and their application to sociometry analysis in case of 30 people of human relationships.
software engineering, artificial intelligence, networking and parallel/distributed computing | 2012
Yasunori Shiono; Shohei Noguchi; Mitsumasa Mochida; Tomoo Sumida; Hideki Mori; Kazuhito Ohmaki; Kensei Tsuchida
Embedded systems have become an essential technology in fields that require electronic control. These technologies must work in real time and have high reliability and low cost. Among them, safety verification of embedded systems is very important in fields related to human life. In addition, as multi-core and multiprocessors have spread, the processing power of the hardware has been improved. As a result, concurrent processing has become necessary. In developing concurrent embedded systems, Communicating Sequential Processes (CSP) is regarded as useful. The purpose of this study is to verify, implement, and evaluate the concurrent sorting algorithm using the characteristics of CSP. In this study, we use two characteristics of CSP: synchronous communication and verification based on the formal method. In addition, we describe the extended improvement concurrent sorting algorithm.
Archive | 2012
Takaaki Goto; Yasunori Shiono; Tomoo Sumida; Tetsuro Nishino; Takeo Yaku; Kensei Tsuchida
Embedded systems are extensively used in various small devices, such as mobile phones, in transportation systems, such as those in cars or aircraft, and in large-scale distributed systems, such as cloud computing environments. We need a technology that can be used to develop low-cost, high-performance embedded systems. This technology would be useful for designing, testing, implementing, and evaluating embedded prototype systems by using a software simulator.
Proceedings of the IEICE General Conference | 2003
Tomoo Sumida; Katsuyoshi Ito
Journal of Japan Society for Fuzzy Theory and Intelligent Informatics | 2017
Toshihiro Yoshizumi; Tomoo Sumida; Yasunori Shiono; Mitsuhiro Namekawa; Kensei Tsuchida