Faculty Profiles - ONO Hirotaka

Papers - ONO Hirotaka

Division display 221 - 236 of about 236 ／ All the affair displays >>

センサーネットワークにおける省電力高信頼なデータ伝送(計算機科学の理論とその応用)

佐薙光樹, 小野廣隆, 定兼邦彦[他]

数理解析研究所講究録 Vol. 1554 page： 264-268 2007.5

Graph orientation algorithms to minimize the maximum outdegree Reviewed

Asahiro Yuichi, Miyano Eiji, Ono Hirotaka, Zenmyo Kouhei

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE Vol. 18 ( 2 ) page： 197-215 2007.4

Failure Detectors for Solving k-Set Agreement

SAKATA Atsushi, ONO Hirotaka, SADAKANE Kunihiko, YAMASHITA Masafumi

IEICE technical report Vol. 106 ( 566 ) page： 1-6 2007.3

Language：Japanese Publishing type：Research paper (scientific journal)

Failure detectors are distributed oracles that provide each process with information about failures of other processes in distributed systems. It is known that many problems are unsolvable in asynchronous distributed systems if crash failures occur. For such unsolvable problems, failure detectors can be used to make them solvable. How strong information failure detectors should provide, that is, the weakest failure detectors for a certain problem are intensively studied from both theoretical and practical viewpoints. In this paper, we propose two new failure detectors classes, (k-Ω,Σ) and (Ω,Σ_k>), for solving k-Set Agreement problem, where both are generalizations of (Ω,Σ) that is a class of the weakest failure detectors for consensus problem. Furthermore, we consider the reducibility between these failure detector classes and another failure detector class, (Ω^k,Σ), which is also proposed for k-Set Agreement in a related study.

Collecting Moving Objects

ASAHIRO Yuichi, ONO Hirotaka, MIYANO Eiji, YAMASHITA Masafumi

The Journal of the Institute of Electronics, Information and Communication Engineers Vol. 90 ( 3 ) page： 245-247 2007.2

Exploration of Scale-Free Graphs with Degree Information

Kurumida Yuichi, Ono Hirotaka, Sadakane Kunihiko, Yamashita Masafumi

Record of Joint Conference of Electrical and Electronics Engineers in Kyushu Vol. 2007 ( 0 ) page： 95-95 2007

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree Reviewed

Asahiro Yuichi, Jansson Jesper, Miyano Eiji, Ono Hirotaka, Zenmyo Kouhei

ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS Vol. 4508 page： 167-+ 2007

Approximation Ratio of Algorithms for Constructing Evolutionary Trees from Rooted Triplets

Maemura Kazuya, Ono Hirotaka, Sadakane Kunihiko, Yamashita Masafumi

Record of Joint Conference of Electrical and Electronics Engineers in Kyushu Vol. 2007 ( 0 ) page： 85-85 2007

Thermodynamically DNA Sequences Design based on Local Search

Kawashimo Suguru, Ono Hirotaka, Sadakane Kunihiko, Yamashita Masafumi

Record of Joint Conference of Electrical and Electronics Engineers in Kyushu Vol. 2007 ( 0 ) page： 93-93 2007

On approximation of bookmark assignments Reviewed

Asahiro Yuichi, Miyano Eiji, Murata Toshihide, Ono Hirotaka

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS Vol. 4708 page： 115-+ 2007

Drawing borders efficiently Reviewed

Iwama Kazuo, Miyano Eiji, Ono Hirotaka

FUN WITH ALGORITHMS, PROCEEDINGS Vol. 4475 page： 213-+ 2007

How to collect balls moving in the Euclidean plane Reviewed

Asahiro Yuichi, Horiyama Takashi, Makino Kazuhisa, Ono Hirotaka, Sakuma Toshinori, Yamashita Masafumi

DISCRETE APPLIED MATHEMATICS Vol. 154 ( 16 ) page： 2247-2262 2006.11

DNA Sequence Design by Dynamic Neighborhood Searches

KAWASHIMO Suguru, ONO Hirotaka, SADAKANE Kunihiko, YAMASHITA Masafumi

IEICE technical report Vol. 106 ( 63 ) page： 47-54 2006.5

Language：Japanese Publishing type：Research paper (scientific journal)

In recent years, DNA sequence sets are used in various fields such as nanotechnology and nanocomputing. Since there are several applications using the sequence sets, the sequence sets need to satisfy several constraints depending on the applications. Since several constraints are combinatorial, we consider the sequence sets design problem where the sequence sets are used to solve combinatorial problems. For the purpose, we focus on the overlapping measure which is more combinatorial than other constraints. Then, we propose a local-search based approximation algorithm. To deal with this, we adopt a dynamic neighorhood search frame work, called Variable Neighborhood Search and Variable Depth Search. The computational experiments show that generated sequence sets are as good as the ones generated by exiting methods, or better.

DNA Sequence Desgin Using Hidden Markov Models

MAEMURA Kazuya, ONO Hirotaka, SADAKANE Kunihiko, YAMASHITA Masafumi

IEICE technical report Vol. 106 ( 63 ) page： 39-46 2006.5

Language：Japanese Publishing type：Research paper (scientific journal)

DNA computing is a new computation paradigm to take reaction process of DNA as computation. The design of DNA sequence is a one of crucial research topics in DNA computing. We have to prepare DNA sequences that satisfy many constraints to react DNA as we expected. In our research, we propose sequence design using Hidden Markov Models. Hidden Markov Model is a stochastic model utilizing Markov process. In this paper, as a test of this method, we show experiments and their results of sequence design of DNA whose minimum free energy is small.

DNA sequence design by dynamic neighborhood searches Reviewed

Kawashimo Suguru, Ono Hirotaka, Sadakane Kunihiko, Yamashita Masafumi

DNA COMPUTING Vol. 4287 page： 157-+ 2006

Forest search: A paradigm for faster exploration of scale-free networks Reviewed

Kurumida Yuichi, Ono Hirotaka, Sadakane Kunihiko, Yamashita Masafumi

PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS Vol. 4330 page： 39-+ 2006

A probabilistic model of the DNA conformational change Reviewed

Shiozaki Masashi, Ono Hirotaka, Sadakane Kunihiko, Yamashita Masafumi

DNA COMPUTING Vol. 4287 page： 274-+ 2006

　 PREV - NEXT 　

<ONO Hirotaka>

Papers - ONO Hirotaka