An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimen...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ruivo, Eurico L.P. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2020transfer abstract |
|---|
| Schlagwörter: |
Deterministic update schedules |
|---|
| Übergeordnetes Werk: |
Enthalten in: Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation - Thude, Hansjörg ELSEVIER, 2015transfer abstract, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:413 ; year:2020 ; pages:0 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.physd.2020.132554 |
|---|
| Katalog-ID: |
ELV05129883X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV05129883X | ||
| 003 | DE-627 | ||
| 005 | 20230626031840.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 210910s2020 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.physd.2020.132554 |2 doi | |
| 028 | 5 | 2 | |a /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001585.pica |
| 035 | |a (DE-627)ELV05129883X | ||
| 035 | |a (ELSEVIER)S0167-2789(19)30693-1 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 610 |q VZ |
| 082 | 0 | 4 | |a 570 |q VZ |
| 084 | |a BIODIV |q DE-30 |2 fid | ||
| 100 | 1 | |a Ruivo, Eurico L.P. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata |
| 264 | 1 | |c 2020transfer abstract | |
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. | ||
| 520 | |a Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. | ||
| 650 | 7 | |a Deterministic update schedules |2 Elsevier | |
| 650 | 7 | |a Synchronisation problem |2 Elsevier | |
| 650 | 7 | |a Synchronism |2 Elsevier | |
| 650 | 7 | |a Block sequential asynchronous update |2 Elsevier | |
| 650 | 7 | |a Asynchrony |2 Elsevier | |
| 650 | 7 | |a Cellular automata |2 Elsevier | |
| 700 | 1 | |a Balbi, Pedro Paulo |4 oth | |
| 700 | 1 | |a Perrot, Kévin |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Thude, Hansjörg ELSEVIER |t Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation |d 2015transfer abstract |g Amsterdam [u.a.] |w (DE-627)ELV018422527 |
| 773 | 1 | 8 | |g volume:413 |g year:2020 |g pages:0 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.physd.2020.132554 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a FID-BIODIV | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |d 413 |j 2020 |h 0 | ||
| author_variant |
e l r el elr |
|---|---|
| matchkey_str |
ruivoeuricolpbalbipedropauloperrotkvin:2020----:nsnhoosouinohsnhoiainrbefriayndmn |
| hierarchy_sort_str |
2020transfer abstract |
| publishDate |
2020 |
| allfields |
10.1016/j.physd.2020.132554 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001585.pica (DE-627)ELV05129883X (ELSEVIER)S0167-2789(19)30693-1 DE-627 ger DE-627 rakwb eng 610 VZ 570 VZ BIODIV DE-30 fid Ruivo, Eurico L.P. verfasserin aut An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata 2020transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata Elsevier Balbi, Pedro Paulo oth Perrot, Kévin oth Enthalten in Elsevier Thude, Hansjörg ELSEVIER Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV018422527 volume:413 year:2020 pages:0 https://doi.org/10.1016/j.physd.2020.132554 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA AR 413 2020 0 |
| spelling |
10.1016/j.physd.2020.132554 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001585.pica (DE-627)ELV05129883X (ELSEVIER)S0167-2789(19)30693-1 DE-627 ger DE-627 rakwb eng 610 VZ 570 VZ BIODIV DE-30 fid Ruivo, Eurico L.P. verfasserin aut An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata 2020transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata Elsevier Balbi, Pedro Paulo oth Perrot, Kévin oth Enthalten in Elsevier Thude, Hansjörg ELSEVIER Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV018422527 volume:413 year:2020 pages:0 https://doi.org/10.1016/j.physd.2020.132554 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA AR 413 2020 0 |
| allfields_unstemmed |
10.1016/j.physd.2020.132554 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001585.pica (DE-627)ELV05129883X (ELSEVIER)S0167-2789(19)30693-1 DE-627 ger DE-627 rakwb eng 610 VZ 570 VZ BIODIV DE-30 fid Ruivo, Eurico L.P. verfasserin aut An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata 2020transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata Elsevier Balbi, Pedro Paulo oth Perrot, Kévin oth Enthalten in Elsevier Thude, Hansjörg ELSEVIER Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV018422527 volume:413 year:2020 pages:0 https://doi.org/10.1016/j.physd.2020.132554 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA AR 413 2020 0 |
| allfieldsGer |
10.1016/j.physd.2020.132554 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001585.pica (DE-627)ELV05129883X (ELSEVIER)S0167-2789(19)30693-1 DE-627 ger DE-627 rakwb eng 610 VZ 570 VZ BIODIV DE-30 fid Ruivo, Eurico L.P. verfasserin aut An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata 2020transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata Elsevier Balbi, Pedro Paulo oth Perrot, Kévin oth Enthalten in Elsevier Thude, Hansjörg ELSEVIER Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV018422527 volume:413 year:2020 pages:0 https://doi.org/10.1016/j.physd.2020.132554 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA AR 413 2020 0 |
| allfieldsSound |
10.1016/j.physd.2020.132554 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001585.pica (DE-627)ELV05129883X (ELSEVIER)S0167-2789(19)30693-1 DE-627 ger DE-627 rakwb eng 610 VZ 570 VZ BIODIV DE-30 fid Ruivo, Eurico L.P. verfasserin aut An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata 2020transfer abstract nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata Elsevier Balbi, Pedro Paulo oth Perrot, Kévin oth Enthalten in Elsevier Thude, Hansjörg ELSEVIER Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation 2015transfer abstract Amsterdam [u.a.] (DE-627)ELV018422527 volume:413 year:2020 pages:0 https://doi.org/10.1016/j.physd.2020.132554 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA AR 413 2020 0 |
| language |
English |
| source |
Enthalten in Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation Amsterdam [u.a.] volume:413 year:2020 pages:0 |
| sourceStr |
Enthalten in Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation Amsterdam [u.a.] volume:413 year:2020 pages:0 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Deterministic update schedules Synchronisation problem Synchronism Block sequential asynchronous update Asynchrony Cellular automata |
| dewey-raw |
610 |
| isfreeaccess_bool |
false |
| container_title |
Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation |
| authorswithroles_txt_mv |
Ruivo, Eurico L.P. @@aut@@ Balbi, Pedro Paulo @@oth@@ Perrot, Kévin @@oth@@ |
| publishDateDaySort_date |
2020-01-01T00:00:00Z |
| hierarchy_top_id |
ELV018422527 |
| dewey-sort |
3610 |
| id |
ELV05129883X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV05129883X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626031840.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210910s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.physd.2020.132554</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001585.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV05129883X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0167-2789(19)30693-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">BIODIV</subfield><subfield code="q">DE-30</subfield><subfield code="2">fid</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ruivo, Eurico L.P.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020transfer abstract</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Deterministic update schedules</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Synchronisation problem</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Synchronism</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Block sequential asynchronous update</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Asynchrony</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Cellular automata</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Balbi, Pedro Paulo</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Perrot, Kévin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Thude, Hansjörg ELSEVIER</subfield><subfield code="t">Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV018422527</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:413</subfield><subfield code="g">year:2020</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.physd.2020.132554</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">FID-BIODIV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">413</subfield><subfield code="j">2020</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| author |
Ruivo, Eurico L.P. |
| spellingShingle |
Ruivo, Eurico L.P. ddc 610 ddc 570 fid BIODIV Elsevier Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata |
| authorStr |
Ruivo, Eurico L.P. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV018422527 |
| format |
electronic Article |
| dewey-ones |
610 - Medicine & health 570 - Life sciences; biology |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
610 VZ 570 VZ BIODIV DE-30 fid An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata Elsevier |
| topic |
ddc 610 ddc 570 fid BIODIV Elsevier Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata |
| topic_unstemmed |
ddc 610 ddc 570 fid BIODIV Elsevier Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata |
| topic_browse |
ddc 610 ddc 570 fid BIODIV Elsevier Deterministic update schedules Elsevier Synchronisation problem Elsevier Synchronism Elsevier Block sequential asynchronous update Elsevier Asynchrony Elsevier Cellular automata |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
p p b pp ppb k p kp |
| hierarchy_parent_title |
Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation |
| hierarchy_parent_id |
ELV018422527 |
| dewey-tens |
610 - Medicine & health 570 - Life sciences; biology |
| hierarchy_top_title |
Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV018422527 |
| title |
An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata |
| ctrlnum |
(DE-627)ELV05129883X (ELSEVIER)S0167-2789(19)30693-1 |
| title_full |
An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata |
| author_sort |
Ruivo, Eurico L.P. |
| journal |
Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation |
| journalStr |
Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology 500 - Science |
| recordtype |
marc |
| publishDateSort |
2020 |
| contenttype_str_mv |
zzz |
| container_start_page |
0 |
| author_browse |
Ruivo, Eurico L.P. |
| container_volume |
413 |
| class |
610 VZ 570 VZ BIODIV DE-30 fid |
| format_se |
Elektronische Aufsätze |
| author-letter |
Ruivo, Eurico L.P. |
| doi_str_mv |
10.1016/j.physd.2020.132554 |
| dewey-full |
610 570 |
| title_sort |
an asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata |
| title_auth |
An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata |
| abstract |
Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. |
| abstractGer |
Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. |
| abstract_unstemmed |
Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA |
| title_short |
An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata |
| url |
https://doi.org/10.1016/j.physd.2020.132554 |
| remote_bool |
true |
| author2 |
Balbi, Pedro Paulo Perrot, Kévin |
| author2Str |
Balbi, Pedro Paulo Perrot, Kévin |
| ppnlink |
ELV018422527 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1016/j.physd.2020.132554 |
| up_date |
2024-07-06T19:53:12.552Z |
| _version_ |
1803860671255805952 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV05129883X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626031840.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210910s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.physd.2020.132554</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001585.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV05129883X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0167-2789(19)30693-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">BIODIV</subfield><subfield code="q">DE-30</subfield><subfield code="2">fid</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ruivo, Eurico L.P.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020transfer abstract</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Because cellular automata rely on totally local and synchronous processing at the neighbourhood of each cell, the issue of global synchronisation of the cell states has a long tradition in cellular automata literature. Here, the following benchmark synchronisation problem in the context of one-dimensional binary cellular automata rule is addressed: in periodic boundary condition, a rule needs to be conceived so as to lead any initial configuration to converge, at some time in future, to a cyclic regime of period 2 characterised by all cells alternating between fully homogeneous configurations of 0s and 1s. In spite of its simplicity, the problem has recently been shown not to have a solution by synchronously updating the cell states. In contrast, we provide a perfect solution to the problem, with a 4-neighbour rule, by replacing the synchronous update of the cells of the lattice with a deterministic, block sequential asynchronous update schedule. Achieving synchrony by asynchronous means represents an example that makes it evident the fact that asynchrony can be explored to give more freedom to the cells of a CA, in terms of the local information they exchange with each other. Since synchronisation phenomena and problems are pervasive in many contexts in science and engineering, it is a valuable resource to understand how synchronisation can be achieved and controlled in simple computational models, such as cellular automata.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Deterministic update schedules</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Synchronisation problem</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Synchronism</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Block sequential asynchronous update</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Asynchrony</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Cellular automata</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Balbi, Pedro Paulo</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Perrot, Kévin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Thude, Hansjörg ELSEVIER</subfield><subfield code="t">Role of the Fyn −93A>G polymorphism (rs706895) in acute rejection after liver transplantation</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV018422527</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:413</subfield><subfield code="g">year:2020</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.physd.2020.132554</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">FID-BIODIV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">413</subfield><subfield code="j">2020</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| score |
7.4021244 |