The search functionality is under construction.

Author Search Result

[Author] Susumu SHIBUSAWA(2hit)

1-2hit
  • "Web-Com": Interactive Browser for Web-Based Education

    Kazuki HIRAKI  Tatsuhiro YONEKURA  Susumu SHIBUSAWA  

     
    PAPER

      Vol:
    E88-D No:5
      Page(s):
    912-918

    We developed a Web-based education system called "Web-Com". It supports synchronous and asynchronous learning. It consists of an interactive web browser and voice server. Web-Com provides a multi-layer drawable canvas on which the user can draw annotations. Each layer can be shared with other users in real-time via the Internet to enable synchronous learning. In conjunction with the voice server, Web-Com can support voice communication. It can also replay the process of annotation in order, which enables asynchronous learning. Finally, a subject experiment is conducted to evaluate the scheme's workability and explore various issues that arise during the course of learning. The experimental results show that learners can learn fairly interactively with an instructor in a Web-Based class using Web-Com's synchronous style.

  • A Routing Method for a Class of Cyclic Permutation Networks

    Susumu SHIBUSAWA  

     
    PAPER-Computer Networks

      Vol:
    E72-E No:2
      Page(s):
    130-140

    Some classes of hypercube structure and a routing method for them are presented in this paper. The first class of cyclic permutation networks (CPN1) is constructed by connecting input terminals with output terminals for permutation networks in accordance with a given rule. CPN1 is also a cyclic interchange graph of a hypercube, which is constructed by replacing each edge of the hypercube with a vertex and connecting the new adjacent vertices cyclically. The second class of cyclic permutation networks (CPN2) is constructed by splitting each vertex of CPN1 into two new vertices. The CPN2 is also graph-isomorphic to the CCC network. This paper also presents a routing method using the path coefficient for the cyclic permutation networks and the CCC network. For the cyclic networks, the path coefficient which determines the path from any source node (terminal) to the destination node can be expressed using only the binary representation of the destination node, and does not depend on the representation of the source node.