Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NLP, CAS |
2010-08-02 09:00 |
Tokushima |
Naruto University of Education |
Anti-Phase Synchronization of Switching Phenomena in Globally Coupled System of Chaotic Circuits Takuya Nishimoto, Yasuteru Hosokawa (Shikoku Univ.), Yoshifumi Nishio (Tokushima Univ.) CAS2010-32 NLP2010-48 |
There are chaotic circuits which have some attractors. On thesecircuits, random switching phenomenaof attractors can be ... [more] |
CAS2010-32 NLP2010-48 pp.1-4 |
NLP, CAS |
2010-08-02 09:25 |
Tokushima |
Naruto University of Education |
Property of an iterative method based on discretization of continuous-time image reconstruction for computed tomography Chika Ueda, Ken'ichi Fujimoto, Tetsuya Yoshinaga (Tokushima Univ.) CAS2010-33 NLP2010-49 |
For computed tomography, some of the authors have proposed a continuous-time image reconstruction (CIR) system and an it... [more] |
CAS2010-33 NLP2010-49 pp.5-9 |
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 |
NLP, CAS |
2010-08-02 10:25 |
Tokushima |
Naruto University of Education |
Slide-and-Insert Assignment Method with Chaotic Dynamics for Quadratic Assignment Problems Yusuke Sakamoto, Yoshihiko Horio (Tokyo Denki Univ.) CAS2010-35 NLP2010-51 |
A quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem. Some heuristic algorithms for the... [more] |
CAS2010-35 NLP2010-51 pp.17-22 |
NLP, CAS |
2010-08-02 10:50 |
Tokushima |
Naruto University of Education |
Effect of Chaos Noise on City Placement of Traveling Salesman Problems Yasuyuki Yoshida, Yoko Uwate, Yoshifumi Nishio (Tokusima Univ.) CAS2010-36 NLP2010-52 |
Although it would be possible to solve combinatorial optimization
problems with a huge number of elements if we have in... [more] |
CAS2010-36 NLP2010-52 pp.23-26 |
NLP, CAS |
2010-08-02 11:15 |
Tokushima |
Naruto University of Education |
Study of network structure on the searching performance of D-PSO Takahiro Tsujimoto, Takuya Shindo, Kenya Jin'no (Nippon Inst. of Tech.) CAS2010-37 NLP2010-53 |
Particle swarm optimization ( abbr. PSO ) is one of the most effective optimization alogorithms.
The PSO contains many ... [more] |
CAS2010-37 NLP2010-53 pp.27-30 |
NLP, CAS |
2010-08-02 11:40 |
Tokushima |
Naruto University of Education |
Particle Swarm Optimization Containing Plural Swarms whose Particles have Different Features Masaki Sugimoto (Tokushima Univ.), Haruna Matsushita (Hosei Univ.), Yoshifumi Nishio (Tokushima Univ.) CAS2010-38 NLP2010-54 |
This study proposes a new Particle Swarm Optimization (PSO) algorithm containing plural swarms whose particles
have dif... [more] |
CAS2010-38 NLP2010-54 pp.31-34 |
NLP, CAS |
2010-08-02 13:20 |
Tokushima |
Naruto University of Education |
Experimental Study of Mixed-Mode Oscillations in a Slow-Fast Dynamical Circuit Naohiko Inaba (Meiji Univ.), Munehisa Sekikawa (JST), Tetsuya Yoshinaga, Ken'ichi Fujimoto (Univ. of Tokushima), Takashi Tsubouchi (Univ. of Tsukuba), Tetsuro Endo (Meiji Univ.) CAS2010-39 NLP2010-55 |
In this paper, we discuss the observability of mixed-mode oscillations(MMOs) in a slow-fast dynamical circuit. Our model... [more] |
CAS2010-39 NLP2010-55 pp.35-38 |
NLP, CAS |
2010-08-02 13:45 |
Tokushima |
Naruto University of Education |
Remarkable resemblances between two pair of stable and saddle canards Munehisa Sekikawa (JST), Naohiko Inaba (Meiji Univ.), Tetsuya Yoshinaga (Univ. of Tokushima), Kazuyuki Aihara (Univ. of Tokyo/JST) CAS2010-40 NLP2010-56 |
[more] |
CAS2010-40 NLP2010-56 pp.39-42 |
NLP, CAS |
2010-08-02 14:10 |
Tokushima |
Naruto University of Education |
Functional Connectivity Patterns Organized through STDP in Recurrent Networks Hideyuki Kato, Tohru Ikeguchi (Saitama Univ.) CAS2010-41 NLP2010-57 |
In this report, we investigated the functional connectivity in recurrent networks organized through spike-timing-depende... [more] |
CAS2010-41 NLP2010-57 pp.43-48 |
NLP, CAS |
2010-08-02 14:45 |
Tokushima |
Naruto University of Education |
A Study on Global and Local Maxima of the Clustering Coefficient Saki Koizuka, Norikazu Takahashi (Kyushu Univ.) CAS2010-42 NLP2010-58 |
The clustering coefficient is one of the most important indices characterizing complex networks. It is often said that m... [more] |
CAS2010-42 NLP2010-58 pp.49-54 |
NLP, CAS |
2010-08-02 15:10 |
Tokushima |
Naruto University of Education |
Circuit Implementation of an A/D Converter Based on the Scale-Adjusted β-Map Using a Discrete-Time Integrator Yoshihiko Horio (Tokyo Denki Univ.), Tohru Kohda (Kyushu Univ.), Kazuyuki Aihara (Univ. of Tokyo.) CAS2010-43 NLP2010-59 |
The beta-converter is robust against
errors in the quantizer threshold value like the
Sigma-Delta-type converters, and... [more] |
CAS2010-43 NLP2010-59 pp.55-60 |
NLP, CAS |
2010-08-02 15:35 |
Tokushima |
Naruto University of Education |
Method of Computer Assisted Proof for Dirichelet Problem of Nonlinear Elliptic Equations Shin'ichi Oishi, Akitoshi Takayasu (Waseda Univ.), Takatoshi Kubo (Tsukuba univ.) CAS2010-44 NLP2010-60 |
[more] |
CAS2010-44 NLP2010-60 pp.61-64 |
NLP, CAS |
2010-08-02 16:10 |
Tokushima |
Naruto University of Education |
[Invited Talk]
Frustration in Synchronized Calling Behavior of Japanese Tree Frogs Ikkyu Aihara (Kyoto Univ.) CAS2010-45 NLP2010-61 |
[more] |
CAS2010-45 NLP2010-61 pp.65-68 |
NLP, CAS |
2010-08-02 17:10 |
Tokushima |
Naruto University of Education |
[Invited Talk]
Some Problems on Nonlinear LC Circuits Hiroshi Kawakami CAS2010-46 NLP2010-62 |
A simple LC circuit is defined as a fundamental oscillatory circuit, if it has no L(or C) only cut-set and L(or C) only ... [more] |
CAS2010-46 NLP2010-62 pp.69-72 |
NLP, CAS |
2010-08-03 09:00 |
Tokushima |
Naruto University of Education |
An Experimental Study on Mechanical Model for Understanding Power System Stability Yuko Omagari, Tsuyoshi Funaki (Osaka Univ.) CAS2010-47 NLP2010-63 |
It is difficult to understand the power system behavior intuitively due to its invisibility. The equivalent mechanical m... [more] |
CAS2010-47 NLP2010-63 pp.73-78 |
NLP, CAS |
2010-08-03 09:25 |
Tokushima |
Naruto University of Education |
Sharp Heuristic Algorithms for Extracting a Maximum Induced Tree from a Graph Hiroyuki Yoshida, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2010-48 NLP2010-64 |
The problem of extracting a maximum induced tree of a graph (MAXIT), asks for a vertex set of largest cardinality among ... [more] |
CAS2010-48 NLP2010-64 pp.79-84 |
NLP, CAS |
2010-08-03 10:30 |
Tokushima |
Naruto University of Education |
Coexistence Phenomenon in Globally Coupled Logistic Maps Involving Parametric Force Hironori Kumeno, Yoshifumi Nishio (Tokushima Univ.), Daniele Fournier-Prunaret (Toulouse Univ.) CAS2010-49 NLP2010-65 |
[more] |
CAS2010-49 NLP2010-65 pp.85-88 |
NLP, CAS |
2010-08-03 10:30 |
Tokushima |
Naruto University of Education |
Oscillatory Phenomena Depending on Network Topology of Two Template CNN Junji Fujii (Tokushima Univ.), Yasuteru Hosokawa (Shikoku Univ.), Yoshifumi Nishio (Tokushima Univ.) CAS2010-50 NLP2010-66 |
In our previous study, we have proposed a Two-Template CNN. This system can generate some kinds of oscillatory phenomena... [more] |
CAS2010-50 NLP2010-66 pp.89-92 |
NLP, CAS |
2010-08-03 10:30 |
Tokushima |
Naruto University of Education |
Template Design of CNN by BP with Annealing Noise Masashi Nakagawa, Yoko Uwate, Yoshifumi Nishio (Tokushima Univ.) CAS2010-51 NLP2010-67 |
In previous study, we proposed template design method of cellular neural networks with back propagation algorithm.
In t... [more] |
CAS2010-51 NLP2010-67 pp.93-98 |