2021 Ninth International Symposium on Computing and Networking (CANDAR)最新文献

筛选

英文中文

An asynchronous P system with a DPLL algorithm for solving a satisfiability problem 用DPLL算法求解异步P系统的可满足性问题

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00029

Takuya Noguchi, A. Fujiwara

{"title":"An asynchronous P system with a DPLL algorithm for solving a satisfiability problem","authors":"Takuya Noguchi, A. Fujiwara","doi":"10.1109/CANDAR53791.2021.00029","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00029","url":null,"abstract":"Membrane computing, which is also known as a 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 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({m}n^{2})$ parallel steps or $O(mn2^{n})$ 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. 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.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133613216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A State Transfer Method That Adapts to Network Bandwidth Variations in Geographic State Machine Replication 地理状态机复制中适应网络带宽变化的状态转移方法

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-10-09 DOI: 10.1109/CANDAR53791.2021.00019

Tairi Chiba, Ren Ohmura, Junya Nakamura

{"title":"A State Transfer Method That Adapts to Network Bandwidth Variations in Geographic State Machine Replication","authors":"Tairi Chiba, Ren Ohmura, Junya Nakamura","doi":"10.1109/CANDAR53791.2021.00019","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00019","url":null,"abstract":"We present a new state transfer method for geographic State Machine Replication (SMR) that dynamically allocates the state to be transferred among replicas according to changes in communication bandwidths. SMR is a method that improves fault tolerance by replicating a service to multiple replicas. When a replica is newly added or is recovered from a failure, the other replicas transfer the current state of the service to it. However, in geographic SMR, the communication bandwidths of replicas are different and constantly changing. Therefore, existing state transfer methods cannot fully utilize the available bandwidth, and their state transfer time becomes long. To overcome this problem, our method divides the state into multiple chunks and assigns them to replicas based on each replica's bandwidth so that the broader a replica's bandwidth is, the more chunks it transfers. The number of assigned chunks is dynamically updated based on the currently estimated bandwidth. The performance evaluation on Amazon EC2 shows that the proposed method reduces the state transfer time by up to 47% compared with the existing one.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Hip to Be (Latin) Square: Maximal Period Sequences from Orthogonal Cellular Automata 等(拉丁)方:正交元胞自动机的最大周期序列

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-06-14 DOI: 10.1109/CANDAR53791.2021.00012

L. Mariot

{"title":"Hip to Be (Latin) Square: Maximal Period Sequences from Orthogonal Cellular Automata","authors":"L. Mariot","doi":"10.1109/CANDAR53791.2021.00012","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00012","url":null,"abstract":"Orthogonal Cellular Automata (OCA) have been recently investigated in the literature as a new approach to construct orthogonal Latin squares for cryptographic applications such as secret sharing schemes. In this paper, we consider OCA for a different cryptographic task, namely the generation of pseudorandom sequences. The idea is to iterate a dynamical system where the output of an OCA pair is fed back as a new set of coordinates on the superposed squares. The main advantage is that OCA ensure a certain amount of diffusion in the generated sequences, a property which is usually missing from traditional CA-based pseudorandom number generators. We study the problem of finding OCA pairs with maximal period by first performing an exhaustive search over local rules of diameter up to $mathbf{d=5}$, and then focusing on the subclass of linear bipermutive rules. In this case, we characterize an upper bound on the periods of the sequences in terms of the order of the subgroup generated by an invertible Sylvester matrix. We finally devise an algorithm based on Lagrange's theorem to efficiently enumerate all linear OCA pairs that induce Sylvester matrices of maximal order up to diameter $d=11$,","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122319342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

首页上一页