Filters








341 Hits in 2.3 sec

A Look Back at Some Early Results in Membrane Computing [chapter]

Oscar H. Ibarra
2010 Lecture Notes in Computer Science  
By using the rules in a nondeterministic, maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions shows how the system is evolving.  ...  feasible time, by trading space for time; development of software and simulations; proposals for various potential applications.  ...  By using the rules in a nondeterministic, maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions shows how the system is evolving.  ... 
doi:10.1007/978-3-642-11467-0_6 fatcat:uogszbxl4jeclgemexv7fwnxci

On determinism versus nondeterminism in P systems

Oscar H. Ibarra
2005 Theoretical Computer Science  
An important open problem in the area of membrane computing is whether there is a model of P systems for which the nondeterministic version is strictly more powerful than the deterministic version.  ...  For the first class, the deterministic and nondeterministic versions are equivalent if and only if deterministic and nondeterministic linear bounded automata are equivalent.  ...  I would also like to thank the referees for their suggestions which improved the presentation of our results.  ... 
doi:10.1016/j.tcs.2005.03.052 fatcat:fmsuj5u44bfebcyaeq44x2xglq

On Model-Checking of P Systems [chapter]

Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
2005 Lecture Notes in Computer Science  
It identifies an unconventional computing model, namely a P system, from natural phenomena of cell evolutions and chemical reactions.  ...  Because of the nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently  ...  We now look at a special case when the cardinality of the maximally parallel multiset of rules applicable at each step is at most 1. Thus the computation of the system would be sequential.  ... 
doi:10.1007/11560319_9 fatcat:7oczxs5cqjga5cv3ejpqf73etm

From the Closed Classical Algorithmic Universe to an Open World of Algorithmic Constellations [chapter]

Mark Burgin, Gordana Dodig-Crnkovic
2013 Computing Nature  
In this paper we analyze methodological and philosophical implications of algorithmic aspects of unconventional computation.  ...  In contrast, the open algorithmic universe, and even more the open world of algorithmic constellations, remove such restrictions and enable new, richer understanding of computation.  ...  Acknowledgements The authors would like to thank Andree Ehresmann, Hector Zenil and Marcin Schroeder for useful and constructive comments on the previous version of this work.  ... 
doi:10.1007/978-3-642-37225-4_16 fatcat:yfy26okdojggxiruih6cpya34q

The Power of Maximal Parallelism in P Systems [chapter]

Oscar H. Ibarra, Hsu-Chun Yen, Zhe Dang
2004 Lecture Notes in Computer Science  
We consider the following definition (different from the standard definition in the literature) of "maximal parallelism" in the application of evolution rules in a P system be the set of (distinct) rules  ...  For a positive integer & ( ' % , define: & -Max-Parallel: At each step, nondeterministically select a maximal subset of at most % membranes, it is equivalent to a vector addition system for any % 7 6 4  ...  by the application of a multi-set of rules, which are chosen nondeterministically.  ... 
doi:10.1007/978-3-540-30550-7_18 fatcat:ecj7rc4fr5dd7iryobuytxoxay

Deterministic catalytic systems are not universal

Oscar H. Ibarra, Hsu-Chun Yen
2006 Theoretical Computer Science  
A CS is said to be deterministic if at each step there is a unique maximally parallel multiset of rules applicable.  ...  At each step, a maximal multiset of rules is nondeterministically selected and applied in parallel to the current configuration to derive the next configuration (note that the next configuration is not  ...  Acknowledgments The authors thank the anonymous referees for their comments and suggestions, which improved the presentation of this paper.  ... 
doi:10.1016/j.tcs.2006.07.029 fatcat:ug7asafsrfazfgrgj3uhl5rpva

On the computational complexity of membrane systems

Oscar H. Ibarra
2004 Theoretical Computer Science  
We prove that reachability of extended conÿgurations for symport/antiport systems (as well as for catalytic systems and communicating P systems) can be decided in nondeterministic log n space and, hence  ...  We focus on catalytic systems, communicating P systems, and systems with only symport/antiport rules, but our techniques are applicable to other P systems that are universal.  ...  I would also like to thank the anonymous referee for suggestions which improve the presentation of our results.  ... 
doi:10.1016/j.tcs.2004.03.045 fatcat:6gm6hnd2grb4tbo4v2r5ljs2xm

On the computational complexity of membrane systems*1

O IBARRA
2004 Theoretical Computer Science  
We prove that reachability of extended conÿgurations for symport/antiport systems (as well as for catalytic systems and communicating P systems) can be decided in nondeterministic log n space and, hence  ...  We focus on catalytic systems, communicating P systems, and systems with only symport/antiport rules, but our techniques are applicable to other P systems that are universal.  ...  I would also like to thank the anonymous referee for suggestions which improve the presentation of our results.  ... 
doi:10.1016/s0304-3975(04)00196-3 fatcat:os5hn5sbjvecxblv3mybq4xjpu

Non-confluence in divisionless P systems with active membranes

Antonio E. Porreca, Giancarlo Mauri, Claudio Zandron
2010 Theoretical Computer Science  
Furthermore, we provide an algorithm for simulating such devices on a nondeterministic Turing machine with a polynomial slowdown.  ...  Together, these results prove that the complexity class of problems solvable nonconfluently and in polynomial time by this kind of P system is exactly the class NP.  ...  Pérez Jiménez for commenting on our results and pointing out an error in a preliminary version of Algorithm 1.  ... 
doi:10.1016/j.tcs.2009.07.032 fatcat:we6tq4q6qzhc7nmyoeoz22pshy

ON STATELESS AUTOMATA AND P SYSTEMS

LINMIN YANG, ZHE DANG, OSCAR H. IBARRA
2008 International Journal of Foundations of Computer Science  
In particular, we investigate the decidability of the emptiness and reachability problems for these stateless automata and show that the results are applicable to similar questions concerning certain variants  ...  of P systems, namely, token systems and sequential tissue-like P systems.  ...  A stateless one-way (two-way) DFA is one in which at each step of the computation, at most one maximally parallel set of instructions is applicable.  ... 
doi:10.1142/s0129054108006261 fatcat:7vhgxvkqn5fm5co624kd5htkzi

Automata and processes on multisets of communicating objects

Linmin Yang, Yong Wang, Zhe Dang
2010 Natural Computing  
In particular, in the multiprocess case, regular maximal parallelism is defined for inter-process synchronization.  ...  We formalize the concept of processes, running over a multiset of objects, of a service automaton and study the computing power of both single-process and multiprocess service automata.  ...  However, we shall point out that, for network applications, maximal parallelism in general is hard or expensive to implement.  ... 
doi:10.1007/s11047-010-9206-0 fatcat:d5xaqhm2c5a6ljjlpelh3rs3ku

BulkCompactor: Optimized deterministic execution via Conflict-Aware commit of atomic blocks

Yuelu Duan, Xing Zhou, Wonsun Ahn, Josep Torrellas
2012 IEEE International Symposium on High-Performance Comp Architecture  
For example, for 32 processors, BulkCompactor incurs an average execution overhead of 22% over a nondeterministic system. The round-robin scheme's average overhead is 133%.  ...  Finally, a simulation-based evaluation shows that BulkCompactor delivers performance comparable to nondeterministic systems.  ...  We described the design of BulkCompactor as extensions to the Bulk chunk-based nondeterministic multiprocessor.  ... 
doi:10.1109/hpca.2012.6169040 dblp:conf/hpca/DuanZAT12 fatcat:vzkpgjqwrzbe3i64zbrpemrnme

A STUDY OF CO-PLANING TECHNOLOGY OF SPACEBORNE, AIRBORNE AND GROUND REMOTE SENSING DETECTING RESOURCE, DRIVEN BY DISASTER EMERGENCY TASK

F. Yu, H. Chen, K. Tu, Q. Wen, J. He, X. Gu, Z. Wang
2018 The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
Based on the analysis of the characteristics of major disaster observation tasks, the key technologies of spaceborne, airborne and ground collaborative observation project are studied.  ...  Facing the monitoring needs of emergency responses to major disasters, combining the disaster information acquired at the first time after the disaster and the dynamic simulation result of the disaster  ...  ACKNOWLEDGEMENTS This research was supported by National Key R&D Program of China (NO. 2017YFB0504101)  ... 
doi:10.5194/isprs-archives-xlii-3-2147-2018 fatcat:b4a2f3hrzfdn3lyv2gobzy47tu

All about Eve: Execute-Verify Replication for Multi-Core Servers

Manos Kapritsos, Yang Wang, Vivien Quéma, Allen Clement, Lorenzo Alvisi, Mike Dahlin
2012 USENIX Symposium on Operating Systems Design and Implementation  
Eve minimizes divergence using application-specific criteria to organize requests into groups of requests that are unlikely to interfere.  ...  a wide range of faults, including elusive concurrency bugs.  ...  To take advantage of parallel hardware, modern servers execute multiple requests in parallel.  ... 
dblp:conf/osdi/Kapritsos0QCAD12 fatcat:3jx2m3ia25c75et7e3ypgtynzu

Computing the Boolean product of two n× n Boolean matrices using O(n^2) mechanical operation [article]

Andrzej Lingas, Mia Persson
2020 arXiv   pre-print
We study the problem of determining the Boolean product of two n\times n Boolean matrices in an unconventional computational model allowing for mechanical operations.  ...  Introduction The problem of Boolean matrix multiplication has a wide range of fundamental applications, for instance, in graph algorithms (see, e.g., [18] ).  ...  in parallel.  ... 
arXiv:2004.13086v2 fatcat:xyhhiges5bhexoqflam2pc7cp4
« Previous Showing results 1 — 15 out of 341 results