IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 30  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
CCS 2023-11-12
10:25
Toyama Toyama Prefectural University Analysis of a simple network topology for optimizer based on spiking-neural oscillator networks
Tomoyuki Sasaki (SIT), Hidehiro Nakano (TCU) CCS2023-34
Optimizer based on Spiking Neural-oscillator Networks (OSNNs) are one of the deterministic PSO methods, which are based ... [more] CCS2023-34
pp.53-57
EMCJ 2023-01-27
15:50
Okayama WASHU BLUE RESORT
(Primary: On-site, Secondary: Online)
Investigation of Applicable Types of DC-DC Converters to Noise-source Equivalent-circuit Model for Conducted-noise Prediction
Yanyu Jin, Shuqi Zhang, Kengo Iokibe, Yoshitaka Toyota (Okayama Univ.) EMCJ2022-89
We have so far proposed a noise-source equivalent-circuit model for predicting conducted noise from a DC-DC converter. T... [more] EMCJ2022-89
pp.93-98
CCS 2022-11-18
16:00
Mie
(Primary: On-site, Secondary: Online)
Investigation for the coupling interactions in swarm intelligence algorithm based on spiking neural-oscillator networks
Tomoyuki Sasaki (SIT), Hidehiro Nakano (TCU) CCS2022-60
Optimizer based on Spiking Neural-oscillator Networks (OSNNs) are deterministic swarm intelligence algorithms which intr... [more] CCS2022-60
pp.85-90
CCS, NLP 2022-06-10
15:55
Osaka
(Primary: On-site, Secondary: Online)
Swarm intelligence algorithm based on spiking neural-oscillator networks, coupling interactions and solving performances
Tomoyuki Sasaki (SIT), Hidehiro Nakano (TCU) NLP2022-22 CCS2022-22
Optimizer based on spiking neural-oscillator networks (OSNN) are one of the deterministic swarm intelligence
algorithms... [more]
NLP2022-22 CCS2022-22
pp.111-116
MBE, NC
(Joint)
2022-03-02
11:00
Online Online Learning of a stacked autoencoder with regularizers added to the cost function, evaluation of their effectiveness, and clarification of its information compression mechanism
Masumi Ishikawa (Kyutech) NC2021-49
Deep learning has a serious drawback in that the resulting models tend to be a black box, hence hard to understand. A sp... [more] NC2021-49
pp.17-22
NLP, MICT, MBE, NC
(Joint) [detail]
2022-01-23
12:10
Online Online Deep learning of mixture of continuous and categorical data with regularizers added to the cost function and evaluation of the effectiveness of sparse modeling
Masumi Ishikawa (Kyutech) NC2021-45
Deep learning has a serious drawback in that the resulting models tend to be a black box, hence hard to understand. A sp... [more] NC2021-45
pp.65-70
NLP 2021-12-17
10:00
Oita J:COM Horuto Hall OITA Basic performances of a swarm intelligence algorithm based on spiking oscillator networks
Tomoyuki Sasaki (SIT), Hidehiro Nakano (TCU) NLP2021-43
Spiking oscillator networks are simply coupling systems of plural spiking oscillators, which generate various synchroniz... [more] NLP2021-43
pp.1-6
NLP 2021-12-18
13:00
Oita J:COM Horuto Hall OITA A Study on the Solution Finding Ability of PSO Considering Micro Perturbations
Riku Takato, Kenya Jin'no (Tokyo City University) NLP2021-61
The Particle Swarm Optimization (PSO) method is one of the heuristic methods to search for the optimal value of a black ... [more] NLP2021-61
pp.82-85
SP, EA, SIP 2020-03-02
13:00
Okinawa Okinawa Industry Support Center
(Cancelled but technical report was issued)
Vulnerability investigation of speaker verification against black-box adversarial attacks
Hiroto Kai, Sayaka Shiota, Hitoshi Kiya (TMU) EA2019-106 SIP2019-108 SP2019-55
Recently,vulnerability against adversarial attacks is being feared for machine learning-based systems.Adversarial attack... [more] EA2019-106 SIP2019-108 SP2019-55
pp.29-33
SP, EA, SIP 2020-03-02
13:00
Okinawa Okinawa Industry Support Center
(Cancelled but technical report was issued)
[Poster Presentation] High-precision modeling of distortion stomp box by deep learning using spectral features
Kento Yoshimoto, Daichi Kitahara, Akira Hirabayashi (Ritsumeikan Univ.) EA2019-124 SIP2019-126 SP2019-73
We propose a method for modeling distortion stomp box with high accuracy using a deep neural network, WaveNet. The conve... [more] EA2019-124 SIP2019-126 SP2019-73
pp.135-140
NC, MBE 2019-12-06
15:40
Aichi Toyohashi Tech Prevention of redundant representations and of the black box in stacked autoencoders
Masumi Ishikawa (Kyutech) MBE2019-56 NC2019-47
Recent progress in deep learning (DL) is remarkable and its recognition capability is said to surpass that of humans. Th... [more] MBE2019-56 NC2019-47
pp.67-72
COMP 2019-03-18
13:45
Tokyo The University of Tokyo [Invited Talk] Non-Black-Box Worst-Case to Average-Case Reductions within NP
Shuichi Hirahara (Univ. Tokyo) COMP2018-49
There are significant obstacles to establishing an equivalence between the worst-case and average-case hardness of NP: S... [more] COMP2018-49
p.43
IMQ, IE, MVE, CQ
(Joint) [detail]
2019-03-14
17:10
Kagoshima Kagoshima University [Invited Talk] Pattern Optimization Using Evolutionary Computation
Satoshi Ono (Kagoshima Univ.) IMQ2018-51 IE2018-135 MVE2018-82
This study focuses Evolutionary Computation (EC) that is a black-box optimization framework for non-differentiable, glob... [more] IMQ2018-51 IE2018-135 MVE2018-82
pp.165-171
HWS, ISEC, SITE, ICSS, EMM, IPSJ-CSEC, IPSJ-SPT [detail] 2018-07-25
14:10
Hokkaido Sapporo Convention Center [Invited Talk] Memory Lower Bounds of Reductions Revisited (from EUROCRYPT 2018)
Yuyu Wang (Tokyo Tech/AIST/IOHK), Takahiro Matsuda, Goichiro Hanaoka (AIST), Keisuke Tanaka (Tokyo Tech) ISEC2018-24 SITE2018-16 HWS2018-21 ICSS2018-27 EMM2018-23
In this invited talk, we introduce the paper, “ Memory Lower Bounds of Reductions Revisited ” by Y. Wang, T. Matsuda, G.... [more] ISEC2018-24 SITE2018-16 HWS2018-21 ICSS2018-27 EMM2018-23
p.93
MBE, NC, NLP
(Joint)
2018-01-27
10:20
Fukuoka Kyushu Institute of Technology Nonlinear map model optimization method
Kenya Jin'no (NIT) NLP2017-95
In this article, we propose a nonlinear map-model optimization (abbr. NMO) method. The NMO consists of some particle who... [more] NLP2017-95
pp.51-54
ISEC 2015-05-15
16:35
Tokyo Kikai-Shinko-Kaikan Bldg. [Invited Talk] Black-Box Separations for One-More (Static) Problems and Its Generalization
Jiang Zhang, Zhenfeng Zhang, Yu Chen, Yanfei Guo (CAS), Zongyang Zhang (AIST) ISEC2015-7
We will present our ASIACRYPT 2014 paper about the hardness of one-more problems. As previous works only deal with one-m... [more] ISEC2015-7
p.41
ISEC 2014-12-19
16:25
Tokyo Kikai-Shinko-Kaikan Bldg. [Invited Talk] Round-Efficient Black-Box Construction of Composable Multi-Party Computation
Susumu Kiyoshima (NTT) ISEC2014-74
We talk about our paper that appeared in CRYPTO 2014.In that paper, we present a round-efficient black-box construction ... [more] ISEC2014-74
p.23
ICSS, ISEC, SITE, EMM, IPSJ-CSEC, IPSJ-SPT [detail] 2014-07-04
13:50
Hokkaido San-Refure Hakodate A Case Study on Light-weight URL Blacklist Generation based on Sandbox Analysis
Mitsuhiro Hatada, Takanori Inazumi, Jun Arikawa, Yasuyuki Tanaka (NTT Communications) ISEC2014-44 SITE2014-39 ICSS2014-48 EMM2014-44
In order to detect the malware infection in internal network, we focus on HTTP traffic to the Internet. URL blacklist is... [more] ISEC2014-44 SITE2014-39 ICSS2014-48 EMM2014-44
pp.309-314
COMP, IPSJ-AL 2013-05-17
13:35
Hokkaido Otaru University of Commerce Query Complexity of Witness Finding
Akinori Kawachi (Tokyo Inst. of Tech.), Benjamin Rossman (NII), Osamu Watanabe (Tokyo Inst. of Tech.) COMP2013-11
For any polynomial-time relation L subset_of {0,1}^m x {0,1}^n where n = m^{O(1)}, the classic search-to-decision reduct... [more] COMP2013-11
pp.39-46
ISEC 2012-12-12
16:30
Tokyo Kikai-Shinko-Kaikan Bldg. [Invited Talk] On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
Goichiro Hanaoka, Takahiro Matsuda (AIST), Jacob Schuldt (RHUL) ISEC2012-79
In this invited talk, we introduce the lecture with the same title presented at the 32nd International Cryptology Confer... [more] ISEC2012-79
p.43
 Results 1 - 20 of 30  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan