Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SS, MSS |
2022-01-11 13:40 |
Nagasaki |
Nagasakiken-Kensetsu-Sogo-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
Model Reduction of Boolean Networks Based on Graph Structure Fuma Motoyama, Koichi Kobayashi, Yuh Yamashita (Hokkaido Univ.) MSS2021-36 SS2021-23 |
A Boolean network (BN) is widely used as a mathematical model for control of gene regulatory networks. Since a gene regu... [more] |
MSS2021-36 SS2021-23 pp.29-34 |
SS, MSS |
2022-01-11 14:05 |
Nagasaki |
Nagasakiken-Kensetsu-Sogo-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
Design of Self-Triggered Reduced-Order Controllers of Probabilistic Boolean Networks Using Reinforcement Learning Michiaki Takizawa, Koichi Kobayashi, Yuh Yamashita (Hokkaido Univ.) MSS2021-37 SS2021-24 |
We consider the stabilization of Probabilistic Boolean Networks using reinforcement learning. Using reinforcement learni... [more] |
MSS2021-37 SS2021-24 pp.35-39 |
SIP, CAS, VLD, MSS |
2021-07-06 11:15 |
Online |
Online |
Pinning Stabilization of Probabilistic Boolean Networks Using Reinforcement Learning Michiaki Takizawa, Koichi Kobayashi, Yuh Yamashita (Hokkaido Univ.) CAS2021-12 VLD2021-12 SIP2021-22 MSS2021-12 |
We consider the pinning stabilization of probabilistic Boolean networks using reinforcement learning. Using reinforcemen... [more] |
CAS2021-12 VLD2021-12 SIP2021-22 MSS2021-12 pp.60-63 |
MSS, CAS, IPSJ-AL [detail] |
2020-11-25 17:25 |
Online |
Online |
Data-Driven Optimal Reconstruction of Boolean Networks with Noisy Dynamics Koichi Kobayashi (Hokkaido Univ.), Yuhu Wu (Dalian Univ. of Tech.) CAS2020-25 MSS2020-17 |
A Boolean network is a mathematical model that the dynamics are represented by Boolean functions. In this paper, a metho... [more] |
CAS2020-25 MSS2020-17 pp.34-39 |
NLP, MSS (Joint) |
2019-03-15 09:25 |
Fukui |
Bunkyo Camp., Univ. of Fukui |
MSS2018-93 |
Research on network motifs has recently focused on the relationship between form and function, in the context of Boolean... [more] |
MSS2018-93 pp.65-68 |
NLP |
2018-04-26 16:25 |
Kumamoto |
Kumaoto Univ. |
Construction Methods of Probabilistic Boolean Networks Based on Imperfect Information Katsuaki Umiji, Koichi Kobayashi, Yuh Yamashita (Hokkaido Univ.) NLP2018-11 |
A probabilistic Boolean network (PBN) is one of the mathematical models of gene regulatory networks. In a Boolean networ... [more] |
NLP2018-11 pp.49-52 |
CQ |
2017-01-20 09:30 |
Osaka |
Osaka University Nakanoshima Center |
A Path Construction Scheme in Reflective Network Tomography for Node Failure Detection Naoya Kiyofuji (Osaka Univ.), Takahiro Matsuda (Osaka Univ./NICT), Shinsuke Hara (Osaka City Univ.), Kenichi Takizawa, Fumie Ono, Ryu Miura (NICT) CQ2016-97 |
Network tomography is a network monitoring method to estimate network internal characteristics from end-to-end measureme... [more] |
CQ2016-97 pp.41-46 |
CQ (2nd) |
2016-10-06 13:20 |
Nagano |
Naganoken Nokyo Building |
[Poster Presentation]
A Study on Network Failure Detection with Reflective Network Tomography Naoya Kiyofuji (Osaka Univ.), Takahiro Matsuda (Osaka Univ./NICT), Shinsuke Hara (Osaka City Univ.), Kenichi Takizawa, Fumie Ono, Ryu Miura (NICT) |
Network tomography is a technique to estimate network internal characteristics by end-to-end measurements. An adaptive B... [more] |
|
VLD, CAS, MSS, SIP |
2016-06-16 15:50 |
Aomori |
Hirosaki Shiritsu Kanko-kan |
Controllability Analysis of Boolean Networks Focusing on Attractors Koichi Kobayashi (Hokkaido Univ.) CAS2016-12 VLD2016-18 SIP2016-46 MSS2016-12 |
In this paper, based on a singleton attractor, the controllability problem of a gene regulatory network modeled by a Boo... [more] |
CAS2016-12 VLD2016-18 SIP2016-46 MSS2016-12 pp.61-66 |
MSS, CAS, SIP, VLD |
2015-06-17 09:20 |
Hokkaido |
Otaru University of Commerce |
Design of Probabilistic Boolean Networks Based on Network Structure and Steady-state Probabilities Koichi Kobayashi (Hokkaido Univ.), Kunihiko Hiraishi (JAIST) CAS2015-1 VLD2015-8 SIP2015-32 MSS2015-1 |
In this paper, we consider the problem of finding a probabilistic Boolean network (PBN) based on network structure and d... [more] |
CAS2015-1 VLD2015-8 SIP2015-32 MSS2015-1 pp.1-6 |
CQ, CS (Joint) |
2015-04-21 10:30 |
Fukuoka |
Fukuoka Institute of Technology |
Network Failure Detection with Mobility-Assisted Boolean Network Tomography Masaki Mukamoto, Takahiro Matsuda (Osaka Univ), Shinsuke Hara (Osaka City Univ), Kenichi Takizawa, Fumie Ono, Ryu Miura (NICT) CQ2015-3 |
Boolean network tomography can identify failure links/nodes in a network by solving a system of Boolean equations to rep... [more] |
CQ2015-3 pp.11-14 |
MVE, ITE-HI, HI-SIG-VR |
2011-06-29 16:15 |
Tokyo |
Sanjo Conference Hall |
An Interpretation of "the Mechanism of Meaning" by ARAKAWA+GINS(3)
-- In Order to Detect and Debug Logical Errors in Human Civilization -- Kimiaki Tokumaru (System Engineer) MVE2011-30 |
Last year, the author discussed on “What is Virtual Reality?” differentiating cases of “seeing inexistence” and those “b... [more] |
MVE2011-30 pp.85-90 |
AI |
2011-05-26 10:30 |
Tokyo |
Kwansei Gakuin Univ. Tokyo Marunouchi Campus |
Several Remarks on the Acquisition of Web-Information
-- Co-existence of Bit and Linguistic Information, and Corporal Intelligence -- Kimiaki Tokumaru (System Engineer) AI2011-1 |
The author has been investigating on the origin and mechanism of language through interdisciplinary researches. He reali... [more] |
AI2011-1 pp.1-6 |
COMP |
2009-10-16 14:50 |
Miyagi |
Tohoku University |
Algorithm for Finding Minimum Reaction Cut of Metabolic Network Takeyuki Tamura (Kyoto Univ.), Kazuhiro Takemoto (Univ. of Tokyo.), Tatsuya Akutsu (Kyoto Univ.) COMP2009-36 |
In this article, we study two problems ReactionCut and MD-ReactionCut
for calculating minimum reaction cuts of a metabo... [more] |
COMP2009-36 pp.27-34 |
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 |
MSS |
2009-08-07 10:20 |
Tokyo |
JAIST Tokyo Campus |
Analyzing Boolean Networks by Using Integer Programming Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamura (Kyoto Univ.) CST2009-17 |
The Boolean network (BN) model is known as a mathematical model of genetic networks and many studies have been done on B... [more] |
CST2009-17 pp.31-36 |
NC, NLP |
2009-07-13 15:10 |
Nara |
NAIST |
Uncorrelated inputs driven correlations in sub-Boolean Networks Chikoo Oosawa (Kyushu Inst. of Tech.) NLP2009-25 NC2009-18 |
We propose an analyzing and comparing method for 12 different sub-Boolean networks that have three nodes. By applying ra... [more] |
NLP2009-25 NC2009-18 pp.61-66 |
NLP |
2008-02-01 11:10 |
Hokkaido |
|
Analysis of Random Boolean Network Dynamics Based on One-dimensional Mapping Nobumitsu Fujiwara, Shinji Doi, Sadatoshi Kumagai (Osaka Univ.) NLP2007-145 |
The dynamics of random Boolean networks which are used to model a range
of complex phenomena is studied. The states of... [more] |
NLP2007-145 pp.19-24 |
NLP |
2007-11-22 11:30 |
Fukuoka |
|
Effects of embedded motifs on behavior of Boolean networks Chikoo Oosawa (KIT), Kazuhiro Takemoto (Kyoto Univ.) NLP2007-95 |
We show advantages of feedforward loops using Boolean network that is one of the discrete dynamical models for the trans... [more] |
NLP2007-95 pp.1-6 |
COMP |
2007-05-25 13:20 |
Fukuoka |
Kyushu University |
An O(1.787^n)-time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes Takeyuki Tamura, Tatsuya Akutsu (Kyoto Univ.) COMP2007-13 |
The Boolean network (BN) is a mathematical model of genetic networks. It is known that detecting a singleton attractor i... [more] |
COMP2007-13 pp.13-18 |