研究者詳細 - 舩曵　信生

MISC - 舩曵　信生

分割表示 573 件中 81 - 100 件目／全件表示 >>

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月

A Study of Throughput Estimation Model and Channel Assignment Algorithm for Partially Overlapping Channels in IEEE 802.11n Wireless Local-Area Networks (ネットワークシステム)

イスマエル・ムネネクエンガ, 舩曵信生, セリム・アル・マムンムハマド, ソウ・ルインキョウ, クマル・デブナシュモン

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117 ( 303 ) 23 - 28 2017年11月

A Study of Throughput Estimation Model for IEEE 802.11n MIMO Link in Wireless Local-Area Network (ネットワークシステム) 査読

クマル・デブナシュモン, 舩曵信生, ソウ・ルインキョウ, セリム・アル・マムンムハマド

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117 ( 303 ) 17 - 22 2017年11月

誤り訂正符号を用いたDCT-OFDM型電子透かし方式の耐性向上に関する考察

重本章吾, 栗林稔, 舩曵信生

電子情報通信学会技術研究報告 117 ( 282(EMM2017 55-65) ) 47 - 52 2017年11月

電子透かし方式の安全性を高めるための難読化処理に関する考察

山下晃一郎, 栗林稔, 舩曵信生

電子情報通信学会技術研究報告 117 ( 282(EMM2017 55-65) ) 53 - 58 2017年11月

Javaプログラミング学習支援システムのコードクローン除去問題におけるメソッド生成課題の改善 (ディペンダブルコンピューティング)

石原信也, 舩曵信生, 栗林稔

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117 ( 249 ) 25 - 30 2017年10月

An Informative Test Code Approach for Code Writing Problem in Java Programming Learning Assistant System (ソフトウェアサイエンス)

キンゾウキン, 舩曵信生

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117 ( 248 ) 31 - 36 2017年10月

An Informative Test Code Approach for Code Writing Problem in Java Programming Learning Assistant System (ディペンダブルコンピューティング)

キンゾウキン, 舩曵信生

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117 ( 249 ) 31 - 36 2017年10月

A software architecture for Java programming learning assistant system

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

International Journal of Computer & Software Engineering 2 ( 1 ) 116 - 116 2017年7月

記述言語：英語出版者・発行元：Graphy Publications

For advancements of Java programming educations, we have developed a Web-based Java Programming Learning System (JPLAS). JPLAS provides four problems with different levels, namely, element fill-inblank problem, value trace problem, statement fill-in-blank problem, and code writing problem, to cover students at different learning stages. Unfortunately, since JPLAS has been implemented by a number of 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 a software architecture for JPLAS to avoid redundancy. Based on the MVC model, our proposal uses Java for the model (M), HTML/CSS/JavaScript for the view (V), and JSP for the controller (C). Besides, adopting a design pattern, the marking functions of the four problems are implemented uniformly. For evaluations, after JPLAS is implemented with this architecture, the number of code files is compared with that of the previous implementation, and the number of additional files is examined for two new functions.

CiNii Article

researchmap

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

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

2017 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW 2017) 241 - 242 2017年7月

PDFファイルの内部構造を考慮した大容量電子透かし法

福島拓哉, 栗林稔, 舩曵信生

電子情報通信学会技術研究報告 117 ( 39(IT2017 1-15) ) 13 - 18 2017年5月

組織内からの情報漏洩対策のための電子指紋システムの提案

上田貴大, 栗林稔, 舩曵信生

電子情報通信学会技術研究報告 117 ( 39(IT2017 1-15) ) 19 - 24 2017年5月

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月

無線LANの保有アクセスポイント割当問題のチャネル割当における部分干渉チャネルの考慮 (ネットワークシステム)

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

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116 ( 484 ) 457 - 462 2017年3月

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

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, and Sho Fujita

Wireless Networks 1 - 13 2017年2月