Demo Data from EDBT 2026 / reviewers in the wild / expert
Tetsuro Moriya
dblp:04/2979
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 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.
| Artificial intelligence
1 paper |
Planning, search and constraint satisfaction · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Software maintenance and evolution · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Haptics and multimodal interaction · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software maintenance and evolution
software process improvement |
0.1 | 1 | 2006 | Practical approach to development of SPI activities in a large organization: Toshiba's SPI history since 2000 · ICSE 2006 |
Haptics and multimodal interaction
tactile display |
0.0 | 1 | 2004 | Food Simulator: A Haptic Interface for Biting · VR 2004 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › scheduling
production scheduling |
0.0 | 1 | 2001 | A macro-level scheduling method using Lagrangian relaxation · IEEE Trans. Robotics Autom. 2001 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
scheduling |
0.0 | 1 | 2001 | A macro-level scheduling method using Lagrangian relaxation · IEEE Trans. Robotics Autom. 2001 |
Mathematical optimization
lagrangian relaxation |
0.0 | 1 | 2001 | A macro-level scheduling method using Lagrangian relaxation · IEEE Trans. Robotics Autom. 2001 |
Haptics and multimodal interaction › haptic feedback
force feedback |
0.0 | 1 | 2004 | Food Simulator: A Haptic Interface for Biting · VR 2004 |
Methods — techniques the papers use, named apart from their topics
lagrangian relaxation · 0.1dynamic programming · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Practical approach to development of SPI activities in a large organization: Toshiba's SPI history since 2000abstractFor the effective promotion of software process improvement (SPI) activities in a large-scale organization, it is necessary to establish an organizational structure and a deployment method for promotion and to develop training courses, support tools, and other materials. Even if an organizational promotion system is established, the SPI activities of each development department cannot be promoted effectively without SPI community. To promote SPI activities throughout the TOSHIBA group, we organized a Corporate Software Engineering Process Group in April 2000. We also have been focused to establish SPI community, while promoting SPI activities in each development department. The fundamental our operating policy of SPI is "bottom-up". This paper discusses the problems encountered in the promotion of SPI activities and presents solutions to the problems. The actual results obtained show that the framework and solutions developed by us can be used to effectively promote SPI activities. Hideto Ogasawara, Takashi Ishikawa, Tetsuro Moriya |
ICSE | 3 |
| 2004 | Food Simulator: A Haptic Interface for Biting
Hiroo Iwata, Hiroaki Yano, Takahiro Uemura, Tetsuro Moriya |
VR | 4 |
| 2001 | A macro-level scheduling method using Lagrangian relaxationabstractIn this paper, a macro-level scheduling method is developed to provide high-level planning support for factories with multiple coordinating cells. To model the problem with manageable complexity, detailed operations of a product within a cell are aggregated as a single operation whose processing time is related to the amount of resources allocated. "Overload variables" are introduced and penalized in the objective function. The goal is to properly allocate resources, efficiently handle complicated process plans, and coordinate cells to ensure on-time delivery, low working-in-process inventory, and small resource overload. The formulation obtained is "separable" and can be effectively decomposed by using Lagrangian relaxation. A combined backward and forward dynamic programming (BFDP) method is developed to solve a product sub-problem after a novel transformation of its process plan. The BFDP is further simplified and solved approximately. Peter B. Luh, Katsumi Narimatsu, Tetsuro Moriya, Tsuyoshi Shimada |
IEEE Trans. Robotics Autom. | 4 |