Filters








2,095 Hits in 4.4 sec

Abstracts of Current Computer Literature

1970 IEEE transactions on computers  
The concept of a continuous-time probabilistic automaton is presented in the paper.  ...  The paper describes a transformation that can be used to characterize patterns independent of their position.  ... 
doi:10.1109/t-c.1970.222960 fatcat:ire5kgre7fch5ppqcmq2bjesvi

The BG-simulation for Byzantine Mobile Robots [article]

Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada
2011 arXiv   pre-print
Interestingly, because of its versatility, we can easily extend our impossibility result for general pattern formation problems.  ...  In this paper, we show strong impossibility results of Byzantine gathering.  ...  Let P ′ be the pattern in F maximizing |L ∩ P | (if two or more patterns in F maximize it, an arbitrary one is deterministically chosen).  ... 
arXiv:1106.0113v1 fatcat:hkmx3cqo5fagpjqhqv6jz3ptvi

Low power asynchronous circuit back-end design flow

Behnam Ghavami, Hossein Pedram
2011 Microelectronics Journal  
This paper introduces a framework for the synthesis of low leakage power asynchronous circuits while maintaining performance requirements.  ...  The proposed flow has the advantage of exploiting a new performance metric and presents an efficient methodology for static estimation of average performance of asynchronous circuits with choices at the  ...  This paper proposes the following considerations for a integrated design framework of a low leakage power and high performance asynchronous circuit: (1) A Probabilistic Timed Petri-Net model is used to  ... 
doi:10.1016/j.mejo.2010.12.001 fatcat:qazzugoncjff5pbpmfurn5egqa

Memory Dynamics in Asynchronous Neural Networks

I. Tsuda, E. Koerner, H. Shimizu
1987 Progress of theoretical physics  
The investigated network consists of two sets both composed of asynchronously firing model neurons.  ...  It is shown that positive and negative global feedbacks by the field effect play an essential role in the successive recall of stored patterns.  ...  Short review of spinglass model for associative memory Stimulated by Hopfield's paper of 1982 14 ) concerning the collective computations in terms of asynchronous neurons, theoretical studies of the memory  ... 
doi:10.1143/ptp.78.51 fatcat:fiskeus3ybei7pyixpijix53q4

Practical automated vulnerability monitoring using program state invariants

Cristiano Giuffrida, Lorenzo Cavallaro, Andrew S. Tanenbaum
2013 2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)  
Due to the probabilistic nature of our asynchronous detection model (crucial to achieve low overhead), however, we can make no claim that RCORE can identify all the short-lived vulnerabilities or attacks  ...  Our current implementation is based on the ELF binary format.  ... 
doi:10.1109/dsn.2013.6575318 dblp:conf/dsn/GiuffridaCT13 fatcat:bosmtfb2nbcjvf7wwh36kh6yem

Provable self-organizing pattern formation by a swarm of robots with limited knowledge

Mario Coppola, Jian Guo, Eberhard Gill, Guido C. H. E. de Croon
2019 Swarm Intelligence  
The generated local behavior is a probabilistic local state-action map.  ...  They only know: (1) the relative location of their neighbors within a short range and (2) a common direction (North).  ...  Generating arbitrary patterns without livelocks and deadlocks Section 4.2 showed how Π f can be readily computed for any pattern.  ... 
doi:10.1007/s11721-019-00163-0 fatcat:jycmgrqzf5a3jh3qlzqttljqk4

From SysML to Model Checkers via Model Transformation [chapter]

Martin Kölbl, Stefan Leue, Hargurbir Singh
2018 Lecture Notes in Computer Science  
In this paper we present an automated translation from the systems engineering modeling language SysML into the input languages of the NuSMV, Prism and Spin model checkers.  ...  A special focus of this work is the semantics of the communication mechanisms used in a syntactic fragment of SysML, in particular synchronous and asynchronous, broadcast and buffered communication.  ...  In this paper we do not consider asynchronous call events for which the invoking stm only waits until the operation is called.  ... 
doi:10.1007/978-3-319-94111-0_15 fatcat:ytkkejmq2vdfxm33zelnj4zcde

The cost of probabilistic gathering in oblivious robot networks [article]

Julien Clement, Maria Gradinariu Potop-Butucaru JAIST, Japon
2008 arXiv   pre-print
Both deterministic gathering and scattering have been proved impossible under arbitrary schedulers therefore probabilistic solutions have been recently proposed.  ...  The contribution of this paper is twofold. First, we propose a detailed complexity analysis of the existent probabilistic gathering algorithms in both fault-free and fault-prone environments.  ...  (e.g. leader election, flocking, constrained scattering, pattern formation).  ... 
arXiv:0807.1753v1 fatcat:5lcivd5h5vdgbcel6cjt5opqd4

Abstracts of Current Computer Literature

1970 IEEE transactions on computers  
Computers (Short Notes), vol. C-19, pp. 262-269, March 1970. The realization of an arbitrary switching function by an interconnection of threshold and parity elements is considered.  ...  Computers (Short Notes), vol. C-19, pp. 254-258, March 1970.  ... 
doi:10.1109/t-c.1970.223067 fatcat:fmxgtckr5vcivhopuosht7gszu

Abstracts of Current Computer Literature

1971 IEEE transactions on computers  
In this paper the algebraic treatment of probabilistic automata with two states is discussed.  ...  State Assignment Selection in Asynchronous Sequential Circuits, G. K. Maki (U. Idaho, Moscow, Idaho) and J. H. Tracey (U. Missouri at Rolla); IEEE Trans. Computers (Short Notes), vol.  ... 
doi:10.1109/t-c.1971.223093 fatcat:xxhdbzhhdzdp5e5wznkfj3yoai

Simplified Bluetooth device discovery - analysis and simulation

G.V. Zaruba, V. Gupta
2004 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the  
Bluetooth is a promising wireless technology enabling (portable) devices to form short-range starshaped wireless networks (or wireless personal area networks -PAN).  ...  Bluetooth relies on a frequency hopping physical layer, implying that hosts are not able to communicate unless they have previously discovered each by synchronizing their frequency hopping patterns.  ...  In this paper we are concentrating on the original (asynchronous) inquiry scheme of Bluetooth and derive formulas to model the total inquiry time of node-sets with an arbitrary population.  ... 
doi:10.1109/hicss.2004.1265722 dblp:conf/hicss/ZarubaG04 fatcat:xmolwpwegngkzg3s7xybprzc5y

R2U2: Monitoring and Diagnosis of Security Threats for Unmanned Aerial Systems [chapter]

Johann Schumann, Patrick Moosbrugger, Kristin Y. Rozier
2015 Lecture Notes in Computer Science  
By simultaneously monitoring and performing statistical reasoning, attack patterns and post-attack discrepancies in the UAS behavior can be detected.  ...  To that end, they extend STL to include operators that calculate the Short-Time Fourier Transformed (STFT) coefficients for a parameterizable frequency of an arbitrary input signal.  ...  Therefore, in our R2U2 models, we aim to take into account other observation patterns and use a Bayesian network for probabilistic reasoning.  ... 
doi:10.1007/978-3-319-23820-3_15 fatcat:iw5ktaseivhypkd57k7bl6he5e

R2U2: monitoring and diagnosis of security threats for unmanned aerial systems

Patrick Moosbrugger, Kristin Y. Rozier, Johann Schumann
2017 Formal methods in system design  
By simultaneously monitoring and performing statistical reasoning, attack patterns and post-attack discrepancies in the UAS behavior can be detected.  ...  To that end, they extend STL to include operators that calculate the Short-Time Fourier Transformed (STFT) coefficients for a parameterizable frequency of an arbitrary input signal.  ...  Therefore, in our R2U2 models, we aim to take into account other observation patterns and use a Bayesian network for probabilistic reasoning.  ... 
doi:10.1007/s10703-017-0275-x fatcat:3ykk6afjmnfqlb66rqpiz3zkbi

Intrinsic universality and the computational power of self-assembly

Damien Woods
2013 Electronic Proceedings in Theoretical Computer Science  
This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models.  ...  Is there an intrinsically universal tile set that simulates a wide class of systems in a probabilistically fair manner?  ...  Introduction Molecular self-assembly, the formation of large structures by small pieces of matter sticking together according to simple local interactions, is a ubiquitous phenomenon in nature.  ... 
doi:10.4204/eptcs.128.5 fatcat:6vd74phg4nanzgmukhh4yig27i

Omega: An Architecture for AI Unification [article]

Eray Özkural
2018 arXiv   pre-print
The representation language must also provide the means to combine primitives meaningfully, and obtain short programs for common patterns.  ...  Asynchronous Computer We define an asynchronous model of computation for conception of fine-grain concurrent models.  ... 
arXiv:1805.12069v1 fatcat:gkj27nzfb5azrkfrawgqil5pim
« Previous Showing results 1 — 15 out of 2,095 results