Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ICTSSL, CAS |
2023-01-26 11:15 |
Tokyo |
TBD (Primary: On-site, Secondary: Online) |
On Image Recognition Neural Networks and Polynomial Approximation of Images Jiahang Chang, Kazuya Ozawa, Hideaki Okazaki (SIT) CAS2022-66 ICTSSL2022-30 |
In this report, we present a convolutional neural network that we have built ourselves for our research. Then, we discus... [more] |
CAS2022-66 ICTSSL2022-30 pp.23-27 |
COMP |
2022-10-26 11:45 |
Fukuoka |
Kyusyu Univ. Nishijin Plaza |
Evacuation problems on grid networks with uniform transit time and uniform capacity Yuki Tokuni, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa (Uoh) COMP2022-15 |
We consider the problem of finding the minimum time at which all supplies on a dynamic flow network can reach the demand... [more] |
COMP2022-15 pp.7-13 |
MSS, CAS, IPSJ-AL [detail] |
2020-11-26 13:50 |
Online |
Online |
On an approximating polynomials by a Pseudo Residual Neural Network with a Power Activation Function Kazuya Ozawa, Kaito Isogai, Hideaki Okazaki (Shonan Inst. Tech) CAS2020-31 MSS2020-23 |
Since a series of successes of Deep neural networks (DNNs) with rectified linear units (ReLUs), many approximations by N... [more] |
CAS2020-31 MSS2020-23 pp.68-72 |
COMP |
2020-03-01 14:50 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Minmax regret 1-sink problem with parametric weights Yuki Tokuni (Kwansei Gakuin Univ.), Noaki Katoh, Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie (Univ. of Hyogo) COMP2019-51 |
This paper addresses the minmax regret 1-sink problem in dynamic path networks with parametric weights. A dynamic path n... [more] |
COMP2019-51 pp.35-41 |
CAS, MSS, IPSJ-AL [detail] |
2019-11-28 13:25 |
Fukuoka |
|
A Multiplication by a Neural Network (NN) with Power Activations and a Polynomial Enclosure for a NN with Parametric ReLU Functions Kazuya Ozawa, Kaito Isogai, Toshihiro Tachibana, Hideo Nakano, Hideaki Okazaki (SIT) CAS2019-49 MSS2019-28 |
Since a series of successes of Deep neural networks (DNNs) with rectified linear units (ReLUs), many approximations by N... [more] |
CAS2019-49 MSS2019-28 pp.27-32 |
MSS, CAS, IPSJ-AL [detail] |
2018-11-13 13:25 |
Shizuoka |
|
On an approximated polynomial function by neural networks with parametric rectified linear units Kazuya Ozawa, Toshihiro Tachibana, Hideo Nakano, Hideaki Okazaki (SIT) CAS2018-72 MSS2018-48 |
In this report we discuss learnings of a polynomial function approximation by a neural network with rectified linear uni... [more] |
CAS2018-72 MSS2018-48 pp.105-110 |
CAS, SIP, MSS, VLD |
2018-06-14 09:20 |
Hokkaido |
Hokkaido Univ. (Frontier Research in Applied Sciences Build.) |
How to represent a polynomial function by Neural Networks with rectified linear units Hideaki Okazaki, Kazuya Ozawa, Kaito Isogai, Toshihiro Tachibana, Hideo Nakano (SIT) CAS2018-2 VLD2018-5 SIP2018-22 MSS2018-2 |
In this report we study how to represent an exact polynomial function by neural networks (NN) with rectified linear un... [more] |
CAS2018-2 VLD2018-5 SIP2018-22 MSS2018-2 pp.7-10 |
CAS, SIP, MSS, VLD |
2018-06-14 09:40 |
Hokkaido |
Hokkaido Univ. (Frontier Research in Applied Sciences Build.) |
On an approximated polynomial function by a Deep Neural Network Kazuya Ozawa, Toshihiro Tachibana, Hideo Nakano, Hideaki Okazaki (SIT) CAS2018-3 VLD2018-6 SIP2018-23 MSS2018-3 |
In order to approximate a bivariate polynomial function used in a bivariate fractal interpolation method , and to realiz... [more] |
CAS2018-3 VLD2018-6 SIP2018-23 MSS2018-3 pp.11-15 |
COMP |
2015-12-01 14:20 |
Osaka |
|
[Invited Talk]
Fiding a Stable Allocation in Polymatroid Intersection Satoru Iwata, Yu Yokoi (Univ. Tokyo) COMP2015-34 |
The stable matching model of Gale and Shapley (1962) has been generalized in various directions such as matroid kernels ... [more] |
COMP2015-34 p.25 |
WBS, SAT (Joint) |
2015-05-29 11:10 |
Tokyo |
Tokyo City Univ. (Setagaya Campus) |
Multi-user Detection and Interference Rejection Using Orthogonal Matched Filter based on Modified Hermite Polynomials for UWB communication Takumi Kobayashi, Chika Sugimoto, Ryuji Kohno (Yokohama Natl. Univ.) WBS2015-11 |
Multi-user Detection and Interference Rejection using Orthogonal Matched Filter based on Modified Hermite Polynomials fo... [more] |
WBS2015-11 pp.55-60 |
NS, IN (Joint) |
2014-03-07 09:50 |
Miyazaki |
Miyazaki Seagia |
Server Access Traffic Control by Link Metric Update Takahiro Munechika, Akira Noguchi, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-228 |
Recently, with the spread of broadband Internet access and video contents provide services, large contents in the Intern... [more] |
NS2013-228 pp.301-306 |
NS, IN (Joint) |
2014-03-07 08:50 |
Miyazaki |
Miyazaki Seagia |
Sever Location Method for Keeping Shorter Distance from Clients to Servers during Failures Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-243 |
Recently, large contents in the Internet have increased loads of contents servers, networks and data centers which may d... [more] |
NS2013-243 pp.385-390 |
MW, AP (Joint) |
2013-09-13 09:55 |
Tokyo |
NHK Science Tech. Research Lab. |
A Study on Parameter Optimization for Orthogonal Polynomial Based Digital Predistortion of Concurrently Amplified Dual-band Single-carrier Signals Ikuma Ando, Gia Khanh Tran, Kiyomichi Araki (Tokyo Inst. of Tech.), Takayuki Yamada, Takana Kaho, Yo Yamaguchi (NTT) MW2013-91 |
To realize “User-Centric Wireless Networks” which integrates various wireless systems on a unified hardware platform tow... [more] |
MW2013-91 pp.17-22 |
CQ, MoNA, IPSJ-DPS, IPSJ-CN, IPSJ-EIP (Joint) [detail] |
2013-09-12 10:10 |
Ishikawa |
Kanazawa Institute of Technology |
Time-specific Failure Frequency Analysis for Telecommunications Networks Tsubasa Kogami, Masahiro Hayashi (Tokyo City Univ.) CQ2013-32 |
This paper proposes a new approach to analyze time-specific failure frequency and time-specific success frequency for te... [more] |
CQ2013-32 pp.23-28 |
NS, IN (Joint) |
2013-03-08 13:40 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Method for Finding Links Protected for Keeping the Shorter Distance from Clients to Servers during Failures Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-251 |
Recently, large-volume contents distributed by a content delivery network~(CDN) on the Internet increase load of content... [more] |
NS2012-251 pp.499-504 |
NS, IN (Joint) |
2013-03-08 14:00 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Method for Finding Links Protected to Keep Reachability to Server during Simultaneous Two Links Failures Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-252 |
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] |
NS2012-252 pp.505-510 |
NS, IN (Joint) |
2013-03-08 13:00 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Method for Finding Links Protected against Increase of Path Length during Failures Kohei Nishida, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-265 |
A telecommunication network should be reliable, since it is important as social infrastructure. However, in many actual ... [more] |
NS2012-265 pp.583-588 |
NC, MBE (Joint) |
2011-12-20 11:20 |
Aichi |
Nagoya Institute of Technology |
Eigen Vector Descent and Line Search for Multilayer Perceptron Seiya Satoh, Ryohei Nakano (Chubu Univ.) NC2011-87 |
As learning methods of a multilayer perceptron (MLP), we have the BP algorithm, Newton's method, quasi-Newton method, an... [more] |
NC2011-87 pp.19-24 |
IN, NS (Joint) |
2011-03-03 08:40 |
Okinawa |
Okinawa Convention Center |
Method for Finding Links Protected for Network Load Balancing during Failures Akira Noguchi, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010-173 |
The internet reliability is needed as the Internet becomes an important social infrastructure. However, we face the ris... [more] |
NS2010-173 pp.57-62 |
IN, NS (Joint) |
2011-03-03 09:20 |
Okinawa |
Okinawa Convention Center |
Method for Finding Links Protected to Keep Reachability to Server during Failures Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010-175 |
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] |
NS2010-175 pp.69-74 |