Naoyuki Yamada

dblp:38/2651 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Systems, architecture and hardware · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 70% Mathematical optimization · 30%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
constraint programming
0.812024
Stable Matchings in Practice: A Constraint Programming Approach · AAAI 2024
Algorithmic game theory and mechanism design › matching
stable matching
0.812024
Stable Matchings in Practice: A Constraint Programming Approach · AAAI 2024
Algorithmic game theory and mechanism design › market design › matching markets
two-sided matching
0.812024
Stable Matchings in Practice: A Constraint Programming Approach · AAAI 2024
Algorithmic game theory and mechanism design › market design
matching markets
0.212024
Stable Matchings in Practice: A Constraint Programming Approach · AAAI 2024
Human-robot interaction
human behavior modeling
0.112006
Behavior Modeling in Man-machine Cooperative System based on Stochastic Switched Dynamics · ICRA 2006
Knowledge, reasoning and agents › Knowledge representation and reasoning › diagnosis
model-based diagnosis
0.011983
A Diagnosis Method of Dynamic System Using the Knowledge on System Description · IJCAI 1983

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

constraint programming · 0.8stochastic switched linear dynamical model · 0.1EM algorithm · 0.1knowledge-based diagnosis · 0.0
YearPublicationVenuePosition
2024 Stable Matchings in Practice: A Constraint Programming Approach
abstract
We study a practical two-sided matching problem of allocating children to daycare centers, which has significant social implications. We are cooperating with several municipalities in Japan and our goal is to devise a reliable and trustworthy clearing algorithm to deal with the problem. In this paper, we describe the design of our new algorithm that minimizes the number of unmatched children while ensuring stability. We evaluate our algorithm using real-life data sets, and experimental results demonstrate that our algorithm surpasses the commercial software that currently dominates the market in terms of both the number of matched children and the number of blocking coalitions (measuring stability). Our findings have been reported to local governments, and some are considering adopting our proposed algorithm in the near future, instead of the existing solution. Moreover, our model and algorithm have broader applicability to other important matching markets, such as hospital-doctor matching with couples and school choice with siblings.
Zhaohong Sun 0001, Naoyuki Yamada, Yoshihiro Takenami, Daisuke Moriwaki, Makoto Yokoo
AAAI2
2006 Behavior Modeling in Man-machine Cooperative System based on Stochastic Switched Dynamics
abstract
This paper presents a new mathematical model for the human behavior called stochastic switched linear dynamical (SS-LD) model. The SS-LD model can be regarded as a natural extension of the conventional hidden Markov model (HMM), where different linear dynamical model is allocated to each discrete state of the HMM to represent continuous dynamics. Then, the parameter identification technique for SS-LD model is developed based on the EM algorithm. Finally, we apply the proposed behavior model to a typical man-machine cooperative system, and the usefulness of the proposed model is verified through some experiments
Naoyuki Yamada, Shinkichi Inagaki, Tatsuya Suzuki 0001, Hiroyuki Okuda, Soichiro Hayakawa, Nuio Tsuchida
ICRA1
1994 Cellular Local Area Radio Network: CELARN
abstract
The cellular local area radio network (CELARN), which is suitable for transmitting data to indoor mobiles, such as forklifts in factories and warehouses, is proposed. CELARN consists of some radio networks and a wired network which integrates the radio networks. The base stations are connected to one another by the wired network in a logical ring. A data-frame makes the round of the base stations to transmit data. Moreover, the data-frame behaves as a token of the common radio control channel to prevent collisions. The transmission delay performance of CELARN in a car manufacturing factory is analyzed for the practical use.>
Tsutayuki Shibata, Naoyuki Yamada, Yoshkazu Asano
VTC2
1992 Domain Model for Constructing a Knowledge Based System
abstract
An expert system tool, ASPROGEN (automatic search program generator), is described. It has a domain model editor, by which tool users can define their problems in an object-oriented way, and a built-in function for automatic generation of a domain-specific inference program. This function uses search-based program specifications and an abstract data type of search. The descriptiveness of this domain model is shown by applying ASPROGEN to a scheduling problem.>
Takayasu Kasahra, Naoyuki Yamada, Yasuhiro Kobayashi, Katsuyuki Yoshino, Kikuo Yoshimura
ICTAI2
1989 LADIES: an automatic layout system for analog LSI's
abstract
The authors have developed a prototype system for analog LSI layout design which ensures the functionality of circuits. The procedural initial layout program is based on a clustering algorithm and a river routing algorithm and it manipulates mathematically specified layout constraints. Before and after this program the system uses a knowledge base to manipulate complex conditions and thereby avoid circuit malfunction. Using circuit descriptions and knowledge about layout constraints as related to the circuits, a preprocessing program generates specific layout constraints which ensure the functionality of circuits. A postprocessing program eliminates unused space, taking the various constraints into account. The authors have also developed a predictive inference mechanism which selects suitable actions to get better results. In an experiment involving a 71-element block, the authors obtained a layout which follows all constraints and is only 8% larger than the manual layout.>
Masato Mogaki, Naoki Kato, Youko Chikami, Naoyuki Yamada, Yasuhiro Kobayashi
ICCAD4
1983 A Diagnosis Method of Dynamic System Using the Knowledge on System Description
Naoyuki Yamada, Hiroshi Motoda
IJCAI1