Yasushi Inoguchi

Japan Advanced Institute of Science and Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

M. M. Hafizur Rahman

King Faisal University

Yukinori Sato

Toyohashi University of Technology

Yukio Iwaya

Shinshu University

Takao Tsuchiya

Doshisha University

Faiz Al Faisal

Green University of Bangladesh

Makoto Otani

Saga University

Susumu Horiguchi

Tohoku University

Yiyu Tan

Iwate University

Wei Sun

Kunming University of Science and Technology

Yasuyuki Miura

Shonan Institute of Technology

Cooperative Institutions

Japan Advanced Institute of Science and Technology

Tohoku University

International Islamic University Malaysia

Jikei University School of Medicine

Tokyo University of Science

The University of Tokyo

Kanazawa University

Khulna University of Engineering and Technology

ORCID

RIKEN Center for Computational Science

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Probabilistic Strategies Based on Staged LSH for Speedup of Audio Fingerprint Searching with Ten Million Scale Database

Masahiro Fukuda Yasushi Inoguchi

We are developing and improving algorithms to identify audio fingerprints (AFP) in a network router. Staged Locality Sensitive Hashing (LSH) is one of them and nearly as fast as 1Gbps of prevalent network routers. In this paper, we propose two extensions from Staged LSH, both of which take advantage of probabilistic strategies. One is Neighbor Staged LSH, which is to tune up about how to choose buckets for the hash method for searching. The other is Hierarchy Staged LSH, whose strategy is to focus on the popularity of songs. Adopting both achieved at most 182.8 times as fast as the simple Staged LSH and it was equivalent to 1 Gbps. The accuracy rate was 100 % if the BER of AFP is less than 15 %.

Locality-sensitive hashing

Speedup

Popularity

10.1145/3120895.3120921

Cite

Citations (2)

Secure Data Aggregation in Wireless Sensor Networks: A Survey

Yingpeng Sang Hong Shen Yasushi Inoguchi Yasuo Tan Naixue Xiong

Data aggregation is a widely used technique in wireless sensor networks. The security issues, data confidentiality and integrity, in data aggregation become vital when the sensor network is deployed in a hostile environment. There has been many related work proposed to address these security issues. In this paper we survey these work and classify them into two cases: hop-by-hop encrypted data aggregation and end-to-end encrypted data aggregation. We also propose two general frameworks for the two cases respectively. The framework for end-to-end encrypted data aggregation has higher computation cost on the sensor nodes, but achieves stronger security, in comparison with the framework for hop-by-hop encrypted data aggregation

Data aggregator

Data Security

10.1109/pdcat.2006.96

Cite

Citations (150)

Crosstalk freeness of Concatenated Modified Plus-Minus 2<sup>i</sup> photonic switching network

M. M. Hafizur Rahman S. M. Ashif Manjur A. B. M. Kowser Patwary Yasushi Inoguchi

In this paper, we analyze the crosstalk freeness Concatenated Modified Plus-Minus 2 ⁱ (CMPM2I) photonic switching network. A new routing algorithm is proposed for this network, which decomposes a permutation into two semi-permutations. It is shown that using the proposed routing algorithm the CMPM2I network is capable of realizing semi-permutation in one pass and thus the whole network is corsstalk free in two passes.

Crosstalk

Network routing

Routing algorithm

10.1109/ict4m.2014.7020661

Cite

Citations (0)

Hot-Spot Traffic Pattern on Hierarchical 3D Mesh Network

M. M. Hafizur Rahman M. A. H. Akhand Yasuyuki Miura Yasushi Inoguchi

A Hierarchical 3D-Mesh (H3DM) Network is a 2D-mesh network of multiple basic modules (BMs), in which the basic modules are 3D-torus networks that are hierarchically interconnected for higher-level networks. In this paper, we evaluate the dynamic communication performance of a H3DM network under hot-spot traffic pattern using a deadlock-free dimension order routing algorithm with minimum number of virtual channels. We have also evaluated the dynamic communication performance of the mesh and torus networks. It is shown that under most imbalance hot-spot traffic pattern H3DM network yields high throughput and low average transfer time than that of mesh and torus networks, providing better dynamic communication performance compared to those networks.

Grid network

Mesh networking

Virtual channel

Airfield traffic pattern

Optical mesh network

10.1109/acsat.2014.17

Cite

Citations (0)

On Effectiveness for e-Learning Courseware Design

Yoshiro Ogawara Akiko Takahashi Izumi Saita Yasushi Inoguchi Hiroshi Horii

Source

Cite

Citations (0)

High-Performance Training of Conditional Random Fields for Large-Scale Applications of Labeling Sequence Data

IEICE Transactions on Information and Systems (2007)

Xuan-Hieu Phan Loc Nguyen Yasushi Inoguchi S. Horiguchi

Conditional random fields (CRFs) have been successfully applied to various applications of predicting and labeling structured data, such as natural language tagging & parsing, image segmentation & object recognition, and protein secondary structure prediction. The key advantages of CRFs are the ability to encode a variety of overlapping, non-independent features from empirical data as well as the capability of reaching the global normalization and optimization. However, estimating parameters for CRFs is very time-consuming due to an intensive forward-backward computation needed to estimate the likelihood function and its gradient during training. This paper presents a high-performance training of CRFs on massively parallel processing systems that allows us to handle huge datasets with hundreds of thousand data sequences and millions of features. We performed the experiments on an important natural language processing task (text chunking) on large-scale corpora and achieved significant results in terms of both the reduction of computational time and the improvement of prediction accuracy.

Sequence labeling

Sequence (biology)

10.1093/ietisy/e90-1.1.13

Cite

Citations (9)

A deadlock-free dimension order routing for hierarchical 3D-Mesh network

M. M. Hafizur Rahman Asadullah Shah Yasushi Inoguchi

Virtual channels are used to make the routing algorithm deadlock-free for a wormhole routed network, however, its unconstrained used is strictly prohibited for the cost-effective parallel computers. In this paper, we present a deadlock-free routing algorithm for the Hierarchical 3D-Mesh (H3DM) network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the network's dynamic communication performance using the proposed routing algorithm under the uniform traffic pattern. We evaluate the dynamic communication performance of H3DM, mesh, and torus networks by computer simulation. It is shown that H3DM network yields low average transfer time than that of mesh and torus networks. The trade-off between throughput and latency of these network shown that H3DM network provide better dynamic communication performance than that of mesh and torus networks before saturation.

Grid network

Virtual channel

Wormhole

Mesh networking

10.1109/iccisci.2012.6297094

Cite

Citations (4)

Performance Improvement on Music Fingerprint Searching from Large-Scale Database by Using Probabilistic Bias

IEICE Technical Report; IEICE Tech. Rep. (2016)

Masahiro Fukuda Yasushi Inoguchi

Source

Cite

Citations (0)

Design of a FPGA-based Timing Sharing Architecture for Sound Rendering Applications

Yiyu Tan Yasushi Inoguchi Yukinori Sato Makoto Otani Yukio Iwaya

Sound rendering applications are data-intensive and memory-intensive as a sound space increases. To speed up computation and extend the simulated area, a sound rendering system based on the two-dimensional Digital Huygens Model (DHM) with timing sharing architecture is designed and implemented by a Field Programmable Gate Array (FPGA) chip XC5VLX330T. Compared with the DHM system with the traditional parallel architecture, the proposed system implemented by a FPGA chip extends about 20 times in simulated area, and speeds up 1.47 times against the software simulation carried out in a computer with an AMD Phenom 9500 Quad-core processor (2.2 GHz) and 4GB RAM. The system is relatively easy to cascade many FPGA chips to work in parallel in real applications.

10.1109/itng.2012.110

Cite

Citations (2)

A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks

Vinh Trong Le Son Hong Ngo Xiaohong Jiang S. Horiguchi Yasushi Inoguchi

Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. In this paper, we propose a novel hybrid algorithm for this problem based on a combination of the mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report diverse routes into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without requiring the time consuming process associated with current GA-based lightpath protection schemes. We furthermore improve the performance of our algorithm by introducing a more advanced fitness function. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability and a smaller execution time than the conventional survivable routing algorithms.

Blocking (statistics)

Hybrid routing

Path protection

10.1109/ispan.2005.8

Cite

Citations (20)