Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Yoshihide Igarashi"'
Publikováno v:
Engineering Psychology and Cognitive Ergonomics: Performance, Emotion and Situation Awareness ISBN: 9783319584713
HCI (5)
HCI (5)
In the design of BCI (Brain-Computer Interface) systems, brain signals distributed in a certain rage are often regarded as the identical signals. However, there exist some cases where such rough measurement of signals and data-collection are not good
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b3b9cec1bfdfc413ff57a427b798e04
https://doi.org/10.1007/978-3-319-58472-0_10
https://doi.org/10.1007/978-3-319-58472-0_10
Publikováno v:
The Japanese Journal of Ergonomics. 46:144-156
事象関連電位(Event Related Potential,ERP)は,頭皮上から測定される脳波の加算平均により得られる.我々の実験で測定されたデータは,ERPと背景脳波や他のノイズの総和であり,刺激表
Exploring a vast array of topics related to computation, Computing: A Historical and Technical Perspective covers the historical and technical foundation of ancient and modern-day computing. The book starts with the earliest references to counting by
Publikováno v:
Foundations of Augmented Cognition ISBN: 9783319208152
HCI (15)
HCI (15)
BCI (brain computer interface) is particularly important for HCI. Some of recent results concerning BCI made a great contribution to the development of the HCI research area. In this paper we define “good-trained brain states”, and then propose a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d81e58588be309fa57fa0fccede24c5e
https://doi.org/10.1007/978-3-319-20816-9_19
https://doi.org/10.1007/978-3-319-20816-9_19
Publikováno v:
Information Processing Letters. 91:85-91
Vidyasankar introduced a combined problem of k-exclusion and group mutual exclusion, called the group k-exclusion problem, which occurs in a situation where philosophers with the same interest can attend a forum in a meeting room, and up to k meeting
Publikováno v:
Discrete Applied Mathematics. 126:33-54
This paper presents results which improve the efficiency of parallel algorithms for computing the minimum spanning trees. For an input graph with n vertices and m edges our EREW PRAM algorithm runs in O(logn) time with O((m+n)logn) operations. Our CR
Publikováno v:
Interdisciplinary Information Sciences. 8:187-198
We analyze two algorithms for the k-exclusion problem on the asynchronous multi-writer/reader shared memory model and show their correctness. The first algorithm is a natural extension of the n-process algorithm by Peterson for the mutual exclusion a
Publikováno v:
Computing ISBN: 9781482227413
Computing: A Historical and Technical Perspective
Computing: A Historical and Technical Perspective
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01d1797e7c4d811a46487611f1b67cf0
https://doi.org/10.1201/b17011-2
https://doi.org/10.1201/b17011-2