2021/07/12 更新

写真a

フナビキ ノブオ
舩曵 信生
FUNABIKI Nobuo
所属
自然科学学域 教授
職名
教授
外部リンク

学位

  • 博士(工学) ( 東京大学 )

研究キーワード

  • 教育工学

  • 無線ネットワーク

  • Information and Communication Technology

  • Optimization Algorithms

  • Web Systems

  • Webシステム

  • Educational Technology

  • Wireless Networks

  • 情報通信工学

  • 最適化アルゴリズム

研究分野

  • 人文・社会 / 教育工学

  • 情報通信 / 情報ネットワーク

  • 情報通信 / 情報学基礎論

  • 情報通信 / 計算機システム

学歴

  • ケ-スウェスタンリザ-ブ大学大学院   工学系研究科   電気工学

    - 1991年

      詳細を見る

    国名: アメリカ合衆国

    researchmap

  • ケースウェスタンリザーブ大学    

    - 1991年

      詳細を見る

  • 東京大学   工学部   計数工学科

    - 1984年

      詳細を見る

    国名: 日本国

    researchmap

  • 東京大学   Faculty of Engineering  

    - 1984年

      詳細を見る

経歴

  • - Professor,Professor, Graduate School of Natural Science and Technology, Okayama University

    2005年

      詳細を見る

  • - 岡山大学大学院自然科学研究科 教授(改組による) 教授

    2005年

      詳細を見る

  • - Professor,Graduate School of Natural Science and Technology,Okayama University

    2004年

      詳細を見る

  • - 岡山大学自然科学研究科 教授

    2004年

      詳細を見る

  • Professor,Professor, Faculty of Engineering, Okayama University

    2001年 - 2005年

      詳細を見る

  • 岡山大学工学部 教授 教授   Faculty of Engineering

    2001年 - 2005年

      詳細を見る

  • 大阪大学基礎工学部 助教授 准教授   School of Engineering Science Direct Affiliates

    1995年 - 2001年

      詳細を見る

  • Associate Professor,Associate Professor, Faculty of Engineering Science, Osaka University

    1995年 - 2001年

      詳細を見る

  • 大阪大学基礎工学部 講師 講師   School of Engineering Science Direct Affiliates

    1994年 - 1995年

      詳細を見る

  • Senior Assistant Professor,Assistant Professor, Faculty of Engineering Science, Osaka University

    1994年 - 1995年

      詳細を見る

  • Technical Staff,Sumitomo Metal Industries, Ltd.

    1984年 - 1994年

      詳細を見る

  • 住友金属工業株式会社 職員(技術系)

    1984年 - 1994年

      詳細を見る

▼全件表示

所属学協会

▼全件表示

委員歴

  • IEEE   広島支部支部長  

    2014年   

      詳細を見る

    団体区分:学協会

    IEEE

    researchmap

  • IEEE   IEEE Hiroshima Section Chairman  

    2014年   

      詳細を見る

    団体区分:学協会

    IEEE

    researchmap

 

書籍等出版物

  • ICTプロフェッショナル概論

    岡山大学出版会  2013年 

     詳細を見る

  • Intelligent control and innovative computing

    Springer  2012年 

     詳細を見る

  • グラフ理論の基礎と応用

    共立出版  2012年 

     詳細を見る

  • Wireless Mesh Networks

    InTech - Open Access Publisher  2011年 

     詳細を見る

  • 情報セキュリティ対策の要点-実務と理論-

    コロナ社  2005年 

     詳細を見る

  • Soft computing in communications

    Springer  2004年 

     詳細を見る

▼全件表示

MISC

  • A test code generation method for coding standard input/output with exception handling in Java programming learning assistant system

    Ei Ei Mon, Nobuo Funabiki, Ryota Kusaka, Khin Khin Zaw, Wen-Chung Kao

    Advances in Science, Technology and Engineering Systems Journal   3 ( 1 )   30 - 37   2018年

     詳細を見る

  • An improved informative test code approach for code writing problem in Java programming learning assistant system

    Nobuo Funabiki, Khin Khin Zaw, Ei Ei Mon, Wen-Chung Kao

    Proceeding of The 6th International Conference on Emerging Internet, Data and Web Technologies (EIDWT-2018)   687 - 698   2018年

     詳細を見る

  • A holding access-point assignment algorithm for IEEE802.11 wireless local-area networks

    Shigeto Tajima, Nobuo Funabiki, Teruo Higashino

    International Journal of Space-Based and Situated Computing   8 ( 1 )   50 - 58   2018年

     詳細を見る

  • A proposal of code completion problem for Java programming learning assistant system

    Htoo Htoo, Sandi Kyaw, Shwe Thinzar Aung, Hnin Aye Thant, Nobuo Funabiki

    Proceeding of The 10th International Workshop on Virtual Environment and Network-Oriented Applications (VENOA-2018)   855 - 864   2018年

     詳細を見る

  • A proposal of hardware channel bonding for IEEE802.11n wireless network using Raspberry Pi

    Rahardhita Widyatra Sudibyo, Nobuo Funabiki, Wen-Chung Kao

    Proceeding of 2018 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW 2018)   277 - 278   2018年

     詳細を見る

  • A study of MIMO host location optimization in active access-point configuration algorithm for elastic WLAN system

    Mousumi Saha, Nobuo Funabiki, Sumon Kumar Debnath, Wen-Chung Kao

    Proceeding of 2018 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW 2018)   275 - 276   2018年

     詳細を見る

  • A throughput estimation model for IEEE 802.11n MIMO link in wireless local-area networks

    Sumon Kumar Debnath, Mousumi Saha, Nobuo Funabiki, Wen-Chung Kao

    Proceedings of 3rd International Conference on Computer and Communication Systems (ICCCS-2018)   327 - 331   2018年

     詳細を見る

  • A holding access-point assignment algorithm for wireless local-area networks

    Shigeto Tajima, Nobuo Funabiki, Sumon Kumar Debnath, Teruo Higashino

    2017 9th IEEE International Conference on Communication Software and Networks, ICCSN 2017   2017-   367 - 371   2017年12月

     詳細を見る

    記述言語:英語   出版者・発行元:Institute of Electrical and Electronics Engineers Inc.  

    Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers, and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs into the network field depending on the host type distribution has become very important to improve the network performance. In this paper, we formulate this holding access-point assignment problem as a combinatorial optimization problem and propose its heuristic algorithm. Because plural non-overlapping channels are available in IEEE802.11 WLANs, we extend the algorithm to finding the channel assignment to the APs such that the total interference among them is minimized. The effectiveness of our proposal is verified through simulations in three instances.

    DOI: 10.1109/ICCSN.2017.8230137

    Scopus

    researchmap

  • Accumulator for monotone formulas and its application to anonymous credential system

    Shahidatul Sadiah, Toru Nakanishi, Nasima Begum, Nobuo Funabiki

    Journal of Information Processing   25   949 - 961   2017年12月

     詳細を見る

    記述言語:英語   出版者・発行元:Information Processing Society of Japan  

    An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, a system to prove AND and OR relations simultaneously by CNF formulas was proposed. To achieve a constant-size proof of the formula, this system adopts an accumulator that compresses multiple attributes into a single value. However, this system has a problem: the proof generation requires a large amount of computational time in the case of lots of OR literals in the formula. Therefore, we convert the attribute relation from the CNF formula to a monotone formula to decrease the number of OR literals. The monotone formula is a logic formula that contains any combination of AND and OR relations. In this paper, we propose an extended accumulator to prove the monotone formula, and apply it to the anonymous credential system. Our approach to prove the monotone formula is that the tag assignment in the accumulator is extended to be adapted to the tree expressing the monotone formula. Using this type of formula, the number of public parameters multiplied in the accumulator is decreased, which greatly impacts the reduction of authentication time.

    DOI: 10.2197/ipsjjip.25.949

    Scopus

    researchmap

  • DCT-OFDM Watermarking Scheme Based on Communication System Model

    Minoru Kuribayashi, Shogo Shigemoto, Nobuo Funabiki

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E100A ( 4 )   944 - 952   2017年4月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    In conventional spread spectrum (SS) watermarking schemes, random sequences are used for the modulation of watermark information. However, because of the mutual interference among those sequences, it requires complicated removal operation to improve the performance. In this paper, we propose an efficient spread spectrum watermarking scheme by introducing the orthogonal frequency divisiion multiplexing (OFDM) technique at the modulation of watermark information. The SS sequences in the proposed method are the DCT basic vectors modulated by a pseudo-random number (PN) sequence. We investigate the SS-based method considering the host interference at the blind detection scenario and analyze the noise caused by attacks. Because every operation is invertible, the quantization index modulation (QIM)-based method is applicable for the OFDM modulated signals. We also consider the property of watermark extracting operation in SS-based and QIM-based method and formalize their models of noisy channel in order to employ an error correcting code. The performance of their methods with error correcting code is numerically evaluated under the constraints of same distortion level in watermarked content. The experimental results indicated a criteria for the selection of SS-based and QIM-based methods for given content, which is determined by the amount of host interference. In case that the host interference is 0.8 times smaller than a watermark signal, the SS-based method is suitable. When it is 1.0 times larger, the QIM-based method should be selected.

    DOI: 10.1587/transfun.E100.A.944

    Web of Science

    researchmap

  • Cross-layer selective routing for cost and delay minimization in IEEE 802.11ac wireless mesh network

    I. W. Lai, Nobuo Funabiki, Shigeto Tajima, Md. Selim Al Mamun, Sho Fujita

    Wireless Networks   1 - 13   2017年2月

     詳細を見る

    記述言語:英語   出版者・発行元:Springer New York LLC  

    A Wireless Internet-access Mesh NETwork (WIMNET) provides scalable and reliable internet access through the deployment of multiple access points (APs) and gateways (GWs). In this work, we propose a selective routing algorithm aiming at a hierarchical minimization of the operational cost and the maximal end-to-end delay. In particular, by deploying redundant APs/GWs in the network field, the WIMNET becomes robust to the link or AP/GW failure. However, these redundant APs/GWs increase the operational cost like the power consumption. By using Dijkstra algorithm and 2-opt algorithm, the proposed algorithm iteratively deactivates the deployed APs/GWs and performs the routing that reduces the maximal end-to-end delay based on the APs/GWs remaining active. The generated route meets the real-world constraints like fairness criterion. We further propose a cross-layer design to enhance the routing performance by exploiting the MAC-layer frame aggregation technique. The selective routing algorithm is then implemented in the WIMNET simulator proposed by our group. The numerical experiments demonstrate that in both indoor and open space environments, the proposed selective routing greatly reduces the operational cost, i.e., up to (Formula presented.) APs/GWs can be deactivated.

    DOI: 10.1007/s11276-017-1462-9

    Scopus

    researchmap

  • A proposal of informative test code approach for code writing problem in Java programming learning assistant system

    Khin Khin Zaw, Nobuo Funabiki, Wen-Chung Kao

    Proceedings of The 8th International Conference on Science and Engineering 2017 (ICSE 2017)   260 - 265   2017年

     詳細を見る

  • A design-aware test code approach for code writing problem in Java programming learning assistant system

    Khin Khin Zaw, Nobuo Funabiki

    International Journal of Space-Based and Situated Computing   7 ( 3 )   145 - 154   2017年

     詳細を見る

  • Dynamic access-point configuration approach for elastic wireless local-area network system

    Md. Manowarul Islam, Md. Selim Al Mamun, Nobuo Funabiki, Minoru Kuribayashi

    Proceedings of The Fifth International Symposium on Computing and Networking (CANDAR, ASON))   2017年

     詳細を見る

  • A minimax approach for access point setup optimization in IEEE 802.11n wireless networks

    Kyaw Soe Lwin, Nobuo Funabiki, Chihiro Taniguchi, Khin Khin Zaw, Md. Selim Al Mamun, Minoru Kuribayashi, Wen-Chung Kao

    International Journal of Networking and Computing   7 ( 2 )   187 - 207   2017年

     詳細を見る

  • A channel assignment extension of active access-point configuration algorithm for elastic WLAN system and its implementation using Raspberry Pi

    Md. Selim Al Mamun, Nobuo Funabiki, Kyaw Soe Lwin, Md. Ezharul Islam, Wen-Chung Kao

    International Journal of Networking and Computing   7 ( 2 )   248 - 270   2017年

     詳細を見る

  • A minimax approach for access point setup optimization in IEEE 802.11n wireless networks

    Kyaw Soe Lwin, Nobuo Funabiki, Chihiro Taniguchi, Khin Khin Zaw, Md. Selim Al Mamun, Minoru Kuribayashi, Wen-Chung Kao

    International Journal of Networking and Computing   7 ( 2 )   187 - 207   2017年

     詳細を見る

  • A fill-in-blank problem workbook for Java programming learning assistant system

    Ta Na, Nobuo Funabiki, Khin Khin Zaw, Nobuya Ishihara, Shinpei Matsumoto, Wen-Chung Kao

    International Journal of Web Information Systems   13 ( 2 )   140 - 154   2017年

     詳細を見る

    記述言語:英語   出版者・発行元:Emerald Group Publishing Ltd.  

    Purpose-To advance Java programming educations, the authors have developed a Java Programming Learning Assistant System (JPLAS) as a web application system. JPLAS provides fill-in-blank problems for novices to study the grammar and basic programming skills through code reading. Design/methodology/approach-To select the blank elements with grammatically correct and unique answers from a given Java code, the authors have proposed the graph-based blank element selection algorithm. Then, the code for this problem should be highly readable to encourage novice students to study it. Because code readability can be improved by proper names for identifiers, the authors have also proposed the naming rule testing algorithm to identify codes with correct names. Findings-In this paper, the authors present a fill-in-blank problem workbook by collecting suitable Java codes from textbooks and Web sites and applying these algorithms with several extensions. The workbook consists of 16 categories with a considerable number of problems that follow the conventional learning order of Java programming. Originality/value-The proper set of ready-made fill-in-blank problems is effective in enhancing the usability of JPLAS both for teachers and students. For the preliminary evaluation, the authors assign a few problems to students. In coming semesters, the authors will use this workbook in the course to verify the adequacy of the proposal for novices.

    DOI: 10.1108/IJWIS-12-2016-0076

    Scopus

    researchmap

  • File access extension of test code generation tool for Java programming learning assistant system

    Nobuo Funabiki, Ryota Kusaka, Nobuya Ishihara, Wen-Chung Kao

    Proceedings of 6th IEEE Global Conference on Consumer Electronics (GCCE2017)   243 - 244   2017年

  • A software architecture for Java programming learning assistant system

    Nobuya Ishihara, Nobuo Funabiki, Minoru Kuribayashi, Wen-Chung Kao

    International Journal of Computer & Software Engineering   2 ( 1 )   2017年

     詳細を見る

  • A parameter optimization tool and its application to throughput estimation model for wireless LAN

    Nobuo Funabiki, Chihiro Taniguchi, Kyaw Soe Lwin, Khin Khin Zaw, Wen-Chung Kao

    The 9th International Workshop on Virtual Environment and Network-Oriented Applications (VENOA-2017)   701 - 710   2017年

     詳細を見る

  • A channel assignment extension of active access-point configuration algorithm for elastic WLAN system and its implementation using Raspberry Pi

    Md. Selim Al Mamun, Nobuo Funabiki, Kyaw Soe Lwin, Md. Ezharul Islam, Wen-Chung Kao

    International Journal of Networking and Computing   7 ( 2 )   248 - 270   2017年

     詳細を見る

  • An element fill-in-blank problem application in UTYCC for Java programming learning assistant system

    Htoo Htoo, Sandi Kyaw, Shwe Thinzar Aung, Hnin Aye Thant, Nobuo Funabiki

    Proceedings of The 8th International Conference on Science and Engineering 2017 (ICSE 2017)   271 - 275   2017年

     詳細を見る

  • A Proposal of Software Architecture for Java Programming Learning Assistant System

    Nobuya Ishihara, Nobuo Funabiki, Minoru Kuribayashi, Wen-Chung Kao

    2017 IEEE 31ST INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA)   64 - 70   2017年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    To improve Java programming educations, we have developed a Web-based Java Programming Learning System (JPLAS). To deal with students at different levels, JPLAS provides three levels of problems, namely, element fill-in-blank problems, statement fill-in-blank problems, and code writing problems. Unfortunately, since JPLAS has been implemented by various students who studied in our group at different years, the code has become complex and redundant, which makes further extensions of JPLAS extremely hard. In this paper, we propose the software architecture for JPLAS to avoid redundancy to the utmost at implementations of new functions that will be continued with this JPLAS project. Following the MVC model, our proposal basically uses Java for the model (M), JavaScript/CSS for the view (V), and JSP for the controller (C). For the evaluation, we implement JPLAS by this architecture and compare the number of code files with the previous implementation.

    DOI: 10.1109/AINA.2017.56

    Web of Science

    researchmap

  • A Proposal of Test Code Generation Tool for Java Programming Learning Assistant System

    Nobuo Funabiki, Ryota Kusaka, Nobuya Ishihara, Wen-Chung Kao

    2017 IEEE 31ST INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA)   51 - 56   2017年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    To advance Java programming educations, we have developed the Java programming learning assistant system (JPLAS) that can verify the correctness of the code from a student automatically using the test-driven development (TDD) method. Then, to register a new assignment in JPLAS, teachers are required to write the test code in addition to the reference source code. Unfortunately, most teachers at schools are not accustomed to writing test codes. In this paper, we propose a test code generation tool that automatically generates the test cases from the reference source code by extracting the outputs for given inputs using functions in JUnit. As assignments for Java novice students, the code that contains standard inputs/outputs is emphasized. For evaluation, we collected 97 codes containing standard inputs/outputs from Java programming text books or Web sites. The experimental result has shown that the proposed tool correctly generated the test codes for them except for one code using a random generator.

    DOI: 10.1109/AINA.2017.60

    Web of Science

    researchmap

  • Cross-layer selective routing for cost and delay minimization in IEEE 802.11ac wireless mesh network

    I-Wei Lai, Nobuo Funabiki, Shigeto Tajima, Md. Selim Al Mamun, Sho Fujita

    Wireless Networks   2017年

     詳細を見る

  • A graph-based blank element selection algorithm for fill-in-blank problems in Java programming learning assistant system

    Nobuo Funabiki, Tana, Khin Khin Zaw, Nobuya Ishihara, Wen-Chung Kao

    International Journal of Computer Science   44 ( 2 )   247 - 260   2017年

     詳細を見る

  • A User-PC computing system as ultralow-cost computation platform for small groups

    Nobuo Funabiki, Kyaw Soe Lwin, Yuuki Aoyagi, Minoru Kuribayashi, Wen-Chung Kao

    Application and Theory of Computer Technology   2 ( 3 )   10 - 24   2017年

     詳細を見る

  • A fill-in-blank problem workbook for Java programming learning assistant system

    Ta Na, Nobuo Funabiki, Khin Khin Zaw, Nobuya Ishihara, Shinpei Matsumoto, Wen-Chung Kao

    International Journal of Web Information Systems   13 ( 2 )   140 - 154   2017年

     詳細を見る

    記述言語:英語   出版者・発行元:Emerald Group Publishing Ltd.  

    Purpose-To advance Java programming educations, the authors have developed a Java Programming Learning Assistant System (JPLAS) as a web application system. JPLAS provides fill-in-blank problems for novices to study the grammar and basic programming skills through code reading. Design/methodology/approach-To select the blank elements with grammatically correct and unique answers from a given Java code, the authors have proposed the graph-based blank element selection algorithm. Then, the code for this problem should be highly readable to encourage novice students to study it. Because code readability can be improved by proper names for identifiers, the authors have also proposed the naming rule testing algorithm to identify codes with correct names. Findings-In this paper, the authors present a fill-in-blank problem workbook by collecting suitable Java codes from textbooks and Web sites and applying these algorithms with several extensions. The workbook consists of 16 categories with a considerable number of problems that follow the conventional learning order of Java programming. Originality/value-The proper set of ready-made fill-in-blank problems is effective in enhancing the usability of JPLAS both for teachers and students. For the preliminary evaluation, the authors assign a few problems to students. In coming semesters, the authors will use this workbook in the course to verify the adequacy of the proposal for novices.

    DOI: 10.1108/IJWIS-12-2016-0076

    Scopus

    researchmap

  • An offline answering function for code writing problem in Java programming learning assistant system

    Nobuo Funabiki, Yingxin Wang, Nobuya Ishihara, Wen-Chung Kao

    2017 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW 2017)   245 - 246   2017年

  • A graph-based blank element selection algorithm for fill-in-blank problems in Java programming learning assistant system

    Nobuo Funabiki, Tana, Khin Khin Zaw, Nobuya Ishihara, Wen Chung Kao

    IAENG International Journal of Computer Science   44 ( 2 )   247 - 260   2017年

     詳細を見る

  • Value trace problems for graph theory algorithms in Java programming learning assistant system

    Nobuo Funabiki, Khin Khin Zaw, Minoru Kuribayashi, Wen-Chung Kao

    2016 5th International Conference on Educational and Information Technology (ICEIT 2016)   2016年

     詳細を見る

  • A Channel Assignment Extension of Active Access-Point Configuration Algorithm for Elastic WLAN System under Limited Channels

    Md. Selim Al Mamun, Sumon Kumar Debnath, Kyaw Soe Lwin, Nobuo Funabiki

    2016 FOURTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)   318 - 324   2016年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    Previously, we proposed the active access-point (AP) configuration algorithm for elastic Wireless Local-Area Network (WLAN) systems using heterogeneous APs. This algorithm activates or deactivates APs depending on traffic demands, assuming that any active AP can use a different channel to avoid interferences among APs. However, the number of non-interfered channels in IEEE 802.11 protocols is limited. In this paper, we propose an extension of this algorithm to consider the channel assignment to the active APs under this limitation. After the channel assignment to the active APs, AP associations of hosts are improved to further minimize interferences by averaging loads among different channels. The effectiveness of our proposal is evaluated using the WIMNET simulator.

    DOI: 10.1109/CANDAR.2016.32

    Web of Science

    researchmap

  • An active access-point configuration algorithm for elastic wireless local-area network system using heterogeneous devices

    Khin Khin Zaw, Nobuo Funabiki, Wen-Chung Kao

    International Journal of Networking and Computing   6 ( 2 )   395 - 419   2016年

     詳細を見る

  • Throughput measurements for access-point installation optimization in IEEE802.11n wireless networks

    Nobuo Funabiki, Kyaw Soe Lwin, Minoru Kuribayashi, I-Wei Lai

    2016 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW 2016)   324 - 325   2016年

  • Worker PC performance measurements using benchmarks for user-PC computing system

    Nobuo Funabiki, Yuki Aoyagi, Minoru Kuribayashi, Wen-Chung Kao

    2016 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW 2016)   282 - 283   2016年

  • Offline answering function for fill-in-blank problems in Java programming learning assistant system

    Nobuo Funabiki, Hiroki Masaoka, Nobuya Ishihara, I-Wei Lai, Wen-Chung Kao

    2016 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW 2016)   324 - 325   2016年

  • Toward personalized learning in JPLAS: generating and scoring functions for debugging questions

    Takato Mohri, Shingo Yamaguchi, Nobuo Funabiki

    The 5th IEEE Global Conference on Consumer Electronics (GCCE2016)   216 - 219   2016年

  • A proposal of three extensions in blank element selection algorithm for Java programming learning assistant system

    Khin Khin Zaw, Nobuo Funabiki, Minoru Kuribayashi

    The 5th IEEE Global Conference on Consumer Electronics (GCCE2016)   3 - 5   2016年

  • Analysis of fill-in-blank problem solution results in Java programming course

    Nobuo Funabiki, Tana, Nobuya Ishihara, Wen-Chung Kao

    The 5th IEEE Global Conference on Consumer Electronics (GCCE2016)   479 - 480   2016年

  • A Proposal of Coding Rule Learning Function in Java Programming Learning Assistant System

    Nobuo Funabiki, Takuya Ogawa, Nobuya Ishihara, Minoni Kuribayashi, Wen-Chung Kao

    PROCEEDINGS OF 2016 10TH INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT, AND SOFTWARE INTENSIVE SYSTEMS (CISIS)   561 - 566   2016年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    Recently, Java has been educated in many universities and professional schools due to reliability, portability, and scalability. However, because of its limited time in Java programming courses, coding rules arc rarely educated. As a result, codes made by students become far from readable codes. In this paper, we propose a coding rule learning function using static code analyzers in Java Programming Learning Assistant System (JPLAS), targeting students who have accomplished the grammar learning and are going to write practical codes for final projects. Coding rules for this function consist of naming rules, coding styles, and potential problems. We evaluate the improvement of readability in four codes refined by this function and the usability of this function through the questionnaires completed by five students. In future studies, we expect that this function will be employed in Java programming courses.

    DOI: 10.1109/CISIS.2016.94

    Web of Science

    researchmap

  • A workbook design for fill-in-blank problems in Java programming learning assistant system

    Nobuo Funabiki, Khin Khin Zaw, Wen-Chung Kao

    The 11-th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA2016)   331 - 342   2016年

     詳細を見る

  • Analysis of fill-in-blank problem solutions and extensions of blank element selection algorithm for Java programming learning assistant system

    Nobuo Funabiki, Tana, Khin Khin Zaw, Nobuya Ishihara, Wen-Chung Kao

    The World Congress on Engineering and Computer Science 2016 (WCECS 2016)   237 - 242   2016年

     詳細を見る

  • A minimax approach for access-point setup optimization using throughput measurements in IEEE802.11n wireless networks

    Kyaw Soe Lwin, Nobuo Funabiki, Khin Khin Zaw, Md. Selim Al Mamun, Minoru Kuribayashi

    The Fourth International Symposium on Computing and Networking (CANDAR, ASON)   311 - 317   2016年

  • A core blank element selection algorithm for code reading studies by fill-in-blank problems in Java programming learning assistant system

    Khin Khin Zaw, Nobuo Funabiki

    The 7th International Conference on Science and Engineering 2016 (7th ICSE 2016)   204 - 208   2016年

     詳細を見る

  • Applications of coding rule learning function to workbook codes for Java programming learning assistant system

    Nobuo Funabiki, Shinpei Matsumoto, Khin Khin Zaw, Wen-Chung Kao

    The 7th International Conference on Science and Engineering 2016 (7th ICSE 2016)   1170 - 1175   2016年

     詳細を見る

  • A Cooking-Step Scheduling Algorithm with Guidance System for Homemade Cooking

    Yukiko Matsushima, Nobuo Funabiki

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E98D ( 8 )   1439 - 1448   2015年8月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Homemade cooking plays a key role for a healthy and cost-efficient life. Unfortunately, preparing multiple dishes is generally time-consuming. In this paper, an algorithm is proposed to minimize the cooking time by scheduling the cooking-step of multiple dishes. The cooking procedure of a dish is divided into a sequence of six types of cooking-steps to consider the constraints in cooks and cooking utensils in a kitchen. A cooking model is presented to optimize the cooking-step schedule and estimate the cooking time for a given starting order of dishes under various constraints of cooks and utensils. Then, a high-quality schedule is sought by repeating the generation of a new order and the model application based on exhaustive search and simulated annealing. Our simulation results and cooking experiments confirm the effectiveness of our proposal.

    DOI: 10.1587/transinf.2015EDP7048

    Web of Science

    researchmap

  • Revocable Group Signatures with Compact Revocation List Using Accumulators

    Toru Nakanishi, Nobuo Funabiki

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E98A ( 1 )   117 - 131   2015年1月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    A group signature scheme allows a group member to anonymously sign a message on behalf of the group. One of the important issues is the member revocation, and lots of revocable schemes have been proposed so far. A scheme recently proposed by Libert et al. achieves that O(1) or O(log N) efficiency of communication and computation except for the revocation list size (also the revocation cost), for the total number of members N and the number of revoked members R. However, since a signature is required for each subset separated from the set of non-revoked members, the size is about 900R Bytes in the 128-bit security. In the case of R = 100, 000, it amounts to about 80MB. In this paper, we extend the scheme to reduce the revocation list (also the revocation cost), by accumulating T subsets, which is signed for the revocation list. The revocation list size is reduced by 1/T. Unfortunately, the public key size, membership certificate size and the cost of a witness computation needed for signing increase related to T.

    DOI: 10.1587/transfun.E98.A.117

    Web of Science

    researchmap

  • Cross-Layer Selective Routing for Active Access-Point Minimization in Wireless Mesh Network

    I-Wei Lai, Wen-Chung Kao, Nobuo Funabiki

    2015 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW)   482 - 483   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    A Wireless Internet-access Mesh NETwork (WIMNET) provides the scalable and reliable internet access through the multiple access points (APs) and wireless relay communications. In particular, by redundantly deploying APs in the network field, the WIMNET becomes robust to the link or AP failure. However, these redundant APs increase the power consumption, and thus the number of active APs should be minimized by the selective routing without loss of the transmission performance. In this work, we propose to reinvent such selective routing algorithm by exploiting physical-layer technologies. An exemplar numerical simulation demonstrates that this cross-layer selective routing can further minimize the number of APs, leading to less operational costs in WIMNET.

    DOI: 10.1109/ICCE-TW.2015.7217010

    Web of Science

    researchmap

  • An Operator Fill-in-blank Problem for Algorithm Understanding in Java Programming Learning Assistant System

    Nobuo Funabiki, Shin Sasaki, Ta Na, Wen-Chung Kao

    2015 IEEE 4TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS (GCCE)   346 - 347   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    A Web-based Java Programming Learning Assistant System (JPLAS) has been developed to help novice students studying Java programming through self-learning. As one function, JPLAS provides the fill-in-blank problem that requests filling in the blank elements in a given code with several blanks. Currently, reserved words, identifiers, or control symbols can be blanked to have unique correct answers, which may be solved without reading the code carefully. In this paper, we propose to additionally blank operators in conditional expressions of core statements in the code so that students can understand the structure to realize the specification. For preliminary evaluations, we generated six operator fill-in-blank problems, and assigned them to students where the number of answer submissions per blank has increased from that of conventional problems.

    DOI: 10.1109/GCCE.2015.7398539

    Web of Science

    researchmap

  • A proposal of statement fill-in-blank problem using program dependence graph in Java programming learning assistant system

    Nobuya Ishihara, Nobuo Funabiki, Wen-Chung Kao

    Information Engineering Express   1 ( 3 )   19 - 28   2015年

     詳細を見る

  • A proposal of value trace problem for algorithm code reading in Java programming learning assistant system

    Khin Khin Zaw, Nobuo Funabiki, Wen-Chung Kao

    Information Engineering Express   1 ( 3 )   9 - 18   2015年

     詳細を見る

  • A Worker Implementation on Windows OS for User-PC Computing System

    Nobuo Funabiki, Yusuke Asai, Yuuki Aoyagi, Wen-Chung Kao

    PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)   279 - 282   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    Previously, we have proposed and implemented the User-PC computing (UPC) system as a highly parallel computing platform using idling CPU cycles in members' personal computers (PCs) of the same organization such as a laboratory in a university. This implementation for both the UPC master and the UPC worker covers only Linux OS. However, currently a lot of PCs adopt Windows OS. In this paper, we present an implementation of the UPC worker for Windows OS based on the implementation for Linux OS. During the implementation, we realize the CPU usage limitation and the automatic start-up of the worker program which can reduce loads for PC owner, aside from basic functions of master communications and job executions. Through evaluations, we conclude that the CPU usage rate does not exceed the given limitation except for starting time, and the job execution time on Windows is about twice the use of that on Linux.

    DOI: 10.1109/CANDAR.2015.17

    Web of Science

    researchmap

  • A Function for Generating Debugging Questions in a Java Programming Learning Assistant System

    Shingo Yamaguchi, Takato Mohri, Nobuo Funabiki

    2015 IEEE 4TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS (GCCE)   350 - 353   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    Today many universities offer courses for learning Java programming. Debugging cannot be avoided in programming. Nevertheless, there are not many chances for students to debugging programs, particularly written by another person. In this paper, for increasing that chance, we propose a function for generating a new kind of questions that are called debugging questions. A debugging question requires students to debug a program mixed with bugs. This function provides three ways of mixing bugs: deletion of reserved words, swapping of variables, and replacement by lists. We implemented this function into a Java programming learning assistant system, called JPLAS. We also discussed the usefulness by evaluating the function.

    DOI: 10.1109/GCCE.2015.7398573

    Web of Science

    researchmap

  • An Extension of Statement Fill-in-blank Problem in Java Programming Learning Assistant System

    Nobuya Ishihara, Nobuo Funabiki, Ta Na, Wen-Chung Kao

    2015 IEEE 4TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS (GCCE)   354 - 358   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    To assist Java programming studies, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). As one function in JPLAS, it provides a statement fill-in-blank problem that asks students to fill in proper statements to blanked ones in a Java code, so as to cultivate simultaneous code reading and writing abilities. Previously, we blanked only the core statement in a code with one class using the Program Dependence Graph (PDG), where we do not consider the features of object-oriented programming in Java that uses multiple classes and collaborations with other systems such as database. In this paper, we extend the statement fill-in-blank problem to deal with these features. We verify the effectiveness of our proposal through the Java programming course at our department.

    DOI: 10.1109/GCCE.2015.7398543

    Web of Science

    researchmap

  • Correlation Analysis of Fill-in-blank Problem Solutions to Final Programming Results in Java Programming Course

    Ta Na, Nobuo Funabiki, Nobuya Ishihara, Wen-Chung Kao

    2015 IEEE 4TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS (GCCE)   348 - 349   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    To assist Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS provides fill-in-blank problems to study the Java grammar and fundamental programming by filling blank elements that are composed of reserved words, identifiers, and control symbols in a high-quality code. During the last semester, we assigned 121 problems with 1,552 questions to 46 students taking our Java programming course. In this paper, we analyze correlations of problem solving results of students to their final programming results.

    DOI: 10.1109/GCCE.2015.7398542

    Web of Science

    researchmap

  • Active Access-Point Configuration Algorithm with Dynamic Mobile Router Placement for Elastic WLAN System

    Md. Selim Al Mamun, Md. Ezharul Islam, Nobuo Funabiki, I-Wei Lai

    PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)   246 - 252   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    Recently, a variety of wireless access points (APs) have been deployed by many organizations to meet different traffic demands. Previously, we proposed an active AP configuration algorithm that activates or deactivates heterogeneous AP devices depending on the traffic demand and network topology, in order to realize the elastic Wireless Local-Area Network (WLAN) system. Unfortunately, in this algorithm, the locations of the mobile routers have been fixed as the algorithm input, although they can be placed flexibly as portable APs using cellular networks. In this paper, we consider the elastic WLAN system with mobile routers which can be placed flexibly. The dynamic mobile router placement is proposed for the active AP configuration algorithm to meet stringent traffic requirements. Specifically, if some hosts fail to meet the throughput requirements, the locations of additional mobile routers are dynamically determined by applying the Kmeans algorithm to maximize the number of those failed hosts in its coverage. The effectiveness of this location determination is demonstrated by numerical examples with three network scenarios.

    DOI: 10.1109/CANDAR.2015.55

    Web of Science

    researchmap

  • Extensions of access-point aggregation algorithm for large-scale wireless local area networks

    International Journal of Networking and Computing   5 ( 1 )   200 - 222   2015年

     詳細を見る

  • Practices of Fill-in-blank Problems in Java Programming Course

    Nobuo Funabiki Tana, Nobuya Ishihara

    2015 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW)   120 - 121   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    To assist Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS provides fill-in-blank problems to study the Java grammar by filling blank elements in a high-quality code that are composed of reserved words, identifiers, and control symbols. A graph-based blank element selection algorithm has been proposed to automatically select as many blanks as possible that have grammatically correct unique answers. In this paper, we show and discuss their application results to a Java programming course in our department.

    DOI: 10.1109/ICCE-TW.2015.7216810

    Web of Science

    researchmap

  • Concept of User-PC Computing System

    Nobuo Funabiki, Bongsu Kim, Yuki Aoyagi

    2015 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW)   480 - 481   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    The User-PC computing system (UPC) is a technology of realizing a parallel computing environment using idling computing resources (CPU cycles) in Personal Computers (PCs) of members in the same organization or group such as a laboratory in a university and a section in a company. UPC can resolve drawbacks in the registration of computing projects, the reliability of computing results, and the continuity of computations that may often happen in Volunteer Computing (VC) systems using voluntary PCs in the Internet. Thus, UPC can be easily and comfortably used by computing users. In this paper, we show the concept of UPC and preliminary evaluations.

    DOI: 10.1109/ICCE-TW.2015.7217009

    Web of Science

    researchmap

  • A proposal of graph-based blank element selection algorithm for Java programming learning with fill-in-blank problems

    Tana, Nobuo Funabiki, Nobuya Ishihara

    The International MultiConference of Engineers and Computer Scientists 2015 (IMECS 2015)   2015年

     詳細を見る

  • Practices of Cooking-Step Scheduling Algorithm for Homemade Cooking

    Yukiko Matsushima, Nobuo Funabiki

    2015 IIAI 4TH INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS (IIAI-AAI)   500 - 505   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    Homemade cooking is essential not only for keeping healthy and cost-efficient dietary lives but also for constructing good family relationships and identities. Previously, we proposed the cooking-step scheduling algorithm to help homemade cooking by finding a schedule of applying the cooking-steps for multiple dishes with minimal cooking time. In this algorithm, the cooking procedure for each dish is divided into a sequence of six types of cooking-steps to consider the constraints in cooks and cooking utensils in a kitchen. In this paper, we conduct practices of the algorithm in actually cooking dishes by following the generated schedules to show the effectiveness.

    DOI: 10.1109/IIAI-AAI.2015.189

    Web of Science

    researchmap

  • A Concept of Value Trace Problem for Java Code Reading Education

    Khin Khin Zaw, Nobuo Funabiki

    2015 IIAI 4TH INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS (IIAI-AAI)   253 - 258   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    To assist Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS provides the fill-in-blank problem to help novice students studying Java programming at home, where some elements in a high-quality code including reserved words, identifiers, and control symbols are blanked to be filled by students. Unfortunately, this problem may be solved without reading out the algorithm in the code if students are familiar with Java grammar to some extent. In this paper, to further cultivate the code reading capability of students, we propose a concept of the value trace problem to ask the actual values of important variables in a code implementing some fundamental data structure or algorithm. A value trace problem can be generated by: 1) selecting a high-quality class code for the algorithm to be studied, 2) making the main class to instantiate the class in 1) if it does not contain the main method, 3) adding the functions to output variable values in questions into a text file, 4) preparing the input file to the code in 3) if necessary, 5) running this code to obtain the set of variable values in the text file, 6) blanking some values from the text file to be filled by students, and 7) uploading the final code, the blanked text file, and the correct answer file into the JPLAS server, and adding the brief description on the algorithm for a new assignment. To verify the feasibility of this concept, we manually generated five problems and asked four students with high Java programming skills in our group to solve them. Then, we analyzed the difficulty of the value trace problem for Quick Sort.

    DOI: 10.1109/IIAI-AAI.2015.188

    Web of Science

    researchmap

  • A Proposal of Statement Fill-in-blank Problem in Java Programming Learning Assistant System

    Nobuya Ishihara, Nobuo Funabiki

    2015 IIAI 4TH INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS (IIAI-AAI)   247 - 252   2015年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    As a reliable, portable, and practical programming language, Java has been educated in many universities and professional schools. To assist Java educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS provides the element fill-in-blank problem and the code writing problem. The former problem is designed for novice students to study the grammar and writing style of Java by filling correct words to the blanks in a given Java code that are automatically marked by checking coincidences with correct ones. The latter problem is for students to study writing Java codes for specifications described in natural language that are automatically verified using the test-driven development (TDD) method. Unfortunately, the transition between two problems is not smooth due to the difference in difficulties. In this paper, we propose the statement fill-in-blank problem in JPLAS to fill the gap by asking students to write one whole statement in a code where the correctness is verified by the TDD method. The blank statement is selected by generating the Program Dependence Graph (PDG) of the code and finding the statement that has the largest dependence with other ones. We verify the effectiveness of our proposal through applications to the Java programming course in our department.

    DOI: 10.1109/IIAI-AAI.2015.192

    Web of Science

    researchmap

  • An Anonymous Reputation System with Reputation Secrecy for Manager

    Toru Nakanishi, Nobuo Funabiki

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E97A ( 12 )   2325 - 2335   2014年12月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    In anonymous reputation systems, where after an interaction between anonymous users, one of the users evaluates the peer by giving a rating. Ratings for a user are accumulated, which becomes the reputation of the user. By using the reputation, we can know the reliability of an anonymous user. Previously, anonymous reputation systems have been proposed, using an anonymous e-cash scheme. However, in the e-cash-based systems, the bank grasps the accumulated reputations for all users, and the fluctuation of reputations. These are private information for users. Furthermore, the timing attack using the deposit times is possible, which makes the anonymity weak. In this paper, we propose an anonymous reputation system, where the reputations of users are secret for even the reputation manager such as the bank. Our approach is to adopt an anonymous credential certifying the accumulated reputation of a user. Initially a user registers with the reputation manager, and is issued an initial certificate. After each interaction with a rater, the user as the ratee obtains an updated certificate certifying the previous reputation summed up by the current rating. The update protocol is based on the zero-knowledge proofs, and thus the reputations are secret for the reputation manager. On the other hand, due to the certificate, the user cannot maliciously alter his reputation.

    DOI: 10.1587/transfun.E97.A.2325

    Web of Science

    researchmap

  • Implementation of Anonymous Credential System with Efficient Proofs for Monotone Formulas on Attributes Excluding Restriction

    Shahidatul Sadiah, Toru Nakanishi, Nobuo Funabiki

    2014 SECOND INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)   531 - 535   2014年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    An anonymous credential system allows a user to convince a service provider anonymously that he/she owns certified attributes. Previously, we proposed an anonymous credential system to prove user's attributes to satisfy a monotone formula, i.e., a logic relation with any combination of AND/OR relations. However, this system has a restriction that the user can prove the monotone formula when only one attribute is true for any OR relation. Recently, we proposed the improved system to overcome the restriction, by adopting Linear Homonorphic (LH) signature scheme to generate a certificate that contains the minimum attribute set as required in the verification. However, the improved system has never been implemented, and thus the practicality is not evaluated. In this paper, we implement the system using a fast pairing library, and measure the processing times and data sizes, when changing the number of user's attributes and the size of the proved relation.

    DOI: 10.1109/CANDAR.2014.35

    Web of Science

    researchmap

  • A proposal of routing algorithm under practical conditions for wireless Internet-access mesh networks

    Nobuo Funabiki, Toru Nakanishi, Wataru Maruyama

    2014 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW 2014)   27 - 28   2014年

  • Extensions of Active Access-Point Selection Algorithm for Wireless Mesh Networks Using IEEE802.11ac Protocol

    Chang Choon Chew, Nobuo Funabiki, Sho Fujita

    2014 SECOND INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)   310 - 314   2014年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    A wireless Internet-access mesh network (WIMNET) provides a scalable Internet-access network by flexibly allocating access points (APs) in the field that are connected by wireless links. Previously, we proposed an active AP selection algorithm to select the APs to be activated among the redundantly allocated APs for WIMNET that has a single Internet gateway (GW). However, in practical implementations of large-scale WIMNET, multiple GWs are usually necessary to increase the capacity of Internet connections. Besides, the number of hops between a GW and a host is limited for stable multihop communications, and the transmission speed of a wireless link is dynamically changed by the link condition such as the distance in the high-speed IEEE802.11ac protocol. Furthermore, the minimum throughput should be provided to a host as QoS (Quality of Service) when it is exclusively connected with the GW. In this paper, we propose extensions of the active AP selection algorithm to consider these conditions. We verify the effectiveness of our proposal through simulations in three topologies using the WIMNET simulator.

    DOI: 10.1109/CANDAR.2014.29

    Web of Science

    researchmap

  • A Frame Aggregation Extension of Routing Algorithm for Wireless Mesh Networks

    Nobuo Funabiki, Yuuma Tani, Shigeto Tajima

    2014 SECOND INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)   238 - 242   2014年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    As a scalable Internet-access network, an Wireless Internet-access Mesh NETwork (WIMNET) consists of multiple wireless access-points (APs) that are connected through wireless links. At least one AP acts as a gateway (GW) to the Internet where any host must reach there through multi-hop communications between APs. To handle large traffics, the latest highspeed IEEE 802.11ac protocol should be adopted for scalable WIMNET, where the routing path determines the performance under its practical implementations using commercial products. Therefore, we have proposed a routing algorithm considering 1) multiple GWs, 2) the link speed change, and 3) the limited number of hops. In this paper, to further improve the performance, we extend the routing algorithm to efficiently consider the frame aggregation in IEEE802.11ac. We verify the effectiveness of our proposal through simulating two topologies using the extended WIMNET simulator.

    DOI: 10.1109/CANDAR.2014.28

    Web of Science

    researchmap

  • An extended active access-point selection algorithm for link speed changes in wireless mesh networks

    International Journal Space-Based and Situated Computing   4 ( 3 )   184 - 193   2014年

     詳細を見る

  • A proposal of Javadoc hint function for Java programming learning assistant system

    Nobuo Funabiki, Takuya Nakamura, Wen-Chung Kao

    The 3rd IEEE Global Conference on Consumer Electronics (GCCE2014)   352 - 356   2014年

  • Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System

    Nasima Begum, Toru Nakanishi, Nobuo Funabiki

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E96A ( 12 )   2422 - 2433   2013年12月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    To enhance user privacy, anonymous credential systems allow the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. In the systems, the user can prove relations on his/her attributes embedded into the certificate. Previously, a pairing-based anonymous credential system with constant-size proofs in the number of attributes of the user was proposed. This system supports the proofs of the inner product relations on attributes, and thus can handle the complex logical relations on attributes as the CNF and DNF formulas. However this system suffers from the computational cost: The proof generation needs exponentiations depending on the number of the literals in OR relations. In this paper, we propose a pairing-based anonymous credential system with the constant-size proofs for CNF formulas and the more efficient proof generation. In the proposed system, the proof generation needs only multiplications depending on the number of literals, and thus it is more efficient than the previously proposed system. The key of our construction is to use an extended accumulator, by which we can verify that multiple attributes are included in multiple sets, all at once. This leads to the verification of CNF formulas on attributes. Since the accumulator is mainly calculated by multiplications, we achieve the better computational costs.

    DOI: 10.1587/transfun.E96.A.2422

    Web of Science

    researchmap

  • A Fixed Backoff-Time Switching Method for CSMA/CA Protocol in Wireless Mesh Networks

    Sritrusta Sukaridhoto, Nobuo Funabiki, Toru Nakanishi, Kan Watanabe, Shigeto Tajima

    IEICE TRANSACTIONS ON COMMUNICATIONS   E96B ( 4 )   1019 - 1029   2013年4月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    As a flexible and cost-efficient scalable Internet access network, we studied architectures, protocols, and design optimizations of the Wireless Internet-access Mesh NETwork (WIMNET). WIMNET is composed of multiple access points (APs) connected through multihop wireless communications on IEEE 802.11 standards. The increasing popularity of real-time applications such as IF-phones and IP-TV means that they should be supported in WIMNET. However, the contention resolution mechanism using a random backoff-time in the CSMA/CA protocol of 802.11 standards is not sufficient for handling real-time traffic in multihop wireless communications. In this paper, we propose a Fixed Backoff-time Switching (FBS) method for the CSMA/CA protocol to improve the real-time traffic performance in WIMNET by giving the necessary activation chances to each link. We implement our proposal on the QualNet simulator, and verify its effectiveness through simulations on three network topologies with four scenarios.

    DOI: 10.1587/transcom.E96.B.1019

    Web of Science

    researchmap

  • A Java programming learning assistant system using test-driven development method

    Nobuo Funabiki, Yukiko Matsushima, Toru Nakanishi, Kan Watanabe, Noriki Amano

    IAENG International Journal of Computer Science   40 ( 1 )   38 - 46   2013年

     詳細を見る

  • An extension of access-point aggregation algorithm to ensure minimum host throughput for wireless local area networks

    Md. Ezharul Islam, Nobuo Funabiki, Toru Nakanishi, Kan Watanabe

    The First International Symposium on Computing and Networking (CANDAR'13)   668 - 673   2013年

     詳細を見る

  • An improvement of graph-based fill-in-blank problem generation algorithm in Java programming learning assistant system

    Tana, Nobuo Funabiki, Toru Nakanishi, Noriki Amano

    International Workshop on ICT   1 - 4   2013年

     詳細を見る

  • A cooking guidance function on Android tablet for homemade cooking assistance system

    Yukiko Matsushima, Nobuo Funabiki, Tomoya Okada, Toru Nakanishi, Kan Watanabe

    IEEE Region 10 Humanitarian Technology Conference 2013 (R10-HTC2013)   277 - 282   2013年

  • An extension of fill-in-the-blank problem function in Java programming learning assistant system

    Nobuo Funabiki, Yousuke Korenaga, Toru Nakanishi, Kan Watanabe

    IEEE Region 10 Humanitarian Technology Conference 2013 (R10-HTC2013)   95 - 100   2013年

  • A Modified Active Access-Point Selection Algorithm Considering Link Speed Change in IEEE 802.11n for Wireless Mesh Networks

    Nobuo Funabiki, Sho Fujita, Toru Nakanishi, Kan Watanabe

    2013 SEVENTH INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT, AND SOFTWARE INTENSIVE SYSTEMS (CISIS)   714 - 719   2013年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    As an inexpensive, scalable Internet-access wireless network, we have studied the architecture, protocols, and design optimizations of the wireless Internet-access mesh network (WIMNET) that uses multiple access-points (APs) connected by wireless links. WIMNET can improve the dependability to failures of links and/or APs by allocating APs redundantly in the network field. Because redundant APs can increase the operational cost and degrade the performance due to increasing radio interferences, only the necessary APs for connections between the hosts and the Internet gateway should be activated at communications. Previously, we have defined the active AP selection problem of selecting the minimum number of active APs, and proposed its heuristic algorithm, assuming that every link has the same constant speed for simplicity. However, our preliminary experiments found that the link speed is greatly affected by the distance in the high-speed IEEE802.11n protocol that has recently become popular. In this paper, we propose a modification of the active AP selection algorithm to consider the link speed change, where we introduce a new design parameter for WIMNET to select links that have sufficient throughputs. We verify the effectiveness of our modified algorithm through simulations in four instances using the WIMNET simulator.

    DOI: 10.1109/CISIS.2013.128

    Web of Science

    researchmap

  • A Modified Routing Tree Algorithm Considering Link Speed Change in IEEE 802.11n for Wireless Mesh Network

    Nobuo Funabiki, Toru Nakanishi, Kan Watanabe, Wataru Maruyama

    2013 IEEE 17TH INTERNATIONAL SYMPOSIUM ON CONSUMER ELECTRONICS (ISCE)   29 - 30   2013年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    A Wireless Internet-access Mesh NETwork (WIMNET) can provide an expandable Internet-access network by adopting multiple Access-Points (APs) that have wireless connections with each other. Previously, we proposed a routing tree algorithm for generating an optimal routing path between the APs and the Internet Gate Way (GW) with a minimal transmission delay, assuming that every link has the same data transmission speed. However, our preliminary experiments found that the link speed using the IEEE802.11n as a new high-speed protocol for wireless communications, decreases drastically as the distance increases due to the lowered receiving signal quality. In this paper, we propose a modified routing tree algorithm to consider the large speed change in order to adopt the IEEE 802.11n in WIMNET effectively. In addition to links between APs, our modified algorithm selects the links between hosts and their associated APs. We verify the effectiveness of the modified algorithm through simulations in three topologies.

    DOI: 10.1109/ISCE.2013.6570233

    Web of Science

    researchmap

  • Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs

    Nasima Begum, Toru Nakanishi, Nobuo Funabiki

    2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013   530 - 533   2013年

     詳細を見る

    記述言語:英語  

    To enhance the user privacy at authentications, an anonymous credential system has been designed to allow a user to anonymously convince a verifier of the possession of a certificate issued by the issuing authority. In this system, a user can prove relations on his/her attributes embedded into the certificate. Previously, we have proposed an anonymous credential system with constant-size proofs and faster proof generations for CNF formulas than the existing system. In the system, in the verification, some value should be included in some set Φ. Unfortunately, this system has a problem of requiring long public parameters that is proportional to the size of the set Φ. In this paper, we propose an extension to reduce the public key by separating this set Φ into two sets Φ1 and Φ2 with logarithmic sizes such that u1 Φ1 and u2 Φ2 if and only if u1 +u2 Φ. Furthermore, we evaluate the efficiency based on the implementation. © 2013 IEEE.

    DOI: 10.1109/GCCE.2013.6664912

    Scopus

    researchmap

  • An extension of clustering algorithm for considering link speed in wireless mesh networks

    Shigeto Tajima, Nobuo Funabiki, Teruo Higashino

    2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013   500 - 504   2013年

     詳細を見る

    記述言語:英語  

    As a scalable Internet-access network, we have studied Wireless Internet-access Mesh Network (WIMNET) using multiple access point (APs) that are connected through wireless communications. In previous studies, we proposed a clustering algorithm for efficiently composing a large scale WIMNET by partitioning the APs into a set of clusters. This algorithm assumes that any link speed is constant for simplicity, whereas our preliminary experiments found that it is greatly changed as the link distance increases due to interferences when adopting the new high-speed IEEE802.11n protocol. In this paper, we extend our clustering algorithm to consider this link speed change to introduce IEEE802.11n into WIMNET. We verify the effectiveness of the extended algorithm through simulations in a grid topology instance using the WIMNET simulator. © 2013 IEEE.

    DOI: 10.1109/GCCE.2013.6664902

    Scopus

    researchmap

  • Extensions of cooking guidance function on Android tablet for homemade cooking assistance system

    Yukiko Matsushima, Nobuo Funabiki, Yijia Zhang, Toru Nakanishi, Kan Watanabe

    2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013   397 - 401   2013年

     詳細を見る

    記述言語:英語  

    Previously, we proposed a cooking-step scheduling algorithm to find a schedule of applying the cooking steps in the recipes for efficiently cooking multiple dishes simultaneously, to help healthy and cost-efficient lives for busy person. Then, we implemented a cooking guidance function on an Android tablet to navigate the cooking schedule in a kitchen. Although we confirmed the effectiveness through cooking experiments, we found three problems: 1) a user may click a starting button even if the previous required steps are not completed, 2) a user may miss the proper timing to stop a cooking-step, and 3) the duration time for a cooking-step may be varied by a user skill or a dish nature. In this paper, we extend the cooking guidance function by adding three features of starting condition checking, time-up alarming, and cooking rescheduling to solve these problems. We verify the effectiveness of the extended guidance function through experimentally cooking four dishes. © 2013 IEEE.

    DOI: 10.1109/GCCE.2013.6664869

    Scopus

    researchmap

  • An extension of menu planning algorithm for two-phase homemade cooking

    Nobuo Funabiki, Yukiko Matsushima, Toru Nakanishi, Kan Watanabe

    2013 IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013   352 - 356   2013年

     詳細を見る

    記述言語:英語  

    Nowadays, many people keep busy lives due to working in companies, studying in schools, or taking care of children or senior parents. As a result, it has become very hard for them to cook foods for suppers by themselves at home after long-hour duties at daytime in weekdays. Previously, to assist homemade cooking of such busy people, we proposed a two-phase cooking such that the preparation phase of cooking foods that they will eat on the following weekdays is performed on a weekend, and the finishing phase for the foods for a supper is completed on the day in short time. Then, we presented a menu planning algorithm to assist generating one-week menus for this two-phase cooking. Unfortunately, we found that this algorithm has the following drawbacks in practical use: 1) the selection of food preference is not easy, 2) the use of preferred ingredients for cooking cannot be directly specified, and 3) the nutrition balance of foods in a menu is not considered. In this paper, we extend this algorithm to solve them by newly defining a preference index and the food balance guide by Japanese government. We verify the effectiveness of the extended algorithm through generating five-day menus from 241 food candidates. © 2013 IEEE.

    DOI: 10.1109/GCCE.2013.6664853

    Scopus

    researchmap

  • A graph-based algorithm for fill-in-blank problem generation in Java programming learning assistant system

    Nobuo Funabiki, Tana, Toru Nakanishi, Kan Watanabe

    The 3rd International Conference on Applied and Theoretical Information Systems Research (ATISR2013)   2013年

     詳細を見る

  • A fixed backoff-time switching method for wireless mesh networks: Design and Linux implementation

    Sritrusta Sukaridhoto, Nobuo Funabiki, Dadet Pramudihanto, Zainal Arief

    Proceedings - 2013 International Conference on Information Technology and Electrical Engineering: "Intelligent and Green Technologies for Sustainable Development", ICITEE 2013   248 - 253   2013年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE Computer Society  

    As a flexible and cost-efficient scalable Internet access network, we have studied architectures, protocols, and design optimizations of the Wireless Internet-Access Mesh NETwork (WIMNET). WIMNET is composed of wirelessly connected access points (APs), where any host can basically access to the Internet through multihop communications between APs with IEEE 802.11 standard. In WIMNET, undesirable situations can often happen such that some links dominate the bandwidth while others become insufficient due to the limited shared bandwidth. However, the contention resolution mechanism using a random backoff-time in the CSMA/CA protocol of 802.11 standards is not sufficient for handling real-time traffic in multihop wireless communications. Previously, we have proposed the concept of the CSMA-based Fixed Backoff time Switching (CSMA-FBS) method for WIMNET to improve the performance by giving necessary link activation chances for multi-hop communications. We implemented our proposal on the QualNet simulator, and verify its effectiveness through simulations. In this paper, we present an implementation of the FBS method in Linux kernel to show its practicality and investigate the performance in a real network. Our design consists of implementations or modifications of the five programs: Kernel configuration, Debugfs, Minstrel, iw, and FBSdaemon. © 2013 IEEE.

    DOI: 10.1109/ICITEED.2013.6676247

    Scopus

    researchmap

  • An access-point aggregation approach for energy-saving wireless local area networks

    Md. Ezharul Islam, Nobuo Funabiki, Toru Nakanishi, Kan Watanabe

    IEICE Transactions on Communications   E96-B ( 12 )   2986 - 2997   2013年

     詳細を見る

    記述言語:英語   出版者・発行元:Institute of Electronics, Information and Communication, Engineers, IEICE  

    Nowadays, with spreads of inexpensive small communication devices, a number of wireless local area networks (WLANs) have been deployed even in the same building for the Internet access services. Their wireless access-points (APs) are often independently installed and managed by different groups such as departments or laboratories in a university or a company. Then, a user host can access to multiple WLANs by detecting signals from their APs, which increases the energy consumption and the operational cost. It may also degrade the communication performance by increasing interferences. In this paper, we present an AP aggregation approach to solve these problems in multiple WLAN environments by aggregating deployed APs of different groups into limited ones using virtual APs. First, we formulate the AP aggregation problem as a combinatorial optimization problem and prove the NP-completeness of its decision problem. Then, we propose its heuristic algorithm composed of five phases. We verify the effectiveness through extensive simulations using the WIMNET simulator. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.

    DOI: 10.1587/transcom.E96.B.2986

    Scopus

    researchmap

  • 地域企業との協同による実践的エンジニアリングデザイン能力の育成

    五福明夫, 田畑綽久, 冨田栄二, 舩曵信生

    工学教育   60 ( 1 )   52 - 57   2012年

     詳細を見る

  • A dynamic rescheduling extension of cooking-step scheduling algorithm for multiple dish cooking

    Yukiko Matsushima, Nobuo Funabiki, Toru Nakanishi, Kan Watanabe

    The 2nd International Conference on Applied and Theoretical Information Systems Research (2nd ATISR2012)   2012年

     詳細を見る

  • A code design learning function in Java programming learning assistant system using test-driven development method

    Nobuo Funabiki, Takuya Nakamura, Yukiko Matsushima, Toru Nakanishi, Kan Watanabe

    The 2nd International Conference on Applied and Theoretical Information Systems Research (2nd ATISR2012)   2012年

     詳細を見る

  • An application of cooking-step scheduling algorithm for homemade cooking and its extensions

    Yukiko Matsushima, Nobuo Funabiki, Toru Nakanishi, Kan Watanabe

    1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012   94 - 98   2012年

     詳細を見る

    記述言語:英語  

    Homemade cooking can have a key role for a healthy and cost-efficient life. To help this activity for busy people such as workers, students, and child-rearing families, we have proposed a cooking-step scheduling algorithm to suggest an optimal sequence of the cooking-steps when multiple dishes are cooked within a limited time. In this algorithm, the cooking procedure for each dish is divided into a set of cooking-steps, and the execution sequence of all the cooking-steps for the dishes is optimized such that the total cooking time is minimized. In this paper, we first show our application result of this algorithm in cooking five dishes and the arisen problems through this experiment. Then, we present four extensions of this algorithm to solve them. Through simulations and cooking experiments, we verify the effectiveness of the algorithm extensions. © 2012 IEEE.

    DOI: 10.1109/GCCE.2012.6379977

    Scopus

    researchmap

  • An extension of routing tree algorithm for smart antenna use in wireless Internet-access mesh network

    Nobuo Funabiki, Toru Nakanishi, Kan Watanabe

    The 1st IEEE Global Conference on Consumer Electronics (GCCE2012)   642 - 646   2012年

  • Implementation and Evaluation of an Pairing-Based Anonymous Credential System with Constant-Size Proofs and Efficient Proof Generations

    Nasima Begum, Toru Nakanishi, Nobuo Funabiki

    2012 THIRD INTERNATIONAL CONFERENCE ON NETWORKING AND COMPUTING (ICNC 2012)   264 - 268   2012年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    To enhance user privacy, anonymous credential systems allow the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. In the systems, the user can prove logical relations on his/her attributes embedded into the certificate. Previously, we proposed a pairing-based system with constant-size proofs. In the system, the proof generation needs only multiplications depending on the size of the proved relations, and it is more efficient than other existing system that needs the exponentiations whose costs are much larger than multiplications. However, our efficient system has never been implemented, and thus the practicality is not evaluated. In this study, we implemented the system, and measured the processing times and data size, when changing the parameters describing the size of the proved relation. The verification time is very fast and constant, and the proof size is also constant, from which we can confirm the practicality. However, the proof generation time increases, when the parameters increase. Although we confirm the practicality in case of small relations, we clarify the problems in case of larger relations, which should be solved in our future works.

    DOI: 10.1109/ICNC.2012.48

    Web of Science

    researchmap

  • Efficient proofs for CNF formulas on attributes in pairing-based anonymous credential system

    Nasima Begum, Toru Nakanishi, Nobuo Funabiki

    15th Annual International Conference on Information Security and Cryptology (ICISC 2012)   2012年

     詳細を見る

  • An Error Code Highlighting Function in Java Programming Learning Assistant System Using Test-Driven Development Method

    Nobuo Funabiki, Yuuki Fukuyama, Yukiko Matsushima, Toru Nakanishi, Kan Watanabe

    WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2012, VOL I   230 - 235   2012年

     詳細を見る

    記述言語:英語   出版者・発行元:INT ASSOC ENGINEERS-IAENG  

    Recently, the objected-oriented programming language Java has been used in many practical systems including enterprise servers, smart phones, and embedded systems due to its high reliability and portability. To enhance effects of Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS adopts the Test-Driven Development (TDD) method for automatic testing of source codes written by students on the server to assist their self-learning. In JPLAS, a teacher needs to register each Java programming assignment with a statement, a reference source code, and a test code. Then, students should write source codes by referring this statement and the test code so that their source codes can be tested automatically at the server by a testing software tool called JUnit with the test code. Unfortunately, the current JPLAS is not friendly to students who have difficulty in reading the log message from JUnit that contains the information on the errors in the source code. In this paper, we implement the error code highlighting function to help such students to find erroneous lines in the code by highlighting them graphically. We evaluate the effectiveness of this function through an experiment for 42 students who are currently taking the Java programming class.

    Web of Science

    researchmap

  • An extension of clustering algorithm for smart-antenna use in wireless mesh networks

    Shigeto Tajima, Nobuo Funabiki, Shigeru Tomisato, Masaharu Hata, Teruo Higashino

    The 1st IEEE Global Conference on Consumer Electronics (GCCE2012)   647 - 651   2012年

  • A proposal of access-point aggregation approach for multiple wireless local area networks

    Nobuo Funabiki, Md. Ezharul Islam, Toru Nakanishi, Kan Watanabe

    4th International Workshop on Virtual Environment and Network-Oriented Applications (VENOA 2012)   668 - 673   2012年

     詳細を見る

  • A pairing-based anonymous credential system with efficient attribute proofs

    Amang Sudarsono, Toru Nakanishi, Nobuo Funabiki

    Journal of Information Processing   20 ( 3 )   774 - 784   2012年

     詳細を見る

    記述言語:英語  

    To enhance user privacy, anonymous credential systems allow the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. The typical application is the privacy-enhancing electronic ID (eID). Although a previously proposed system achieves the constant complexity in the number of finiteset attributes of the user, it requires the use of RSA. In this paper, we propose a pairing-based anonymous credential system excluding RSA that achieves the constant complexity. The key idea of our proposal is the adoption of a pairing-based accumulator that outputs a constant-size value from a large set of input values. Using zero-knowledge proofs of pairing-based certificates and accumulators, any AND and OR relation can be proved with the constant complexity in the number of finite-set attributes. We implement the proposed system using the fast pairing library, compare the efficiency with the conventional systems, and show the practicality in a mobile eID application. © 2012 Information Processing Society of Japan.

    DOI: 10.2197/ipsjjip.20.774

    Scopus

    researchmap

  • A proposal of CSMA fixed backoff-time switching protocol and its implementation on QualNet simulator for wireless mesh networks

    Sritrusta Sukaridhoto, Nobuo Funabiki, Toru Nakanishi, Kan Watanabe

    Proceedings - 26th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2012   520 - 525   2012年

     詳細を見る

    記述言語:英語  

    As an inexpensive and scalable Internet access network, we have studied the architecture, protocols, and design optimizations of the Wireless Internet access Mesh Network (WIMNET). WIMNET is composed of multiple access points (APs) that are connected through wireless links. Previously, we have proposed the concept of the CSMA-based Fixed Back off-time Switching (CSMA-FBS) method for WIMNET to improve the performance by giving necessary link activation chances for multi-hop communications. In this paper, we propose a protocol for this CSMA-FBS method implement able on APs, and its actual implementation on the QualNet simulator for evaluations in realistic network environments. The simulation results in two network topologies confirm the effectiveness of our proposal. © 2012 IEEE.

    DOI: 10.1109/WAINA.2012.69

    Scopus

    researchmap

  • An online fill-in-the-blank problem function for learning reserved words in Java programming education

    Nobuo Funabiki, Yousuke Korenaga, Yukiko Matsushima, Toru Nakanishi, Kan Watanabe

    Proceedings - 26th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2012   375 - 380   2012年

     詳細を見る

    記述言語:英語  

    The Java programming education to students has been held in a lot of universities and professional schools due to the reliability, portability, and easy learning. To assist this education, our group has developed a Java programming learning system based on the test-driven development method. However, this Web system targets students who have studied Java to some extent. In this paper, we propose a fill-in-the-blank problem function for this system to assist the learning of the Java reserved words by novice Java learners. Our function consists of a teacher service process and a student service process. By the former one, a teacher can generate a fill-in-the-blank problem easily by blanking the specified reserved words randomly from a sample Java code in the database. By the latter one, a student can repeatedly submit answers of a problem until all the questions are correctly solved for self-study. The function is implemented on an existing Web system and is applied to students who are currently learning Java. The questionnaire result confirms the effectiveness of our proposal. © 2012 IEEE.

    DOI: 10.1109/WAINA.2012.64

    Scopus

    researchmap

  • An extension of routing tree algorithm considering link speed change in IEEE 802.11n protocol for wireless mesh network

    Nobuo Funabiki, Wataru Maruyama, Toru Nakanishi, Kan Watanabe

    The Third International Symposium on Multidisciplinary Emerging Networks and Systems (MENS2012)   2012年

  • A Lattice Implementation of High-precision IIR Filter for X-ray CT Reconstruction

    Kazuhisa Hayashi, Hiroshi Tsutsu, Yoshitaka Morikawa, Nobuo Funabiki

    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, IMECS 2012, VOL I   751 - 756   2012年

     詳細を見る

    記述言語:英語   出版者・発行元:INT ASSOC ENGINEERS-IAENG  

    The authors previously proposed forward and backward one round (FBOR) method to accelerate the filtering process by realizing the discrete Hilbert transform (DHT) function using an IIR filter in the convolution backprojection (CB) method that is a typical reconstruction algorithm for the X-ray CT. The FBOR method cascades causal and anticausal allpass filters to realize the linear phase DHT, and implements them by parallel ladders of allpass filters. Unfortunately, this method has to adopt the DHT that has the brickwall transition at the zero frequency and thus, requires high sensitivity coefficients in order to reduce distortions of a reconstructed image. As a result, it needs to rely on double precision floating points to avoid cancellations of significant digits. In this paper, we propose a successive-scan one-round (SSOR) method of implementing the DHT by cascading primary lattice allpass filters that allows the use of single precision floating points. We confirm the effec-tiveness of our proposal through simulations.

    Web of Science

    researchmap

  • Modeling and Performance Evaluation of Colluding Attack in Volunteer Computing Systems

    Kan Watanabe, Nobuo Funabiki, Tom Nakanishi, Masaru Fukushi

    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTIST, IMECS 2012, VOL II   1658 - 1663   2012年

     詳細を見る

    記述言語:英語   出版者・発行元:INT ASSOC ENGINEERS-IAENG  

    This paper proposes a model of a colluding attack in Volunteer Computing (VC), where some of participants are unreliable and may return incorrect results. The colluding attack is one of the most important issues to realize reliable VC because it may ruin the most basic assumption, i.e. "the majority in voting is correct". Especially, check-by-voting archives the largest efficiency by sorting reliable participants based on whether their results are the majority or not. Thus, if some incorrect results become the majority by colluding attack, it may have significant impacts on check-by-voting. In this paper, we perform a Monte Carlo simulation of VC using the proposed colluding model and evaluate the sabotage-tolerance performance of voting methods. Simulation results show that check-by-voting works well if colluding attack happens.

    Web of Science

    researchmap

  • An improved Java programming learning system using test-driven development method

    Nobuo Funabiki, Yuuki Fukuyama, Yukiko Matsushima, Toru Nakanishi, Kan Watanabe

    The International MultiConference of Engineers and Computer Scientists 2012 (IMECS 2012)   587 - 602   2012年

     詳細を見る

  • A proposal of cooking model and cooking step scheduling algorithm for multiple dishes

    Yukiko Matsushima, Nobuo Funabiki, Toru Nakanishi

    The International MultiConference of Engineers and Computer Scientists 2011 (IMECS 2011)   127 - 131   2011年

     詳細を見る

  • An active access-point selection approach for dependable wireless mesh networks

    Nobuo Funabiki, Junki Shimizu, Masaharu Hata, Shigeru Tomisato, Toru Nakanishi, Kan Watanabe

    Journal of Interconnection Networks   12 ( 3 )   137 - 154   2011年

     詳細を見る

    記述言語:英語   出版者・発行元:World Scientific Publishing Co. Pte Ltd  

    As an inexpensive, flexible, and scalable Internet-access wireless network, we have studied the architecture, protocols, and design optimizations of the Wireless Internet-access Mesh NETwork (WIMNET) that adopts multiple access-points (APs) connected through wireless links. WIMNET can improve the dependability to failures of APs and/or their links by allocating APs redundantly in the network field. Because redundant APs may increase the operational cost and degrade the throughput due to increasing radio interferences, only the necessary APs for connectivity between the hosts and the Internet gateway should be activated in communications. In this paper, we first define the active AP selection problem of selecting the minimum number of active APs, and prove the NP-completeness of its decision version through reduction from the known minimum set cover problem. Then, we propose an active AP selection algorithm of deactivating APs one by one until no more AP can be deactivated. Due to the limited transmission capacity in WIMNET, we further present an algorithm extension for throughput maximization. We verify the effectiveness of our proposal through simulations in three instances, where the number of active APs is reduced by more than 40% and the throughput is improved by more than 10% from the original in any instance. © 2011 World Scientific Publishing Company.

    DOI: 10.1142/S0219265911002915

    Scopus

    researchmap

  • An implementation of fixed backoff-time switching method on IEEE 802.11 MAC protocol for wireless Internet-access mesh network

    Nobuo Funabiki, Sritrusta Sukaridhoto, Zhe Wang, Toru Nakanishi, Kan Watanabe, Shigeto Tajima

    The 2011 International Workshop on Smart Info-Media System in Asia (SISA 2011)   67 - 72   2011年

     詳細を見る

  • A proposal of an active access-point selection algorithm in wireless mesh networks

    Nobuo Funabiki, Junki Shimizu, Toru Nakanishi, Kan Watanabe

    Proceedings - 2011 International Conference on Network-Based Information Systems, NBiS 2011   112 - 117   2011年

     詳細を見る

    記述言語:英語  

    The wireless Internet-access mesh network (WIMNET) has been studied to offer an inexpensive, scalable Internetaccess wireless network by adopting multiple access points (APs) connected by wireless links. WIMNET can improve the dependability to failures of links and/or APs by allocating APs redundantly in the network field. However, redundant APs may increase the operational cost and degrade the throughput due to increasing radio interferences. One solution to this problem is to activate only the necessary APs to provide the connectivity to the hosts while maximizing the throughput. In this paper, we first define this active AP selection problem of selecting the activated APs for communications, and propose its heuristic algorithm. The simulation results in three instances confirm the effectiveness of the proposed algorithm, and indicate the existence of an active AP selection that maximizes the throughput. Then, we present the average hop count and the traffic bias as the indices to seek the active AP selection with the maximal throughput, and the extension of our active AP selection algorithm using them. © 2011 IEEE.

    DOI: 10.1109/NBiS.2011.26

    Scopus

    researchmap

  • A smart access-point selection algorithm for scalable wireless mesh networks

    Nobuo Funabiki, Sritrusta Sukaridhoto, Masaharu Hata, Shigeru Tomisato, Toru Nakanishi, Kan Watanabe, Shigeto Tajima

    IAENG International Journal of Computer Science   38 ( 3 )   260 - 267   2011年

     詳細を見る

  • Efficient Proofs of Attributes in Pairing-Based Anonymous Credential System

    Amang Sudarsono, Toru Nakanishi, Nobuo Funabiki

    PRIVACY ENHANCING TECHNOLOGIES   6794   246 - 263   2011年

     詳細を見る

    記述言語:英語   出版者・発行元:SPRINGER-VERLAG BERLIN  

    An anonymous credential system allows the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. One of the applications is the privacy-enhancing electronic ID (eID). A previously proposed anonymous credential system achieves constant complexity in the number of finite-set attributes of the user. However, the system is based on the RSA. In this paper, we show how to achieve the constant complexity in a pairing-based anonymous credential system excluding the RSA. The key idea of the construction is the use of a pairing-based accumulator. The accumulator outputs a constant-size value from a large set of input values. Using zero-knowledge proofs of pairing-based certificates and accumulators, we can prove AND and OR relations with constant complexity in the number of finite-set attributes.

    DOI: 10.1007/978-3-642-22263-4_14

    Web of Science

    researchmap

  • An extension of active access-point selection algorithm for throughput maximization in wireless mesh networks

    Nobuo Funabiki, Junki Shimizu, Toru Nakanishi, Kan Watanabe, Shigeru Tomisato

    Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011   367 - 372   2011年

     詳細を見る

    記述言語:英語  

    In order to offer an inexpensive, scalable Internetaccess wireless network, we have studied the architecture, protocols, and design optimizations of the wireless Internet-access mesh network (WIMNET) that adopts multiple access-points (APs) connected by wireless links. WIMNET can improve the dependability to failures of links and/or APs by allocating APs redundantly in the network field. Because redundant APs may increase the operational cost and degrade the throughput due to increasing radio interferences, only the necessary APs for the connectivity between the hosts and the Internet gateway should be activated in communications. Previously, we have defined the active AP selection problem of selecting the minimum number of active APs, and proposed its heuristic algorithm. However, the throughput should be maximized in WIMNET as a bandlimited wireless network, even if the number of active APs is slightly increased. In this paper, we propose the extension of the active AP selection algorithm for the throughput maximization using the average hop count. We confirm the effectiveness of our algorithm extension through simulations in three instances, where the throughput is improved by about 10% with 7-14 additional active APs on average. © 2011 IEEE.

    DOI: 10.1109/INCoS.2011.50

    Scopus

    researchmap

  • A throughput evaluation of wireless Internet-access mesh network using MIMO and adaptive array antenna

    Shigeto Tajima, Nobuo Funabiki, Shigeru Tomisato, Masaharu Hata, Teruo Higashino

    The 2011 International Workshop on Smart Info-Media System in Asia (SISA 2011)   79 - 84   2011年

     詳細を見る

  • Automatic generation of configuration manuals for open-source software

    Yukikazu Murakami, Erina Kagawa, Nobuo Funabiki

    Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2011   653 - 658   2011年

     詳細を見る

    記述言語:英語  

    The installation and initial configuration of an open-source software can be difficult for novice users because of a common lack of adequate manuals. To address this problem, we have proposed a method of automatically generating Web based installation manuals for open-source software by editing the log information recorded during the installation process by a skilled user. A lot of systems using open-source software require changes of configuration files. Actually, middleware systems such as application servers and database management systems, often exhibit the low performance under their default configuration files. Thus, the optimization of such systems by setting the optimal confirmation is essential for significant performance improvements. In this paper, we propose the extension of our previous method to the automatic generation of Web-based configuration manuals. We verify the effectiveness of our proposal through experiments. © 2011 IEEE.

    DOI: 10.1109/CISIS.2011.109

    Scopus

    researchmap

  • A proposal of fixed backoff-time switching method by link activation rate for wireless mesh networks

    Shigeto Tajima, Nobuo Funabiki, Teruo Higashino

    Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2011   647 - 652   2011年

     詳細を見る

    記述言語:英語  

    As an inexpensive and scalable access network to the Internet, we have extensively studied the Wireless Internet-access Mesh Network (WIMNET) that is composed of multiple access points (APs) connected through wireless links. Because most traffic in WIMNET passes through the gateway (GW) to the Internet, the links around the GW are much crowded so that they should be activated with higher priorities than others. In this paper, we propose the Fixed Back off-time Switching (CSMA-FBS) method for WIMNET using the CSMA/CA protocol to improve the performance by giving necessary activation chances to such links. Before starting communications, the target link activation rate and the active/passive back off-times for collision avoidance are calculated from the expected traffic load for each link. During communications, these back off-times are switched by comparing the actual link activation rate with the target one. By assigning different fixed values to these back off-times, the conflicts among the interfered links can be avoided. Through extensive simulations using two types of network topologies, we verify the effectiveness of our proposal. © 2011 IEEE.

    DOI: 10.1109/CISIS.2011.108

    Scopus

    researchmap

  • A proposal of a menu planning algorithm for two-phase cooking by busy persons

    Nobuo Funabiki, Shiho Taniguchi, Yukiko Matsushima, Toru Nakanishi

    Proceedings of the International Conference on Complex, Intelligent and Software Intensive Systems, CISIS 2011   668 - 673   2011年

     詳細を見る

    記述言語:英語  

    For busy persons such as working people, students, and nurturing parents, it is very hard to spend a long time in cooking foods by themselves at home after working for long hours on weekdays. As one solution, the cooking process can be divided into two phases, where the preparation steps for foods that they will eat on the following weekdays are performed on a weekend, and the final steps for some foods are finished on the eating day in a short time. Then, the task of generating a menu planning with this two-phase cooking becomes a complex problem to satisfy the limited cooking time. In this paper, we formulate this time-constrained menu planning problem with the two-phase cooking, and prove the NP-completeness of its decision problem through the reduction from the NP-complete knapsack problem. Then, we present its heuristic algorithm based on a simple greedy method for the knapsack problem, where foods are sequentially selected into the menu in descending order of food priorities. We apply the algorithm to the generation of one week menu plan from 53 food candidates, where the result verifies the effectiveness of our approach. © 2011 IEEE.

    DOI: 10.1109/CISIS.2011.112

    Scopus

    researchmap

  • A proposal of a traffic control method with consumed bandwidth estimation for real-time applications in wireless mesh networks

    Sritrusta Sukaridhoto, Nobuo Funabiki, Toru Nakanishi

    Proceedings of the International Symposium on Consumer Electronics, ISCE   143 - 148   2011年

     詳細を見る

    記述言語:英語  

    As a flexible and cost effective solution for a scalable Internet-access network, we have studied the Wireless Internet-access Mesh NETwork (WIMNET) that is composed of multiple access points (APs). WIMNET utilizes multi-hop communications between APs to provide access to the Internet through a gateway (GW) from associated hosts, which becomes increasingly vulnerable to problems of the available bandwidth degradation and the network latency. As a result, real-time applications such as Voice-over-IP (VoIP) and video conferences are hard in WIMNET. In this paper, we propose a traffic control method with consumed bandwidth estimation to afford real-time applications in WIMNET. After the consumed bandwidth by the requesting applications is estimated, the least priority application is repeatedly dropped at GW using the leaky bucket traffic shaping, until it does not exceed the available bandwidth in WIMNET. The effectiveness of our proposal is verified through simulations using the QualNet simulator. © 2011 IEEE.

    DOI: 10.1109/ISCE.2011.5973801

    Scopus

    researchmap

  • Minimal smart access-point selection for maximal throughput in wireless mesh networks

    Nobuo Funabiki, Tatsuya Takebayashi, Toru Nakanishi

    The International MultiConference of Engineers and Computer Scientists 2011 (IMECS 2011)   594 - 599   2011年

     詳細を見る

  • 無線メッシュネットワークでの動作アクセスポイント選択アルゴリズムの提案

    清水淳基, 舩曵信生, 中西透

    電子情報通信学会論文誌(B)   J94-B ( 2 )   264 - 273   2011年

     詳細を見る

  • A proposal of a web-based computer-scored test assistance system for university education

    Nobuo Funabiki, Hiroki Kawano, Toru Nakanishi, Kan Watanabe

    Proceedings of the International Symposium on Consumer Electronics, ISCE   580 - 585   2011年

     詳細を見る

    記述言語:英語  

    Frequent applications of short tests or quizzes during classes can be effective to enhance educational effects to students in universities. However, teachers may have to spend much time to prepare test materials before classes, and mark the test papers from students after them. In this paper, in order to reduce these loads of teachers, we propose a Web-based computer-scored test assistance system that consists of the five functions for problem generation &amp
    management, test generation &amp
    management, grading, subject generation &amp
    management, and learning profile management. By handling problems and tests separately where one test is composed of several problems, this system allows users to reuse existing problems and tests in various subjects by sharing them among teachers. Besides, by automatically generating test papers containing the randomly shuffled choices for each problem, it can prevent students from cheating by peeking at test papers of other students at neighbor seats. We implemented the system by extending our learning management system called NOBASU, and applied it to one class in our department, where the questionnaire result confirms the effectiveness of the system. © 2011 IEEE.

    DOI: 10.1109/ISCE.2011.5973897

    Scopus

    researchmap

  • An implementation of a pairing-based anonymous credential system with constant complexity

    Amang Sudarsono, Toru Nakanishi, Nobuo Funabiki

    The International MultiConference of Engineers and Computer Scientists 2011 (IMECS 2011)   630 - 635   2011年

     詳細を見る

  • Forward-Secure Group Signatures from Pairings

    Toru Nakanishi, Yuta Hira, Nobuo Funabiki

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E93A ( 11 )   2007 - 2016   2010年11月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    To reduce the damage of key exposures forward secure group signature schemes have been first proposed by Song In the forward secure schemes a secret key of a group member is updated by a one way function every interval and the previous secret key is erased Thus even if a secret key is exposed the signatures produced by the secret keys of previous Intervals remain secure Since the previous forward secure group signature schemes are based on the strong RSA assumption the signatures are longer than pairing based group signatures In addition the complexity of the key update or signing/verification is O(T) where T is the total number of Intervals In this paper a forward secure group signature scheme from pairings is proposed The complexity of our key update and signing/verification is O(log T)

    DOI: 10.1587/transfun.E93.A.2007

    Web of Science

    researchmap

  • Extensions of the Access Point Allocation Algorithm for Wireless Mesh Networks

    Walaa Hassan, Nobuo Funabiki, Toru Nakanishi

    IEICE TRANSACTIONS ON COMMUNICATIONS   E93B ( 6 )   1555 - 1565   2010年6月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Previously, we have proposed an access point (AP) allocation algorithm in indoor environments for the Wireless Internet-access Mesh NETWork (WIMNET) using one gateway (GW) to the Internet. WIMNET consists of multiple APs that are connected wirelessly mainly by the Wireless Distribution System (WDS), to expand the coverage area inexpensively and flexibly In this paper, we present two extensions of this algorithm to enhance the applicability to the large-scale WIMNET. One is the multiple GW extension of the algorithm to increase the communication bandwidth with multiple GWs, where all the rooms in the network field are first partitioned into a set of disjoint GW clusters and then, our previous allocation algorithm is applied to each GW cluster sequentially. The APs in a GW cluster share the same GW. The other is the dependability extension to assure the network function by maintaining the connectivity and the host coverage, even if one link/AP fault occurs, where redundant APs are added to the AP allocation by our previous algorithm. The effectiveness of our proposal in terms of the number of APs and the throughput is verified through simulations using the WIMNET simulator.

    DOI: 10.1587/transcom.E93.B.1555

    Web of Science

    researchmap

  • A WDS Clustering Algorithm for Wireless Mesh Networks

    Shigeto Tajima, Nobuo Funabiki, Teruo Higashino

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E93D ( 4 )   800 - 810   2010年4月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Wireless mesh networks have been extensively studied as expandable. flexible. and inexpensive access networks to the Internet This paper focuses on one composed of multiple access points (APs) connected through multihop wireless communications mainly by the wireless distribution system (WDS) For scalability, the proper partition of APs into multiple WDS clusters is essential, because the number of APs in one cluster is hinted due to the increasing radio interference and control packets In this paper, we formulate this WDS clustering problem and prove the NP-completeness of its decision version through reduction from a known NP-complete problem Then we propose its heuristic algorithm. using a greedy method and a variable depth search method. to satisfy the complex constraints while optimizing the cost function We verify the effectiveness of our algorithm through extensive simulations. where the results confirm as superiority to the existing algorithm in terms of throughput.

    DOI: 10.1587/transinf.E93.D.800

    Web of Science

    researchmap

  • Revocable Group Signature Schemes with Constant Costs for Signing and Verifying

    Toru Nakanishi, Hiroki Fujii, Yuta Hira, Nobuo Funabiki

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E93A ( 1 )   50 - 62   2010年1月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N) or O(R) complexity, where N is the group size and R is the number of revoked members. On the other hand, in Camenisch-Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, the updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where any update of secret key is not required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with O( root N)-size public key, where signing and verifying have constant extra costs.

    DOI: 10.1587/transfun.E93.A.50

    Web of Science

    researchmap

  • Anonymous IEEE802.1X authentication system using group signatures

    Amang Sudarsono, Toru Nakanishi, Yasuyuki Nogami, Nobuo Funabiki

    Journal of Information Processing Society Japan   51 ( 3 )   691 - 702   2010年

     詳細を見る

  • Software architecture and characteristic functions in learning management system "NOBASU"

    Nobuo Funabiki, Toru Nakanishi, Noriki Amano, Hiroki Kawano, Yuuki Fukuyama, Megumi Isogai

    Proceedings - 2010 10th Annual International Symposium on Applications and the Internet, SAINT 2010   109 - 112   2010年

     詳細を見る

    記述言語:英語  

    Recently, a learning management system (LMS) using the Web technology has been used at many educational institutions. To support educational activities in our department, we have independently developed an LMS called NOBASU (NetwOrk-Based Assistant System for University education) to improve the quality while reducing costs. Besides conventional functions in LMS, NOBASU has incorporated several original ones such as the keyword submission function for preparing and reviewing class contents. In this paper, we present two new characteristic functions for the Java programming education in NOBASU. The Java code test function verifies the specifications in source codes from students using the test-driven development (TDD) method. The Java test code submission function requests students to submit test codes so that they can generate detailed program specifications by themselves. © 2010 IEEE.

    DOI: 10.1109/SAINT.2010.24

    Scopus

    researchmap

  • A Proposal of a Smart Access Point Allocation Algorithm for Scalable Wireless Mesh Networks

    Kanako Uemura, Nobuo Funabiki, Toru Nakanishi

    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III   848 - 853   2010年

     詳細を見る

    記述言語:英語   出版者・発行元:INT ASSOC ENGINEERS-IAENG  

    As a flexible, inexpensive, and extensive Internet access network, we have studied WIMNET (Wireless Internet-access Mesh NETwork) composed of multiple access points (APs) as wireless mesh routers. WIMNET utilizes two types of APs to achieve the scalability with sufficient bandwidth while reducing costs. One is the expensive, programmable smart AP (SAP) that can use plural channels for wireless communications and has various functions for the Internet access. Another is the inexpensive, non-rogrammable conventional AP (CAP) that can use only one channel. To enhance the performance, the proper SAP allocation is critical, because the number of SAPs is much smaller than that of CAPs. In this paper, we present the definition of the SAP allocation problem, and its algorithm of extracting the optimum solution in terms of the newly defined cost function after finding the communication route configuration by applying our previous algorithms. We verify the effectiveness through simulations in three network topologies using the WIMNET simulator.

    Web of Science

    researchmap

  • Software Architecture and New Functions in Learning Management System "NOBASU"

    Nobuo Funabiki, Toru Nakanishi, Noriki Amano, Hiroki Kawano, Kanako Uemura

    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III   665 - 670   2010年

     詳細を見る

    記述言語:英語   出版者・発行元:INT ASSOC ENGINEERS-IAENG  

    Recently, the learning management systems (LMS) using the Web technology has been developed and used at a lot of educational institutions. We have continuously developed an original LMS called NOBASU (NetwOrk-Based Assistant System for University education) to support various educational activities in our department to improve the quality while reducing costs. In this paper, we describe the software architecture and the outline of distinguishing functions in NOBASU. In addition to conventional functions in LMS, NOBASU has incorporated several original ones such as the keyword submission function for preparing and reviewing classes, the lecture-scene playback function using the digital picture-card show, and the writing style check function for report submissions. We have implemented them in NOBASU and evaluated the effectiveness through applications to real classes in our department.

    Web of Science

    researchmap

  • An extension of the web-page layout optimization method for multimodal browsing sizes

    Nobuo Funabiki, Junki Shimizu, Megumi Isogai, Toru Nakanishi

    Proceedings - 13th International Conference on Network-Based Information Systems, NBiS 2010   139 - 146   2010年

     詳細を見る

    記述言語:英語  

    Recently, Web-page browsings at various terminals have become popular due to deployments of small mobile devices and large flat displays. To deal with this recent trend, we have proposed a Web-page layout optimization method for multimodal browsing sizes. It dynamically changes box locations and font sizes by switching CSS files for different browsing sizes, so that the main content can be accessed without the screen scroll operation even at a small size whereas the blank space is avoided at a large size. However, in this method, any box location must be specified by the absolute value in HTML/CSS files, which is not easy under a variety of browsing sizes. In this paper, we propose the extension of this method for flexible Web-page designs using the normal flow, the liquid layout, and the float property, where the browser automatically arranges the boxes. Using Ajax, the box location and the font size is switched to fit to the current browsing size by our method. The effectiveness of our proposal is verified through a usability test using sample Web-pages at small sizes. © 2010 IEEE.

    DOI: 10.1109/NBiS.2010.18

    Scopus

    researchmap

  • A Node Aggregation Approach for WDM Ring Networks

    Nobuo Funabiki, Toru Nakanishi, Megumi Isogai

    TENCON 2010: 2010 IEEE REGION 10 CONFERENCE   829 - 834   2010年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    For a high-speed metropolitan area network (MAN), a ring network based on the wavelength-division multiplexing (WDM) technology has been deployed to solve global information explosions in the Internet. To enhance the network performance, we have studied the node configuration problem, particularly for the one with the double-ring architecture where each node is equipped with fast-tunable transmitters and wavelength-fixed receivers (TT-FR) as fiber interfaces. In our studies, by adopting additional transmitters/receivers, nodes can afford far larger traffics than conventional ones. This fact indicates that plural nodes should be aggregated into one so that the transmitters/receivers can be utilized more efficiently. This paper presents a definition of the node aggregation problem for the WDM ring network and its simple greedy heuristic algorithm. The simulation results using the network simulator show the effectiveness of our approach.

    DOI: 10.1109/TENCON.2010.5686576

    Web of Science

    researchmap

  • A node configuration algorithm with bandwidth bottleneck resolution for WDM ring networks

    Megumi Isogai, Nobuo Funabiki, Toru Nakanishi, Yosuke Isshiki

    PHOTONIC NETWORK COMMUNICATIONS   18 ( 2 )   218 - 226   2009年10月

     詳細を見る

    記述言語:英語   出版者・発行元:SPRINGER  

    The wavelength-division multiplexing (WDM) technology has been extensively studied and actually deployed as a key technology to solve global information explosions by multiplexing plural signal paths using different wavelengths into one optical fiber. Among WDM-based network architectures, this article focuses on a double-ring one for a next-generation metropolitan area network (MAN), where each node is normally equipped with two pairs of fast-tunable transmitters and wavelength-fixed receivers (TT-FR) as interface to two fibers. To enhance the network performance, additional transmitters/receivers at nodes and receiver wavelengths should be assigned optimally, so that the bandwidth bottleneck can be resolved both on nodes and fiber links. This article formulates this node configuration problem with bandwidth bottleneck resolution as a combinatorial optimization problem, and proves the NP-completeness of its decision version. Then, it presents the two-phase heuristic algorithm composed of a greedy method and a variable depth search (VDS) method. Our algorithm is evaluated through extensive network simulations, where the results support the effectiveness of this joint assignment approach.

    DOI: 10.1007/s11107-009-0185-y

    Web of Science

    researchmap

  • An Access Point Allocation Algorithm for Indoor Environments in Wireless Mesh Networks

    Tamer Farag, Nobuo Funabiki, Toru Nakanishi

    IEICE TRANSACTIONS ON COMMUNICATIONS   E92B ( 3 )   784 - 793   2009年3月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    As a flexible, cost effective solution for a large-scale access network to the Internet, we have studied the design optimization of the Wireless Internet-access Mesh NETwork (WIMNET). WIMNET consists of multiple access points (APs) that have wireless links between them mainly on the wireless distribution system (WDS). In WIMNET, the links around the Internet gateway can be bottlenecks because every packet passes through it after multihop link activations. Besides, the link quality may be degraded by obstacles in indoor environments. Thus, the proper allocation of APs is essential in WIMNET, so that the communication quality should be ensured while the installation and management cost be minimized. In this paper, we formulate this AP allocation problem for indoor environments in WIMNET with the proof of the NP-completeness of its decision version. Then, we present its two-stage heuristic algorithm composed of the initial greedy allocation and the iterative improvement. The effectiveness of our proposal is verified through extensive simulations in three indoor environments.

    DOI: 10.1587/transcom.E92.B.784

    Web of Science

    researchmap

  • An implementation of writing style check function in learning management system “NOBASU”

    Hiroki Kawano, Nobuo Funabiki, Toru Nakanishi, Noriki Amano

    An implementation of writing style check function in learning management system “NOBASU”   227 - 228   2009年

     詳細を見る

  • A heuristic optimization algorithm for panoramic image generation problem from multiple cameras

    Megumi Isogai, Nobuo Funabiki, Toru Nakanishi

    The 2009 International Conference on Intelligent Computing (ICIC 2009)   297 - 306   2009年

  • An implementation of anonymous authentication system for Web services using proxies

    Toru Nakanishi, Hiroki Obayashi, Nobuo Funabiki

    The 13th IEEE International Symposium on Consumer Electronics (ISCE2009)   179 - 181   2009年

  • Revocable Group Signature Schemes with Constant Costs for Signing and Verifying

    Toru Nakanishi, Hiroki Fujii, Yuta Hira, Nobuo Funabiki

    PUBLIC KEY CRYPTOGRAPHY-PKC 2009, PROCEEDINGS   5443   463 - 480   2009年

     詳細を見る

    記述言語:英語   出版者・発行元:SPRINGER-VERLAG BERLIN  

    Lots of revocable group signature schemes have been proposed so far. In one type of revocable schemes, signing and/or verifying algorithms have O(N) or O(R) complexity, where N is the group size and It is the number of revoked members. On the other hand, in Camenisch-Lysyanskaya scheme and the followers, signing and verifying algorithms have O(1) complexity. However, before signing, updates of the secret key are required. The complexity is O(R) in the worst case. In this paper, we propose a revocable scheme with signing and verifying of O(1) complexity, where no updates of secret key are required. The compensation is the long public key of O(N). In addition, we extend it to the scheme with O(root N)-size public key, where signing and verifying have constant extra costs.

    DOI: 10.1007/978-3-642-00468-1_26

    Web of Science

    researchmap

  • A proposal of structured learning assistance function in lecture-Scene playback system using digital picture-card show

    Nobuo Funabiki, Aki Mouri, Kanako Uemura, Toru Nakanishi

    First International Workshop on Virtual Environment and Network-Oriented Applications (VENOA 2009)   983 - 988   2009年

     詳細を見る

  • 操作ログを用いたオープンソースソフトウエアのインストールマニュアル自動生成法の提案

    村上幸一, 舩曵信生, 徳永秀和, 重田和弘, 中西透

    情報処理学会論文誌   50 ( 3 )   926 - 939   2009年

     詳細を見る

  • A web-based installation manual management system for open source software

    Yukikazu Murakami, Nobuo Funabiki, Hidekazu Tokunaga, Kazuhiro Shigeta, Toru Nakanishi

    NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC   1261 - 1266   2009年

     詳細を見る

    記述言語:英語  

    Recently, Open Source Software (OSS) has become commonly used at many places. Unfortunately, although the use of OSS is often hard for novice users, many OSSes have few good manuals. To solve this problem, we have proposed a method of automatically generating a Web-based installation manual for an OSS by editing the log information recorded during the installation process by a skilled user. However, this method has another problem of requiring several manuals even for the same OSS, because installation commands may be different depending on the installation environment such as Linux distributions and versions. In addition, novice users sometimes make input mistakes during installation process that cannot be detected by themselves. In this paper, we propose a Web-based system to manage the created manuals so that users can easily use them. By incorporating the analogous manual search algorithm after investigating command changes under different environments, our system is able to show similar manuals if no existing manual matches to the search condition. Besides, we propose the installation guidance function to avoid mistakes by users. It monitors the input commands by a user, and displays the correct commands with the error message if a mistake is found. The experimental results in installing OSS packages by novice users confirm the effectiveness our proposal. © 2009 IEEE.

    DOI: 10.1109/NCM.2009.183

    Scopus

    researchmap

  • Forward-Secure Group Signatures from Pairings

    Toru Nakanishi, Yuta Hira, Nobuo Funabiki

    PAIRING-BASED CRYPTOGRAPHY - PAIRING 2009   5671   171 - 186   2009年

     詳細を見る

    記述言語:英語   出版者・発行元:SPRINGER-VERLAG BERLIN  

    To reduce the damage of key exposures, forward-secure group signature schemes have been first proposed by Song. In the forward-secure schemes, a secret key of a, group member is updated by a one-way function every interval and the previous secret key is erased. Thus, even if a secret key is exposed, the signatures produced by the secret keys of previous intervals remain secure. Since the previous forward-secure group signature schemes are based on the strong RSA assumption, the signatures are longer than pairing-based group signatures. In addition, the complexity of the key update or signing/verification is O(T), where T is the total number of intervals. In this paper, a forward-secure group signature scheme from pairings is proposed. The complexity of our key update and signing/verification is O(log T).

    DOI: 10.1007/978-3-642-03298-1_12

    Web of Science

    researchmap

  • A proposal of a Web-page layout optimization method for multimodal browsing sizes

    Nobuo Funabiki, Yosuke Isshiki, Megumi Isogai, Toru Nakanishi

    The 13th IEEE International Symposium on Consumer Electronics (ISCE2009)   894 - 898   2009年

  • A comparative study of open source softwares for virtualization with streaming server applications

    Sritrusta Sukaridhoto, Nobuo Funabiki, Toru Nakanishi, Dadet Pramadihanto

    The 13th IEEE International Symposium on Consumer Electronics (ISCE2009)   577 - 581   2009年

  • スケーラブル無線メッシュネットワークのための通信路構成最適化アルゴリズム

    上村香菜子, 舩曵信生, 中西透

    スケーラブル無線メッシュネットワークのための通信路構成最適化アルゴリズム   J92-B ( 9 )   1526 - 1537   2009年

     詳細を見る

  • A web-based lecture scene playback system using digital picture-card show with structured learning assistance function

    Aki Mouri, Nobuo Funabiki, Toru Nakanishi

    INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES   5 ( 4 )   372 - 389   2009年

     詳細を見る

    記述言語:英語   出版者・発行元:INDERSCIENCE ENTERPRISES LTD  

    Computer-aided slide presentations have become common at lectures in universities. To improve the educational quality, this paper presents it Web-based lecture scene playback system using the digital picture-card show with the structured learning, assistance function. Fine still images of lecture scenes are periodically taken by a digital camera, and the lecturer voice is recorded by a personal computer, which are edited to produce the digital picture-card show. The structured learning assistance function classifies the picture cards representing the slides containing each important concept into five structures, and generates their links. The system was applied to freshman courses in our department where questionnaire results confirmed the effectiveness.

    DOI: 10.1504/IJWGS.2009.030265

    Web of Science

    researchmap

  • A two-stage algorithm for access point allocation in indoor environments for wireless mesh networks

    Tamer Farag, Nobuo Funabiki, Toru Nakanishi, Kanako Uemura

    The 14th Asia-Pacific Conference on Communications (APCC2008)   2008年

     詳細を見る

  • A minimum-delay routing tree algorithm for access-point communications in wireless mesh networks

    Nobuo Funabiki, Kanako Uemura, Toru Nakanishi, Walaa Hassan

    RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies   2008   161 - 166   2008年

     詳細を見る

    記述言語:英語  

    As a scalable, flexible access network to the Internet, we have studied the design optimization and the implementation of the Wireless Internet-access Mesh NETwork (WIMNET). WIMNET is composed of multiple access points (APs) that are connected with each other by wireless communications. At least one AP performs as the gateway (GW) to the Internet. Any host in the network can access to the Internet through this GW, after associating its neighbor AP and communicating with multihop wireless links between APs. The delay along the routing path degrades the performance of WIMNET. To avoid the bottleneck of communications by minimizing the maximum delay, we formulate the routing tree problem for AP communications, and prove the NP-completeness of its decision version. Then, we propose the greedy heuristic algorithm of sequentially selecting one link that minimizes the delay of the predicted tree containing the link. The effectiveness of our algorithm is verified through extensive simulations in instances with 25 APs using the WIMNET simulator. ©2008 IEEE.

    DOI: 10.1109/RIVF.2008.4586349

    Scopus

    researchmap

  • A bandwidth bottleneck resolution approach to node configuration optimization in WDM ring networks

    Megumi Isogai, Nobuo Funabiki, Yosuke Isshiki, Toru Nakanishi

    2008 IEEE Sarnoff Sympoium   2008 ( S13.4 )   2008年

  • A dynamic channel assignment technique for wireless Internet-access mesh networks

    Walaa Hassan, Nobuo Funabiki, Toru Nakanishi

    The 14th Asia-Pacific Conference on Communications (APCC2008)   2008年

     詳細を見る

  • An implementation of anonymous IEEE802.1X authentication with user revocation

    Amang Sudarsono, Toru Nakanishi, Kouhei Miki, Nobuo Funabiki

    3rd Joint Workshop on Information Security (JWIS 2008)   240 - 245   2008年

     詳細を見る

  • A Proposal of an Installation Manual Generation Method for Open Source Software Using Operation Logs

    Yukikazu Murakami, Nobuo Funabiki, Hidekazu Tokunaga, Kazuhiro Shigeta, Toru Nakanishi

    SITIS 2008: 4TH INTERNATIONAL CONFERENCE ON SIGNAL IMAGE TECHNOLOGY AND INTERNET BASED SYSTEMS, PROCEEDINGS   547 - 554   2008年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE COMPUTER SOC  

    An Open Source Software (OSS) is the software whose source code has been public, usually through the Internet, so that everybody can use and modify it freely. A lot of companies, governments, and universities are now using OSS technologies because of the advantages they bring. However the use of an OSS is actually hard for its beginners, because many OSSes have few good manuals, where they have usually been developed by volunteers. Besides, the installation of an OSS package sometimes requires installations of multiple OSS packages to be integrated together In this paper we propose a method of automatically generating an installation manual of an OSS package, including the one requiring the integration of multiple OSS packages. Then, we implement the proposed method for evaluations. Our experimental results in installations of OSS packages including the one requiring the integration of four packages by generated manuals verify the effectiveness of our method.

    DOI: 10.1109/SITIS.2008.62

    Web of Science

    researchmap

  • A Lecture Scene Playback System using Digital Picture-Card Show for Distance Learning

    Nobuo Funabiki, Aki Mouri, Walaa Hassan, Toru Nakanishi

    2008 22ND INTERNATIONAL WORKSHOPS ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOLS 1-3   2008   1071 - 1076   2008年

     詳細を見る

    記述言語:英語   出版者・発行元:IEEE  

    Recently, computer-aided slide presentations have been commonly used at lectures in universities. To improve their educational quality, this paper presents an Web-based lecture scene playback system using the digital picture-card show for distance teaming. In this system, fine still images of lecture scenes containing the lecturer, the blackboard, and the screen, are periodically taken by an off-the-shell digital photo camera, and the lecturer voice is recorded into a digital file by a personal computer during a class. Then, the digital picture-card show to play back the lecture scenes is edited by selecting one image and the voice file interval corresponding to one lecture scene defined as the time span of teaching one slide page by the lecturer The picture-card show is delivered to students through the World-Wide Web system on demand. We have implemented and applied our System to one course for freshmen in our department. The system performance and the questionnaire results from students show that our system is very efficient and practical to improve understandings and motivations of students for study of this course.

    DOI: 10.1109/WAINA.2008.73

    Web of Science

    researchmap

  • Efficient revocable group signature schemes using primes

    Toru Nakanishi, Nobuo Funabiki

    IPSJ Journal   49 ( 9 )   2951 - 2962   2008年

     詳細を見る

  • A short verifier-local revocation group signature scheme with backward unlinkability

    Toru Nakanishi, Nobuo Funabiki

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E90A ( 9 )   1793 - 1802   2007年9月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Previously Verifier-Local Revocation (VLR) group signature schemes from bilinear maps were proposed. In VLR schemes, only verifiers are involved in the revocation of a member, while signers are not. Thus, the VLR schemes are suitable for mobile environments. Furthermore, the previously proposed schemes satisfy the important backward unlinkability. This means that even after a member is revoked, signatures produced by the member before the revocation remain anonymous. This property is needed in case of a voluntary leave of a member or in case of a key loss. However, in the previous schemes, signatures become long, due to the adopted assumption, which should be improved in order to apply the schemes to the mobile environments. In this paper an improved VLR scheme is proposed with the shorter group signatures. This is achieved by using a different assumption, DLDH assumption, and improving zero-knowledge proofs in the group signatures. The length of the proposed group signatures is reduced to about 53% of that of the previous ones.

    DOI: 10.1093/ietfec/e90-a.9.1793

    Web of Science

    researchmap

  • Verifier-local revocation group signature schemes with backward unlinkability from bilinear maps

    Torn Nakanishi, Nobuo Funabiki

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E90A ( 1 )   65 - 74   2007年1月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    An approach of membership revocation in group signatures is verifier-local revocation (VLR for short). In this approach, only verifiers are involved in the revocation mechanism, while signers have no involvement. Thus, since signers have no load, this approach is suitable for mobile environments. Although Boneh and Shacham recently proposed a VLR group signature scheme from bilinear maps, this scheme does not satisfy the backward unlikability. The backward unlinkability means that even after a member is revoked, signatures produced by the member before the revocation remain anonymous. In this paper, we propose VLR group signature schemes with the backward unlinkability from bilinear maps.

    DOI: 10.1093/ietfec/e90-a.1.65

    Web of Science

    researchmap

  • A WDS clustering algorithm for wireless mesh networks

    Shigeto Tajima, Teruo Higashino, Nobuo Funabiki, Toru Nakanishi

    Proc. of 2007 Fourth International Conference on Wireless and Optical Communication Networks (WOCN07)   2007年

  • 無線メッシュネットワークにおけるゲートウエイ用アクセスポイント選択問題

    田島滋人, 舩曵信生, 東野輝夫

    第3回アドホックネットワークワークショップ   2006年

     詳細を見る

  • 最大重みクリーク問題に対する局所探索法

    片山謙吾, 濱本明宏, 貞松政史, 成久洋之, 南原英生, 舩曵信生

    電子情報通信学会論文誌A   2006年

     詳細を見る

  • メモリカードのためのセキュアファイルシステムSASの提案と実装

    川島潤, 舩曵信生, 中西透, 竹内 順一, 石崎 雅幸, Andre Caldas de Souza

    情報処理学会論文誌   2006年

     詳細を見る

  • プライバシを保護した授業評価アンケートの実装

    谷川浩司, 中西透, 舩曵信生

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • VNCプロクシのネットワーク負荷分散性能の評価

    松本康平, 籠谷裕人, 甲本卓也, 舩曵信生

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • A proposal of Anonymous IEEE802.1X authentication protocol for wireless netwroks

    Nobuo Funabiki, Toru Nakanishi, Hideo Takahashi, Kouhei Miki, Jun Kawashima

    Proc. of Second Workshop on Secure Network Protocols   2006年

     詳細を見る

  • デジタル紙芝居システムのための配信経路生成アルゴリズムの提案

    毛利亜紀, 篠原陽介, 舩曵信生, 中西透

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • An optimal access-point allocation for wireless infrastrcuture mesh netwroks

    Nobuo Funabiki, Toru Nakanishi, Yohei Nomura, Tamer Farag, Shigeto Tajima, Teruo Higashino

    Proc. of 16th International Conference on Computer Theory and Applications   2006年

     詳細を見る

  • 無線メッシュネットワークのアクセスポイント間通信での優先度制御に関する一検討

    野村洋平, 新田友里子, 田島滋人, 舩曵信生, 中西透

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • 無線メッシュネットワークでの帯域測定実験とその考察

    加藤秀明, 野村洋平, 舩曵信生, 中西透

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • 所属無効化可能なグループ署名方式の素数情報を用いた高速化とその実装

    濱田直人, 中山卓也, 中西透, 舩曵信生

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • 画像の明るさと文字配置の考慮によるナンバープレート認識法の改良

    篠原陽介, 川島潤, 舩曵信生

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • 無線メッシュネットワークにおけるアクセスポイントのチャネル割当アルゴリズムの提案と配置アルゴリズムの評価

    野村洋平, 舩曵信生, 中西透

    第3回アドホックネットワークワークショップ   2006年

     詳細を見る

  • An internet gateway access-point selection problem for wireless infrastructure mesh networks

    Shigeto Tajima, Teruo Higashino, Nobuo Funabiki, Shoji Yoshida

    Proceedings - IEEE International Conference on Mobile Data Management   2006   2006年

     詳細を見る

    記述言語:英語  

    This paper presents a study of the gateway access-point selection problem for the wireless infrastructure mesh network (WIMNET). WIMNET is a wireless mesh network composed of multiple access-points (APs) that communicate mutually using radio transmissions, and all the traffics to/from the Internet go through the limited number of gateway APs. Thus, the selection of these gateway APs often determines the whole performance of WIMNET, because heavy congestions at gateway APs and their peripheries can drastically increase the delay and the link failure due to radio interferences. In this paper, we define a cost function to minimize the total traffic in WIMNET in order to reduce congestions and present a simple algorithm. Through simulations using the newly developed WIMNET simulator, we show the effectiveness of our approach. © 2006 IEEE.

    DOI: 10.1109/MDM.2006.36

    Scopus

    researchmap

  • Group signature schemes with membership revocation for large groups

    Toru Nakanishi, Nobuo Funabiki

    IEICE Transactions on Fundamentals   2006年

  • WDMリングネットワークのノード構成問題の一般化

    磯貝愛, 舩曵信生, 中西透

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • A LECCS model parameter optimization algorithm for EMC designs of IC/LSI systems

    Nobuo Funabiki, Yohei Nomura, Jun Kawashima, Yuichiro Minamisawa, Osami Wada

    Proc. of 17th International Zurich Symposium on Electromagnetic Compatibility   2006年

     詳細を見る

  • トポロジの多重化によりトラヒック分散を実現した階層型論理トポロジの構成法とそのルーティングアルゴリズム

    木谷友哉, 舩曵信生, 東野輝夫

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • WEBによる教育支援システム"NOBASU"での課題プログラム評価

    馬場章太, 長尾憲暁, 中西透, 舩曵信生

    情報処理学会研究報告   2006年

     詳細を見る

  • VNCにおける負荷分散と操作権限制御を目的としたプロクシの提案

    松本康平, 籠谷裕人, 甲本卓也, 舩曵信生

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • 複数ネットワークインターフェースを有するエンドホストでのサービス指向型ルーティングの実装

    東根俊, 川島潤, 舩曵信生, 中西透

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • 無線メッシュネットワークのためのWIMENTシミュレータの開発

    吉田翔志, 舩曵信生, 中西透

    第3回アドホックネットワークワークショップ   2006年

     詳細を見る

  • PeerCastをベースとしたマルチメディア配信システムPeerStreamの構築とその評価

    斎藤正隆, 磯貝愛, 甲本卓也, 舩曵信生

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • アプリケーションレベルマルチキャスト通信におけるマルチホーム化ホスト選択アルゴリズムの改良

    加藤秀明, 川島潤, 舩曵信生, 中西透

    電子情報通信学会技術研究報告   2006年

     詳細を見る

  • An optical-drop wavelength assignment algorithm for efficient wavelength reuse under heterogeneous traffic in WDM ring networks

    N Funabiki, J Kawashima, T Nakanishi, K Okayama, T Higashino

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E88A ( 5 )   1234 - 1240   2005年5月

     詳細を見る

    記述言語:英語   出版者・発行元:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    The wavelength-division multiplexing (WDM) technology has been popular in communication societies for providing very large communication bands by multiple lightpaths with different wavelengths on a single optical fiber. Particularly, a double-ring optical network architecture based on the packet-over-WDM technology such as the HORNET architecture, has been extensively studied as a next generation platform for metropolitan area networks (MANs). Each node in this architecture is equipped with a wavelength-fixed optical-drop and a fast tunable transmitter so that a lightpath can be established between any pair of nodes without wavelength conversions. In this paper, we formulate the optical-drop wavelength assignment problem (ODWAP) for efficient wavelength reuse under heterogeneous traffic in this network, and prove the NP-completeness of its decision problem. Then, we propose a simple heuristic algorithm for the basic case of ODWAP. Through extensive simulations, we demonstrate the effectiveness of our approach in reducing waiting times for packet transmissions when a small number of wavelengths are available to retain the network cost for MANs.

    DOI: 10.1093/ietfec/e88-a.5.1234

    Web of Science

    researchmap

  • マルチホップ WDM ネットワークにおけるトラヒック分散のための静的トポロジ構成法の改善

    木谷友哉, 舩曵信生, 東野輝夫

    電子情報通信学会技術研究報告, NS2005-76   2005年

     詳細を見る

  • WWWを用いた英語教員クラス編成支援システムECASOUの提案

    高橋紀行, 舩曵信生, 矢野正昭

    電子情報通信学会論文誌D-Ⅰ   2005年

     詳細を見る

  • Optical-drop wavelength assignment problem for wavelength reuse in WDM ring metropolitan area networks

    Nobuo Funabiki, Megumi Isogai, Toru Nakanishi, Teruo Higashino

    Proc. of The IEEE 19th International Conference on Advanced Information Networking and Applications (AINA-2005)   2005年

     詳細を見る

  • モバイルホストのユーザ情報を秘匿するアドレス配信プロトコルの提案

    高橋秀郎, 川島潤, 中西透, 舩曵信生

    情報処理学会研究報告, 2005-CSEC-28   2005年

     詳細を見る

  • メモリカードのためのセキュアファイルシステムSASの提案

    川島潤, 舩曵信生, 中西透, 竹内順一, 石崎雅幸, Andre Caldasde Souza

    電子情報通信学会技術研究報告, OIS2005-05   2005年

     詳細を見る

  • アプリケーションレベルマルチキャスト通信における伝送遅延モデルの一考察

    永田佳範, 川島潤, 舩曵信生, 中西透

    電子情報通信学会技術研究報告, NS2005-61   2005年

     詳細を見る

  • アプリケーションレベルマルチキャストにおけるマルチホーム化ホスト選択アルゴリズムの提案

    加藤秀明, 川島潤, 舩曵信生, 中西透

    電子情報通信学会技術研究報告, NS2005-62   2005年

     詳細を見る

  • WDMネットワークにおける階層型コーダルリングトポロジ構成法

    木谷友哉, 舩曵信生, 東野輝夫

    情報処理学会論文誌   2005年

     詳細を見る

  • WDMリングネットワークのノード構成問題

    磯貝愛, 舩曵信生, 中西透

    電子情報通信学会技術研究報告, NS2005-91   2005年

     詳細を見る

  • アプリケーションレベルマルチキャストにおける遠隔講義のための複数経路木生成法の提案

    東根俊, 川島潤, 舩曵信生, 中西透

    電子情報通信学会技術研究報告, NS2005-63   2005年

     詳細を見る

  • 無線LANのアクセスポイント配置アルゴリズムの改良

    野村洋平, 舩曵信生, 中西透

    電子情報通信学会技術研究報告, NS2005-73   2005年

     詳細を見る

  • 無線LANのWDSにおけるAP間通信へのリンクスケジューリングアルゴリズムの適用

    田島滋人, 舩曵信生, 東野輝夫

    電子情報通信学会技術研究報告, NS2005-74   2005年

     詳細を見る

  • アプリケーションレベルマルチキャスト経路木アルゴリズムCT+法の提案とマルチホーム環境の効果

    磯貝愛, 舩曵信生, 中西透

    電子情報通信学会論文誌D-Ⅰ   2005年

     詳細を見る

  • 仮想OSを用いたセキュアなプログラミング課題検証支援システム

    長尾憲暁, 舩曵信生, 中西透

    電子情報通信学会技術研究報告, ET2005-45   2005年

     詳細を見る

  • 階層型コーダルリングネットワークにおけるコンパクトルーティングアルゴリズム

    木谷友哉, 舩曵信生, 東野輝夫

    電子情報通信学会技術研究報告, NS2005-145   2005年

     詳細を見る

  • A proposal of a node configuration algorithm for WDM ring networks

    Megumi Isogai, Nobuo Funabiki, Toru Nakanishi, Teruo Higashino

    Proc. of International Conference on Optical Communications and Networks (ICOCN-2005)   2005年

     詳細を見る

  • Compact tree plus algorithms for application-level multicast communications in multihome networks

    Nobuo Funabiki, Megumi Isogai, Toru Nakanishi, Teruo Higashino

    Proc. of 2005 International Conference on Networks (ICON-2005)   2005年

  • A minimum dead space algorithm for wavelength reuse problems in WDM ring networks

    Nobuo Funabiki, Toru Nakanishi, Yoshitaka Toyota, Jun Kawashima, Teruo Higashino

    Proc. of International Conference on Optical Communications and Networks (ICOCN-2004)   2004年

     詳細を見る

  • 無線ネットワークのリンクスケジューリング問題に対するヒューリスティック解法の提案

    田島滋人, 舩曵信生, 東野輝夫

    情報処理学会論文誌, vol. 45, no. 2   2004年

     詳細を見る

  • P2PMM_router: a two-stage heuristic algorithm to peer-to-peer multicast routing problems in multihome networks

    Nobuo Funabiki, Jun Kawashima, Shoji Yoshida, Kiyohiko Okayama, Toru Nakanishi, Teruo Higashino

    IEICE Transactions on Fundamentals   2004年

     詳細を見る

  • A minimum dead space algorithm for generalized isochronous channel reuse problems in DQDB networks

    Nobuo Funabiki, Jun Kawashima, Kiyohiko Okayama, Toru Nakanishi, Teruo Higashino

    IEICE Transactions on Communications   2004年

     詳細を見る

  • A proposal of hierarchical chordal ring network topology for WDM networks

    Tomoya Kitani, Nobuo Funabiki, Teruo Higashino

    Proc. of 2004 International Conference on Networks (ICON-2004)   2004年

  • A proposal of a two-stage heuristic algorithm for peer-to-peer multicast routing problems in multihome networks

    Nobuo Funabiki, Jun Kawashima, Akihito Kubo, Kiyohiko Okayama, Teruo Higashino

    Proc. of The Fifth Metaheuristics International Conference (MIC-2003)   2003年

     詳細を見る

  • A two-stage hierarchical algorithm for wavelength assignment in WDM-based bidirectional manhattan street networks

    Tomiya Kitani, Masakazu Yonedu, Nobuo Funabiki, Toru Nakanishi, Kiyohiko Okayama, Teruo Higashino

    Proc. of 2003 International Conference on Networks (ICON-2003)   2003年

     詳細を見る

  • Deformable-Templateマッチング法による眼の輪郭線抽出に関する研究

    小田政志, 舩曵信生, 東野輝夫

    電子情報通信学会技術研究報告, PRMU2003-140   2003年

     詳細を見る

  • A proposal of a minimal-state processing search algorithm for link scheduling problems in packet radio networks

    Shigeto Tajima, Nobuo Funabiki, Teruo Higashino

    Proc. of 2003 International Symposium on Applications and the Internet (SAINT-2003)   2003年

  • 双方向マンハッタンストリートネットワークのノード配置問題に対する階層型近似アルゴリズムの提案

    米津正隆, 舩曵信生, 木谷友哉, 横平徳美, 中西透, 東野輝夫

    電子情報通信学会論文誌D-I   2003年

     詳細を見る

  • A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks

    Nobuo Funabiki, Teruo Higashino

    Proc. of 2003 International Conference on Advanced Information Networking and Applications (AINA-2003)   2003年

  • Deformable Templateマッチング法による唇輪郭抽出法の改良と歯科医療応用を目的とした評価

    横川勇仁, 小田政志, 舩曵信生, 東野輝夫, 森悦秀

    電子情報通信学会論文誌D-Ⅱ,vol. J86-D-Ⅱ, no.8   2003年

     詳細を見る

  • 双方向マンハッタンストリートネットワークのノード配置問題に対する階層型近似アルゴリズムの提案

    米津正隆, 舩曵信生, 横平徳美, 中西透, 田島滋人, 中田明夫, 東野輝夫

    電子情報通信学会技術研究報告, COMP2001-77   2002年

     詳細を見る

  • A quasi-solution state evolution algorithm for channel assignment problems in cellular networks

    Nobuo Funabiki, Toru Nakanishi, Tokumi Yokohira, Shigeto Tajima, Teruo Higashino

    IEICE Transactions on Fundamentals   2002年

     詳細を見る

  • Binary neural networks to N-queens problems and their VLSI implementations

    Nobuo Funabiki, Takakazu Kurokawa, Masaya Ohta

    Control and Cybernetics   2002年

     詳細を見る

  • ネットワークのリンクスケジューリングにおけるタイムスロット数下限値算出法の改善

    田島滋人, 舩曵信生, 東野輝夫

    マルチメディア,分散,協調とモバイルシンポジウム(DICOMO 2002)講演集   2002年

     詳細を見る

  • ユーザの移動情報を利用したモバイル・マルチキャストルーティング問題の一解法

    常村和史, 田島滋人, 中田明夫, 舩曵信生, 東野輝夫

    マルチメディア,分散,協調とモバイルシンポジウム(DICOMO 2002)講演集   2002年

     詳細を見る

  • Webバグに基づくファイルの不正開封検知システムの提案

    小林正憲, 舩曵信生, 中西透

    コンピュータセキュリティシンポジウム2002講演集   2002年

     詳細を見る

  • 通信プロトコルの試験系列生成問題に対するSATアルゴリズム適用法の提案

    森 亮憲, 大塚裕孝, 舩曵信生, 中田明夫, 東野輝夫

    電子情報通信学会論文誌D-I   2002年

     詳細を見る

  • 静的およびモバイル・マルチキャストルーティング問題に対する最適パス選択解法の提案

    藤井雅和, 舩曵信生, 横平徳美, 田島滋人, 常村和史, 東野輝夫

    電子情報通信学会論文誌A   2002年

     詳細を見る

  • A proposal of a quasi-solution state evolution algorithm for channel assignment problems

    Nobuo Funabiki, Tokumi Yokohira, Toru Nakanishi, Shigeto Tajima, Teruo Higashino

    Proc. of 16th international conference on information networking (ICOIN-16)   2002年

     詳細を見る

  • An optimal path selection algorithm for static and mobile multicast routing problems

    Shigeto Tajima, Masakazu Fujii, Nobuo Funabiki, Tokumi Yokohira, Kazufumi Tsunemura, Teruo Higashino

    Proc. of 16th international conference on information networking (ICOIN-16)   2002年

     詳細を見る

  • 通信プロトコルの試験系列生成問題へのSATアルゴリズム適用法の提案

    大塚裕孝, 中田明夫, 舩曵信生, 東野輝夫

    電子情報通信学会技術研究報告, COMP2001-75   2002年

     詳細を見る

  • Relaxation of coefficient sensitiveness to performance for neural networks using neuron filter through total coloring

    Yoichi Takenaka, Nobuo Funabiki, Teruo Higashino

    IEICE Transactions on Fundamentals   2001年

     詳細を見る

  • A global routing technique for Wave-Steered circuits

    Nobuo Funabiki, Amit Singh, Arindam Mukherjee, Malgorzata Marek-Sadowska

    Proc. of Euromicro Symposium on Digital Design (DSD’2001)   2001年

  • A minimal-state processing search algorithm for satisfiability problems

    Nobuo Funabiki, Tokumi Yokohira, Toru Nakanishi, Shigeto Tajima, Teruo Higashino

    Proc. of IEEE International Conference on Systems, Man, and Cybernetics   2001年

     詳細を見る

  • モバイル・マルチキャストルーティング問題に対する最適パス選択解法の提案

    常村和史, 田島滋人, 藤井雅和, 中田明夫, 横平徳美, 舩曵信生, 東野輝夫

    マルチメディア通信と分散処理ワークショップ講演集   2001年

     詳細を見る

  • Deformable-Templateマッチング法による唇輪郭抽出法の改良としきい値自動調整アルゴリズムの提案

    横川勇仁, 船曵信生, 東野輝夫, 森悦秀

    電子情報通信学会技術研究報告, MI2001-434   2001年

     詳細を見る

  • ネットワークのリンクスケジューリングへのグラフ彩色アプローチ

    田島滋人, 舩曵信生, 東野輝夫, 横平徳美, 中西透

    電子情報通信学会技術研究報告, COMP2001-71   2001年

     詳細を見る

  • 静的マルチキャストルーティング問題に対する最適パス選択解法の提案

    藤井雅和, 船曵信生, 中田明夫, 北道淳司, 東野輝夫

    電子情報通信学会技術研究報告, COMP2000-69   2001年

     詳細を見る

  • 無線通信網における信頼度制約通信経路割当問題に対するニューラルネットワーク併用二段階解法の提案

    馬場孝之, 船曵信生, 田島滋人

    電子情報通信学会論文誌A   2000年

     詳細を見る

  • A proposal of neuron filter: a constraint resolution scheme of neural networks for combinatorial optimization problems

    Yoichi Takenaka, Nobuo Funabiki, Teruo Higashino

    IEICE Transactions on Fundamentals   2000年

     詳細を見る

  • A three-stage heuristic combined neural-network algorithm for channel assignment in cellular mobile systems

    Nobuo Funabiki, Noriko Okutani, Seishi Nishikawa

    IEEE Transactions on Vehicular Technology   49 ( 2 )   397 - 403   2000年

     詳細を見る

    記述言語:英語  

    A three-stage algorithm of combining sequential heuristic methods into a parallel neural network is presented for the channel assignment problem in cellular mobile communication systems in this paper. The goal of this NP-complete problem is to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. The three-stage algorithm consists of: 1) the regular interval assignment stage
    2) the greedy assignment stage
    and 3) the neural-network assignment stage. In the first stage the calls in a cell determining the lower bound on the total number of channels are assigned channels at regular intervals. In the second stage the calls in a cell with the largest degree and its adjacent cells are assigned channels by a greedy heuristic method. In the third stage the calls in the remaining cells are assigned channels by a binary neural network. The performance is verified through solving well-known benchmark problems. Especially for Sivarajan's benchmark problems our three-stage algorithm first achieves the lower bound solutions in all of the 13 instances while the computation time is comparable with existing algorithms. © 2000 IEEE.

    DOI: 10.1109/25.832970

    Scopus

    researchmap

  • A three-stage heuristic combined neural network algorithm for channel assignment in cellular radio systems

    Nobuo Funabiki, Noriko Okutani, Seishi Nishikawa

    IEEE Transactions on Vehicular Technology   2000年

     詳細を見る

  • A three-stage heuristic combined neural-network algorithm for channel assignment in cellular mobile systems

    Nobuo Funabiki, Noriko Okutani, Seishi Nishikawa

    IEEE Transactions on Vehicular Technology   49 ( 2 )   397 - 403   2000年

     詳細を見る

    記述言語:英語  

    A three-stage algorithm of combining sequential heuristic methods into a parallel neural network is presented for the channel assignment problem in cellular mobile communication systems in this paper. The goal of this NP-complete problem is to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. The three-stage algorithm consists of: 1) the regular interval assignment stage
    2) the greedy assignment stage
    and 3) the neural-network assignment stage. In the first stage the calls in a cell determining the lower bound on the total number of channels are assigned channels at regular intervals. In the second stage the calls in a cell with the largest degree and its adjacent cells are assigned channels by a greedy heuristic method. In the third stage the calls in the remaining cells are assigned channels by a binary neural network. The performance is verified through solving well-known benchmark problems. Especially for Sivarajan's benchmark problems our three-stage algorithm first achieves the lower bound solutions in all of the 13 instances while the computation time is comparable with existing algorithms. © 2000 IEEE.

    DOI: 10.1109/25.832970

    Scopus

    researchmap

  • A greedy digital neural-network algorithm for subgraph isomorphism problems

    Nobuo Funabiki, Teruo Higashino

    Proc. of World Multiconference on Systemics, Cybernetics, and Informatics   2000年

     詳細を見る

  • A greedy-neural combined discrete optimization algorithm for triangle and Kn-subgraph partition problem

    Hirotaka Ohtsuka, Nobuo Funabiki, Teruo Higashino

    Proc. of World Multiconference on Systemics, Cybernetics, and Informatics   2000年

     詳細を見る

  • A proposal of a neuron filter algorithm with a thinning-out method for total coloring problems

    Yoichi Takenaka, Nobuo Funabiki

    Proc. of World Multiconference on Systemics, Cybernetics, and Informatics   2000年

     詳細を見る

  • FPGAの論理ブロックの端子割当問題の定式化と2段階離散最適化法の提案

    船曵信生, 池永勝芳, 江川晋爾, 東野輝夫

    電子情報通信学会論文誌A   2000年

     詳細を見る

  • 遺伝的プログラミングを用いた関数合成アルゴリズムの改良法の提案

    関岡哲也, 船曵信生, 東野輝夫

    電子情報通信学会論文誌D1   2000年

     詳細を見る

  • 静的マルチキャストルーティング問題に対する2段階解法の提案

    藤井雅和, 船曵信生, 東野輝夫

    第13回回路とシステム(軽井沢)ワークショップ講演集   2000年

     詳細を見る

  • A minimal-state processing search algorithm for graph coloring problems

    Nobuo Funabiki, Teruo Higashino

    IEICE Transactions on Fundamentals   2000年

     詳細を見る

  • A gradual neural network approach for FPGA segmented channel routing problems

    Nobuo Funabiki, Makiko Yoda, Junji Kitamichi, Seishi Nishikawa

    IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics   29 ( 4 )   481 - 489   1999年8月

     詳細を見る

    記述言語:英語  

    A novel neural network approach called gradual neural network (GNN) is presented for segmented channel routing in field programmable gate arrays (FPGA's). FPGA's contain predefined segmented channels for net routing, where adjacent segments in a track can be interconnected through programmable switches for longer segments. The goal of the FPGA segmented channel routing problem, known to be NP-complete, is to find a conflict-free net routing with the minimum routing cost. The GNN for the N-net-M-track problem consists of a neural network of N x M binary neurons and a gradual expansion scheme. The neural network satisfies the constraints of the problem, while the gradual expansion scheme seeks the cost minimization by gradually increasing activated neurons. The energy function and the motion equation are newly defined with heuristic methods. The performance is verified through solving 30 instances, where GNN finds better solutions than existing algorithms within a constant number of iteration steps. © 1999 IEEE.

    DOI: 10.1109/3477.775264

    Scopus

    researchmap

  • A gradual neural network approach for FPGA segmented channel routing problems

    Nobuo Funabiki, Makiko Yoda, Junji Kitamichi, Seishi Nishikawa

    IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics   29 ( 4 )   481 - 489   1999年8月

     詳細を見る

    記述言語:英語  

    A novel neural network approach called gradual neural network (GNN) is presented for segmented channel routing in field programmable gate arrays (FPGA's). FPGA's contain predefined segmented channels for net routing, where adjacent segments in a track can be interconnected through programmable switches for longer segments. The goal of the FPGA segmented channel routing problem, known to be NP-complete, is to find a conflict-free net routing with the minimum routing cost. The GNN for the N-net-M-track problem consists of a neural network of N x M binary neurons and a gradual expansion scheme. The neural network satisfies the constraints of the problem, while the gradual expansion scheme seeks the cost minimization by gradually increasing activated neurons. The energy function and the motion equation are newly defined with heuristic methods. The performance is verified through solving 30 instances, where GNN finds better solutions than existing algorithms within a constant number of iteration steps. © 1999 IEEE.

    DOI: 10.1109/3477.775264

    Scopus

    researchmap

  • A gradual neural network approach for FPGA segmented channel routing problems

    Nobuo Funabiki, Makiko Yoda, Junji Kitamichi, Seishi Nishikawa

    IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics   1999年

     詳細を見る

  • プレスブルガー文真偽判定アルゴリズムのためのBDDの応用とそれを用いた回路検証

    景山洋行, 北道淳司, 船曵信生

    情報処理学会論文誌   1999年

     詳細を見る

  • A two-stage discrete optimization method for largest common subgraph problems

    Nobuo Funabiki, Junji Kitamichi

    IEICE Transactions on Information and Systems   1999年

     詳細を見る

  • A proposal of a two-stage discrete optimization method for the maximum clique problem

    Nobuo Funabiki, Teruo Higashino

    Proc. of International Symposium on Nonlinear Theory and Its Applications   1999年

     詳細を見る

  • チャネル割当問題を対象とした拡張マキシマムニューラルネットワーク解法の提案

    池永勝芳, 船曵信生, 竹中要一

    電子情報通信学会論文誌A   1999年

     詳細を見る

  • 貪欲法とGAを併用したデータ転送路資源最適化問題解法の提案

    四方康人, 船曵信生, 北道淳司

    電子情報通信学会論文誌A   1999年

     詳細を見る

  • A non-feedback neuron filter algorithm for separated board-level routing problems in FPGA-based logic emulation systems

    Yoichi Takenaka, Nobuo Funabiki

    Proc. of IEEE International Joint Conference on Neural Networks   1999年

     詳細を見る

  • A gradual neural network approach for broadcast scheduling in packet radio networks

    Nobuo Funabiki, Yoichi Takenaka, Teruo Higashino

    Proc. of IEEE International Joint Conference on Neural Networks   1999年

     詳細を見る

  • Formal verification method for combinatorial circuits at high level design

    Junji Kitamichi, Hiroyuki Kageyama, Nobuo Funabiki

    Proc. of Asia and South Pacific Design Automation Conference   1999年

     詳細を見る

  • A gradual neural network approach for broadcast scheduling in packet radio networks

    Nobuo Funabiki, Junji Kitamichi

    IEICE Transactions on Fundamentals   1999年

     詳細を見る

  • A gradual neural-network algorithm for jointly time-slot/code assignment problems in packet radio networks

    Nobuo Funabiki, Junji Kitamichi

    IEEE Transactions on Neural Networks   9 ( 6 )   1523 - 1528   1998年

     詳細を見る

    記述言語:英語  

    A gradual neural network (GNN) algorithm is presented for the jointly time-slot/code assignment problem (JTCAP) in a packet radio network in this paper. The goal of this newly defined problem is to find a simultaneous assignment of a time-slot and a code to each communication link, whereas time-slots and codes have been independently assigned in existing algorithms. A time/code division multiple access protocol is adopted for conflict-free communications, where packets are transmitted in repetition of fixed-length time-slots with specific codes. GNN seeks the time-slot/code assignment with the minimum number of time-slots subject to two constraints: 1) the number of codes must not exceed its upper limit and 2) any couple of links within conflict distance must not be assigned to the same time-slot/code pair. The restricted problem for only one code is known to be NP-complete. The performance of GNN is verified through solving 3000 instances with 100-500 nodes and 100-1000 links. The comparison with the lower bound and a greedy algorithm shows the superiority of GNN in terms of the solution quality with the comparable computation time. © 1998 IEEE.

    DOI: 10.1109/72.728402

    Scopus

    researchmap

  • An evolutionary neural network approach for module orientation problems

    Nobuo Funabiki, Junji Kitamichi, Seishi Nishikawa

    IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics   28 ( 6 )   849 - 855   1998年

     詳細を見る

    記述言語:英語  

    A novel neural network approach called "Evolutionary Neural Network (ENN)" is presented for the module orientation problem. The goal of this NP-complete problem is to minimize the total wire length by flipping circuit modules with respect to their vertical and/or horizontal axes of symmetry. In order to achieve high quality VLSI systems, it is strongly desired to solve the problem as quickly as possible in the design cycle. Based on the concept of the genetic algorithm, the evolutionary initialization scheme on neuron states is introduced so as to provide a high quality solution within a very short time. The performance of ENN is compared with three heuristic algorithms through simulations on 20 examples with up to 500 modules. The results show that ENN can find the best solutions in the shortest time. © 1998 IEEE.

    DOI: 10.1109/3477.735394

    Scopus

    researchmap

  • An evolutionary neural network approach for module orientation problems

    Nobuo Funabiki, Junji Kitamichi, Seishi Nishikawa

    IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics   28 ( 6 )   849 - 855   1998年

     詳細を見る

    記述言語:英語  

    A novel neural network approach called "Evolutionary Neural Network (ENN)" is presented for the module orientation problem. The goal of this NP-complete problem is to minimize the total wire length by flipping circuit modules with respect to their vertical and/or horizontal axes of symmetry. In order to achieve high quality VLSI systems, it is strongly desired to solve the problem as quickly as possible in the design cycle. Based on the concept of the genetic algorithm, the evolutionary initialization scheme on neuron states is introduced so as to provide a high quality solution within a very short time. The performance of ENN is compared with three heuristic algorithms through simulations on 20 examples with up to 500 modules. The results show that ENN can find the best solutions in the shortest time. © 1998 IEEE.

    DOI: 10.1109/3477.735394

    Scopus

    researchmap

  • A gradual neural-network algorithm for jointly time-slot/code assignment problems in packet radio networks

    Nobuo Funabiki, Junji Kitamichi

    IEEE Transactions on Neural Networks   9 ( 6 )   1523 - 1528   1998年

     詳細を見る

    記述言語:英語  

    A gradual neural network (GNN) algorithm is presented for the jointly time-slot/code assignment problem (JTCAP) in a packet radio network in this paper. The goal of this newly defined problem is to find a simultaneous assignment of a time-slot and a code to each communication link, whereas time-slots and codes have been independently assigned in existing algorithms. A time/code division multiple access protocol is adopted for conflict-free communications, where packets are transmitted in repetition of fixed-length time-slots with specific codes. GNN seeks the time-slot/code assignment with the minimum number of time-slots subject to two constraints: 1) the number of codes must not exceed its upper limit and 2) any couple of links within conflict distance must not be assigned to the same time-slot/code pair. The restricted problem for only one code is known to be NP-complete. The performance of GNN is verified through solving 3000 instances with 100-500 nodes and 100-1000 links. The comparison with the lower bound and a greedy algorithm shows the superiority of GNN in terms of the solution quality with the comparable computation time. © 1998 IEEE.

    DOI: 10.1109/72.728402

    Scopus

    researchmap

  • A neural network approach for multilayer over-the-cell channel routing problems

    Nobuo Funabiki, Seishi Nishikawa

    Neurocomputing   16 ( 4 )   319 - 332   1997年9月

     詳細を見る

    記述言語:英語   出版者・発行元:Elsevier Sci B.V.  

    A new algorithm for multilayer over-the-cell channel routing problems using two neural networks is presented in this paper. In the multilayer over- the-cell channel routing problem, signal nets may be placed not only in the multilayer channel between two cells, but also on the multilayer routing area over the cells. The goal of our algorithm is to route all the given nets in both routing areas with the minimum number of tracks in the channel. Our algorithm consists of four steps: (1) extracting nets for the over-the-cell routing, (2) routing nets in the multilayer over-the-cell muting area by the neural network, (3) transforming nets for the channel routing and (4) routing nets in the multilayer channel by the neural network. The performance of our algorithm was verified through seven benchmark problems with 1-4 layers for the over-the-cell and 2-8 layers for the channel. The simulation results support the flexibility of our algorithm in the multilayer over-the-cell channel routing problem.

    DOI: 10.1016/S0925-2312(97)00039-8

    Scopus

    researchmap

  • A neural network approach for multilayer over-the-cell channel routing problems

    Nobuo Funabiki, Seishi Nishikawa

    Neurocomputing   16 ( 4 )   319 - 332   1997年9月

     詳細を見る

    記述言語:英語   出版者・発行元:Elsevier Sci B.V.  

    A new algorithm for multilayer over-the-cell channel routing problems using two neural networks is presented in this paper. In the multilayer over- the-cell channel routing problem, signal nets may be placed not only in the multilayer channel between two cells, but also on the multilayer routing area over the cells. The goal of our algorithm is to route all the given nets in both routing areas with the minimum number of tracks in the channel. Our algorithm consists of four steps: (1) extracting nets for the over-the-cell routing, (2) routing nets in the multilayer over-the-cell muting area by the neural network, (3) transforming nets for the channel routing and (4) routing nets in the multilayer channel by the neural network. The performance of our algorithm was verified through seven benchmark problems with 1-4 layers for the over-the-cell and 2-8 layers for the channel. The simulation results support the flexibility of our algorithm in the multilayer over-the-cell channel routing problem.

    DOI: 10.1016/S0925-2312(97)00039-8

    Scopus

    researchmap

  • A gradual neural-network approach for frequency assignment in satellite communication systems

    Nobuo Funabiki, Seishi Nishikawa

    IEEE Transactions on Neural Networks   8 ( 6 )   1359 - 1370   1997年

     詳細を見る

    記述言語:英語  

    A novel neural-network approach called gradual neural network (GNN) is presented for a class of combinatorial optimization problems of requiring the constraint satisfaction and the goal function optimization simultaneously. The frequency assignment problem in the satellite communication system is efficiently solved by GNN as the typical problem of this class in this paper. The goal of this NP-complete problem is to minimize the cochannel interference between satellite communication systems by rearranging the frequency assignment so that they can accommodate the increasing demands. The GNN consists of N × M binary neurons for the N-carrier-M-segment system with the gradual expansion scheme of activated neurons. The binary neural network achieves the constrain satisfaction with the help of heuristic methods, whereas the gradual expansion scheme seeks the cost optimization. The capability of GNN is demonstrated through solving 15 instances in practical size systems, where GNN can find far better solutions than the existing algorithm. © 1997 IEEE.

    DOI: 10.1109/72.641459

    Scopus

    researchmap

  • A gradual neural-network approach for frequency assignment in satellite communication systems

    Nobuo Funabiki, Seishi Nishikawa

    IEEE Transactions on Neural Networks   8 ( 6 )   1359 - 1370   1997年

     詳細を見る

    記述言語:英語  

    A novel neural-network approach called gradual neural network (GNN) is presented for a class of combinatorial optimization problems of requiring the constraint satisfaction and the goal function optimization simultaneously. The frequency assignment problem in the satellite communication system is efficiently solved by GNN as the typical problem of this class in this paper. The goal of this NP-complete problem is to minimize the cochannel interference between satellite communication systems by rearranging the frequency assignment so that they can accommodate the increasing demands. The GNN consists of N × M binary neurons for the N-carrier-M-segment system with the gradual expansion scheme of activated neurons. The binary neural network achieves the constrain satisfaction with the help of heuristic methods, whereas the gradual expansion scheme seeks the cost optimization. The capability of GNN is demonstrated through solving 15 instances in practical size systems, where GNN can find far better solutions than the existing algorithm. © 1997 IEEE.

    DOI: 10.1109/72.641459

    Scopus

    researchmap

  • A neural network model for multilayer topological via minimization in a switchbox

    Nobuo Funabiki, Seishi Nishikawa

    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems   15 ( 8 )   1012 - 1020   1996年

     詳細を見る

    記述言語:英語  

    This paper presents a new approach using a neural network model for the multilayer topological via minimization problem in a switchbox. Our algorithm consists of three steps: 1) dividing multiterminal nets into two-terminal nets, 2) finding a layer-assignment of the twoterminal nets by a neural network model so as to minimize the number of unassigned nets, and 3) embedding one via for each imassigned net by Marek-Sadowska's algorithm. The neural network model is composed of N x M processing elements to assign N two-terminal nets in an M -layer switchbox. The performante of our algorithm is verified by 15 benchmark problems where it can find optimum or near-optimum solutions. In the two-layer Burstein's switchbox, our algorithm finds a 15-via solution while the best known solution requires 20 vias. © 1996 IEEE.

    DOI: 10.1109/43.511580

    Scopus

    researchmap

  • A neural network model for multilayer topological via minimization in a switchbox

    Nobuo Funabiki, Seishi Nishikawa

    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems   15 ( 8 )   1012 - 1020   1996年

     詳細を見る

    記述言語:英語  

    This paper presents a new approach using a neural network model for the multilayer topological via minimization problem in a switchbox. Our algorithm consists of three steps: 1) dividing multiterminal nets into two-terminal nets, 2) finding a layer-assignment of the twoterminal nets by a neural network model so as to minimize the number of unassigned nets, and 3) embedding one via for each imassigned net by Marek-Sadowska's algorithm. The neural network model is composed of N x M processing elements to assign N two-terminal nets in an M -layer switchbox. The performante of our algorithm is verified by 15 benchmark problems where it can find optimum or near-optimum solutions. In the two-layer Burstein's switchbox, our algorithm finds a 15-via solution while the best known solution requires 20 vias. © 1996 IEEE.

    DOI: 10.1109/43.511580

    Scopus

    researchmap

  • A parallel algorithm for traffic control problems in three-stage connecting networks

    Nobuo Funabiki, Yoshiyasu Takefuji

    Journal of Parallel and Distributed Computing   20 ( 2 )   236 - 240   1994年

     詳細を見る

    記述言語:英語  

    A parallel heuristic algorithm for traffic control problems in three-stage connecting networks is presented in this paper. A three-stage connecting network consists of an input crossbar switching stage, an intermediate crossbar switching stage, and an output crossbar switching stage. The goal of our algorithm is to quickly and efficiently find a conflict-free switching assignment for communication demands through the network. The algorithm requires n2 × m processing elements for the network composed of n input/output switches and m intermediate switches, where it runs not only on a sequential machine, but also on a parallel machine with maximally n2 × m processors. The algorithm was verified by 1100 simulation runs with the network size from 102 × 7 to 502 × 27. The simulation results show that the algorithm can find a solution in nearly constant time with n2 × m processors. © 1994 Academic Press, Inc.

    DOI: 10.1006/jpdc.1994.1022

    Scopus

    researchmap

  • A Parallel Algorithm for Time-Slot Assignment Problems in TDM Hierarchical Switching Systems

    Nobuo Funabiki, Yoshiyasu Takefuji

    IEEE Transactions on Communications   42 ( 10 )   2890 - 2898   1994年

     詳細を見る

    記述言語:英語  

    This paper presents a parallel algorithm for timeslot assignment problems in TDM hierarchical switching systems, based on the neural network model. The TDM systems are operated. in repetitive frames composed of several Time-Slots. A Time-Slot represents a switching configuration where one packet is transmitted through an I/O line. The goal of our algorithm is to find conflict-free Time-Slot assignments for given switching demands. The algorithm runs on a maximum of n2×m processors for m-Time-Slot problems in n×n TDM systems. In small problems up to a 24×24 TDM system, the algorithm can find the optimum solution in a nearly constant time, when it is performed on n2×m processors. © 1994 IEEE

    DOI: 10.1109/26.328959

    Scopus

    researchmap

  • A parallel multi-layer channel router on the HVH model

    Nobuo Funabaki, Yoshiyasu Takefuji

    Parallel Computing   19 ( 1 )   63 - 77   1993年

     詳細を見る

    記述言語:英語  

    With the advancement of the silicon technology multi-layered VLSI circuits and PCBs (printed circuit boards) have been widely used. Based on the neural network model this paper presents the first parallel algorithm for multi-layer channel routing problems on the HVH model which minimize wiring areas in VLSI circuits and PCBs. The algorithm requires n × m × 2s processing elements for the n-net-m-track-3s-layer problem. The algorithm not only runs on a sequential machine but also on a parallel machine with maximally n × m × 2s processors. The algorithm is verified by solving seven benchmark problems where it finds better solutions than the existing algorithms for 6-12-layer problems in nearly constant time on a parallel machine. © 1993.

    DOI: 10.1016/0167-8191(93)90105-T

    Scopus

    researchmap

  • Comparisons of Seven Neural Network Models on Traffic Control Problems in Multistage Interconnection Networks

    Nobuo Funabiki, Yoshiyasu Takefuji, Kuo Chun Lee

    IEEE Transactions on Computers   42 ( 4 )   497 - 501   1993年

     詳細を見る

    記述言語:英語  

    This paper presents performance comparisons of seven neural network models on traffic control problems in multistage interconnection networks. The decay term, three neuron models, and two heuristics were evaluated. The goal of the traffic control problems is to find conflict-free switching configurations with the maximum throughput. Our simulation results show that the hysteresis McCulloch-Pitts neuron model without the decay term and with two heuristics has the best performance. © 1993 IEEE

    DOI: 10.1109/12.214695

    Scopus

    researchmap

  • Comparisons of Seven Neural Network Models on Traffic Control Problems in Multistage Interconnection Networks

    Nobuo Funabiki, Yoshiyasu Takefuji, Kuo Chun Lee

    IEEE Transactions on Computers   42 ( 4 )   497 - 501   1993年

     詳細を見る

    記述言語:英語  

    This paper presents performance comparisons of seven neural network models on traffic control problems in multistage interconnection networks. The decay term, three neuron models, and two heuristics were evaluated. The goal of the traffic control problems is to find conflict-free switching configurations with the maximum throughput. Our simulation results show that the hysteresis McCulloch-Pitts neuron model without the decay term and with two heuristics has the best performance. © 1993 IEEE

    DOI: 10.1109/12.214695

    Scopus

    researchmap

  • A Neural Network Approach to Topological Via-Minimization Problems

    Nobuo Funabiki, Yoshiyasu Takefuji

    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems   12 ( 6 )   770 - 779   1993年

     詳細を見る

    記述言語:英語  

    Toooloeical via-minimization (TVM) algorithms in two-layer channels based on the artificial neural network model are presented in this paper. TVM problems require not only assigning wires or nets between terminals without an intersection to one of two layers, but also a minimization of the number of vias, which are the single contacts of nets between two layers. The goal of our algorithms is to embed the maximum number of nets without an intersection. Two types of TVM problems are examined: split rectangular TVM (RTVM) problems and split circular TVM (CTVM) problems. Our algorithms require 3n processing elements for the n-net split RTVM problems, and 5n processing elements for the n-net split CTVM problems. The algorithms were verified by solving seven problems with 20 to 80 nets. The algorithms can be easily extended for more-than-two-layer problems. © 1993 IEEE

    DOI: 10.1109/43.229751

    Scopus

    researchmap

  • A Parallel Algorithm for Broadcast Scheduling Problems in Packet Radio Networks

    Nobuo Funabiki, Yoshiyasu Takefuji

    IEEE Transactions on Communications   41 ( 6 )   828 - 831   1993年

     詳細を見る

    記述言語:英語  

    A parallel algorithm based on an artificial neural network model for broadcast scheduling problems in packet radio networks is presented. The algorithm requires n x m processing elements for an n-node-MSlot radio network problem. The algorithm is verified by simulating 13 different networks. © 1993 IEEE.

    DOI: 10.1109/26.231903

    Scopus

    researchmap

  • A Parallel Improvement Algorithm for the Bipartite Subgraph Problem

    Kuo Chun Lee, Nobuo Funabiki, Yoshiyasu Takefuji

    IEEE Transactions on Neural Networks   3 ( 1 )   139 - 145   1992年

     詳細を見る

    記述言語:英語  

    Since McCulloch and Pitts proposed an artificial neuron model in 1943, several neuron models have been investigated. This paper proposes the first parallel improvement algorithm using the maximum neural network model for the bipartite subgraph problem. The goal of this NP-complete problem is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. A large number of instances have been simulated to verify the proposed algorithm, with the simulation result showing that our algorithm finds a solution within 200 iteration steps and the solution quality is superior to that of the best existing algorithm. The algorithm is extended for the k-partite subgraph problem, where no algorithm has been proposed. © 1992 IEEE

    DOI: 10.1109/72.105427

    Scopus

    researchmap

  • A Parallel Improvement Algorithm for the Bipartite Subgraph Problem

    Kuo Chun Lee, Nobuo Funabiki, Yoshiyasu Takefuji

    IEEE Transactions on Neural Networks   3 ( 1 )   139 - 145   1992年

     詳細を見る

    記述言語:英語  

    Since McCulloch and Pitts proposed an artificial neuron model in 1943, several neuron models have been investigated. This paper proposes the first parallel improvement algorithm using the maximum neural network model for the bipartite subgraph problem. The goal of this NP-complete problem is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. A large number of instances have been simulated to verify the proposed algorithm, with the simulation result showing that our algorithm finds a solution within 200 iteration steps and the solution quality is superior to that of the best existing algorithm. The algorithm is extended for the k-partite subgraph problem, where no algorithm has been proposed. © 1992 IEEE

    DOI: 10.1109/72.105427

    Scopus

    researchmap

  • A neural network model for finding a near-maximum clique

    Nubuo Funabiki, Yoshiyasu Takefuji, Kuo-Chun Lee

    Journal of Parallel and Distributed Computing   14 ( 3 )   340 - 344   1992年

     詳細を見る

    記述言語:英語  

    A parallel algorithm based on the neural network model for finding a near-maximum clique is presented in this paper. A maximum clique of a graph G is a maximum complete subgraph of G where any two vertices are adjacent. The problem of finding a maximum clique is NP-complete. The parallel algorithm requires n processing elements for an n-vertex graph problem. The algorithm is verified by solving 230 different graph problems. The simulation results show that our computation time on a Macintosh IIfx is shorter than that of two better known algorithms on a Cray 2 and an IBM 3090 while the solution quality is similar. The algorithm solves a near-maximum clique problem in nearly constant time on a parallel machine with n processors. © 1992.

    DOI: 10.1016/0743-7315(92)90072-U

    Scopus

    researchmap

  • A neural network model for finding a near-maximum clique

    Nubuo Funabiki, Yoshiyasu Takefuji, Kuo-Chun Lee

    Journal of Parallel and Distributed Computing   14 ( 3 )   340 - 344   1992年

     詳細を見る

    記述言語:英語  

    A parallel algorithm based on the neural network model for finding a near-maximum clique is presented in this paper. A maximum clique of a graph G is a maximum complete subgraph of G where any two vertices are adjacent. The problem of finding a maximum clique is NP-complete. The parallel algorithm requires n processing elements for an n-vertex graph problem. The algorithm is verified by solving 230 different graph problems. The simulation results show that our computation time on a Macintosh IIfx is shorter than that of two better known algorithms on a Cray 2 and an IBM 3090 while the solution quality is similar. The algorithm solves a near-maximum clique problem in nearly constant time on a parallel machine with n processors. © 1992.

    DOI: 10.1016/0743-7315(92)90072-U

    Scopus

    researchmap

  • A neural network parallel algorithm for clique vertex-partition problems

    Nobuo Funabiki, Yoshiyasu Takefuji, Kuo Chun Lee, Yong Beom Cho

    International Journal of Electronics   72 ( 3 )   357 - 372   1992年

     詳細を見る

    記述言語:英語  

    A parallel algorithm based on a neural network model for solving clique vertex-partition problems in arbitrary non-directed graphs is presented in this paper. A clique of a graph G = (V, E) with a set of vertices V and a set of edges E is a complete subgraph of G where any pair of vertices is connected with an edge. A clique vertex-partition problem of a graph G is to partition every vertex in V into a set of disjointed cliques of G. The clique vertex-partition problem with the minimum number of cliques in an arbitrary graph is known to be NP-complete. The algorithm requires nm processing elements for the n vertex m partition problem. A total of 10 different problems with 8 vertex to 300 vertex graphs were examined where the algorithm found a solution in nearly constant time. The circuit diagram of the neural network model is also proposed in this paper. © 1992 Taylor &amp
    Francis Ltd.

    DOI: 10.1080/00207219208925578

    Scopus

    researchmap

  • A neural network parallel algorithm for clique vertex-partition problems

    Nobuo Funabiki, Yoshiyasu Takefuji, Kuo Chun Lee, Yong Beom Cho

    International Journal of Electronics   72 ( 3 )   357 - 372   1992年

     詳細を見る

    記述言語:英語  

    A parallel algorithm based on a neural network model for solving clique vertex-partition problems in arbitrary non-directed graphs is presented in this paper. A clique of a graph G = (V, E) with a set of vertices V and a set of edges E is a complete subgraph of G where any pair of vertices is connected with an edge. A clique vertex-partition problem of a graph G is to partition every vertex in V into a set of disjointed cliques of G. The clique vertex-partition problem with the minimum number of cliques in an arbitrary graph is known to be NP-complete. The algorithm requires nm processing elements for the n vertex m partition problem. A total of 10 different problems with 8 vertex to 300 vertex graphs were examined where the algorithm found a solution in nearly constant time. The circuit diagram of the neural network model is also proposed in this paper. © 1992 Taylor &amp
    Francis Ltd.

    DOI: 10.1080/00207219208925578

    Scopus

    researchmap

  • A Neural Network Parallel Algorithm for Channel Assignment Problems in Cellular Radio Networks

    Nobuo Funabiki

    IEEE Transactions on Vehicular Technology   41 ( 4 )   430 - 437   1992年

     詳細を見る

    記述言語:英語  

    A parallel algorithm for channel assignment problems in cellular radio networks is presented in this paper. The channel assignment problem involves not only assigning channels or frequencies to each radio cell, but also satisfying frequency constraints given by a compatibility matrix. The proposed parallel algorithm is based on an artificial neural network composed of nm processing elements for an n-cell-m-frequency problem. The algorithm runs not only on a sequential machine but also on a parallel machine with up to a maximum of nm processors. The algorithm was tested by solving eight benchmark problems where the total number of frequencies varied from 100 to 533. The algorithm found the solutions in nearly constant time with nm processors. The simulation results showed that the algorithm found better solutions than the existing algorithm in one out of eight problems. © 1992 IEEE

    DOI: 10.1109/25.182594

    Scopus

    researchmap

  • A Parallel Algorithm for Channel Routing Problems

    Nobuo Funabiki, Nobuo Funabiki, Yoshiyasu Takefuji

    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems   11 ( 4 )   464 - 474   1992年

     詳細を見る

    記述言語:英語  

    A parallel algorithm for channel routing problems is presented in this paper. The channel routing problem is very important in the automatic layout design of VLSI circuits and printed circuit boards. The problem is to route the given interconnections between two rows of terminals on a multilayer channel where the channel area must be minimized. Although several algorithms have been proposed for two-layer problems, two-Iayer-and-over-the-cell problems, and three-layer problems, the current advancement of VLSI chip technology allows us to use four layers composed of two metal layers and two polysilicon layers for routing in a chip. The goal of the proposed parallel algorithm is to find the near-optimum routing solution for the given interconnections in a short time. The algorithm is applied for the four-layer channel routing problems where it requires n × m × 2 processing elements for the n-netm-track problem. The algorithm has three advantages over the conventional algorithms: 1) it can be easily modified for accommodating more than four-layer problems, 2) it runs not only on a sequential machine but also on a parallel machine with maximally n ×m × 2 processors, and 3) the program size is very small. The algorithm is verified by solving seven benchmark problems where the algorithm finds routing solutions in a nearly constant time with n × m × 2 processors. © 1992 IEEE

    DOI: 10.1109/43.125094

    Scopus

    researchmap

  • A Parallel Algorithm for Channel Routing Problems

    Nobuo Funabiki, Nobuo Funabiki, Yoshiyasu Takefuji

    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems   11 ( 4 )   464 - 474   1992年

     詳細を見る

    記述言語:英語  

    A parallel algorithm for channel routing problems is presented in this paper. The channel routing problem is very important in the automatic layout design of VLSI circuits and printed circuit boards. The problem is to route the given interconnections between two rows of terminals on a multilayer channel where the channel area must be minimized. Although several algorithms have been proposed for two-layer problems, two-Iayer-and-over-the-cell problems, and three-layer problems, the current advancement of VLSI chip technology allows us to use four layers composed of two metal layers and two polysilicon layers for routing in a chip. The goal of the proposed parallel algorithm is to find the near-optimum routing solution for the given interconnections in a short time. The algorithm is applied for the four-layer channel routing problems where it requires n × m × 2 processing elements for the n-netm-track problem. The algorithm has three advantages over the conventional algorithms: 1) it can be easily modified for accommodating more than four-layer problems, 2) it runs not only on a sequential machine but also on a parallel machine with maximally n ×m × 2 processors, and 3) the program size is very small. The algorithm is verified by solving seven benchmark problems where the algorithm finds routing solutions in a nearly constant time with n × m × 2 processors. © 1992 IEEE

    DOI: 10.1109/43.125094

    Scopus

    researchmap

▼全件表示

講演・口頭発表等

  • テストログを用いたテストコード生成支援ツールの戻り値のあるJavaメソッドへの拡張

    電子情報通信学会技術研究報告  2018年 

     詳細を見る

  • Javaプログラミング学習支援システムJPLASへのソースコード管理システムの導入

    電子情報通信学会技術研究報告  2018年 

     詳細を見る

  • Javaプログラミング学習支援システムのテストコード学習のためのコード修正問題の提案

    電子情報通信学会技術研究報告  2018年 

     詳細を見る

  • 無線LANの保有アクセスポイント割当問題のチャネル割当におけるチャネル間干渉の考慮

    電子情報通信学会技術研究報告  2017年 

     詳細を見る

  • A minimax approach for access-point setup optimization in IEEE 802.11n WLAN with MIMO links

    第19回IEEE広島支部学生シンポジウム  2017年 

     詳細を見る

  • A study of throughput estimation model and channel assignment algorithm for partially overlapping channels in IEEE 802.11n wireless local-area networks

    電子情報通信学会技術研究報告  2017年 

     詳細を見る

  • A study of throughput estimation model for IEEE802.11n MIMO link in wireless local-area network

    電子情報通信学会技術研究報告  2017年 

     詳細を見る

  • Javaプログラミング学習のための命名規則検査ツールの改良

    電子情報通信学会技術研究報告  2017年 

     詳細を見る

  • Javaプログラミング学習支援システムにおけるコードクローン除去問題の提案

    電子情報通信学会技術研究報告  2017年 

     詳細を見る

  • Javaプログラミング学習支援システムのコードクローン除去問題におけるメソッド生成課題の改善

    電子情報通信学会技術研究報告  2017年 

     詳細を見る

  • An informative test code approach for code writing problem in Java programming learning assistant system

    電子情報通信学会技術研究報告  2017年 

     詳細を見る

  • Element fill-in-blank problems in Java programming learning assistant system

    IEICE General Conference  2017年 

     詳細を見る

  • Raspberry Pi configuration for access-point and its throughput measurements in IEEE802.11n wireless networks

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • パラメータ最適化ツールの開発と無線LANのスループット推定モデルへの適用

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • 無線LANの保有アクセスポイント割当アルゴリズムのチャネル割当拡張

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • UPCシステムにおけるベンチマーク測定結果を用いたジョブスケジューリングの提案

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • A blank element selection algorithm extension for algorithm code reading by fill-in-blank problems in Java programming learning assistant system

    2016 IEEE Hiroshima Section Student Symposium (HISS2016)  2016年 

     詳細を見る

  • Preliminary evaluation of blank element selection algorithm extension for fill-in-blank problem in Java programming learning assistant system

    IEICE Society Conference  2016年 

     詳細を見る

  • Throughput measurements for access-point setup optimization in IEEE802.11n wireless networks

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • Javaプログラミング学習支援システムJPLASのテストコード自動生成ツールの提案

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • Javaプログラミング学習支援システムJPLASのコード作成問題のオフライン解答機能

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • Javaプログラミング学習支援システムJPLASの課題提示およびオフライン学習機能の実装

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • Javaプログラミング学習支援システムJPLASの空欄補充問題のキャラクタ付き解答インターフェースの提案

    2016 IEEE Hiroshima Section Student Symposium (HISS2016)  2016年 

     詳細を見る

  • Extensions of blank element selection algorithm for Java programming learning assistant system

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • Javaプログラミング学習支援システムJPLASのMVCモデルに沿ったコード記述ルールの提案とその再構築

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • 無線LANの保有アクセスポイント割当手法の一検討

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • Performance evaluations of elastic WLAN testbed

    IEICE General Conference  2016年 

     詳細を見る

  • Evaluations of access-point configuration algorithm under limited mobile router allocations

    IEICE General Conference  2016年 

     詳細を見る

  • Elastic WLAN system model and its implementation on Linux-PC

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • A study of value trace problems for graph theory algorithms in Java programming learning assistant system

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • Throughput measurements with various indoor AP placement conditions for IEEE802.11n wireless networks

    IEICE General Conference  2016年 

     詳細を見る

  • Performance evaluations of elastic WLAN testbed

    IEICE General Conference  2016年 

     詳細を見る

  • Evaluations of access-point configuration algorithm under limited mobile router allocations

    IEICE General Conference  2016年 

     詳細を見る

  • Throughput measurements with various indoor AP placement conditions for IEEE802.11n wireless networks

    IEICE General Conference  2016年 

     詳細を見る

  • Javaプログラミングにおけるリーダブルコード学習ツールの提案

    電子情報通信学会技術研究報告  2016年 

     詳細を見る

  • Drawbacks and countermeasures of element fill-in-blank problem in Java programming learning assistant system

    IEICE Communication Society Conference  2015年 

     詳細を見る

  • A value trace problem for Prim algorithm in graph theory in Java programming learning assistant system

    第17回IEEE広島支部学生シンポジウム(HISS)  2015年 

     詳細を見る

  • Javaプログラミング学習支援システムにおけるコードリーディング学習のためのコーディング規約検査ツールの調査

    第66回電気・情報関連学会中国支部連合大会  2015年 

     詳細を見る

  • Javaプログラミング学習支援システムにおけるエレメント空欄補充問題の演算子空欄化拡張

    第66回電気・情報関連学会中国支部連合大会  2015年 

     詳細を見る

  • ユーザPCコンピューティングシステムにおけるジョブスケジューリングのためのワーカPC性能のベンチマーク評価

    第17回IEEE広島支部学生シンポジウム(HISS)  2015年 

     詳細を見る

  • IEEE802.11ac のシングルユーザMIMO での複数ホスト通信時のスループット測定

    第17回IEEE広島支部学生シンポジウム(HISS)  2015年 

     詳細を見る

  • Measurement results of three indices for IEEE802.11n wireless networks in outdoor environments

    第17回IEEE広島支部学生シンポジウム(HISS)  2015年 

     詳細を見る

  • Evaluations of active access-point configuration algorithm with dynamic mobile router placement under various mobile router speeds and wall effects

    第17回IEEE広島支部学生シンポジウム(HISS)  2015年 

     詳細を見る

  • Eclipse上でのテストコードを用いたJavaプログラミング演習の実践

    第17回IEEE広島支部学生シンポジウム(HISS)  2015年 

     詳細を見る

  • 調理作業最適化のためのレシピ変換アルゴリズムの提案

    電子情報通信学会技術研究報告  2015年 

     詳細を見る

  • ユーザPCコンピューティングシステムのジョブスケジューリング法の実装と評価

    電子情報通信学会技術研究報告  2015年 

     詳細を見る

  • Javaプログラミング授業におけるエレメント空欄補充問題の実践

    情報処理学会研究報告  2015年 

     詳細を見る

  • Javaコードのクラス間連携理解のためのコアステートメント抽出アルゴリズム

    情報処理学会研究報告  2015年 

     詳細を見る

  • 学生用PCを用いたユーザPCコンピューティングシステムのWebインタフェース

    情報処理学会研究報告  2015年 

     詳細を見る

  • An active acess-point configuration algorithm for wireless local area networks with heterogeneous devices

    電子情報通信学会技術研究報告  2015年 

     詳細を見る

  • ユーザPCコンピューティングシステムにおけるワーカ機能のWindows実装と評価

    電子情報通信学会技術研究報告  2015年 

     詳細を見る

  • WIMNETシミュレータを用いたマルチユーザMIMOの通信性能評価

    電子情報通信学会技術研究報告  2015年 

     詳細を見る

  • 大規模無線メッシュネットワークのための動作アクセスポイント選択アルゴリズム

    電子情報通信学会技術研究報告  2015年 

     詳細を見る

  • A blank line selection algorithm for value trace problem in Java programming learning assistant system

    IEICE Communication Society Conference  2015年 

     詳細を見る

  • Throughput measurements in outdoor environment with different AP placement heights and orientations for IEEE802.11n wireless networks

    第17回IEEE広島支部学生シンポジウム(HISS)  2015年 

     詳細を見る

  • Javaプログラミング学習支援システムにおける空欄補充問題の難易度推定法

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Javaプログラミング学習のための空欄語選択アルゴリズムの提案

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • MU-MIMOのためのWIMNETシミュレータ拡張の一検討

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • A study of access-point allocation algorithm for scalable wireless mesh networks in indoor environments

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Java プログラミング学習支援システムのためのメトリクス計測によるコード可読性評価の検討

    第16回IEEE広島支部学生シンポジウム(HISS)  2014年 

     詳細を見る

  • ユーザPCコンピューティングシステムの開発と評価

    第65回電気・情報関連学会中国支部連合大会  2014年 

     詳細を見る

  • 2階層のPKIに対応した匿名属性認証方式の提案

    第65回電気・情報関連学会中国支部連合大会  2014年 

     詳細を見る

  • サーバに対して回答内容を秘匿したオンラインアンケートシステムにおける回答処理の実装

    第65回電気・情報関連学会中国支部連合大会  2014年 

     詳細を見る

  • 無線メッシュネットワークにおける現実的環境を考慮した動作アクセスポイント選択アルゴリズムの拡張

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • ユーザPCコンピューティングシステムの基本機能の実装と評価

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • マルチユーザMIMOにおけるアンテナ割当方式の一検討

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Javaプログラミング学習支援システムのコードの記述ルールの検討

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Javaプログラミング学習支援システムにおけるステートメント補充問題機能の実装,

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • An extension of access point allocation algorithm for wireless mesh networks with multiple gateways and maximum hop limitation

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Throughput evaluations using NS2 for access-point aggregation algorithm in IEEE802.11n wireless LANs

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • 無線メッシュネットワークの経路アルゴリズムのフレームアグリゲーション考慮のための拡張

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Javaプログラミング学習支援システムのための空欄補充問題生成アルゴリズムの拡張

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Throughput measurements in big room with different access point locations for IEEE 802.11ac wireless networks

    電子情報通信学会ソサイエティ大会  2014年 

     詳細を見る

  • An extension of access-point aggregation algorithm for host mobility

    電子情報通信学会ソサイエティ大会  2014年 

     詳細を見る

  • 作業時間変化に対する調理手順最適化アルゴリズムのロバスト性評価

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Efficient proofs for monotone formulas on attributes excluding restriction in anonymous credential system

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • 調理手順スケジューリングのためのWeb公開レシピー変換アルゴリズム

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • Javaプログラミング学習支援システムのコード作成問題におけるJavadocを用いたヒント機能

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • 無線メッシュネットワークの動作アクセスポイント選択アルゴリズムの現実的環境考慮のための拡張

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • File synchronization performance using BitTorrent Sync in IEEE802.11ac wireless networks

    IEICE Technical Report  2014年 

     詳細を見る

  • Throughput Measurements Using IEEE 802.11ac Devices for High-Speed Wireless Networks

    IEICE Technical Report  2014年 

     詳細を見る

  • フレームアグリゲーションのためのWIMNETシミュレータの拡張

    電子情報通信学会技術研究報告  2014年 

     詳細を見る

  • A design for OpenFlow implementation of fixed backoff-time switching method in wireless mesh networks

    電子情報通信学会2013 年総合大会  2013年 

     詳細を見る

  • Javaプログラミング学習のためのステートメント補充問題の生成機能

    第64回電気・情報関連学会中国支部連合大会  2013年 

     詳細を見る

  • 現実的環境下での大規模無線メッシュネットワークのための経路木アルゴリズムの提案

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • An extension of access-point allocation algorithm for adapting link speed change in wireless mesh network

    IEICE Technical Report  2013年 

     詳細を見る

  • 無線メッシュネットワークにおけるリンク速度を考慮したクラスタ分割アルゴリズム

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • オープンソースソフトウェア利用支援システムでのインストール検証機能の提案

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • A proposal of extended anonymous credential scheme with efficient proof on age

    電子情報通信学会2013 年総合大会  2013年 

     詳細を見る

  • 4種料理での調理手順最適化アルゴリズム適用評価

    電子情報通信学会2013 年総合大会  2013年 

     詳細を見る

  • 否定的な評価を考慮した強固な秘匿性を持つ評価システムのWeb実装

    第64回電気・情報関連学会中国支部連合大会  2013年 

     詳細を見る

  • 調理手順最適化のためのWeb公開レシピー変換アルゴリズムの提案

    第64回電気・情報関連学会中国支部連合大会  2013年 

     詳細を見る

  • Throughput measurements using IEEE 802.11n and 11ac devices for high-speed wireless networks

    第64回電気・情報関連学会中国支部連合大会  2013年 

     詳細を見る

  • 効率的に年齢の大小関係を証明可能な匿名属性認証方式の提案

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • グラフ理論を用いたJavaエレメント補充問題生成アルゴリズムの提案

    第64回電気・情報関連学会中国支部連合大会  2013年 

     詳細を見る

  • An extension of age range proof in anonymous credential system using monotone formula

    第64回電気・情報関連学会中国支部連合大会  2013年 

     詳細を見る

  • 手作り料理支援システムの調理ガイダンス機能のためのAndroidアプリケーション

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • Javaプログラミング学習支援システムの穴埋め問題機能の拡張とその評価

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • 無線メッシュネットワークでのリンク速度変化を考慮した経路木アルゴリズムの拡張

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • An extension of access-point aggregation algorithm considering link speed change for wireless local area networks

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • 無線メッシュネットワーク動作アクセスポイント選択アルゴリズムの拡張

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • レシート情報システムのためのデータベース設計と入力データ処理アルゴリズム

    電子情報通信学会技術研究報告  2013年 

     詳細を見る

  • Webによるレシート情報管理システムの提案

    電子情報通信学会2013 年総合大会  2013年 

     詳細を見る

  • An improved host association optimization stage in access-point aggregation algorithm for wireless local area networks

    電子情報通信学会2013 年総合大会  2013年 

     詳細を見る

  • An extension of wireless Internet-access mesh network simulator for smart antenna use and evaluations using simple topologies

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • ボランティアコンピューティングの妨害者対策における抜取検査併用の効果

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • Rubyを用いたグループ内行事支援システム開発のインターンシップ事例

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • オープンソース・ソフトウェア利用マニュアル管理システムの開発と大学院演習への適用

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • テスト駆動型開発手法を用いたJavaプログラミング学習システムでの誤りコード指示機能の実装

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • 否定的な評価を考慮した秘匿性を持つ評価システムの拡張

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • Webを用いたマークシート方式テスト支援機能の拡張

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • Javaプログラミング学習支援システムの穴埋め問題機能の拡張と授業への適用

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • Javaプログラミング学習支援システムでのコード設計学習機能の実装

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • A Linux implementation design of fixed backoff-time switching method for wireless mesh networks

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • 多種料理の調理手順最適化アルゴリズムの拡張

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • 無線メッシュネットワークにおけるWDSクラスタ分割アルゴリズムのスマートアンテナ拡張の一般化

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • CNF式に対する匿名属性認証システムのWeb実装

    電子情報通信学会技術研究報告  2012年 

     詳細を見る

  • 忙しい人のための買い物計画アルゴリズムの提案

    第14回IEEE広島支部学生シンポジウム(HISS)  2012年 

     詳細を見る

  • レシート情報入力システムにおける誤認識修正およびカテゴリ分類アルゴリズム

    第14回IEEE広島支部学生シンポジウム(HISS)  2012年 

     詳細を見る

  • Web サービスにおける匿名属性認証システムの実装

    コンピュータセキュリティシンポジウム2011  2011年 

     詳細を見る

  • A proposal of an access-point aggregation algorithm for wireless local area networks

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • 無線メッシュネットワークでの2個のスマートアンテナ使用アクセスポイントを有するWDSクラスタへの分割アルゴリズム

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • 管理者に対して強固な秘匿性を持つ評価システムの提案

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • 匿名属性認証における効率的な範囲証明プロトコルの提案

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • Parameter optimization of CSMA-FBS method for wireless mesh network

    第13回IEEE広島支部学生シンポジウム(HISS)  2011年 

     詳細を見る

  • 2段階調理を考慮した献立作成アルゴリズムのJava実装と機能拡張

    第13回IEEE広島支部学生シンポジウム(HISS)  2011年 

     詳細を見る

  • 無線メッシュネットワークのスループット最大化のための動作AP選択アルゴリズムの改良

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • テスト駆動型開発手法を用いたJavaプログラミング学習システムでのコード検証方法の改善

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • An implementation and evaluation of fixed backoff-time switching method on QualNet for wireless mesh networks

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • ゲートウエイにMIMOチャネルを用いた無線メッシュネットワークでのWDSクラスタ分割アルゴリズム

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • ボランティアコンピューティングにおける結託攻撃のモデル化と性能評価

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • Web サービスにおける不正ユーザを排除可能な匿名認証システムの実装

    コンピュータセキュリティシンポジウム2011  2011年 

     詳細を見る

  • WEBページレイアウト最適化手法を適用したオープンソースソフトウェア異種マニュアルの統合

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • CMSを用いたオープンソースソフトウェア利用マニュアル管理システムの提案

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • Javaプログラミングの予約語学習のためのオンライン穴埋め問題機能の実装

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • 忙しい人のためのWebを用いた手作り料理支援システムにおける献立作成・調理手順最適化機能の実装

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • Webを用いたマークシート方式テスト支援機能の実装

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • オープンソースソフトウェア・設定マニュアル自動生成システムの試作

    電子情報通信学会技術研究報告  2011年 

     詳細を見る

  • 無線メッシュネットワークのアクセスポイント間通信での優先度順リンク動作方式

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • テスト駆動型開発手法のJavaプログラミング教育応用におけるテストコード提出機能

    情報処理学会研究報告  2010年 

     詳細を見る

  • インターネットアクセス無線メッシュネットワークでの動作アクセスポイント選択アルゴリズムの提案

    電子情報通信学会インターネットアーキテクチャ研究会  2010年 

     詳細を見る

  • 多種料理の調理手順スケジューリングアルゴリズムの複数調理者への拡張

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • WDMリングネットワークのノード構成問題の展開

    情報処理学会研究報告  2010年 

     詳細を見る

  • Webによるオープンソースソフトウェア・設定マニュアルの自動生成法の提案

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • An implementation of a pairing-based anonymous credential system with constant complexity

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • ノード配置問題に対するアント最適化法

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • 無線メッシュネットワークにおけるリンク動作率による固定待機時間切り替え方式の提案

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • Webページレイアウト最適化法のオープンソースソフトウェア・インストールマニュアルへの適用

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • A proposal of a traffic control method with bandwidth usage estimation for real-time applications in wireless mesh networks

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • 無線メッシュネットワークのスループット最大化のための動作AP選択指標の検討

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • Efficient proofs of attributes in anonymous credential systems using a pairing-based accumulator

    コンピュータセキュリティシンポジウム(CSS2010)  2010年 

     詳細を見る

  • アキュムレータを用いた失効可能グループ署名方式の公開鍵サイズの低減

    コンピュータセキュリティシンポジウム(CSS2010)  2010年 

     詳細を見る

  • 組織間連携を考慮した匿名IEEE802.1X認証プロトコルの実装

    コンピュータセキュリティシンポジウム(CSS2010)  2010年 

     詳細を見る

  • プロキシを用いた匿名認証システムのユーザ登録機能及び追跡機能の実装

    コンピュータセキュリティシンポジウム(CSS2010)  2010年 

     詳細を見る

  • 調理手順最適化のための調理モデルの拡張と副調理者の役割変更の効果

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • メンバ間・グループ間双方の公平性を重視したグループ分けアルゴリズム

    第12回IEEE広島支部学生シンポジウム(HISS)  2010年 

     詳細を見る

  • 忙しい人の手作り料理支援のためのまとめ買い食材選択アルゴリズム

    第12回IEEE広島支部学生シンポジウム(HISS)  2010年 

     詳細を見る

  • スケーラブル無線メッシュネットワークの通信性能を極大とする最小スマートアクセスポイント配置

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • 忙しい人のためのまとめ調理を考慮した料理献立と食材購入タイミング選択アルゴリズム

    電子情報通信学会技術研究報告  2010年 

     詳細を見る

  • シーン対応分割によるマルチサーバビデオエンコードシステム

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • Webページレイアウト最適化法の通常フロー配置への拡張

    第11回IEEE広島支部学生シンポジウム(HISS)  2009年 

     詳細を見る

  • 忙しい人のための多種料理の調理順最適化アルゴリズム

    第11回IEEE広島支部学生シンポジウム(HISS)  2009年 

     詳細を見る

  • 藤井裕城, 中西透, 舩曵信生

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • 多種料理の調理順最適化アルゴリズムの提案

    情報処理学会研究報告  2009年 

     詳細を見る

  • Improvement of dependable access point allocation algorithm and introduction of route availability for wireless mesh networks

    IEICE Technical Report  2009年 

     詳細を見る

  • 教育支援システム"NOBASU"での文章作法オンラインチェック機能

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • 無線メッシュネットワークにおけるWDSクラスタ分割アルゴリズムの改善

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • テスト駆動型開発手法によるJavaプログラミング教育支援システムの提案

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • An implementation of a group signature scheme with efficient verifier-local revocation check

    IEICE Technical Report  2009年 

     詳細を見る

  • Dependability extensions of the access point allocation algorithm for wireless mesh networks

    IEICE Technical Report  2009年 

     詳細を見る

  • A generalized access point allocation algorithm for wireless mesh networks in indoor environments

    IEICE Technical Report  2009年 

     詳細を見る

  • オープンソースソフトウエアインストールマニュアル管理のためのWebデータベースシステム

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • スケーラブル無線メッシュネットワークのためのスマートアクセスポイント配置アルゴリズムの提案

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • プロキシを用いた匿名認証システムの改良と匿名掲示板への応用

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • 閲覧サイズに適応するWebページレイアウト最適化法でのアクセス性改善

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • 多様な閲覧サイズのためのWebページレイアウト最適化法の提案

    電子情報通信学会技術研究報告  2009年 

     詳細を見る

  • テスト駆動開発手法によるJavaプログラミング教育支援システムの実用性向上

    第11回IEEE広島支部学生シンポジウム(HISS)  2009年 

     詳細を見る

  • 教育支援システムNOBASUの支援機能の拡張

    電子情報通信学会技術研究報告  2008年 

     詳細を見る

  • Webサービスにおけるプロキシを用いた匿名認証システムの実装

    コンピュータセキュリティシンポジウム2008(CSS2008)  2008年 

     詳細を見る

  • 署名生成・検証時間が一定であるメンバ失効可能グループ署名方式の公開鍵サイズの低減

    電子情報通信学会技術研究報告  2008年 

     詳細を見る

  • ペアリングを用いた効率的なForward-Secureグループ署名方式の公開鍵サイズの低減

    電子情報通信学会技術研究報告  2008年 

     詳細を見る

  • 仮想マシンモニタ"Xen"を用いたスケーラブルなWebサーバシステムの提案

    電子情報通信学会技術研究報告  2008年 

     詳細を見る

  • 無線メッシュネットワークの実用性向上を目的としたスマートアクセスポイントの構築

    電子情報通信学会技術研究報告  2008年 

     詳細を見る

  • 教養科目履修の最適割当アルゴリズムの提案

    電子情報通信学会技術研究報告  2008年 

     詳細を見る

  • WDMリングネットワークのノード構成アルゴリズムのマルチリングへの拡張

    第10回IEEE広島支部学生シンポジウム(HISS)  2008年 

     詳細を見る

  • オープンソース利用初心者を対象としたインストール操作支援システムの提案

    第10回IEEE広島支部学生シンポジウム(HISS)  2008年 

     詳細を見る

  • 複数オープンソース間連携を要するインストールマニュアルの自動生成法

    情報処理学会グループウェアとネットワークサービス研究会  2008年 

     詳細を見る

  • Webによる学習管理システム向け4階層アーキテクチャの提案とNOBASUへの実装

    情報処理学会グループウェアとネットワークサービス研究会  2008年 

     詳細を見る

  • 二階層無線メッシュネットワークへの経路木アルゴリズムの拡張

    電子情報通信学会ネットワークシステム研究会  2008年 

     詳細を見る

  • 構造化学習のための講義シーンの分類・関連付け手法の提案

    情報処理学会コンピュータと教育研究会  2008年 

     詳細を見る

  • 無線メッシュネットワークでの最大遅延の最小化を目的とした経路木生成アルゴリズムの提案

    電子情報通信学会技術研究報告  2007年 

     詳細を見る

  • uClinux環境下でのOSレベル仮想化の実現

    情報処理学会研究報告  2007年 

     詳細を見る

  • 無線メッシュネットワークでのコンテンションウインドウサイズ操作時のスループット測定結果

    電子情報通信学会技術研究報告  2007年 

     詳細を見る

  • プライバシ保護を目的としたグループ署名に基づくSSL/TLSプロトコルの実装

    電子情報通信学会技術研究報告  2007年 

     詳細を見る

  • モバイルホストの負荷を軽減した失効機能をもつ匿名IEEE802.1X認証の実装

    情報処理学会研究報告  2007年 

     詳細を見る

  • A heuristic algorithm for access point allocation in indoor environments for wireless mesh networks

    IEICE Technical Report  2007年 

     詳細を見る

  • デジタル紙芝居システムによる講義シーン再生システムの提案

    電子情報通信学会技術研究報告, ET2007-16  2007年 

     詳細を見る

  • リモートI/O機器のための組込みLinux

    電子情報通信学会技術研究報告, NS2007-28  2007年 

     詳細を見る

  • PeerCastにおける経路の動的変更機能の実装

    電子情報通信学会技術研究報告, NS2007-19  2007年 

     詳細を見る

  • 無線メッシュネットワークのWDSクラスタ分割問題

    電子情報通信学会技術研究報告, NS2006-220  2007年 

     詳細を見る

  • WDMリングネットワークのノード構成アルゴリズムの改良

    電子情報通信学会技術研究報告  2007年 

     詳細を見る

  • 署名者の負担を軽減した失効方式をもつペアリングを用いたグループ署名方式の実装

    電子情報通信学会技術研究報告, ISEC2007-83  2007年 

     詳細を見る

  • WEBベースの教育支援システム"NOBASU"の拡張と評価

    電子情報通信学会技術研究報告, ET2007-38  2007年 

     詳細を見る

  • ログファイルを用いたオープンソースソフトウエアのインストールマニュアル自動生成法の提案

    電子情報通信学会技術研究報告, ET2007-33  2007年 

     詳細を見る

  • 不正回答を防止できる授業評価アンケートシステムの実装

    コンピュータセキュリティシンポジウム  2007年 

     詳細を見る

  • WEBによる教育活動支援システムNOBASUの開発と運用

    平成18年度工業・工学教育研究講演会  2006年 

     詳細を見る

  • デジタル紙芝居配信システムに関する研究

    電気・情報関連学会中国支部第57回連合大会  2006年 

     詳細を見る

  • アプリケーションレベルマルチキャスト通信経路木の視覚的評価のためのMINET_Viewerの開発

    第7回IEEE広島支部学生シンポジウム(HISS)  2005年 

     詳細を見る

  • アドホックネットワークへの中継アンテナ導入によるホスト間通信経路の確保

    電子情報通信学会NS  2004年 

     詳細を見る

  • 大規模グループにおいて所属無効化が可能なグループ署名方式

    電子情報通信学会ISEC  2004年 

     詳細を見る

  • 講義・演習を対象としたWEBベースの教育支援システムの検討

    電子情報通信学会ET  2004年 

     詳細を見る

  • 集計時の負荷を軽減した重み付き電子投票プロトコル

    電子情報通信学会ISEC  2004年 

     詳細を見る

  • 最適化手法によるパノラマ画像合成法の提案

    電子情報通信学会SIS  2004年 

     詳細を見る

  • IC/LSI電源系EMCマクロモデルLECCSのためのパラメータ最適化アルゴリズムの提案

    電子情報通信学会EMCJ  2004年 

     詳細を見る

  • A minimum dead space algorithm for wavelength reuse problems in WDM ring networks

    International Conference on Optical Communications and Networks (ICOCN-2004)  2004年 

     詳細を見る

  • A proposal of hierarchical chordal ring network topology for WDM networks

    2004 International Conference on Networks (ICON-2004)  2004年 

     詳細を見る

  • WEBを用いた英語教員の授業割当支援システム

    電子情報通信学会ET  2004年 

     詳細を見る

  • マルチホームネットワーク環境下での完全k分木型ピアツーピアマルチキャスト経路木探索解法の提案

    電子情報通信学会NS  2004年 

     詳細を見る

  • 可変テンプレートマッチング法による歯の輪郭線抽出法の提案

    電子情報通信学会PRMU  2004年 

     詳細を見る

  • Deformable Template Matching法による歯の輪郭線抽出法の提案

    電気・情報関連学会中国支部第54回連合大会  2003年 

     詳細を見る

  • アドホックネットワークのための信頼度制約ルーティング問題とそのアルゴリズムの提案

    IEEE広島支部学生シンポジウム(HISS)  2003年 

     詳細を見る

  • グループ内での暗号ファイルの相互利用を可能とするファイル保護システムの提案

    電気・情報関連学会中国支部第54回連合大会  2003年 

     詳細を見る

  • 静的マルチキャストルーティング問題に対する最適パス選択解法の提案

    電子情報通信学会コンピュテーション研究会  2001年 

     詳細を見る

  • 静的マルチキャストルーティング問題に対する2段階解法の提案

    第13回回路とシステム(軽井沢)ワークショップ  2000年 

     詳細を見る

  • A proposal of a neuron filter algorithm with a thinning-out method for total coloring problems

    World Multiconference on Systemics, Cybernetics, and Informatics  2000年 

     詳細を見る

  • A greedy digital neural-network algorithm for subgraph isomorphism problems

    World Multiconference on Systemics, Cybernetics, and Informatics  2000年 

     詳細を見る

  • A greedy-neural combined discrete optimization algorithm for triangle and Kn-subgraph partition problem

    World Multiconference on Systemics, Cybernetics, and Informatics  2000年 

     詳細を見る

  • A non-feedback neuron filter algorithm for separated board-level routing problems in FPGA-based logic emulation systems

    IEEE International Joint Conference on Neural Networks  1999年 

     詳細を見る

  • A proposal of a two-stage discrete optimization method for the maximum clique problem

    International Symposium on Nonlinear Theory and Its Applications  1999年 

     詳細を見る

  • A gradual neural network approach for broadcast scheduling in packet radio networks

    IEEE International Joint Conference on Neural Networks  1999年 

     詳細を見る

▼全件表示

Works(作品等)

  • 岡山大学・知恵の見本市

    2015年

     詳細を見る

受賞

  • Best Paper Award of International Conference on Education and Information Technology 2016 (ICEIT2016)

    2016年  

     詳細を見る

  • Certificate of Merit for The 2015 IAENG International Conference on Software Engineering

    2015年  

     詳細を見る

  • Best Paper Award of 4th International Congress on Advanced Applied Informatics (AAI 2015)

    2015年  

     詳細を見る

    受賞国:日本国

    researchmap

  • Competitive Paper Award of The 3rd International Conference on Applied and Theoretical Information Systems Research (ATISR2013)

    2013年  

     詳細を見る

  • Best Paper Award of International Conference on Education and Information Technology 2012 (WICEIT 2012)

    2012年  

     詳細を見る

  • Best Paper Award of The 14th International Conference on Network-Based Information Systems (NBiS 2011)

    2011年  

     詳細を見る

  • Best Paper Award of The 2011 IAENG International Conference on Communication Systems and Applications (ICCSA 2011)

    2011年  

     詳細を見る

  • DICOMO2004優秀論文賞

    2004年  

     詳細を見る

    受賞国:日本国

    researchmap

▼全件表示

 

担当授業科目

  • グラフ理論 (2021年度) 第4学期  - 月7,月8,木3,木4

  • システムセキュリティ最適化論 (2021年度) 前期  - 月5,月6

  • 分散アルゴリズム論 (2021年度) 前期  - その他

  • 分散システム構成学演習 (2021年度) 通年  - その他

  • 実践的キャリア形成演習 (2021年度) 通年  - その他

  • 情報セキュリティ (2021年度) 3・4学期  - 金5,金6,金7,金8

  • 情報セキュリテイ特論 (2021年度) 後期  - 金4,金5,金6,金7,金8

  • 情報化社会と技術 (2021年度) 1・2学期  - その他

  • 情報通信プロフェッショナル概論 (2021年度) 前期  - その他

  • 電子情報システム工学特別研究 (2021年度) 通年  - その他

  • 電気通信系概論 (2021年度) 特別  - その他

  • 電気通信系概論 (2021年度) 特別  - その他

  • ICT活用ビジネスマインド論 (2021年度) 前期  - その他

  • グラフ理論 (2020年度) 第4学期  - 月7,月8,木3,木4

  • システムセキュリティ最適化論 (2020年度) 前期  - 月5,月6

  • 分散アルゴリズム論 (2020年度) 前期  - その他

  • 分散システム構成学演習 (2020年度) 前期

  • 分散システム構成学演習 (2020年度) 通年  - その他

  • 分散システム構成学演習 (2020年度) その他  - その他

  • 実践的キャリア形成演習 (2020年度) 通年  - その他

  • 情報セキュリティ (2020年度) 3・4学期  - 金5,金6,金7,金8

  • 情報セキュリテイ特論 (2020年度) 後期  - 金

  • 情報処理入門2(情報機器の操作を含む) (2020年度) 第2学期  - 木1,木2

  • 情報化社会と技術 (2020年度) 1・2学期  - その他

  • 情報通信プロフェッショナル概論 (2020年度) 前期  - その他

  • 電子情報システム工学特別研究 (2020年度) 通年  - その他

  • 電気通信系概論 (2020年度) 夏季集中  - その他

  • 電気通信系概論 (2020年度) 夏季集中  - その他

  • ICT活用ビジネスマインド論 (2020年度) 前期  - その他

▼全件表示