Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arata Itoh

dblp:64/2961 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 88% Distributed systems · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011991
A Fault-Tolerant Switching Network for B-ISDN · IEEE J. Sel. Areas Commun. 1991
Interconnection networks and networks-on-chip › switching network
self-routing network
0.011991
A Fault-Tolerant Switching Network for B-ISDN · IEEE J. Sel. Areas Commun. 1991
Interconnection networks and networks-on-chip › routing algorithms
disjoint path routing
0.011991
A Fault-Tolerant Switching Network for B-ISDN · IEEE J. Sel. Areas Commun. 1991
Distributed systems
fault tolerance
0.011991
A Fault-Tolerant Switching Network for B-ISDN · IEEE J. Sel. Areas Commun. 1991

Methods — techniques the papers use, named apart from their topics

simulation · 0.0reliability analysis · 0.0performance analysis · 0.0
YearPublicationVenuePosition
2011 Robust seed model training for speaker adaptation using pseudo-speaker features generated by inverse CMLLR transformation
abstract
In this paper, we propose a novel acoustic model training method which is suitable for speaker adaptation in speech recognition. Our method is based on feature generation from a small amount of speakers' data. For decades, speaker adaptation methods have been widely used. Such adaptation methods need some amount of adaptation data and if the data is not sufficient, speech recognition performance degrade significantly. If the seed models to be adapted to a specific speaker can widely cover more speakers, speaker adaptation can perform robustly. To make such robust seed models, we adopt inverse maximum likelihood linear regression (MLLR) transformation-based feature generation, and then train our seed models using these features. First we obtain MLLR transformation matrices from a limited number of existing speakers. Then we extract the bases of the MLLR transformation matrices using PCA. The distribution of the weight parameters to express the MLLR transformation matrices for the existing speakers is estimated. Next we generate pseudo-speaker MLLR transformations by sampling the weight parameters from the distribution, and apply the inverse of the transformation to the normalized existing speaker features to generate the pseudo-speakers' features. Finally, using these features, we train the acoustic seed models. Using this seed models, we obtained better speaker adaptation results than using simply environmentally adapted models.
Arata Itoh, Sunao Hara, Norihide Kitaoka, Kazuya Takeda
ASRU1
1991 A Fault-Tolerant Switching Network for B-ISDN
abstract
The author proposes a self-routing fault-tolerant switching network for asynchronous transfer mode (ATM) switching systems. The network has many subswitches to enhance the fault tolerance of the conventional multistage interconnection network which only has a unique path. The subswitches provide large numbers of alternative paths between switching stages and allow the network to tolerate multiple paths. The routing algorithm is quite simple. The paths can also be used to route cells under the condition that internal cell contentions occur in switching elements. A reliability analysis shows a quantitative measurement of the improvement in fault tolerance as compared with previously presented fault-tolerant networks. A performance analysis and simulation results show that the proposed network has a high level of maximum throughput. In addition, that level of throughput is maintained with reasonable cell delay even though the number of faulty components increases in the network.>
Arata Itoh
IEEE J. Sel. Areas Commun.1