| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| IN, NS (Joint) |
2011-03-04 14:10 |
Okinawa | Okinawa Convention Center | Control Method of Autonomously Formed Unstructured P2P Network Based on Usage History Keishi Ogura, Hiroyoshi Miwa (Kwansei Gakuin Univ.)  IN2010-206 |
P2P(Peer-to-Peer) network systems in contrast to client/server systems is expected in many fields such as not only file ... [more] | IN2010-206 pp.371-376 |
| NC, MBE [detail] | 2010-12-19 11:20 |
Aichi | Nagoya Univ. | Search Method Utilizing Singular Region of Multilayer Perceptron Seiya Satoh, Takayuki Ohwaki, Ryohei Nakano (Chubu Univ.) MBE2010-70 NC2010-81 |
In a search space of MLP(J), multi-layer perceptron having J hidden units, there exists a singular region created by the... [more] | MBE2010-70 NC2010-81 pp.85-90 |
| NLP, CAS | 2010-08-02 09:50 |
Tokushima | Naruto University of Education | A Calculation of Three Layer Neural Network Structures Approximating Multivariate Polynomials Yuichi Nakamura (Anan Nat. Coll. of Tech.), Masahiro Nakagawa (Nagaoka Univ. of Tech.) CAS2010-34 NLP2010-50 |
The function approximation theorem has been proved such that the suitably constructed feedforward neural networks can su... [more] | CAS2010-34 NLP2010-50 pp.11-16 |
| NC, MBE (Joint) |
2010-03-11 13:45 |
Tokyo | Tamagawa University | A Calculation of Three Layer Neural Network Structures Approximating Polynomial Functions Yuichi Nakamura, Masahiro Nakagawa (Nagaoka Univ. of Tech.) NC2009-167 |
The function approximation theorem has been proved such that the suitably constructed feedforward neural networks can su... [more] | NC2009-167 pp.467-472 |
| IT, ISEC, WBS | 2010-03-05 13:25 |
Nagano | Nagano-Engineering Campus, Shinshu University | An Efficient Random Key Pre-distribution Protocol for Multi-Phase Wireless Sensor Networks (2) Hisashige Ito, Atsuko Miyaji, Kazumasa Omote (JAIST) IT2009-109 ISEC2009-117 WBS2009-88 |
A secure multi-phase WSN has a feature that a network automatically self-heals against the node-cap- ture attack. This ... [more] |
IT2009-109 ISEC2009-117 WBS2009-88 pp.247-254 |
| ISEC, LOIS | 2009-11-13 13:25 |
Gifu | Gifu Univ. | Efficient Key Pre-distribution Protocol for Multi-Phase Wireless Sensor Networks Hisashige Ito, Atsuko Miyaji, Kazumasa Omote (JAIST) ISEC2009-66 LOIS2009-55 |
Wireless sensor network (WSN) is a network composed of a lot of wireless sensors with a little calculation resource. Th... [more] |
ISEC2009-66 LOIS2009-55 pp.101-106 |
| MSS | 2009-08-06 15:20 |
Tokyo | JAIST Tokyo Campus | Polynomial-time Algorithm for Controllability Test of Boolean Networks Koichi Kobayashi (JAIST), Jun-ichi Imura (Tokyo Inst. of Tech.), Kunihiko Hiraishi (JAIST) CST2009-14 |
This paper proposes a polynomial-time algorithm to determine if a Boolean network with control nodes and controlled node... [more] | CST2009-14 pp.13-18 |
| COMP | 2008-06-16 15:35 |
Ishikawa | JAIST | Formulas for Counting Connected Spanning Subgraphs with at Most $n+1$ Edges in Graphs $K_{n}-e$, $K_{n}\cdot e$ Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech) COMP2008-21 |
Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs in an $n$-vertex $m$-edge undirected graph $... [more] |
COMP2008-21 pp.43-48 |
| COMP | 2007-12-14 16:15 |
Hiroshima | Hiroshima University | Formulas on the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyahashi Univ. of Tech.) COMP2007-53 |
Let $N_{i}$ be the number of all connected spanning subgraphs with $i(n-1\leq i\leq m)$ edges in an $n$-vertex $m$-edg... [more] |
COMP2007-53 pp.35-42 |
| COMP | 2007-09-20 16:25 |
Aichi | A Proof of Unimodality on the Numbers of Connected Spanning Subgraphs in an $n$-Vertex Graph with at Least $\bigl\lceil(3-2\sqrt{2})n^2+n-\frac{7-2\sqrt{2}}{2\sqrt{2}}\bigr\rceil$ Edges Peng Cheng (Nagoya Gakuin Univ), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2007-40 |
Consider an undirected simple graph $G=(V,E)$ with $n$ vertices and $m$ edges, and let $N_{i}$ be the number of connecte... [more] | COMP2007-40 pp.59-66 |
|
[Return to Top Page]