About: Communicating Mobile Nano-Machines and their Computational Power     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • A computational model of molecularly communicating mobile nanomachines is defined. Nanomachines are modeled by a variant of finite-state automata - so-called timed probabilistic automata - augmented by a severely restricted communication mechanism capturing the main features of molecular communication. We show that for molecular communication among such motile machines an asynchronous stochastic protocol originally designed for wireless (radio) communication in so-called amorphous computers with static computational units can also be used. We design an algorithm that using the previous protocol, randomness and timing delays selects with a high probability a leader from among sets of anonymous candidates. This enables a probabilistic simulation of one of the simplest known model of a programmable computer - so-called counter automaton - proving that networks of mobile nanomachines possess universal computing power.
  • A computational model of molecularly communicating mobile nanomachines is defined. Nanomachines are modeled by a variant of finite-state automata - so-called timed probabilistic automata - augmented by a severely restricted communication mechanism capturing the main features of molecular communication. We show that for molecular communication among such motile machines an asynchronous stochastic protocol originally designed for wireless (radio) communication in so-called amorphous computers with static computational units can also be used. We design an algorithm that using the previous protocol, randomness and timing delays selects with a high probability a leader from among sets of anonymous candidates. This enables a probabilistic simulation of one of the simplest known model of a programmable computer - so-called counter automaton - proving that networks of mobile nanomachines possess universal computing power. (en)
  • Je navržen výpočetní model molekulárně komunikujících mobilních nano-mašin. Nano-mašiny jsou modelovány pomocí jistého druhu konečných automatů - tzv. probabilistických automatů s časovačem. Tyto automaty jsou dále rozšířeny o jednoduchý, značně omezený komunikační mechanismus jenž modeluje hlavní rysy molekulární komunikace. Hlavním výsledkem je důkaz univerzální výpočetní síly sítí skládajících se ze shora popsaných výpočetních elementů. (cs)
Title
  • Communicating Mobile Nano-Machines and their Computational Power
  • Communicating Mobile Nano-Machines and their Computational Power (en)
  • Mobilní komunikační nano-mašiny a jejich výpočetní síla (cs)
skos:prefLabel
  • Communicating Mobile Nano-Machines and their Computational Power
  • Communicating Mobile Nano-Machines and their Computational Power (en)
  • Mobilní komunikační nano-mašiny a jejich výpočetní síla (cs)
skos:notation
  • RIV/67985807:_____/08:00317033!RIV09-AV0-67985807
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET100300419), P(GD201/05/H014), Z(AV0Z10300504)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 360459
http://linked.open...ai/riv/idVysledku
  • RIV/67985807:_____/08:00317033
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • molecular communication; nanomachines; timed probabilistic automata; communication protocol; universal computing (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [144EB130DA89]
http://linked.open...v/mistoKonaniAkce
  • Boston
http://linked.open...i/riv/mistoVydani
  • Gent
http://linked.open...i/riv/nazevZdroje
  • Nano-Net 2008
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Wiedermann, Jiří
  • Petrů, L.
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • ICST
https://schema.org/isbn
  • 978-963-9799-37-0
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software