Probabilistic Pharmaceutical Modelling: A Comparison Between Synchronous and Asynchronous Cellular Automata

被引:0
|
作者
Bezbradica, Marija [1 ]
Ruskin, Heather J. [1 ]
Crane, Martin [1 ]
机构
[1] Dublin City Univ, Sch Comp, Ctr Sci Res & Complex Syst Modelling Sci Sym, Dublin 9, Ireland
关键词
Discrete systems; Controlled drug delivery systems; Complex modelling; Parallel algorithms; DRUG-RELEASE; SIMULATION;
D O I
10.1007/978-3-642-55195-6_66
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The field of pharmaceutical modelling has, in recent years, benefited from using probabilistic methods based on cellular automata, which seek to overcome some of the limitations of differential equation based models. By modelling discrete structural element interactions instead, these are able to provide data quality adequate for the early design phases in drug modelling. In relevant literature, both synchronous (CA) and asynchronous (ACA) types of automata have been used, without analysing their comparative impact on the model outputs. In this paper, we compare several variations of probabilistic CA and ACA update algorithms for building models of complex systems used in controlled drug delivery, analysing the advantages and disadvantages related to different modelling scenarios. Choosing the appropriate update mechanism, besides having an impact on the perceived realism of the simulation, also has practical benefits on the applicability of different model parallelisation algorithms and their performance when used in large-scale simulation contexts.
引用
收藏
页码:699 / 710
页数:12
相关论文
共 50 条
  • [41] Asynchronous Cellular Automata and Pattern Classification
    Sethi, Biswanath
    Roy, Souvik
    Das, Sukanta
    COMPLEXITY, 2016, 21 (S1) : 370 - 386
  • [42] Coxeter Groups and Asynchronous Cellular Automata
    Macauley, Matthew
    Mortveit, Henning S.
    CELLULAR AUTOMATA, 2010, 6350 : 409 - +
  • [43] ASYNCHRONOUS CELLULAR AUTOMATA FOR INFINITE TRACES
    GASTIN, P
    PETIT, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 583 - 594
  • [44] A Guided Tour of Asynchronous Cellular Automata
    Fates, Nazim
    JOURNAL OF CELLULAR AUTOMATA, 2014, 9 (5-6) : 387 - 416
  • [45] m-Asynchronous Cellular Automata
    Dennunzio, Alberto
    Formenti, Enrico
    Manzoni, Luca
    Mauri, Giancarlo
    CELLULAR AUTOMATA, ACRI 2012, 2012, 7495 : 653 - 662
  • [46] Dynamics groups of asynchronous cellular automata
    Macauley, Matthew
    McCammond, Jon
    Mortveit, Henning S.
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2011, 33 (01) : 11 - 35
  • [47] Simulations between asynchronous cellular automata for the standardization of their set of states and their neighborhood
    Worsch, Thomas
    2013 FIRST INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2013, : 487 - 494
  • [48] A Performance Comparison Between Synchronous and Asynchronous Electrostatic Harvesters
    Daneshvar, Seyed Hossein
    Maymandi-Nejad, Mohammad
    Yuce, Mehmet Rasit
    Redoute, Jean-Michel
    2019 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY (ICIT), 2019, : 349 - 354
  • [49] Asynchronous automata networks can emulate any synchronous automata network
    Nehaniv, CL
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2004, 14 (5-6) : 719 - 739
  • [50] Formalization of asynchronous cellular automata using asynchronous protocol for communications
    Lee, Jia
    Peper, Ferdinand
    Leibnitz, Kenji
    2018 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS (CANDARW 2018), 2018, : 38 - 41