Faculty Profiles - FUNABIKI Nobuo

MISC - FUNABIKI Nobuo

Division display 221 - 240 of about 573 ／ All the affair displays >>

D-9-7 A Proposal of Web-based Receipt Information Management System

na Ta, Funabiki Nobuo, Nakanishi Toru, Watanabe Kan

Proceedings of the IEICE General Conference 2013 ( 1 ) 105 - 105 2013.3

An Extension of Routing Tree Algorithm Considering Link Speed Change for Wireless Mesh Networks

MARUYAMA Wataru, FUNABIKI Nobuo, NAKANISHI Toru, WATANABE Kan

IEICE technical report 112 ( 392 ) 1 - 6 2013.1

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

As a flexible inexpensive Internet-access network, we have studied the Wireless Internet-access Mesh NETwork (WIMNET) that is composed of wirelessly interconnected Access-Points (APs). Previously, we proposed the routing tree algorithm to generate a routing path connecting the APs in WIMNET such that the performance can improved by reducing congestions at links around the Internet Gate Way (GW). For this algorithm, we assume that every link has the same constant speed to transmit data packets regardless of its distance However, when we adopt the new high-speed IEEE802. 11n protocol for wireless communications, our preliminary experiments found that the speed decreases drastically as the distance increases. In this paper, we extend the routing tree algorithm in order to consider the link speed change and generate the routing path to the hosts. We show the effectiveness of this extension through simulations in three instances.

An Extension of Active Access Point Selection Algorithm for Wireless Mesh Networks

FUJITA Sho, FUNABIKI Nobuo, NAKANISHI Tom, WATANABE Kan

IEICE technical report 112 ( 392 ) 19 - 24 2013.1

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

The wireless Internet-access mesh network (WIMNET) has been studied to realize an inexpensive, scalable Inter-net-access network by using multiple access points (APs) connected by wireless links. WIMNET can improve the dependability to failures of links and APs by allocating APs redundantly. Since redundant APs may cause the increase of the operational cost and the degradation of the throughput due to increasing radio interferences, we have proposed the active AP selection algorithm for selecting functioning APs for communications. In this algorithm, we assume that every link speed is constant for simplicity, although our preliminary expenments found that the link speed greatly is affected by the distance in the new high-speed IEEE802.11 n protocol that has recently become popular. In this paper, we extend the active AP selection algonthm in considering this link speed change. We verify the effectiveness of our proposal through simulations in four instances using the WIMNET simulator.

An Extension of Access-Point Aggregation Algorithm Considering Link Speed Change for Wireless Local Area Networks

ISLAM Md. EZHARUL, FUNABIKI Nobuo, NAKANISHI Toru, WATANABE Kan

IEICE technical report 112 ( 392 ) 7 - 12 2013.1

Language：English Publisher：The Institute of Electronics, Information and Communication Engineers

These days, multiple wireless local area networks (WLANs) have been often deployed in the same building of a university or a company. In those WLANs, access points (APs) are usually managed independently by different groups such as laboratories or departments. Then, a host can detect signals from multiple APs, which may degrade the communication performance due to their interferences and increase the operational cost Previously, we have proposed an AP aggregation algorithm to minimize the number of active APs in the field by aggregating them using the virtual AP technology. Recently, the IEEE802. 11n protocol has become popular as a high-speed communication protocol for WLANs However, our preliminary experiments using this protocol found that the link speed drastically decreases as its distance increases. In this paper, we extend our AP aggregation algorithm to considering this speed change so that any host can ensure the minimum speed with an AP while maximizing the overall throughput of the network. We verify the effectiveness of our extension through simulations in a network scenario using the WIMNET simulator.

Database Design and Input Data Processing Algorithm for Receipt Information System

Tana, FUNABIKI Nobuo, NAKANISHI Toru, WATANABE Kan

IEICE technical report. Life intelligence and office information systems 112 ( 379 ) 85 - 90 2013.1

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

Recently, due to the lasting economic depression, an economical life has been desired for many people. For their assistance, our group is developing a Web-based receipt information system to help keeping household accounts to grasp daily expenses, and sharing latest information of selling products at nearby shops to buy products as inexpensively as possible. In this paper, we present the database design for this system, and propose the input data processing algorithm composed of the functions for 1) product name corrections, 2) discount price corrections, and 3) category classifications, to solve problems in the character recognition software on receipts adopted in this system. Our preliminary experiments found that this software often falsely recognizes product names, cannot correct discount prices, and cannot automatically classify categories of products. We implemented the proposed algorithm as a Java application, and applied it to 113 products from 12 receipts where every product was correctly processed.

An Android Application of Cooking Guidance Function in Homemade Cooking Assistance System

OKADA Tomoya, MATSUSHIMA Yukiko, FUNABIKI Nobuo, NAKANISHI Toru, WATANABE Kan

IEICE technical report. Information and communication management 112 ( 378 ) 91 - 96 2013.1

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

In order to assist economical and healthy lives with homemade cooking, our group has developed a Web-based HOmemade Cooking Assistance System (HOCAS) Previously, we have implemented the menu planning function and the cooking-step scheduling function at the server, so that busy persons such as working people, students, and nurturing families can make menus and cooking-step schedules for one week including bulk cooking in weekends. In this paper, we implement the cooking guidance function as an Android application of cooking guidance. Using outputs of the existing functions, it provides the three functions for the menu indication, the cooking guidance, and the cooking time measurement. For experimental evaluations, we cooked four dishes by following the guidance from the system, and confirmed its effectiveness. Through comparing cooking times between expected and measured ones, we analyzed its problems and discussed future works.

An Android Application of Cooking Guidance Function in Homemade Cooking Assistance System

OKADA Tomoya, MATSUSHIMA Yukiko, FUNABIKI Nobuo, NAKANISHI Toru, WATANABE Kan

IEICE technical report. Life intelligence and office information systems 112 ( 379 ) 91 - 96 2013.1

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

In order to assist economical and healthy lives with homemade cooking, our group has developed a Web-based HOmemade Cooking Assistance System (HOCAS) Previously, we have implemented the menu planning function and the cooking-step scheduling function at the server, so that busy persons such as working people, students, and nurturing families can make menus and cooking-step schedules for one week including bulk cooking in weekends. In this paper, we implement the cooking guidance function as an Android application of cooking guidance. Using outputs of the existing functions, it provides the three functions for the menu indication, the cooking guidance, and the cooking time measurement. For experimental evaluations, we cooked four dishes by following the guidance from the system, and confirmed its effectiveness. Through comparing cooking times between expected and measured ones, we analyzed its problems and discussed future works.

An Extension of Fill-in-the-blank Problem Function in Java Programming Learning Assistant System and Its Application to Classes

KORENAGA Yousuke, FUNABIKI Nobuo, NAKANISHI Toru, WATANABE Kan, AMANO Noriki

IEICE technical report. Education technology 112 ( 374 ) 63 - 68 2013.1

Language：Japanese Publisher：The Institute of Electronics, Information and Communication Engineers

Nowadays, a programming language Java has been educated in many universities and professional schools To assist its self-studies by students, we have developed a Web-based Java Programming Learning Assis-tant System (JPLAS) In this work, we extend the fill-in-the-blank problem functcon in JPLAS, so that this function can select variables and grammar symbols into problems in addition to conventional reserved words This function can automatically generate fill-in-the-blank problems by randomly blanking symbols in a sample Java code that correspond to the words specified by a teacher, where the constraints for unique answers are observed For evalu-ations of this function, we applied it to students in a Java programming course in our department after preparing 100 problems with various levels using JPLAS Then, we assigned them a quiz of the related problems to verify the learning effect The result shows that those who solved more problems in JPLAS could obtain better scores in the quiz

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

2013 FIRST INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR) 141 - 147 2013

Authorship：Lead author Language：English Publisher：IEEE

Recently, many organizations such as universities and companies are deploying multiple wireless local area networks (WLANs) even in the same building. In these WLANs, wireless access-points (APs) are usually managed independently by different groups such as laboratories or departments. In this overlapped WLAN environment, a host can detect signals from multiple APs, which may degrade the communication performance due to their interferences and increase the operational cost. To solve this problem, previously, we have proposed the AP aggregation algorithm to minimize the number of active APs in the field by aggregating them using the virtual AP technology. However, the minimization of active APs may excessively degrade the performance of WLANs, where more active APs can usually increase it. In this paper, we propose an extension of the AP aggregation algorithm to ensure the minimum average throughput for each host in the field. This average throughput is estimated using the cost function defined in the algorithm, and the number of active APs is increased when it does not reach the given threshold. We verify the effectiveness of this extension through extensive simulations in two network instances using the WIMNET simulator.

DOI： 10.1109/CANDAR.2013.27

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

2013 IEEE Region 10 Humanitarian Technology Conference, R10-HTC 2013 249 - 254 2013

Language：English

To assist busy people such as working persons, students, and nurturing families to have economical and healthy lives with homemade cooking, we have proposed a Web-based HOmemade Cooking Assistance System (HOCAS). Previously, we implemented the menu planning function and the cooking-step scheduling function at the server using JSP/Servlet, so that a user can plan a menu for the whole week and make a cooking-step schedule to efficiently cook multiple dishes at the same time. Unfortunately, a user needs to refer the next cooking-step on a paper during cooking process, which is actually not easy at critical timing in a kitchen, because the schedule is output as a PDF file. In this paper, we propose a cooking guidance function on an Android tablet as a Java application to navigate cooking-steps through touch panel operations. We confirmed the effectiveness by experimentally cooking four dishes using this function. © 2013 IEEE.

DOI： 10.1109/R10-HTC.2013.6669050

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

Nobuo Funabiki, Yousuke Korenaga, Toru Nakanishi, Kan Watanabe

2013 IEEE Region 10 Humanitarian Technology Conference, R10-HTC 2013 85 - 90 2013

Authorship：Lead author Language：English

Nowadays Java has been educated in many universities and professional schools as a reliable, portable, and practical programming language. To assist self-studies by students, we have developed a Web-based Java Programming Learning Assistant System (JPLAS). JPLAS has the two main functions of code writing problem and fill-in-the-blank problem to support studies at different levels. The former function intends that a student can write a whole code from scratch, where the submitted code is automatically tested on the server using the test-driven development (TDD) method. The latter function intends that a novice student can study Java reserved words, where a problem is generated by randomly removing the specified ones from a selected sample code and the removed one becomes the correct answer to each blank. In this paper, we extend this latter function for removing more general elements including variables and control symbols in problems. We analyze the conditions for selecting blanked elements with unique correct answers. For evaluations, we generated 100 problems with various levels using the extended function, and assigned them to students in the Java programming course in our department. Then, we gave a short test and a questionnaire with nine questions, where we found that students solving more problems achieved better scores in general, and their opinions support the effectiveness of our proposal. © 2013 IEEE.

DOI： 10.1109/R10-HTC.2013.6669019

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

Authorship：Lead author Language：English Publisher：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

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

Authorship：Lead author Language：English Publisher：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

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

Language：English

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

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

Language：English

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

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

Authorship：Lead author Language：English

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

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

Authorship：Lead author Language：English

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

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

　 PREV - NEXT 　

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29