Hideo Minamihara
Okayama University of Science
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hideo Minamihara.
Electronics and Communications in Japan Part Iii-fundamental Electronic Science | 2000
Masayoshi Nakamoto; Hideo Minamihara; Mitsuo Ohta
It is extremely difficult to carry out a rigorous theoretical evaluation of the peak value distribution in the maximum-value statistical analysis of random signals because second derivative information is needed in addition to the instantaneous value and the first derivative. On the other hand, the number of level crossings can be evaluated with only the first derivative information, and hence a theoretical evaluation equation that can be applied regardless of the amplitude distribution and the frequency characteristics is explicitly derived. In this paper, a function is derived to evaluate theoretically the relationship between the expected number of signal crossings of a certain level and the number of peaks exceeding this level under the condition of Gaussian distribution. The non-Gaussian nature of the amplitude distribution is reflected in this function and is coupled to a conventional non-Gaussian level-crossing evaluation equation, allowing the practical peak value distribution analysis of broadband non-Gaussian arbitrary random signals. Finally, the validity of the evaluation equation is confirmed by digital simulation.
network-based information systems | 2014
Kengo Katayama; Yuto Akagi; Elis Kulla; Hideo Minamihara; Noritaka Nishihara
We consider a problem of finding an optimal node placement that minimizes the amount of traffic by reducing the weighted hop distances in multihop networks. The problem is called Node Placement Problem (NPP) and is one of the most important issues in multihop networks. NPP is known to be NP-hard. Therefore, several heuristic and metaheuristic algorithms have been proposed for optimizing NPP. Recently we proposed Iterated k-swap Local Search (IKLS) algorithm, which showed better performance than previous metaheuristic algorithms proposed by other researchers. IKLS simply consists of k-swap local search and a kick (mutation or perturbation) operator called Cross-Kick, a method that aims to escape from local optima. In this paper we focus on the kick operators in order to improve the performance of IKLS for NPP. New kick operators are presented and their effectivities are shown through computational experiments on the benchmark instances of NPP. The results show that IV-Kick with Rhombus is more effective than Cross-Kick and other kick operators, particularly for large-scaled instances.
The Journal of The Acoustical Society of Japan (e) | 1995
Hideo Minamihara; Mitsuo Ohta; Masafumi Nishimura; Yoshiaki Takakuwa
情報科学技術フォーラム講演論文集 | 2013
Yuto Akagi; Kengo Katayama; Hideo Minamihara; Noritaka Nishihara
acm symposium on applied computing | 2011
Kengo Katayama; Akinori Kohmura; Keiko Kohmoto; Hideo Minamihara
The bulletin of the Okayama University of Science. A, Natural science | 2009
Akinori Koumura; Kengo Katayama; Hideo Minamihara; Hiroyuki Narihisa
The bulletin of the Okayama University of Science. A, Natural science | 2007
Fumiyoshi Nishino; Kengo Katayama; Hideo Minamihara; Hiroyuki Narihisa
The bulletin of the Okayama University of Science. A, Natural science | 2007
Koushirou Hayashi; Kengo Katayama; Hideo Minamihara; Hiroyuki Narihisa
The bulletin of the Okayama University of Science. A, Natural science | 2006
Masashi Sadamatsu; Kengo Katayama; Hideo Minamihara; Hiroyuki Narihisa
The bulletin of the Okayama University of Science. A, Natural science | 2005
Takahiro Taniguchi; Kengo Katayama; Hideo Minamihara; Hiroyuki Narihisa