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

Takeshi Nishida

dblp:35/3608 · DBLP profile ↗
← Back
30ranked-venue papers
8as first author
3since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 18 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 6 · 4 first-author · 2 since 2021Computer networks · 5 · 2 first-authorSystems, architecture and hardware · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 75% Computational science and engineering · 25%
Computer networks
3 papers
Network performance modeling · 34% Network optimization and economics · 23% Network management and operations · 17%

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

TopicWeightPapersLastEvidence papers
Medical and health informatics
computer-assisted surgery
0.112006
Development of a K-wire Guiding Robotic System for Scaphoid Fracture Reduction · ICRA 2006
Medical and health informatics › medical imaging › medical image analysis
image registration
0.112006
Development of a K-wire Guiding Robotic System for Scaphoid Fracture Reduction · ICRA 2006
Medical and health informatics › medical imaging
medical image analysis
0.112006
Development of a K-wire Guiding Robotic System for Scaphoid Fracture Reduction · ICRA 2006
Computational science and engineering
template matching
0.112006
Development of a K-wire Guiding Robotic System for Scaphoid Fracture Reduction · ICRA 2006
Network management and operations › network management architecture
distributed network management
0.011991
End-to-End Performance Modeling for Distributed Network Management Systems · INFOCOM 1991
Network performance modeling
performance modeling
0.011991
End-to-End Performance Modeling for Distributed Network Management Systems · INFOCOM 1991
Network performance modeling
queueing analysis
0.011991
End-to-End Performance Modeling for Distributed Network Management Systems · INFOCOM 1991
Performance modeling and evaluation
queueing models
0.011990
End-to-End Performance Modeling for Layered Communication Protocol · INFOCOM 1990
Network optimization and economics
network design
0.011988
Fault tolerant packet switched network design using capacity augmentation · INFOCOM 1988
Routing and switching › packet switching
packet-switched networks
0.011988
Fault tolerant packet switched network design using capacity augmentation · INFOCOM 1988
Network optimization and economics › network design
survivable network design
0.011988
Fault tolerant packet switched network design using capacity augmentation · INFOCOM 1988

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

template matching · 0.1fluoroscopic imaging · 0.1CT imaging · 0.1queueing network model · 0.0approximate analysis · 0.0queueing theory · 0.0numerical analysis · 0.0
YearPublicationVenuePosition
2025 Analysis of Student Learning Depth Progression in Programming Courses Through Video Annotation
abstract
In this study, we propose quantifying students' learning depth in video programming courses by analyzing their video annotations using natural language processing techniques and Bloom's Digital Taxonomy (BDT). Utilizing a video-based Learning Management System that allows direct annotation of video frames, we collected 3,014 annotations from 42 students enrolled in a “Data Management” course. We optimized Japanese morphological analysis tools by integrating a custom IT terminology dictionary to enhance the recognition of domain-specific terms. A specialized corpus was constructed, and a domain-specific Word2vec model was trained to expand the BDT classification table through word embeddings. This expansion enabled the comprehensive classification of keywords extracted from student annotations into cognitive process categories. The results revealed a clear shift from lower-order to higher-order cognitive processes as the course progressed, indicating significant changes in students' learning depth influenced by instructional content and teaching strategies. The method effectively captured dynamic trajectories of cognitive development, and these findings provide educators with valuable insights to conduct nuanced assessments and enhance personalized learning experiences. This study provides a practical method for quantifying the depth of learning in online programming education, advancing the understanding of students' cognitive processes, and supporting the improvement of teaching practices through data-driven adjustments to instructional design.
Asako Ohno, Yancong Su, Takeshi Nishida, Kazuhiro Ohtsuki, Hidenari Kiyomitsu
EDUCON5
2024 A Mixed Methods Analysis of Cognitive Engagement Based on Video Position-Based Notes in Programming Learning
abstract
This research full paper describes a study on Video Position-Based Notes (VPB-Notes). Video-based learning environments have become increasingly prevalent in programming education, offering flexibility and personalized pacing. The VPB-Notes which allow students to capture thoughts, questions, and observations at specific video timestamps, have emerged as a promising tool to promote active learning and engagement. However, the lack of standardization in VPB-Notes and the presence of mixed code and natural language poses significant challenges for learning analysis using traditional natural language processing techniques. This study aims to propose a novel analytical framework for understanding the cognitive processes and engagement levels reflected in VPB-Notes taken by students in asynchronous video-based programming courses. The research questions focus on uncovering the key characteristics and patterns of VPB-Notes and investigating the relationships between VPB-Notes features and learners' performance outcomes. Our study combines qualitative analysis of VPB-Notes from four programming courses with quantitative analysis using correlation and cluster analysis. The qualitative analysis reveals that VPB- Notes exhibit contextual relevance, conciseness, dynamic structure, and code integration with commentary. It also proposes an analytical framework for categorizing notes across four dimensions. The quantitative analysis suggests a hierarchy of note features, types, and initiative associated with academic performance. In contrast, cluster analysis highlights the complexity of note portfolios and the influence of personal learning styles. Despite limitations in the automation of note analysis and the need for further validation, this study contributes new insights to the growing body of knowledge on note-taking in online programming education, offering valuable guidance for instructional design and personalized learning support.
Yancong Su, Takeshi Nishida, Kazuhiro Ohtsuki, Hidenari Kiyomitsu
FIE4
2024 Hibikino-Musashi@Home RoboCup@Home DSPL Champion 2024
Akinobu Mizutani, Kosei Isomoto, Kosei Yamao, Ryohei Kobayashi 0003, Soma Fumoto, Koshun Arimura, Naoki Yamaguchi, Tomoya Shiba, Kouki Kimizuka, Yuta Ohno, Ryo Terashima, Hiromasa Yamaguchi, Tomoaki Fujino, Ryoga Maruno, Wataru Yoshimura, Kazuhito Mine, Tang Phu Thien Nhan, Yuga Yano, Yuichiro Tanaka, Takeshi Nishida, Takashi Morie, Hakaru Tamukoh
RoboCup20
2018 Designing Social Interaction Support System with Shyness in Mind
abstract
Shyness have been noted as a problem of the minority, which should be overcome on one's own. However, surveys have shown that nearly half of the society are introverts even in cultures believed to be extroversive. We can see the possibility of more contribution from the introverts if the social space is properly designed. As an initial exploration to this design space, we report here a field study where we held a conference banquet with a seating arrangement system developed with introversive participants in mind.
Takeshi Nishida
GROUP1
2013 Performance Improvement via Bagging Competitive Associative Nets for Multiobjective Robust Controller Using Difference Signals
Shuichi Kurogi, Takeshi Nishida
ICONIP (1)3
2013 Experimental Analysis of Moments of Predictive Deviations as Ensemble Diversity Measures for Model Selection in Time Series Prediction
Shuichi Kurogi, Kohei Ono, Takeshi Nishida
ICONIP (3)3
2013 Text-Prompted Multistep Speaker Verification Using Gibbs-Distribution-Based Extended Bayesian Inference for Reducing Verification Errors
Shuichi Kurogi, Takuya Ueki, Yuta Mizobe, Takeshi Nishida
ICONIP (3)4
2012 Robust Controller for Flexible Specifications Using Difference Signals and Competitive Associative Nets
Shuichi Kurogi, Takeshi Nishida
ICONIP (5)3
2012 Multistep Speaker Identification Using Gibbs-Distribution-Based Extended Bayesian Inference for Rejecting Unregistered Speaker
Yuta Mizobe, Shuichi Kurogi, Tomohiro Tsukazaki, Takeshi Nishida
ICONIP (5)4
2012 Moments of Predictive Deviations for Ensemble Diversity Measures to Estimate the Performance of Time Series Prediction
Kohei Ono, Shuichi Kurogi, Takeshi Nishida
ICONIP (5)3
2011 Naive Bayesian Multistep Speaker Recognition Using Competitive Associative Nets
Shuichi Kurogi, Shota Mineishi, Tomohiro Tsukazaki, Takeshi Nishida
ICONIP (1)4
2011 Multiview Range Image Registration Using Competitive Associative Net and Leave-One-Image-Out Cross-Validation Error
Shuichi Kurogi, Tomokazu Nagi, Shoichi Yoshinaga, Hideaki Koya, Takeshi Nishida
ICONIP (3)5
2011 Robust Control of Nonlinear System Using Difference Signals and Multiple Competitive Associative Nets
Shuichi Kurogi, Hiroshi Yuno, Takeshi Nishida
ICONIP (3)3
2010 Range Image Registration Using Particle Filter and Competitive Associative Nets
Shuichi Kurogi, Tomokazu Nagi, Takeshi Nishida
ICONIP (2)3
2008 Model switching predictive control using bagging CAN2 and first-difference signals for temperature control of RCA cleaning solutions
abstract
The RCA cleaning method is the industry standard way to clean silicon wafers, where temperature control is important for a stable cleaning performance. However, it is difficult mainly because the RCA solutions cause nonlinear and time-varying exothermic chemical reactions. So far, the MSPC (model switching predictive controller) using the CAN2 (competitive associative net 2) has been developed and the effectiveness has been validated. However, we have observed that the control performance, such as the settling time and the overshoot, does not always improve with the increase of the number of learning iterations of the CAN2. To solve this problem, we introduce the bagging method for the CAN2 and first-difference signals for the MSPC. The effectiveness of the present method is shown by means of computer simulation.
Shuichi Kurogi, Yohei Koshiyama, Daisuke Kuwahara, Takeshi Nishida, Mitsuru Mimata, Katsuyoshi Itoh
IJCNN4
2008 Application of CAN2 to plane extraction from 3D range images
abstract
An application of CAN2 (competitive associative net 2) to plane extraction from 3D range images obtained by a LRF (laser range finder) is presented. The CAN2 basically is a neural net which learns efficient piecewise linear approximation of nonlinear functions, and in this application it is utilized for learning piecewise planner surfaces from the range image. As a result of the learning, the obtained piecewise planner surfaces are much smaller and much more than the actual planner surfaces, so that we introduce a method to gather piecewise planner surfaces for reconstructing the actual planner surfaces. We apply this method to real range images, and examine the performance and the comparative advantage to other methods.
Shuichi Kurogi, Daisuke Wakeyama, Hideaki Koya, Shota Okada, Shingo Inoue, Takeshi Nishida
IJCNN6
2007 Bringing Round-Robin Signature to Computer-Mediated Communication
Takeshi Nishida, Takeo Igarashi
ECSCW1
2007 Range Data Approximation for Mobile Robot by Using CAN2
abstract
In this article, we apply the competitive associative net called CAN2 to the processing of the range data of indoor environment acquired by a mobile robot, where the CAN2 is a neural net or a learning machine which performs piecewise linear approximation. After introducing several methods for dealing with range data by the CAN2, we show the following results; (1) an original range image involving lack of data or jump edges can be learned to be recalled as a natural range image by means of modifying the learning and recalling procedure of the CAN2, (2) high data compression ratio can be achieved the CAN2 although the quality of the range image is not reduced so much.
Takeshi Nishida, Shuichi Kurogi, Yuji Takemura, Hirohito Fukumoto, Shota Okada
IJCNN1
2007 Drag-and-Guess: Drag-and-Drop with Prediction
Takeshi Nishida, Takeo Igarashi
INTERACT (1)1
2006 Ensemble of Competitive Associative Nets for Stable Learning Performance in Temperature Control of RCA Cleaning Solutions
Shuichi Kurogi, Daisuke Kuwahara, Hiroaki Tomisaki, Takeshi Nishida, Mitsuru Mimata, Katsuyoshi Itoh
ICONIP (3)4
2006 Ensemble of Competitive Associative Nets and a Method to Select an Effective Number of Units
Shuichi Kurogi, Shinya Tanaka, Ryohei Koyama, Takeshi Nishida
ICONIP (1)4
2006 Development of a K-wire Guiding Robotic System for Scaphoid Fracture Reduction
abstract
Fracture reduction of carpal bones is rather difficult, because of their tight formation. Therefore, it is difficult to recognize their posture and position as well as their segmentation. This paper deals with a novel robotic system for a K-wire guiding using CT and fluoroscopic images for scaphoid fracture reduction. The robot is designed to consider issues such as sterilization, X-ray halation and easy setup. Template matching in registration is investigated focusing on shape and structure of the carpal bones as well as scaphoid itself. Experiments show validity of the developed system in terms of insertion accuracy and operation time
Shin'ichi Warisawa, Takeshi Nishida, Yuuki Kurahashi, Mamoru Mitsuishi, Hiroyuki Hashizume, Masanobu Watanabe
ICRA2
2005 Lock-on-Chat: Boosting Anchored Conversation and Its Operation at a Technical Conference
Takeshi Nishida, Takeo Igarashi
INTERACT1
1998 Recognition of Hand-Written Characters by a Multi-Layered Competitive Net
Shuichi Kurogi, Takeshi Nishida, Shougang Ren
ICONIP2
1995 A New OS Architecture for High Performance Communication over ATM Networks - Zero-copy architecture
Hiroshi Kitamura, Kunihiro Taniguchi, Hiromitsu Sakamoto, Takeshi Nishida
NOSSDAV4
1992 Approximate Analysis for Heterogeneous Multiprocessor Systems with Priority Jobs
Takeshi Nishida
Perform. Evaluation1
1991 End-to-End Performance Modeling for Distributed Network Management Systems
abstract
A unified modeling framework for end-to-end performance evaluation in a network management system is presented. A network management application, e.g., alarm surveillance, can be mostly accomplished by several processes distributed over a network. In order to predict the completion time for such an application, components, whether software or hardware, incurring a delay must be identified. A proposed model, which is referred to as the end-to-end performance model, specifies: (1) components which incur a significant delay in a management application, (2) their characteristics, and (3) their interactions. In determining the major delay components, management application processing, protocol processing, transmission delay, and protocol conversion, are incorporated. A particular modeling procedure is explained using a SONET (synchronous optical network) management network.>
Takeshi Nishida
INFOCOM1
1990 End-to-End Performance Modeling for Layered Communication Protocol
abstract
An analytical model for predicting the performance of protocol software implementation in a layered communication architecture is proposed. Each layer is modeled by a queuing network. The model is constructed by focusing the behavior of the protocol entity in a layer. A first come, first served (FCFS) server queue with preemptive priority is employed for an entity and an infinite-server queue for response time of acknowledge packets. Respective layer models are piled up by embedding the lower services in the infinite-server queue. From the perspective of end-to-end performance, the model provides a solution for the following problems, which arise in implementing a layered communication protocol: assigning each layer's process to a processor; giving priority to respective processes in each processor; and providing an error recovery service. The authors present an approximate analysis to obtain an average end-to-end transmission delay and discuss the possible solutions for the problems mentioned.>
Hiroshi Inai, Takeshi Nishida, Tokumi Yokohira, Hideo Miyahara
INFOCOM2
1988 Fault tolerant packet switched network design using capacity augmentation
abstract
A design method for packet-switched networks is presented that enhances the reliability and prevents the performance degradation caused by network failures. The method is based on a design technique wherein the redundant capacity is assigned to appropriate links in advance to be capable of accommodating the detoured traffic caused by failed links. Using this technique, it is crucial to accurately evaluate to how large an amount the capacity for each link must be augmented. An augmented capacity function is introduced, which determines the capacity of a link based on the probability of a particular network state and a parameter which represents how important the link is in the state. Numerical examples are given to demonstrate the feasibility of the method, in terms of cost/performance effectiveness. The relation between the reliability level and the network cost is discussed.>
Takeshi Nishida, Hideo Miyahara
INFOCOM1
1986 Analysis of Dynamic Behavior in p-Persistent CSMA/CD Using Cusp Catastrophe
Tokumi Yokohira, Takeshi Nishida, Hideo Miyahara
Comput. Networks2