Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
R |
2018-07-27 14:50 |
Hokkaido |
|
Proposal of algorithm for optimal arrangement in connected-(r,s)-out-of-(m,n):F lattice system Taishin Nakamura, Hisashi Yamamoto (Tokyo Met. Univ.), Takashi Shinzato (Tamagawa Univ.) R2018-13 |
One of the most significant problems in reliability theory is an optimal arrangement problem on the assumption that comp... [more] |
R2018-13 pp.13-18 |
PRMU, MI, IE, SIP |
2018-05-17 13:30 |
Gifu |
|
[Invited Talk]
Large-Scale Graph Analysis and Development of Urban OS
-- Cyber-physical System and Industrial Applications of Mathematical Models for Mobility -- Katsuki Fujisawa (Kyushu Univ.) SIP2018-1 IE2018-1 PRMU2018-1 MI2018-1 |
In this talk, we present our ongoing research project. The objective of many ongoing research projects in high performan... [more] |
SIP2018-1 IE2018-1 PRMU2018-1 MI2018-1 p.1 |
SS, MSS |
2018-01-19 11:05 |
Hiroshima |
|
An Analysis of Prosumers' Benefit on Peer-to-Peer Energy Trading Mitsue Imahori, Ryo Hase, Norihiko Shinomiya (Soka Univ.) MSS2017-65 SS2017-52 |
In recent years, many countries have promoted to install photovoltaics to consumers for carbon dioxide reduction. Consum... [more] |
MSS2017-65 SS2017-52 pp.103-106 |
MW |
2017-12-20 14:10 |
Tokyo |
|
Design Theory of LC-Ladder Matching with Minimum Stored Energy Kyohei Yamada, Takashi Ohira (TUT) MW2017-161 |
A design theory of an LC ladder which transforms a positive real impedance to another with minimum stored energy is prop... [more] |
MW2017-161 pp.113-116 |
NLP, CAS |
2017-10-05 15:50 |
Niigata |
Machinaka Campus Nagaoka |
[Invited Talk]
Exploring optimality in nonliear problems
-- Applications to design methodology of injection-locking circuits and new vibration engineering -- Hisa-Aki Tanaka, Masaki Nakagawa (UEC), Hiroo Sekiya (Chiba Univ.) CAS2017-30 NLP2017-55 |
We have been enabling optimizing injection-locking phenomena, in collaboration with research groups in U.S. for these se... [more] |
CAS2017-30 NLP2017-55 pp.35-40 |
PN, NS, OCS (Joint) |
2017-06-15 14:55 |
Akita |
Akita Univ. |
[Invited Talk]
What is a reliable network design?
-- Changes of reliability required for network topology and new network design problem -- Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2017-24 |
High reliability is required for communication network which is one of important social infrastructure. It is necessary... [more] |
NS2017-24 pp.11-16 |
NLP |
2017-03-15 09:55 |
Aomori |
Nebuta Museum Warasse |
Optimization of coupling matrices for stable mutual synchronization of nonlinear oscillators Nobuhiro Watanabe, Sho Shirasaka (Tokyo Tech), Yoji Kawamura (JAMSTEC), Hiroya Nakao (Tokyo Tech) NLP2016-120 |
Optimization of periodic injection signals for stable synchronization of a single oscillator has been studied recently, ... [more] |
NLP2016-120 pp.75-77 |
RCS, CCS, SR, SRW (Joint) |
2016-03-04 13:15 |
Tokyo |
Tokyo Institute of Technology |
A design and its experimental verification of optimal input waveforms for an injection-locked class-E oscillator Youjie Ouyang, Yoji Yabe, Isao Nishikawa, Hisa-Aki Tanaka (UEC), Tomoharu Nagashima, Hiroo Sekiya (Chiba Uni.) CCS2015-71 |
We design the optimal input waveforms that maximize locking ranges in an injection-locked Class-E oscillator, by using a... [more] |
CCS2015-71 pp.23-28 |
RCC, ITS, WBS |
2015-12-18 10:00 |
Okinawa |
Okinawa Industry Support Center |
Solution of community bus network design problem in Nonoichi city Masamichi Takakura, Mikiko Sode (KIT) WBS2015-69 ITS2015-41 RCC2015-71 |
Buses play an important role in suburban cities. Therefore the community bus transportation system design is important. ... [more] |
WBS2015-69 ITS2015-41 RCC2015-71 pp.169-174 |
CCS |
2015-11-09 15:30 |
Kyoto |
Inamori Foundation Memorial Building, Kyoto Univ. |
Common-noise-induced synchronization of oscillator networks and its optimization Yoji Kawamura (JAMSTEC), Hiroya Nakao (Tokyo Tech) CCS2015-53 |
We investigate common-noise-induced synchronization between two identical networks of coupled phase oscillators exhibiti... [more] |
CCS2015-53 pp.47-51 |
ITS |
2015-06-06 13:25 |
Fukuoka |
Kyushu Univ. |
Solving method of the bus stop placement problem of community bus "Notty" Masamichi Takakura, Takashi Furuta, Mikiko Sode Tanaka (KIT) ITS2015-4 |
Buses play an important role in suburban cities. Therefore the bus transportation system design is important. A design i... [more] |
ITS2015-4 pp.17-22 |
MW |
2014-12-19 11:15 |
Tokyo |
Aoyama Gakuin Univ. Aoyama Campus |
Design of Ultra Wide-Band Bandpass Filters Using Short-Circuited Stubs Ryuhi Hamano, Zhewang Ma, Masataka Ohira (Saitama Univ.), Chun-Ping Chen, Tetsuo Anada (Kanagawa Univ.) MW2014-171 |
In this paper, a novel synthesis theory of bandpass filters using short-circuited stubs is proposed. First, the variati... [more] |
MW2014-171 pp.125-131 |
CAS, MSS, IPSJ-AL [detail] |
2014-11-21 11:40 |
Okinawa |
Nobumoto Ohama Memorial Hall (Ishigaki island) |
Influence of tie-set distribution on flow control balancing edge load factor Masashi Yamada, Genya Ishigaki, Norihiko Shinomiya (Soka Univ.) CAS2014-101 MSS2014-65 |
A distributed algorithm controlling network flows by operations in loop structures (tie-sets) has been proposed in order... [more] |
CAS2014-101 MSS2014-65 pp.131-134 |
NLP, CAS |
2014-10-17 09:20 |
Ehime |
Ehime University |
Evaluating availability and Solving Shortest Path Problems by Adaptable Independent-minded Particle Swarm Optimization Yoko Ishii, Haruna Matsushita (Kagawa Univ.) CAS2014-70 NLP2014-64 |
The Shortest-Path Problem (SPP) is one of the most fundamental problems in graph theory. We proposed to investigate on t... [more] |
CAS2014-70 NLP2014-64 pp.95-98 |
COMP |
2014-09-02 13:30 |
Aichi |
Toyohashi University of Technology |
[Invited Talk]
Modeling and Algorithm/Complexity Theory
-- Scheduling in Railroad, AGV(Automated Guided Vehicle) NPB League as Examples -- Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2014-19 |
This paper discuss and suggest how knowledge on algorithm design theory and computational complexity theory help to mo... [more] |
COMP2014-19 pp.29-34 |
MICT, RCC |
2014-05-29 11:20 |
Tokyo |
Kikai-Shinko-Kaikan Bldg |
[Keynote Address]
An Invitation to Reliable Communication and Control
-- Its Imortant and Interesting Topics -- Masaaki Katayama (Nagoya Univ.) RCC2014-4 MICT2014-4 |
Control communications have a wide variety of applications including medical and healthcare systems, financial systems, ... [more] |
RCC2014-4 MICT2014-4 pp.13-16 |
NLP |
2014-01-21 10:00 |
Hokkaido |
Niseko Park Hotel |
Mathematical structures of optimal solutions in continuous optimization problems (3)
-- Estimation of the number of isolated local minima and the number of connected components of local minimal values sets -- Hideo Kanemitsu (Hokkaido Univ. of Education) NLP2013-129 |
We show mathematical structures of optimal solutions in continuous optimization problem with continuous multivariate mul... [more] |
NLP2013-129 pp.1-6 |
RCC (2nd) |
2013-11-22 10:30 |
Osaka |
Umeda Satellite(Graduate School for Creative Cities and Academic Ex |
[Invited Talk]
Optimization of the communication layer based on information of the control layer for wireless feedback control systems Kentaro Kobayashi (Nagoya Univ.) |
The interest of this paper is joint optimization of control and communication layers for dependable wireless control
sy... [more] |
|
NLP |
2013-10-28 15:00 |
Kagawa |
Sanport Hall Takamatsu |
Mathematical structure of optimal solutions in continuous optimization problems (2)
-- Necessary and sufficient optimality condition, and estimations of the number of solutions -- Hideo Kanemitsu (Hokkaido Univ. of Edu.), Hideyuki Imai (Hokkaido Univ.) NLP2013-81 |
We show mathematical structures of optimal solutions in continuous optimization problem with continuous multivariate mul... [more] |
NLP2013-81 pp.63-68 |
NLP |
2013-10-29 16:45 |
Kagawa |
Sanport Hall Takamatsu |
Solving Shortest Path Problems of Complex Networks Using Adaptable Independent-minded Particle Swarm Optimization Yoko Ishii, Haruna Matsushita (Kagawa Univ.) NLP2013-109 |
The Shortest Path Problem (SPP) is one of the most fundamental problems in graph theory. The purpose of this study is to... [more] |
NLP2013-109 pp.211-214 |