Faculty Profiles - FUJIWARA Akihiro

Papers - FUJIWARA Akihiro

Division display >> ／ All the affair displays1 - 81 of about 81

An asynchronous P system with improved branch and bound for solving the minimum Steiner tree Reviewed International journal

Ueno R., Fujiwara A.

Proceedings 2024 12th International Symposium on Computing and Networking Workshops Candarw 2024 236 - 239 2024.11

An asynchronous P system with branch and bound for the minimum Steiner tree Reviewed International journal

Ueno Reo, Fujiwara Akihiro

International Journal of Networking and Computing ( IJNC Editorial Committee ) 14 ( 2 ) 248 - 261 2024.07

Authorship：Last author,　Corresponding author Language：English Publishing type：Research paper (scientific journal)

Membrane computing, also known as a P system, is a computational model inspired by the activity of living cells. P systems work in a polynomial number of steps, and several have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction in the number of membranes must be considered in order to make a P system a more realistic model. In the present paper, we propose an asynchronous P system using branch and bound to solve the minimum Steiner tree problem. The proposed P system solves for the minimum Steiner tree with n vertices and m edges in O(n^2) parallel steps or O(2^mn^2) sequential steps. We evaluate the number of membranes used in the proposed P system through experimental simulations. Our experimental results show the validity and efficiency of the proposed P system.

DOI： 10.15803/ijnc.14.2_248

Kyutacar

CiNii Research

Other Link： https://kyutech.repo.nii.ac.jp/records/2001160

An asynchronous P system for solving the minimum Steiner tree with branch and bound Reviewed

Ueno R., Fujiwara A.

Proceedings - 2023 11th International Symposium on Computing and Networking Workshops, CANDARW 2023 128 - 134 2023.11

An asynchronous P system with the Bron-Kerbosch algorithm for solving the maximum clique Reviewed International journal

Noguchi Takuya, Fujiwara Akihiro

International Journal of Networking and Computing ( IJNC Editorial Committee ) 13 ( 2 ) 131 - 148 2023.07

Authorship：Last author,　Corresponding author Language：English Publishing type：Research paper (scientific journal)

Membrane computing, which is also known as a P system, is a computational model inspired by the activity of living cells. Several P systems, which work in a polynomial number of steps, have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction of the number of membranes must be considered in order to make a P system a more realistic model.

In the present paper, we propose asynchronous P systems based on the Bron-Kerbosch algorithm for solving the maximum clique problem with fewer membranes. The proposed P systems solve the maximum clique with n vertices in O(n^2) parallel steps or O(n^2 2^n) sequential steps.

We evaluate the number of membranes used in the proposed P systems by comparing with the numbers of membranes used in known P systems. Our experimental results demonstrate the validity and efficiency of the proposed P systems.

DOI： 10.15803/ijnc.13.2_131

CiNii Research

Robustness proofs for asynchronous P systems Reviewed International journal

Tojima N., Fujiwara A.

10th International Symposium on Applied Engineering and Science (SAES2022) 2022.12

Robust optimization algorithms for multi-objective knapsack problem Reviewed International journal

Miyamoto T., Fujiwara A.

13th International Workshop on Advances in Networking and Computing 2022.11

An asynchronous P system for solving the maximum clique problem with the Bron-Kerbosch algorithm Reviewed International journal

Noguchi T., Fujiwara A.

4th International Workshop on Parallel and Distributed Algorithms and Applications 2022.11

An asynchronous P system with a DPLL algorithm for solving SAT Reviewed International journal

Noguchi Takuya, Fujiwara Akihiro

International Journal of Networking and Computing ( IJNC Editorial Committee ) 12 ( 2 ) 238 - 252 2022.07

Authorship：Corresponding author Language：English Publishing type：Research paper (scientific journal)

Membrane computing, which is also known as P system, is a computational model inspired by the activity of living cells. Several efficient P systems, which work in a polynomial number of steps, have been proposed for solving computationally hard problems. However, most of the proposed algorithms use an exponential number of membranes, and reduction of the number of membranes must be considered in order to make the P system a more realistic model.

In the present paper, we propose an asynchronous P system with a Davis-Putnam-Logemann-Loveland (DPLL) algorithm, which is a set of rules for solving a satisfiability problem (SAT) efficiently, in an attempt to reduce the number of membranes. The proposed P system solves SAT with n variables and m clauses in O(mn2) parallel steps or O(mn22n) sequential steps.

We evaluate the number of membranes used in the proposed P system by comparison with the number of membranes used in known P systems. The experimental result demonstrates the validity and efficiency of the proposed P system.

DOI： 10.15803/ijnc.12.2_238

CiNii Research

Robust asynchronous P systems for basic operations Reviewed International journal

N. Tojima, A. Fujiwara

Symposium on Computational Science (CSCI-ISCS) 2021.12

An asynchronous P system with branch and bound for solving the subset sum problem Reviewed International journal

Nagao K., Fujiwara A.

Proceedings - 2021 9th International Symposium on Computing and Networking Workshops, CANDARW 2021 241 - 247 2021.11

An asynchronous P system with a DPLL algorithm for solving a satisfiability problem Reviewed International journal

Noguchi T., Fujiwara A.

Proceedings - 2021 9th International Symposium on Computing and Networking, CANDAR 2021 155 - 161 2021.11

Population protocol for the multi-objective knapsack problem Reviewed International journal

C. Kaneko, A. Fujiwara

International Conference on Scientific Computing (in conjunction with CSCE'21) 2021.07

An asynchronous P system for bitonic sort Reviewed International journal

K. Nagao, A. Fujiwara

International Conference on Foundations of Computer Science (in conjunction with CSCE'21) 2021.07

Robust asynchronous P systems for basic operations Reviewed International journal

Tojima N., Fujiwara A.

Proceedings - 2021 International Conference on Computational Science and Computational Intelligence, CSCI 2021 592 - 597 2021.01

An asynchronous P system using branch and bound for maximum independent set

2020.11

An asynchronous P system for counting sort Reviewed

Nagao K., Fujiwara A.

Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020 430 - 434 2020.11

An asynchronous P system with branch and bound for solving the knapsack problem Reviewed

Nakano Y., Fujiwara A.

Proceedings - 2020 8th International Symposium on Computing and Networking Workshops, CANDARW 2020 230 - 236 2020.11

P systems with branch and bound for solving two hard graph problems Reviewed

Umetsu Kotaro, Fujiwara Akihiro

International Journal of Networking and Computing ( IJNC Editorial Committee ) 10 ( 2 ) 159 - 173 2020.01

Authorship：Corresponding author Language：English Publishing type：Research paper (scientific journal)

Membrane computing is a computational model based on activity of cells. Using the membrane computing, a number of computationally hard problems have been solved in a polynomial number of steps using an exponential number of membranes. However, the number of membranes denotes the number of cells from practical point of view, and the reduction of the number of membranes must be considered for using the membrane computing in real world.

In this paper, we propose asynchronous P systems with branch and bound for reducing the number of membranes for two computationally hard graph problems. We first propose an asynchronous P system that solves Hamiltonian cycle problem for a graph with n vertices, and show that the proposed P system works in O(n^2) parallel steps. We next propose an asynchronous P system that solves the minimum graph coloring for a graph with n vertices, and also show that the P system works in O(n^2) parallel steps.

In addition, we evaluate validity of the proposed P systems using computational simulations. The experimental results show the validity and efficiency of the proposed P systems with branch and bound.

DOI： 10.15803/ijnc.10.2_159

CiNii Article

CiNii Research

Other Link： https://ci.nii.ac.jp/naid/130007878671

Population-based Search Relying on Spatial and/or Temporal Scale-free Behaviors of Individuals Reviewed International journal

2019.12

Strawberry optimization for multi-objective knapsack problem Reviewed

2019.11

An asynchronous P system using branch and bound for minimum graph coloring Reviewed

Umetsu K., Fujiwara A.

Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019 242 - 248 2019.11

An asynchronous P system with branch and bound for solving Hamiltonian cycle problem Reviewed

Fujiwara A., Umetsu K., Nozato F.

Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019 256 - 259 2019.11

An asynchronous P system with branch and bound for solving the satisfiability problem Reviewed

Jimen Yuki, Fujiwara Akihiro

IJNC 8 ( 2 ) 141 - 152 2018.07

An asynchronous P system using branch and bound for the satisfiability problem Reviewed

408 - 413 2017.12

A firefly optimization for a connected dominating set in a sensor network Reviewed

594 - 596 2017.12

Solving subset sum problem using EN P system with active membrane Reviewed

T. Shiiba, A. Fujiwara

Joint 8th International Conference on Soft Computing and Intelligent Systems and 17th International Symposium on Advanced Intelligent Systems 886 - 891 2016.08

Asynchronous P systems for hard graph problems Reviewed

K. Tanaka, A. Fujiwara

International Journal of Networking and Computing 4 ( 1 ) 2 - 22 2014.01

Asynchronous P systems for maximum independent set and related graph problems Reviewed

K. Tanaka, A. Fujiwara

15th Workshop on Advances in Parallel and Distributed Computational Models 2013.05

Centralized algorithms for the connected target coverage in wireless sensor networks Reviewed

T. Shimokawa, A. Fujiwara

4th International Workshop on Parallel and Distributed Algorithms and Applications 2012.12

Asynchronous SN P systems for sorting Reviewed

S. Aoki, A. Fujiwara

4th International Workshop on Parallel and Distributed Algorithms and Applications 2012.12

Asynchronous P systems for graph coloring problems Reviewed

K. Tanaka, A. Fujiwara

4th International Workshop on Parallel and Distributed Algorithms and Applications 2012.12

Solving SAT and Hamiltonian cycle problem using asynchronous P systems Reviewed

H. Tagawa, A. Fujiwara

IEICE TRANSACTIONS on Information and Systems E95-D ( 3 ) 746 - 754 2012.03

Asynchronous P systems for arithThe fault tolerant connected sensor cover algorithm for discrete targetsmetic operations and factorization

1st International Workshop on Networking, Computing, Systems, and Software 52 - 53 2011.11

Asynchronous P systems for arithmetic operations and factorization Reviewed

214 - 220 2011.11

Logic and arithmetic operations wiht a constant number of steps in membrane computing Reviewed

A. Fujiwara, T. Tateishi

International Journal of Foundations of Computer Science ２２ ( ３ ) ５４７ - 564 2011.03

Asynchronous P systems for SAT and Hamiltonian Cycle Problem Reviewed

K. Ishii,A. Fujiwara,H. Tagawa

World Congress on Nature and Biologically Inspired Computing 520 - 526 2010.12

Arithmetic Operations and Factorization in Membrane Computing Reviewed

A. Kambe,A. Fujiwara

The 13th Japan-Korea Joint Workshop on Algorithms and Computation 124 - 131 2010.07

Distributed Algorithms for 2-Connected Sensor Cover in Sensor Network Reviewed

K. Nakamoto,A. Fujiwara

Proceedings of the International Conference on Wireless Networks 2010.07

Dictionary operations in membrane computing Reviewed

H. Tagawa,A. Fujiwara

Proceedings of the International Conference on Foundations of Computer Science 2009.07

Procedures for floating point operations with DNA molecules Reviewed

Y. Tokumaru,A. Fujiwara

Proceedings of the International Conference on Foundations of Computer Science 2009.07

Computation wiht a constant number of steps in membrane computing Reviewed

A. Fujiwara,T. Tateishi

Proceedings of 11th Workshop on Advances in Parallel and Distributed Computational Models 2009.05

An access point selection algorithm for heterogeneous stations Reviewed

Y. Sagara,A. Fujiwara

The 2008 International Conference on Wireless Networks 2008.07

Procedures for computing the maximum with DNA Reviewed

A. Fujiwara,S. Kamio,A. Takehara

International Journal of Foundations of Computer Science 18 ( 3 ) 475 - 493 2007.04

Access point selection algorithms for maximizing throughputs in wireless LAN environment Reviewed

A. Fujiwara,Y. Sagara,M. Nakamura

International Conference on Parallel and Distributed Systems 2007.04

Data structures for storing binary numbers in DNA computing Reviewed

T. Tateishi,A. Fujiwara

International Conference on Foundations of Computer Science 2007.04

Procedures multiplication and division in DNA computing Reviewed

H. Fukagawa,A. Fujiwara

The International Conference on Foundations of Computer Science 2006.06

A procedure for MAX-SAT with DNA strands Reviewed

Y. Tokumaru,A. Fujiwara

The International Conference on Foundations of Computer Science 2006.06

A cost optimal parallel algorithm for patience sorting Reviewed

T. Nakashima,A. Fujiwara

Parallel Processing Letters 16 ( 1 ) 39 - 51 2006.01

Analysis of access point selection strategy in wireless LAN Reviewed

Y. Fukuda,A. Fujiwara,M. Tsuru,Y. Oie

roceedings of IEEE 62nd Semiannual Vehicular Technology Conference (VTC2005-fall) 25 - 28 2005.04

A Procedure for Computing 0-1 Integer Programming with DNA Strands Reviewed

K. Atsuyama,A. Fujiwara

Proceedings of the International Conference on Foundations of Computer Science 125 - 134 2005.04

Sorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands Reviewed

M. Ushijima,A. Fujiwara

Proceedings of the International Conference on Foundations of Computer Science 52 - 58 2005.04

A scheduling algorithm with static partition for total exchange Reviewed

K. Nakahira,A. Fujiwara

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications 739 - 745 2005.04

Procedures for multiple input function with DNA molecules Reviewed

A. Fujiwara,S. Kamio

International Journal of Foundations of Computer Science 16 ( 1 ) 37 - 54 2005.01

Procedures for Multiple Input Functions with DNA Strands Reviewed

A. Fujiwara,S. Kamio

Proceedings of Workshop on Advances in Parallel and Distributed Computational Models (in conjunction with IPDPS2004) 2004.04

Procedures for logic and arithmetic operations with DNA molecules Reviewed

A. Fujiwara,K. Matsumoto,W. Chen

International Journal of Foundations of Computer Science 15 ( 3 ) 461 - 474 2004.03

Procedures for computing the maximum with DNA strands Reviewed

S. Kamio,A. Takehara,A. Fujiwara

Proceedings of the International Conference on Parallel and Distributed Processing Symposium 351 - 357 2003.04

Efficient scheduling algorithms for total exchange on GRID environment Reviewed

Y. Jinno,M. Ito,A. Fujiwara

Proceedings of the International Conference on Parallel and Distributed Processing Symposium 81 - 87 2003.04

Addressable procedures for logic and arithmetic operations with DNA strands Reviewed

A. Fujiwara,K. Matsumoto,W. Chen

Proceedings of Workshop on Advances in Parallel and Distributed Computational Models 2003.04

A Parallel Algorithm For The Stack Breadth-First Search Reviewed

T. Nakashima,A. Fujiwara

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E85-D ( 12 ) 1955 - 1958 2002.12

Parallel algorithms for patience sorting and longest increasing subsequence Reviewed

T. Nakashima,A. Fujiwara

Proceedings of the International Conference in Networks, Parallel and Distributed Processing and Applications 7 - 12 2002.10

Parallelizability of some P-complete problems Reviewed

A. Fujiwara,M. Inoue,M. Toshimitsu

Workshop on Advances in Parallel Computational Models (Lecture Notes in Computer Science, 1800) 116 - 122 2002.01

Parallelizability of some geometric P-complete problems in the EREW-PRAM Reviewed

C.D. Castanho,W. Chen,K. Wada,A. Fujiwara

Seventh Annual International Computing and Combinatorics Conference (COCOON2001) 59 - 63 2001.08

Parallelizability of the stack breadth-first search problem Reviewed

T. Nakashima,A. Fujiwara

International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'01) 722 - 727 2001.06

Round optimal parallel algorithms for the convex hull of sorted points Reviewed

N. Oshige,A. Fujiwara

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E84-A ( 5 ) 1152 - 1160 2001.05

Polynomially fast parallel algorithms for some P-complete problems Reviewed

C.D. Castanho,W. Chen,K. Wada,A. Fujiwara

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E84-A ( 5 ) 1244 - 1255 2001.05

辞書式順極大３和問題に対するBSPモデル上のコスト最適な並列アルゴリズム Reviewed

中島孝明,藤原暁宏

情報処理学会論文誌「並列処理」特集号 42 ( 4 ) 724 - 731 2001.04

Polynomially fast parallel algorithms for some geometric P-complete problems Reviewed

C.D. Castanho,W. Chen,K. Wada,A. Fujiwara

Workshop on Computational Geometry 10 - 15 2000.10

Parallel selection algorithms for CGM and BSP models with application to sorting Reviewed

A. Fujiwara,M. Inoue,T. Masuzawa

IEICE Trans. Information and Systems E83-D ( 5 ) 1500 - 1508 2000.04

２分木の平衡分解木を求めるコスト最適な並列アルゴリズム Reviewed

藤原暁宏,井上美智子,増澤利光,都倉信樹

電子情報通信学会論文誌D-I J83-D-I ( 1 ) 90 - 98 2000.04

Parallel algorithms for the all nearest neighbor problems of binary image on the BSP model Reviewed

T. Ishimizu,A. Fujiwara,M. Inoue,T. Masuzawa,H. Fujiwara

IEICE Transactions on Information and Systems E83-D ( 2 ) 151 - 158 2000.04

Parallel selection algorithms with analysis on clusters Reviewed

A. Fujiwara,H. Katsuki,M. Inoue,T. Masuzawa

Proc. Internatinal Symposium on Parallel Architechtures, Algorithms and Networks (ISPAN'99) 388 - 393 1999.06

Parallel algorithms for all nearest neighbors of binary images on the BSP model Reviewed

T. Ishimizu,A. Fujiwara,M. Inoue,T. Masuzawa

Proc. Internatinal Symposium on Parallel Architechtures, Algorithms and Networks (ISPAN'99) 394 - 399 1999.06

A cost optimal parallel algorithm for weighted distance transforms Reviewed

A. Fujiwara,M. Inoue,T. Masuzawa,H. Fujiwara

Parallel computing 25 ( 4 ) 405 - 416 1999.04

選択問題を解くBSPモデルおよびBSP*モデル上の並列アルゴリズム Reviewed

石水隆,藤原暁宏,井上美智子,増澤利光,藤原秀雄

電子情報通信学会論文誌(DI) J82-D-I ( 4 ) 533 - 542 1999.04

A parallel algorithm for Euclidean distance transform on the mesh Reviewed

A. Fujiwara,M. Inoue,T. Masuzawa

Proc. international conference on parallel and distributed processing techiques and applications(PDPTA'98) 1726 - 1733 1998.04

A parallel algorithm for weighted distance transforms Reviewed

A. Fujiwara,M. Inoue,T. Masuzawa,H. Fujiwara

Proceedings of 11th International Parallel Processing Symposium 407 - 412 1997.04

A simple parallel algorithm for the medial axis transform Reviewed

IEICE Transaction on Information and Systems E79-D ( 8 ) 1038 - 1045 1996.04

濃淡画像の連結成分を求める並列アルゴリズム Reviewed

藤原暁宏,増澤利光,藤原秀雄

電子情報通信学会論文誌(DI) J79-D1 ( 5 ) 215 - 225 1996.04

A simple parallel algorithm for the medial axis transform of binary images Reviewed

A. Fujiwara,M. Inoue,T. Masuzawa,H. Fujiwara

Proceedings of IEEE Second International Conference on Algorithms&Architectures for Paralle Processing 1 - 8 1996.04

An optimal parallel algorithm for the Euclidean distance map of 2-D binary images Reviewed

Information Processing Letters 54 ( 5 ) 295 - 300 1995.04

An optimal parallel algorithm for the Euclidean distance maps of binary images Reviewed

A. Fujiwara,T. Masuzawa,H. Fujiwara

Proceedings of First IEEE Internatinal Conference on Algorithms and Architecture for Parallel Processing 928 - 928 1995.04

　PREV-NEXT　

<FUJIWARA Akihiro>

Papers - FUJIWARA Akihiro