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

Kazuaki Harada

dblp:72/3480 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2024
0009-0008-2558-0642ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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 · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
interconnection networks
0.011972
Sequential Permutation Networks · IEEE Trans. Computers 1972
Interconnection networks and networks-on-chip
permutation network
0.011972
Sequential Permutation Networks · IEEE Trans. Computers 1972
Algorithms and data structures › combinatorial algorithms › enumeration algorithms
permutation generation
0.011972
Sequential Permutation Networks · IEEE Trans. Computers 1972
Interconnection networks and networks-on-chip
switching network
0.011972
Sequential Permutation Networks · IEEE Trans. Computers 1972

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

recursive transposition product · 0.0
YearPublicationVenuePosition
2024 Lamarckian Co-design of Soft Robots via Transfer Learning
abstract
In the realm of robot design, co-design aims to optimize both the structure and the controller of a robot concurrently. One approach integrates genetic algorithms to optimize the soft robot's structure with deep reinforcement learning for the controller. A significant challenge in this approach is the inheritance of the controller due to the mismatch of the sensors and actuators of the robots across generations. In this study, we propose a Lamarckian co-design method to inherit the controller optimized by deep reinforcement learning through transfer learning. In experimental evaluations through the Evogym benchmark, we demonstrate that our proposed method achieves an average reduction of 41.7% in the optimization time for robots compared to existing methods and concurrently leads to an average performance improvement of 118.5%. Furthermore, we show that combining the inheritance of controllers with the crossover of structure genomes from two robots allows for additional reductions in optimization time and improvements in performance in several tasks.
Kazuaki Harada, Hitoshi Iba
GECCO1
2010 Turn-alignment using eye-gaze and speech in conversational interaction
abstract
Abstract Spoken interactions are known for accurate timing and alignment between interlocutors: turn-taking and topic flow are managed in a manner that provides conversational fluency and smooth progress of the task. This paper studies the relation between the interlocutors’ eye-gaze and spoken utterances, and describes our experiments on turn alignment. We conducted classification experiments by Support Vector Machine on turn-taking using the features for dialogue act, eye-gaze, and speech prosody in conversation data. As a result, we demonstrated that eye-gaze features are important signals in turn management, and seem even more important than speech features when the intention of utterances is clear. Index Terms : eye-gaze, dialogue, interaction, speech analysis, turn-taking 1. Introduction The role of eye-gaze in fluent communication has long since been acknowledged ([2]; [7]). Previous research has established close relations between eye-gaze and conversational feedback ([3]), building trust and rapport, as well as focus of shared attention ([15]). Eye-gaze is also important in turn-taking signalling: usually the interlocutors signal their wish to give the turn by gazing up to the interlocutor, leaning back, and dropping in pitch and loudness, and the partner can, accordingly, start preparing to take the turn. There is evidence that lack of eye contact decreases turn-taking efficiency in video-conferencing ([16]), and that the coupling of speech and gaze streams in a word acquisition task can improve performance significantly ([11]). Several computational models of eye-gaze behaviour for artificial agents have also been designed. For instance, [9] describe an eye-gaze model for believable virtual humans, [13] demonstrate gaze modelling for conversational engage-ment, and [10] built an eye-gaze model to ground information in interactions with embodied conversational agents. Our research focuses on turn-taking and eye-gaze alignment in natural dialogues and especially on the role of eye-gaze as a means to coordinate and control turn-taking. In our previous work [5,6] we noticed that in multi-party dialogues the participants head movement was important in signalling turn-taking, maybe because of its greater visibility than eye-gaze. (This is in agreement with [12], who noticed that in virtual environments, head tracking seems sufficient when people turn their heads to look but if the person is not turning their head to look at an object, then eye-tracking is important to discern the gaze of a person.) The main objective in the current research is to explore the relation between eye-gaze and speech, in particular, how the annotated turn and dialogue features and automatically recognized speech properties affect in turn management. Methodologically our research relies on experimentation and observation: signal-level measurements and analysis of gaze and speech are combined with human-level observation of dialogue events (dialogue acts and turn-taking). We use our three-party dialogue data that is analysed with respect to the interlocutors’ speech, and annotated with dialogue acts, eye-gaze, and turn-taking features [6]. The experiments deal with the classification of turn-taking events using the analysed features and the results show that eye-gaze speech information significantly improves the accuracy compared with the classification with dialogue act information only. However, what is also interesting that the difference between gaze and speech features is not significant, i.e. eye-gaze and speech are important signals in turn management, but their effect is parallel rather than complementary. Moreover, eye-gaze seems to more important than speech when the intention of the utterance is clear. The paper is structured as follows. We first describe the research on turn-taking and the alignment of speech and gaze in Section 2. We then present our data and speech analysis in Section 3, and experimental results as well as discussion concerning their importance in Section 4. Section 5 draws conclusions and points to future research.
Kristiina Jokinen, Kazuaki Harada, Masafumi Nishida, Seiichi Yamamoto
INTERSPEECH2
1972 Sequential Permutation Networks
abstract
Two sequential permutation networks which generate all nǃ permutations without duplication are presented. Each permutation can be derived from its predecessor autonomously in one clock step. Based on the principle of recursive execution of a product of transpositions, the first network is constructed in multiple cascades of ½(n²-n) switching elements each of which permutes its input pair to its output pair according to its internal state, and is controlled sequentially by the same principle. Next, the network whose structure and control sequence are complementary to those of the first is presented. The first is named a cyclic permutation network and is an explicit representation of a mapping function The second is named a lexicographic permutation network and is an explicit representation of a factorial counting function where ah is a h-nary factorial digit 0 ≤ ah ≤ (n-1). The characteristics of the networks are investigated by establishing a one-to-one correspondence among nI integers, n! permutations, and n! states of the networks. For the lexicographic permutation network which can generate all permutations in lexicographic order, three examples of applications are given.
Kazuaki Harada
IEEE Trans. Computers1